/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loops-crafted-1/sumt9.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-14 14:31:02,241 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-14 14:31:02,242 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-14 14:31:02,270 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-14 14:31:02,271 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-14 14:31:02,272 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-14 14:31:02,276 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-14 14:31:02,281 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-14 14:31:02,282 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-14 14:31:02,286 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-14 14:31:02,287 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-14 14:31:02,288 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-14 14:31:02,288 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-14 14:31:02,291 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-14 14:31:02,291 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-14 14:31:02,292 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-14 14:31:02,292 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-14 14:31:02,293 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-14 14:31:02,296 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-14 14:31:02,299 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-14 14:31:02,300 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-14 14:31:02,301 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-14 14:31:02,302 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-14 14:31:02,303 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-14 14:31:02,304 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-14 14:31:02,306 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-14 14:31:02,306 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-14 14:31:02,307 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-14 14:31:02,308 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-14 14:31:02,308 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-14 14:31:02,309 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-14 14:31:02,309 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-14 14:31:02,310 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-14 14:31:02,311 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-14 14:31:02,311 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-14 14:31:02,311 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-14 14:31:02,312 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-14 14:31:02,312 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-14 14:31:02,312 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-14 14:31:02,312 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-14 14:31:02,313 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-14 14:31:02,314 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-14 14:31:02,314 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-14 14:31:02,340 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-14 14:31:02,341 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-14 14:31:02,341 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-14 14:31:02,341 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-14 14:31:02,341 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-14 14:31:02,342 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-14 14:31:02,342 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-14 14:31:02,342 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-14 14:31:02,342 INFO L138 SettingsManager]: * Use SBE=true [2022-04-14 14:31:02,343 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-14 14:31:02,343 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-14 14:31:02,343 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-14 14:31:02,343 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-14 14:31:02,343 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-14 14:31:02,343 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-14 14:31:02,343 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-14 14:31:02,343 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-14 14:31:02,343 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-14 14:31:02,343 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-14 14:31:02,344 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-14 14:31:02,344 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-14 14:31:02,344 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-14 14:31:02,344 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-14 14:31:02,344 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-14 14:31:02,344 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 14:31:02,344 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-14 14:31:02,344 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-14 14:31:02,344 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-14 14:31:02,344 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-14 14:31:02,345 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-14 14:31:02,345 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-04-14 14:31:02,345 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-14 14:31:02,345 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-14 14:31:02,345 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.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-14 14:31:02,512 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-14 14:31:02,534 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-14 14:31:02,536 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-14 14:31:02,539 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-14 14:31:02,539 INFO L275 PluginConnector]: CDTParser initialized [2022-04-14 14:31:02,540 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/sumt9.c [2022-04-14 14:31:02,600 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7cf4f467/986c523d291445ff8021f44a84c7df82/FLAGe5b5b0329 [2022-04-14 14:31:02,956 INFO L306 CDTParser]: Found 1 translation units. [2022-04-14 14:31:02,956 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/sumt9.c [2022-04-14 14:31:02,962 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7cf4f467/986c523d291445ff8021f44a84c7df82/FLAGe5b5b0329 [2022-04-14 14:31:02,973 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7cf4f467/986c523d291445ff8021f44a84c7df82 [2022-04-14 14:31:02,975 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-14 14:31:02,976 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-14 14:31:02,978 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-14 14:31:02,978 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-14 14:31:02,981 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-14 14:31:02,981 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 02:31:02" (1/1) ... [2022-04-14 14:31:02,982 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b5bf8b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 02:31:02, skipping insertion in model container [2022-04-14 14:31:02,982 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 02:31:02" (1/1) ... [2022-04-14 14:31:02,986 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-14 14:31:02,998 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-14 14:31:03,104 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/sumt9.c[403,416] [2022-04-14 14:31:03,120 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 14:31:03,127 INFO L203 MainTranslator]: Completed pre-run [2022-04-14 14:31:03,134 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/sumt9.c[403,416] [2022-04-14 14:31:03,141 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 14:31:03,149 INFO L208 MainTranslator]: Completed translation [2022-04-14 14:31:03,149 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 02:31:03 WrapperNode [2022-04-14 14:31:03,149 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-14 14:31:03,150 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-14 14:31:03,150 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-14 14:31:03,150 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-14 14:31:03,157 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 02:31:03" (1/1) ... [2022-04-14 14:31:03,157 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 02:31:03" (1/1) ... [2022-04-14 14:31:03,161 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 02:31:03" (1/1) ... [2022-04-14 14:31:03,161 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 02:31:03" (1/1) ... [2022-04-14 14:31:03,165 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 02:31:03" (1/1) ... [2022-04-14 14:31:03,168 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 02:31:03" (1/1) ... [2022-04-14 14:31:03,169 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 02:31:03" (1/1) ... [2022-04-14 14:31:03,170 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-14 14:31:03,171 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-14 14:31:03,171 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-14 14:31:03,171 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-14 14:31:03,172 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 02:31:03" (1/1) ... [2022-04-14 14:31:03,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 14:31:03,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 14:31:03,212 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-14 14:31:03,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-14 14:31:03,235 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-14 14:31:03,235 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-14 14:31:03,235 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-14 14:31:03,235 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-14 14:31:03,235 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-14 14:31:03,235 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-14 14:31:03,235 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-14 14:31:03,235 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-14 14:31:03,235 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-14 14:31:03,235 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-14 14:31:03,236 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-14 14:31:03,236 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-14 14:31:03,236 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-14 14:31:03,236 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-14 14:31:03,236 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-14 14:31:03,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-14 14:31:03,236 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-14 14:31:03,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-14 14:31:03,236 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-14 14:31:03,236 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-14 14:31:03,279 INFO L234 CfgBuilder]: Building ICFG [2022-04-14 14:31:03,280 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-14 14:31:14,298 INFO L275 CfgBuilder]: Performing block encoding [2022-04-14 14:31:14,302 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-14 14:31:14,303 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-14 14:31:14,304 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 02:31:14 BoogieIcfgContainer [2022-04-14 14:31:14,304 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-14 14:31:14,305 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-14 14:31:14,305 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-14 14:31:14,307 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-14 14:31:14,307 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 02:31:02" (1/3) ... [2022-04-14 14:31:14,307 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37991955 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 02:31:14, skipping insertion in model container [2022-04-14 14:31:14,307 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 02:31:03" (2/3) ... [2022-04-14 14:31:14,307 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37991955 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 02:31:14, skipping insertion in model container [2022-04-14 14:31:14,308 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 02:31:14" (3/3) ... [2022-04-14 14:31:14,308 INFO L111 eAbstractionObserver]: Analyzing ICFG sumt9.c [2022-04-14 14:31:14,315 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-14 14:31:14,315 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-14 14:31:14,344 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-14 14:31:14,348 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-14 14:31:14,348 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-14 14:31:14,360 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 21 states have (on average 1.619047619047619) internal successors, (34), 23 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-14 14:31:14,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-14 14:31:14,363 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 14:31:14,363 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 14:31:14,363 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 14:31:14,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 14:31:14,367 INFO L85 PathProgramCache]: Analyzing trace with hash 701348598, now seen corresponding path program 1 times [2022-04-14 14:31:14,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 14:31:14,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224981380] [2022-04-14 14:31:14,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 14:31:14,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 14:31:14,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:31:14,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 14:31:14,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:31:14,860 INFO L290 TraceCheckUtils]: 0: Hoare triple {42#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {32#true} is VALID [2022-04-14 14:31:14,860 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume true; {32#true} is VALID [2022-04-14 14:31:14,861 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32#true} {32#true} #91#return; {32#true} is VALID [2022-04-14 14:31:14,862 INFO L272 TraceCheckUtils]: 0: Hoare triple {32#true} call ULTIMATE.init(); {42#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 14:31:14,862 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {32#true} is VALID [2022-04-14 14:31:14,862 INFO L290 TraceCheckUtils]: 2: Hoare triple {32#true} assume true; {32#true} is VALID [2022-04-14 14:31:14,862 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32#true} {32#true} #91#return; {32#true} is VALID [2022-04-14 14:31:14,862 INFO L272 TraceCheckUtils]: 4: Hoare triple {32#true} call #t~ret5 := main(); {32#true} is VALID [2022-04-14 14:31:14,863 INFO L290 TraceCheckUtils]: 5: Hoare triple {32#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v1~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;~v5~0 := 0;~v6~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {37#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v6~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:31:14,864 INFO L290 TraceCheckUtils]: 6: Hoare triple {37#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v6~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {37#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v6~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:31:14,865 INFO L290 TraceCheckUtils]: 7: Hoare triple {37#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v6~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {37#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v6~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:31:14,865 INFO L290 TraceCheckUtils]: 8: Hoare triple {37#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v6~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 9 then ~l~0 % 4294967296 % 9 - 9 else ~l~0 % 4294967296 % 9) % 4294967296;~v6~0 := 1 + ~v6~0; {38#(and (= main_~v5~0 0) (<= main_~v6~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (<= 1 main_~v6~0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:31:14,867 INFO L290 TraceCheckUtils]: 9: Hoare triple {38#(and (= main_~v5~0 0) (<= main_~v6~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (<= 1 main_~v6~0) (= main_~v1~0 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {39#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (< (+ main_~l~0 (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0 1)) (= main_~i~0 0) (= main_~v4~0 0) (not (<= (+ (div main_~l~0 4294967296) 1) (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))) (<= (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) (+ main_~l~0 (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296)))) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:31:14,869 INFO L272 TraceCheckUtils]: 10: Hoare triple {39#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (< (+ main_~l~0 (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0 1)) (= main_~i~0 0) (= main_~v4~0 0) (not (<= (+ (div main_~l~0 4294967296) 1) (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))) (<= (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) (+ main_~l~0 (* 4294967296 (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296)))) (= main_~v1~0 0) (= main_~v3~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0 + ~v6~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {40#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 14:31:14,870 INFO L290 TraceCheckUtils]: 11: Hoare triple {40#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {41#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-14 14:31:14,870 INFO L290 TraceCheckUtils]: 12: Hoare triple {41#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {33#false} is VALID [2022-04-14 14:31:14,871 INFO L290 TraceCheckUtils]: 13: Hoare triple {33#false} assume !false; {33#false} is VALID [2022-04-14 14:31:14,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 14:31:14,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 14:31:14,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224981380] [2022-04-14 14:31:14,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224981380] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 14:31:14,872 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 14:31:14,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-14 14:31:14,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351061386] [2022-04-14 14:31:14,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 14:31:14,896 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-14 14:31:14,897 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 14:31:14,899 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 14:31:14,916 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 14:31:14,917 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-14 14:31:14,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 14:31:14,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-14 14:31:14,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-04-14 14:31:14,932 INFO L87 Difference]: Start difference. First operand has 29 states, 21 states have (on average 1.619047619047619) internal successors, (34), 23 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 14:31:17,191 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:31:19,513 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:31:23,805 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:31:28,137 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:31:34,693 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:31:36,858 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:31:39,029 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:31:41,194 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:31:45,530 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:31:47,695 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:31:49,865 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:31:52,029 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:31:56,523 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:31:58,687 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:32:00,838 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:32:03,002 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:32:05,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:32:05,458 INFO L93 Difference]: Finished difference Result 67 states and 97 transitions. [2022-04-14 14:32:05,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-14 14:32:05,459 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-14 14:32:05,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 14:32:05,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 14:32:05,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 97 transitions. [2022-04-14 14:32:05,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 14:32:05,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 97 transitions. [2022-04-14 14:32:05,482 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 97 transitions. [2022-04-14 14:32:05,574 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 14:32:05,580 INFO L225 Difference]: With dead ends: 67 [2022-04-14 14:32:05,580 INFO L226 Difference]: Without dead ends: 34 [2022-04-14 14:32:05,582 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2022-04-14 14:32:05,584 INFO L913 BasicCegarLoop]: 28 mSDtfsCounter, 53 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 12 mSolverCounterUnsat, 16 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 32.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 16 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 33.9s IncrementalHoareTripleChecker+Time [2022-04-14 14:32:05,584 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 65 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 140 Invalid, 16 Unknown, 0 Unchecked, 33.9s Time] [2022-04-14 14:32:05,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-14 14:32:05,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2022-04-14 14:32:05,609 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 14:32:05,610 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 32 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 25 states have internal predecessors, (34), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-14 14:32:05,610 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 32 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 25 states have internal predecessors, (34), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-14 14:32:05,611 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 32 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 25 states have internal predecessors, (34), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-14 14:32:05,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:32:05,613 INFO L93 Difference]: Finished difference Result 34 states and 44 transitions. [2022-04-14 14:32:05,613 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 44 transitions. [2022-04-14 14:32:05,614 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:32:05,614 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:32:05,614 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 25 states have internal predecessors, (34), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 34 states. [2022-04-14 14:32:05,614 INFO L87 Difference]: Start difference. First operand has 32 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 25 states have internal predecessors, (34), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 34 states. [2022-04-14 14:32:05,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:32:05,616 INFO L93 Difference]: Finished difference Result 34 states and 44 transitions. [2022-04-14 14:32:05,616 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 44 transitions. [2022-04-14 14:32:05,617 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:32:05,617 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:32:05,617 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 14:32:05,617 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 14:32:05,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 25 states have internal predecessors, (34), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-14 14:32:05,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2022-04-14 14:32:05,619 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 41 transitions. Word has length 14 [2022-04-14 14:32:05,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 14:32:05,620 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 41 transitions. [2022-04-14 14:32:05,620 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 14:32:05,620 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-14 14:32:05,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-14 14:32:05,620 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 14:32:05,621 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 14:32:05,621 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-14 14:32:05,621 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 14:32:05,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 14:32:05,622 INFO L85 PathProgramCache]: Analyzing trace with hash 1047670141, now seen corresponding path program 1 times [2022-04-14 14:32:05,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 14:32:05,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796458872] [2022-04-14 14:32:05,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 14:32:05,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 14:32:05,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:32:05,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 14:32:05,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:32:05,881 INFO L290 TraceCheckUtils]: 0: Hoare triple {256#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {257#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-14 14:32:05,881 INFO L290 TraceCheckUtils]: 1: Hoare triple {257#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} assume true; {257#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-14 14:32:05,882 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {257#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {248#true} #91#return; {253#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-14 14:32:05,883 INFO L272 TraceCheckUtils]: 0: Hoare triple {248#true} call ULTIMATE.init(); {256#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 14:32:05,886 INFO L290 TraceCheckUtils]: 1: Hoare triple {256#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {257#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-14 14:32:05,886 INFO L290 TraceCheckUtils]: 2: Hoare triple {257#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} assume true; {257#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-14 14:32:05,887 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {257#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {248#true} #91#return; {253#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-14 14:32:05,887 INFO L272 TraceCheckUtils]: 4: Hoare triple {253#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} call #t~ret5 := main(); {253#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-14 14:32:05,888 INFO L290 TraceCheckUtils]: 5: Hoare triple {253#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v1~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;~v5~0 := 0;~v6~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {254#(and (= main_~l~0 0) (<= (div ~SIZE~0 4294967296) (div main_~l~0 4294967296)) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-14 14:32:05,888 INFO L290 TraceCheckUtils]: 6: Hoare triple {254#(and (= main_~l~0 0) (<= (div ~SIZE~0 4294967296) (div main_~l~0 4294967296)) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {255#(= main_~l~0 0)} is VALID [2022-04-14 14:32:05,889 INFO L290 TraceCheckUtils]: 7: Hoare triple {255#(= main_~l~0 0)} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {255#(= main_~l~0 0)} is VALID [2022-04-14 14:32:05,889 INFO L290 TraceCheckUtils]: 8: Hoare triple {255#(= main_~l~0 0)} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 9 then ~l~0 % 4294967296 % 9 - 9 else ~l~0 % 4294967296 % 9) % 4294967296); {249#false} is VALID [2022-04-14 14:32:05,889 INFO L290 TraceCheckUtils]: 9: Hoare triple {249#false} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296;~v5~0 := 1 + ~v5~0; {249#false} is VALID [2022-04-14 14:32:05,889 INFO L290 TraceCheckUtils]: 10: Hoare triple {249#false} ~l~0 := 1 + ~l~0; {249#false} is VALID [2022-04-14 14:32:05,890 INFO L272 TraceCheckUtils]: 11: Hoare triple {249#false} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0 + ~v6~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {249#false} is VALID [2022-04-14 14:32:05,890 INFO L290 TraceCheckUtils]: 12: Hoare triple {249#false} ~cond := #in~cond; {249#false} is VALID [2022-04-14 14:32:05,890 INFO L290 TraceCheckUtils]: 13: Hoare triple {249#false} assume 0 == ~cond; {249#false} is VALID [2022-04-14 14:32:05,890 INFO L290 TraceCheckUtils]: 14: Hoare triple {249#false} assume !false; {249#false} is VALID [2022-04-14 14:32:05,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 14:32:05,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 14:32:05,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796458872] [2022-04-14 14:32:05,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796458872] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 14:32:05,891 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 14:32:05,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-14 14:32:05,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306988104] [2022-04-14 14:32:05,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 14:32:05,892 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-14 14:32:05,892 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 14:32:05,892 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 14:32:08,080 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 14 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-14 14:32:08,080 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-14 14:32:08,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 14:32:08,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-14 14:32:08,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-14 14:32:08,081 INFO L87 Difference]: Start difference. First operand 32 states and 41 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 14:32:18,874 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:32:23,233 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:32:31,939 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:32:32,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:32:32,120 INFO L93 Difference]: Finished difference Result 49 states and 66 transitions. [2022-04-14 14:32:32,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-14 14:32:32,121 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-14 14:32:32,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 14:32:32,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 14:32:32,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 61 transitions. [2022-04-14 14:32:32,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 14:32:32,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 61 transitions. [2022-04-14 14:32:32,124 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 61 transitions. [2022-04-14 14:32:34,360 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 60 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-14 14:32:34,361 INFO L225 Difference]: With dead ends: 49 [2022-04-14 14:32:34,361 INFO L226 Difference]: Without dead ends: 32 [2022-04-14 14:32:34,362 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-04-14 14:32:34,362 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 88 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 12 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2022-04-14 14:32:34,363 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [88 Valid, 34 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 29 Invalid, 3 Unknown, 0 Unchecked, 6.1s Time] [2022-04-14 14:32:34,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-14 14:32:34,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-14 14:32:34,394 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 14:32:34,395 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 24 states have (on average 1.375) internal successors, (33), 25 states have internal predecessors, (33), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-14 14:32:34,395 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 24 states have (on average 1.375) internal successors, (33), 25 states have internal predecessors, (33), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-14 14:32:34,395 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 24 states have (on average 1.375) internal successors, (33), 25 states have internal predecessors, (33), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-14 14:32:34,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:32:34,403 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2022-04-14 14:32:34,403 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2022-04-14 14:32:34,404 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:32:34,404 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:32:34,404 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 24 states have (on average 1.375) internal successors, (33), 25 states have internal predecessors, (33), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 32 states. [2022-04-14 14:32:34,405 INFO L87 Difference]: Start difference. First operand has 32 states, 24 states have (on average 1.375) internal successors, (33), 25 states have internal predecessors, (33), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 32 states. [2022-04-14 14:32:34,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:32:34,406 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2022-04-14 14:32:34,406 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2022-04-14 14:32:34,406 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:32:34,406 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:32:34,406 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 14:32:34,406 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 14:32:34,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 24 states have (on average 1.375) internal successors, (33), 25 states have internal predecessors, (33), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-14 14:32:34,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2022-04-14 14:32:34,408 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 15 [2022-04-14 14:32:34,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 14:32:34,408 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2022-04-14 14:32:34,408 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 14:32:34,408 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2022-04-14 14:32:34,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-14 14:32:34,409 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 14:32:34,409 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 14:32:34,409 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-14 14:32:34,409 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 14:32:34,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 14:32:34,410 INFO L85 PathProgramCache]: Analyzing trace with hash -133245550, now seen corresponding path program 1 times [2022-04-14 14:32:34,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 14:32:34,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119080747] [2022-04-14 14:32:34,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 14:32:34,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 14:32:34,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:32:34,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 14:32:34,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:32:34,539 INFO L290 TraceCheckUtils]: 0: Hoare triple {443#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {432#true} is VALID [2022-04-14 14:32:34,539 INFO L290 TraceCheckUtils]: 1: Hoare triple {432#true} assume true; {432#true} is VALID [2022-04-14 14:32:34,539 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {432#true} {432#true} #91#return; {432#true} is VALID [2022-04-14 14:32:34,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-04-14 14:32:34,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:32:34,546 INFO L290 TraceCheckUtils]: 0: Hoare triple {432#true} ~cond := #in~cond; {432#true} is VALID [2022-04-14 14:32:34,546 INFO L290 TraceCheckUtils]: 1: Hoare triple {432#true} assume !(0 == ~cond); {432#true} is VALID [2022-04-14 14:32:34,546 INFO L290 TraceCheckUtils]: 2: Hoare triple {432#true} assume true; {432#true} is VALID [2022-04-14 14:32:34,547 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {432#true} {438#(and (<= 1 main_~l~0) (<= (+ (* (div main_~l~0 4294967296) 954437177) (* (div (+ (* (- 9) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 9)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 954437177) (* 2 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 9))) 0))} #89#return; {438#(and (<= 1 main_~l~0) (<= (+ (* (div main_~l~0 4294967296) 954437177) (* (div (+ (* (- 9) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 9)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 954437177) (* 2 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 9))) 0))} is VALID [2022-04-14 14:32:34,547 INFO L272 TraceCheckUtils]: 0: Hoare triple {432#true} call ULTIMATE.init(); {443#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 14:32:34,548 INFO L290 TraceCheckUtils]: 1: Hoare triple {443#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {432#true} is VALID [2022-04-14 14:32:34,548 INFO L290 TraceCheckUtils]: 2: Hoare triple {432#true} assume true; {432#true} is VALID [2022-04-14 14:32:34,548 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {432#true} {432#true} #91#return; {432#true} is VALID [2022-04-14 14:32:34,548 INFO L272 TraceCheckUtils]: 4: Hoare triple {432#true} call #t~ret5 := main(); {432#true} is VALID [2022-04-14 14:32:34,548 INFO L290 TraceCheckUtils]: 5: Hoare triple {432#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v1~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;~v5~0 := 0;~v6~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {437#(= main_~l~0 0)} is VALID [2022-04-14 14:32:34,549 INFO L290 TraceCheckUtils]: 6: Hoare triple {437#(= main_~l~0 0)} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {437#(= main_~l~0 0)} is VALID [2022-04-14 14:32:34,549 INFO L290 TraceCheckUtils]: 7: Hoare triple {437#(= main_~l~0 0)} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {437#(= main_~l~0 0)} is VALID [2022-04-14 14:32:34,549 INFO L290 TraceCheckUtils]: 8: Hoare triple {437#(= main_~l~0 0)} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 9 then ~l~0 % 4294967296 % 9 - 9 else ~l~0 % 4294967296 % 9) % 4294967296;~v6~0 := 1 + ~v6~0; {437#(= main_~l~0 0)} is VALID [2022-04-14 14:32:34,550 INFO L290 TraceCheckUtils]: 9: Hoare triple {437#(= main_~l~0 0)} ~l~0 := 1 + ~l~0; {438#(and (<= 1 main_~l~0) (<= (+ (* (div main_~l~0 4294967296) 954437177) (* (div (+ (* (- 9) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 9)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 954437177) (* 2 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 9))) 0))} is VALID [2022-04-14 14:32:34,550 INFO L272 TraceCheckUtils]: 10: Hoare triple {438#(and (<= 1 main_~l~0) (<= (+ (* (div main_~l~0 4294967296) 954437177) (* (div (+ (* (- 9) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 9)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 954437177) (* 2 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 9))) 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0 + ~v6~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {432#true} is VALID [2022-04-14 14:32:34,550 INFO L290 TraceCheckUtils]: 11: Hoare triple {432#true} ~cond := #in~cond; {432#true} is VALID [2022-04-14 14:32:34,550 INFO L290 TraceCheckUtils]: 12: Hoare triple {432#true} assume !(0 == ~cond); {432#true} is VALID [2022-04-14 14:32:34,550 INFO L290 TraceCheckUtils]: 13: Hoare triple {432#true} assume true; {432#true} is VALID [2022-04-14 14:32:34,551 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {432#true} {438#(and (<= 1 main_~l~0) (<= (+ (* (div main_~l~0 4294967296) 954437177) (* (div (+ (* (- 9) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 9)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 954437177) (* 2 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 9))) 0))} #89#return; {438#(and (<= 1 main_~l~0) (<= (+ (* (div main_~l~0 4294967296) 954437177) (* (div (+ (* (- 9) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 9)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 954437177) (* 2 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 9))) 0))} is VALID [2022-04-14 14:32:34,552 INFO L290 TraceCheckUtils]: 15: Hoare triple {438#(and (<= 1 main_~l~0) (<= (+ (* (div main_~l~0 4294967296) 954437177) (* (div (+ (* (- 9) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 9)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 954437177) (* 2 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 9))) 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {438#(and (<= 1 main_~l~0) (<= (+ (* (div main_~l~0 4294967296) 954437177) (* (div (+ (* (- 9) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 9)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 954437177) (* 2 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 9))) 0))} is VALID [2022-04-14 14:32:34,554 INFO L290 TraceCheckUtils]: 16: Hoare triple {438#(and (<= 1 main_~l~0) (<= (+ (* (div main_~l~0 4294967296) 954437177) (* (div (+ (* (- 9) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 9)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 954437177) (* 2 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 9))) 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 9 then ~l~0 % 4294967296 % 9 - 9 else ~l~0 % 4294967296 % 9) % 4294967296;~v6~0 := 1 + ~v6~0; {433#false} is VALID [2022-04-14 14:32:34,554 INFO L290 TraceCheckUtils]: 17: Hoare triple {433#false} ~l~0 := 1 + ~l~0; {433#false} is VALID [2022-04-14 14:32:34,554 INFO L272 TraceCheckUtils]: 18: Hoare triple {433#false} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0 + ~v6~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {433#false} is VALID [2022-04-14 14:32:34,554 INFO L290 TraceCheckUtils]: 19: Hoare triple {433#false} ~cond := #in~cond; {433#false} is VALID [2022-04-14 14:32:34,554 INFO L290 TraceCheckUtils]: 20: Hoare triple {433#false} assume 0 == ~cond; {433#false} is VALID [2022-04-14 14:32:34,555 INFO L290 TraceCheckUtils]: 21: Hoare triple {433#false} assume !false; {433#false} is VALID [2022-04-14 14:32:34,555 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 14:32:34,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 14:32:34,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119080747] [2022-04-14 14:32:34,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119080747] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-14 14:32:34,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1904895160] [2022-04-14 14:32:34,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 14:32:34,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 14:32:34,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 14:32:34,563 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 14:32:34,565 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-14 14:32:34,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:32:34,602 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-14 14:32:34,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:32:34,614 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 14:32:35,200 INFO L272 TraceCheckUtils]: 0: Hoare triple {432#true} call ULTIMATE.init(); {432#true} is VALID [2022-04-14 14:32:35,201 INFO L290 TraceCheckUtils]: 1: Hoare triple {432#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {432#true} is VALID [2022-04-14 14:32:35,201 INFO L290 TraceCheckUtils]: 2: Hoare triple {432#true} assume true; {432#true} is VALID [2022-04-14 14:32:35,201 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {432#true} {432#true} #91#return; {432#true} is VALID [2022-04-14 14:32:35,201 INFO L272 TraceCheckUtils]: 4: Hoare triple {432#true} call #t~ret5 := main(); {432#true} is VALID [2022-04-14 14:32:35,202 INFO L290 TraceCheckUtils]: 5: Hoare triple {432#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v1~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;~v5~0 := 0;~v6~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {462#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v6~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:32:35,202 INFO L290 TraceCheckUtils]: 6: Hoare triple {462#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v6~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {462#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v6~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:32:35,203 INFO L290 TraceCheckUtils]: 7: Hoare triple {462#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v6~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {462#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v6~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:32:35,203 INFO L290 TraceCheckUtils]: 8: Hoare triple {462#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v6~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 9 then ~l~0 % 4294967296 % 9 - 9 else ~l~0 % 4294967296 % 9) % 4294967296;~v6~0 := 1 + ~v6~0; {472#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:32:35,204 INFO L290 TraceCheckUtils]: 9: Hoare triple {472#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {476#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:32:35,204 INFO L272 TraceCheckUtils]: 10: Hoare triple {476#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0 + ~v6~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {432#true} is VALID [2022-04-14 14:32:35,204 INFO L290 TraceCheckUtils]: 11: Hoare triple {432#true} ~cond := #in~cond; {432#true} is VALID [2022-04-14 14:32:35,204 INFO L290 TraceCheckUtils]: 12: Hoare triple {432#true} assume !(0 == ~cond); {432#true} is VALID [2022-04-14 14:32:35,204 INFO L290 TraceCheckUtils]: 13: Hoare triple {432#true} assume true; {432#true} is VALID [2022-04-14 14:32:35,205 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {432#true} {476#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} #89#return; {476#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:32:35,206 INFO L290 TraceCheckUtils]: 15: Hoare triple {476#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {476#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:32:35,207 INFO L290 TraceCheckUtils]: 16: Hoare triple {476#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 9 then ~l~0 % 4294967296 % 9 - 9 else ~l~0 % 4294967296 % 9) % 4294967296;~v6~0 := 1 + ~v6~0; {498#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= 2 main_~v6~0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:32:35,207 INFO L290 TraceCheckUtils]: 17: Hoare triple {498#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= 2 main_~v6~0) (= main_~v1~0 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {502#(and (= main_~v5~0 0) (= main_~l~0 2) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= 2 main_~v6~0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:32:35,208 INFO L272 TraceCheckUtils]: 18: Hoare triple {502#(and (= main_~v5~0 0) (= main_~l~0 2) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= 2 main_~v6~0) (= main_~v1~0 0) (= main_~v3~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0 + ~v6~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {506#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 14:32:35,209 INFO L290 TraceCheckUtils]: 19: Hoare triple {506#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {510#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 14:32:35,209 INFO L290 TraceCheckUtils]: 20: Hoare triple {510#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {433#false} is VALID [2022-04-14 14:32:35,209 INFO L290 TraceCheckUtils]: 21: Hoare triple {433#false} assume !false; {433#false} is VALID [2022-04-14 14:32:35,209 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 14:32:35,209 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 14:32:35,450 INFO L290 TraceCheckUtils]: 21: Hoare triple {433#false} assume !false; {433#false} is VALID [2022-04-14 14:32:35,450 INFO L290 TraceCheckUtils]: 20: Hoare triple {510#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {433#false} is VALID [2022-04-14 14:32:35,451 INFO L290 TraceCheckUtils]: 19: Hoare triple {506#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {510#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 14:32:35,452 INFO L272 TraceCheckUtils]: 18: Hoare triple {526#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0 + ~v6~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {506#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 14:32:35,453 INFO L290 TraceCheckUtils]: 17: Hoare triple {530#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} ~l~0 := 1 + ~l~0; {526#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:32:37,566 WARN L290 TraceCheckUtils]: 16: Hoare triple {526#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 9 then ~l~0 % 4294967296 % 9 - 9 else ~l~0 % 4294967296 % 9) % 4294967296;~v6~0 := 1 + ~v6~0; {530#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is UNKNOWN [2022-04-14 14:32:37,567 INFO L290 TraceCheckUtils]: 15: Hoare triple {526#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {526#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:32:37,568 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {432#true} {526#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} #89#return; {526#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:32:37,568 INFO L290 TraceCheckUtils]: 13: Hoare triple {432#true} assume true; {432#true} is VALID [2022-04-14 14:32:37,568 INFO L290 TraceCheckUtils]: 12: Hoare triple {432#true} assume !(0 == ~cond); {432#true} is VALID [2022-04-14 14:32:37,568 INFO L290 TraceCheckUtils]: 11: Hoare triple {432#true} ~cond := #in~cond; {432#true} is VALID [2022-04-14 14:32:37,568 INFO L272 TraceCheckUtils]: 10: Hoare triple {526#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0 + ~v6~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {432#true} is VALID [2022-04-14 14:32:37,573 INFO L290 TraceCheckUtils]: 9: Hoare triple {530#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} ~l~0 := 1 + ~l~0; {526#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:32:39,686 WARN L290 TraceCheckUtils]: 8: Hoare triple {526#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 9 then ~l~0 % 4294967296 % 9 - 9 else ~l~0 % 4294967296 % 9) % 4294967296;~v6~0 := 1 + ~v6~0; {530#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is UNKNOWN [2022-04-14 14:32:39,687 INFO L290 TraceCheckUtils]: 7: Hoare triple {526#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {526#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:32:39,695 INFO L290 TraceCheckUtils]: 6: Hoare triple {526#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {526#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:32:39,698 INFO L290 TraceCheckUtils]: 5: Hoare triple {432#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v1~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;~v5~0 := 0;~v6~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {526#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:32:39,699 INFO L272 TraceCheckUtils]: 4: Hoare triple {432#true} call #t~ret5 := main(); {432#true} is VALID [2022-04-14 14:32:39,699 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {432#true} {432#true} #91#return; {432#true} is VALID [2022-04-14 14:32:39,699 INFO L290 TraceCheckUtils]: 2: Hoare triple {432#true} assume true; {432#true} is VALID [2022-04-14 14:32:39,699 INFO L290 TraceCheckUtils]: 1: Hoare triple {432#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {432#true} is VALID [2022-04-14 14:32:39,699 INFO L272 TraceCheckUtils]: 0: Hoare triple {432#true} call ULTIMATE.init(); {432#true} is VALID [2022-04-14 14:32:39,699 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-14 14:32:39,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1904895160] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-14 14:32:39,700 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-14 14:32:39,700 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5, 9] total 14 [2022-04-14 14:32:39,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926331969] [2022-04-14 14:32:39,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 14:32:39,700 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2022-04-14 14:32:39,701 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 14:32:39,701 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 14:32:41,829 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 18 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-14 14:32:41,829 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-14 14:32:41,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 14:32:41,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-14 14:32:41,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-04-14 14:32:41,830 INFO L87 Difference]: Start difference. First operand 32 states and 40 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 14:32:43,967 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:32:50,467 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:32:56,965 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:33:01,318 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:33:07,823 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:33:12,167 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:33:18,668 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:33:23,039 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:33:29,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:33:29,757 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2022-04-14 14:33:29,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-14 14:33:29,757 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2022-04-14 14:33:29,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 14:33:29,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 14:33:29,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 43 transitions. [2022-04-14 14:33:29,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 14:33:29,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 43 transitions. [2022-04-14 14:33:29,761 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 43 transitions. [2022-04-14 14:33:29,805 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 14:33:29,806 INFO L225 Difference]: With dead ends: 42 [2022-04-14 14:33:29,807 INFO L226 Difference]: Without dead ends: 40 [2022-04-14 14:33:29,807 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 37 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-04-14 14:33:29,807 INFO L913 BasicCegarLoop]: 26 mSDtfsCounter, 5 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.4s IncrementalHoareTripleChecker+Time [2022-04-14 14:33:29,808 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 95 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 8 Unknown, 0 Unchecked, 16.4s Time] [2022-04-14 14:33:29,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-04-14 14:33:29,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 34. [2022-04-14 14:33:29,826 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 14:33:29,826 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand has 34 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 26 states have internal predecessors, (36), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-14 14:33:29,826 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand has 34 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 26 states have internal predecessors, (36), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-14 14:33:29,827 INFO L87 Difference]: Start difference. First operand 40 states. Second operand has 34 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 26 states have internal predecessors, (36), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-14 14:33:29,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:33:29,828 INFO L93 Difference]: Finished difference Result 40 states and 49 transitions. [2022-04-14 14:33:29,828 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 49 transitions. [2022-04-14 14:33:29,828 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:33:29,828 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:33:29,829 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 26 states have internal predecessors, (36), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 40 states. [2022-04-14 14:33:29,829 INFO L87 Difference]: Start difference. First operand has 34 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 26 states have internal predecessors, (36), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 40 states. [2022-04-14 14:33:29,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:33:29,830 INFO L93 Difference]: Finished difference Result 40 states and 49 transitions. [2022-04-14 14:33:29,830 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 49 transitions. [2022-04-14 14:33:29,831 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:33:29,831 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:33:29,831 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 14:33:29,831 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 14:33:29,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 26 states have internal predecessors, (36), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-14 14:33:29,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2022-04-14 14:33:29,832 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 43 transitions. Word has length 22 [2022-04-14 14:33:29,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 14:33:29,832 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 43 transitions. [2022-04-14 14:33:29,832 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 14:33:29,832 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-04-14 14:33:29,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-14 14:33:29,833 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 14:33:29,833 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 14:33:29,853 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-14 14:33:30,035 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 14:33:30,036 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 14:33:30,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 14:33:30,036 INFO L85 PathProgramCache]: Analyzing trace with hash 945055329, now seen corresponding path program 1 times [2022-04-14 14:33:30,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 14:33:30,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726357044] [2022-04-14 14:33:30,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 14:33:30,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 14:33:30,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:33:30,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 14:33:30,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:33:30,144 INFO L290 TraceCheckUtils]: 0: Hoare triple {777#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {766#true} is VALID [2022-04-14 14:33:30,144 INFO L290 TraceCheckUtils]: 1: Hoare triple {766#true} assume true; {766#true} is VALID [2022-04-14 14:33:30,144 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {766#true} {766#true} #91#return; {766#true} is VALID [2022-04-14 14:33:30,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-04-14 14:33:30,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:33:30,156 INFO L290 TraceCheckUtils]: 0: Hoare triple {766#true} ~cond := #in~cond; {766#true} is VALID [2022-04-14 14:33:30,157 INFO L290 TraceCheckUtils]: 1: Hoare triple {766#true} assume !(0 == ~cond); {766#true} is VALID [2022-04-14 14:33:30,157 INFO L290 TraceCheckUtils]: 2: Hoare triple {766#true} assume true; {766#true} is VALID [2022-04-14 14:33:30,158 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {766#true} {772#(and (<= (div main_~l~0 8) 0) (<= 1 main_~l~0))} #89#return; {772#(and (<= (div main_~l~0 8) 0) (<= 1 main_~l~0))} is VALID [2022-04-14 14:33:30,159 INFO L272 TraceCheckUtils]: 0: Hoare triple {766#true} call ULTIMATE.init(); {777#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 14:33:30,159 INFO L290 TraceCheckUtils]: 1: Hoare triple {777#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {766#true} is VALID [2022-04-14 14:33:30,160 INFO L290 TraceCheckUtils]: 2: Hoare triple {766#true} assume true; {766#true} is VALID [2022-04-14 14:33:30,160 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {766#true} {766#true} #91#return; {766#true} is VALID [2022-04-14 14:33:30,167 INFO L272 TraceCheckUtils]: 4: Hoare triple {766#true} call #t~ret5 := main(); {766#true} is VALID [2022-04-14 14:33:30,168 INFO L290 TraceCheckUtils]: 5: Hoare triple {766#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v1~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;~v5~0 := 0;~v6~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {771#(= main_~l~0 0)} is VALID [2022-04-14 14:33:30,170 INFO L290 TraceCheckUtils]: 6: Hoare triple {771#(= main_~l~0 0)} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {771#(= main_~l~0 0)} is VALID [2022-04-14 14:33:30,170 INFO L290 TraceCheckUtils]: 7: Hoare triple {771#(= main_~l~0 0)} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {771#(= main_~l~0 0)} is VALID [2022-04-14 14:33:30,170 INFO L290 TraceCheckUtils]: 8: Hoare triple {771#(= main_~l~0 0)} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 9 then ~l~0 % 4294967296 % 9 - 9 else ~l~0 % 4294967296 % 9) % 4294967296;~v6~0 := 1 + ~v6~0; {771#(= main_~l~0 0)} is VALID [2022-04-14 14:33:30,171 INFO L290 TraceCheckUtils]: 9: Hoare triple {771#(= main_~l~0 0)} ~l~0 := 1 + ~l~0; {772#(and (<= (div main_~l~0 8) 0) (<= 1 main_~l~0))} is VALID [2022-04-14 14:33:30,171 INFO L272 TraceCheckUtils]: 10: Hoare triple {772#(and (<= (div main_~l~0 8) 0) (<= 1 main_~l~0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0 + ~v6~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {766#true} is VALID [2022-04-14 14:33:30,171 INFO L290 TraceCheckUtils]: 11: Hoare triple {766#true} ~cond := #in~cond; {766#true} is VALID [2022-04-14 14:33:30,171 INFO L290 TraceCheckUtils]: 12: Hoare triple {766#true} assume !(0 == ~cond); {766#true} is VALID [2022-04-14 14:33:30,171 INFO L290 TraceCheckUtils]: 13: Hoare triple {766#true} assume true; {766#true} is VALID [2022-04-14 14:33:30,172 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {766#true} {772#(and (<= (div main_~l~0 8) 0) (<= 1 main_~l~0))} #89#return; {772#(and (<= (div main_~l~0 8) 0) (<= 1 main_~l~0))} is VALID [2022-04-14 14:33:30,173 INFO L290 TraceCheckUtils]: 15: Hoare triple {772#(and (<= (div main_~l~0 8) 0) (<= 1 main_~l~0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {772#(and (<= (div main_~l~0 8) 0) (<= 1 main_~l~0))} is VALID [2022-04-14 14:33:30,173 INFO L290 TraceCheckUtils]: 16: Hoare triple {772#(and (<= (div main_~l~0 8) 0) (<= 1 main_~l~0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 9 then ~l~0 % 4294967296 % 9 - 9 else ~l~0 % 4294967296 % 9) % 4294967296); {772#(and (<= (div main_~l~0 8) 0) (<= 1 main_~l~0))} is VALID [2022-04-14 14:33:30,174 INFO L290 TraceCheckUtils]: 17: Hoare triple {772#(and (<= (div main_~l~0 8) 0) (<= 1 main_~l~0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296;~v5~0 := 1 + ~v5~0; {767#false} is VALID [2022-04-14 14:33:30,174 INFO L290 TraceCheckUtils]: 18: Hoare triple {767#false} ~l~0 := 1 + ~l~0; {767#false} is VALID [2022-04-14 14:33:30,174 INFO L272 TraceCheckUtils]: 19: Hoare triple {767#false} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0 + ~v6~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {767#false} is VALID [2022-04-14 14:33:30,174 INFO L290 TraceCheckUtils]: 20: Hoare triple {767#false} ~cond := #in~cond; {767#false} is VALID [2022-04-14 14:33:30,174 INFO L290 TraceCheckUtils]: 21: Hoare triple {767#false} assume 0 == ~cond; {767#false} is VALID [2022-04-14 14:33:30,174 INFO L290 TraceCheckUtils]: 22: Hoare triple {767#false} assume !false; {767#false} is VALID [2022-04-14 14:33:30,182 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 14:33:30,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 14:33:30,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726357044] [2022-04-14 14:33:30,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726357044] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-14 14:33:30,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1271910945] [2022-04-14 14:33:30,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 14:33:30,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 14:33:30,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 14:33:30,183 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 14:33:30,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-14 14:33:30,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:33:30,221 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-14 14:33:30,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:33:30,235 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 14:33:30,773 INFO L272 TraceCheckUtils]: 0: Hoare triple {766#true} call ULTIMATE.init(); {766#true} is VALID [2022-04-14 14:33:30,773 INFO L290 TraceCheckUtils]: 1: Hoare triple {766#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {766#true} is VALID [2022-04-14 14:33:30,774 INFO L290 TraceCheckUtils]: 2: Hoare triple {766#true} assume true; {766#true} is VALID [2022-04-14 14:33:30,774 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {766#true} {766#true} #91#return; {766#true} is VALID [2022-04-14 14:33:30,774 INFO L272 TraceCheckUtils]: 4: Hoare triple {766#true} call #t~ret5 := main(); {766#true} is VALID [2022-04-14 14:33:30,774 INFO L290 TraceCheckUtils]: 5: Hoare triple {766#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v1~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;~v5~0 := 0;~v6~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {796#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v6~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:33:30,775 INFO L290 TraceCheckUtils]: 6: Hoare triple {796#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v6~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {796#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v6~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:33:30,775 INFO L290 TraceCheckUtils]: 7: Hoare triple {796#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v6~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {796#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v6~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:33:30,776 INFO L290 TraceCheckUtils]: 8: Hoare triple {796#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v6~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 9 then ~l~0 % 4294967296 % 9 - 9 else ~l~0 % 4294967296 % 9) % 4294967296;~v6~0 := 1 + ~v6~0; {806#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:33:30,776 INFO L290 TraceCheckUtils]: 9: Hoare triple {806#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {810#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:33:30,776 INFO L272 TraceCheckUtils]: 10: Hoare triple {810#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0 + ~v6~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {766#true} is VALID [2022-04-14 14:33:30,777 INFO L290 TraceCheckUtils]: 11: Hoare triple {766#true} ~cond := #in~cond; {766#true} is VALID [2022-04-14 14:33:30,777 INFO L290 TraceCheckUtils]: 12: Hoare triple {766#true} assume !(0 == ~cond); {766#true} is VALID [2022-04-14 14:33:30,777 INFO L290 TraceCheckUtils]: 13: Hoare triple {766#true} assume true; {766#true} is VALID [2022-04-14 14:33:30,778 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {766#true} {810#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} #89#return; {810#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:33:30,778 INFO L290 TraceCheckUtils]: 15: Hoare triple {810#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {810#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:33:30,779 INFO L290 TraceCheckUtils]: 16: Hoare triple {810#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 9 then ~l~0 % 4294967296 % 9 - 9 else ~l~0 % 4294967296 % 9) % 4294967296); {810#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:33:30,779 INFO L290 TraceCheckUtils]: 17: Hoare triple {810#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296;~v5~0 := 1 + ~v5~0; {835#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:33:30,780 INFO L290 TraceCheckUtils]: 18: Hoare triple {835#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {839#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:33:30,781 INFO L272 TraceCheckUtils]: 19: Hoare triple {839#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1) (= main_~v1~0 0) (= main_~v3~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0 + ~v6~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {843#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 14:33:30,781 INFO L290 TraceCheckUtils]: 20: Hoare triple {843#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {847#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 14:33:30,782 INFO L290 TraceCheckUtils]: 21: Hoare triple {847#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {767#false} is VALID [2022-04-14 14:33:30,782 INFO L290 TraceCheckUtils]: 22: Hoare triple {767#false} assume !false; {767#false} is VALID [2022-04-14 14:33:30,782 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 14:33:30,782 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 14:33:31,007 INFO L290 TraceCheckUtils]: 22: Hoare triple {767#false} assume !false; {767#false} is VALID [2022-04-14 14:33:31,008 INFO L290 TraceCheckUtils]: 21: Hoare triple {847#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {767#false} is VALID [2022-04-14 14:33:31,008 INFO L290 TraceCheckUtils]: 20: Hoare triple {843#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {847#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 14:33:31,009 INFO L272 TraceCheckUtils]: 19: Hoare triple {863#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0 + ~v6~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {843#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 14:33:31,010 INFO L290 TraceCheckUtils]: 18: Hoare triple {867#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} ~l~0 := 1 + ~l~0; {863#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:33:31,023 INFO L290 TraceCheckUtils]: 17: Hoare triple {863#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296;~v5~0 := 1 + ~v5~0; {867#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:33:31,023 INFO L290 TraceCheckUtils]: 16: Hoare triple {863#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 9 then ~l~0 % 4294967296 % 9 - 9 else ~l~0 % 4294967296 % 9) % 4294967296); {863#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:33:31,024 INFO L290 TraceCheckUtils]: 15: Hoare triple {863#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {863#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:33:31,025 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {766#true} {863#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} #89#return; {863#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:33:31,025 INFO L290 TraceCheckUtils]: 13: Hoare triple {766#true} assume true; {766#true} is VALID [2022-04-14 14:33:31,025 INFO L290 TraceCheckUtils]: 12: Hoare triple {766#true} assume !(0 == ~cond); {766#true} is VALID [2022-04-14 14:33:31,025 INFO L290 TraceCheckUtils]: 11: Hoare triple {766#true} ~cond := #in~cond; {766#true} is VALID [2022-04-14 14:33:31,025 INFO L272 TraceCheckUtils]: 10: Hoare triple {863#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0 + ~v6~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {766#true} is VALID [2022-04-14 14:33:31,026 INFO L290 TraceCheckUtils]: 9: Hoare triple {867#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} ~l~0 := 1 + ~l~0; {863#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:33:33,132 WARN L290 TraceCheckUtils]: 8: Hoare triple {863#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 9 then ~l~0 % 4294967296 % 9 - 9 else ~l~0 % 4294967296 % 9) % 4294967296;~v6~0 := 1 + ~v6~0; {867#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is UNKNOWN [2022-04-14 14:33:33,132 INFO L290 TraceCheckUtils]: 7: Hoare triple {863#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {863#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:33:33,136 INFO L290 TraceCheckUtils]: 6: Hoare triple {863#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {863#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:33:33,138 INFO L290 TraceCheckUtils]: 5: Hoare triple {766#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v1~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;~v5~0 := 0;~v6~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {863#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:33:33,139 INFO L272 TraceCheckUtils]: 4: Hoare triple {766#true} call #t~ret5 := main(); {766#true} is VALID [2022-04-14 14:33:33,139 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {766#true} {766#true} #91#return; {766#true} is VALID [2022-04-14 14:33:33,139 INFO L290 TraceCheckUtils]: 2: Hoare triple {766#true} assume true; {766#true} is VALID [2022-04-14 14:33:33,139 INFO L290 TraceCheckUtils]: 1: Hoare triple {766#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {766#true} is VALID [2022-04-14 14:33:33,139 INFO L272 TraceCheckUtils]: 0: Hoare triple {766#true} call ULTIMATE.init(); {766#true} is VALID [2022-04-14 14:33:33,139 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-14 14:33:33,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1271910945] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-14 14:33:33,139 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-14 14:33:33,139 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5, 9] total 14 [2022-04-14 14:33:33,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72320616] [2022-04-14 14:33:33,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 14:33:33,140 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 23 [2022-04-14 14:33:33,140 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 14:33:33,140 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 14:33:35,305 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 20 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-14 14:33:35,305 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-14 14:33:35,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 14:33:35,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-14 14:33:35,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-04-14 14:33:35,306 INFO L87 Difference]: Start difference. First operand 34 states and 43 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 14:33:37,428 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:33:39,625 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:33:41,737 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:33:43,856 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:33:48,224 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:33:52,568 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:33:59,078 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:34:03,402 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:34:12,037 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:34:16,371 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:34:20,758 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:34:23,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:34:23,006 INFO L93 Difference]: Finished difference Result 46 states and 58 transitions. [2022-04-14 14:34:23,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-14 14:34:23,007 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 23 [2022-04-14 14:34:23,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 14:34:23,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 14:34:23,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 47 transitions. [2022-04-14 14:34:23,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 14:34:23,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 47 transitions. [2022-04-14 14:34:23,009 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 47 transitions. [2022-04-14 14:34:25,193 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 46 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-14 14:34:25,194 INFO L225 Difference]: With dead ends: 46 [2022-04-14 14:34:25,194 INFO L226 Difference]: Without dead ends: 44 [2022-04-14 14:34:25,194 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-04-14 14:34:25,195 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 6 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 0 mSolverCounterUnsat, 11 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 11 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.6s IncrementalHoareTripleChecker+Time [2022-04-14 14:34:25,195 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 84 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 61 Invalid, 11 Unknown, 0 Unchecked, 22.6s Time] [2022-04-14 14:34:25,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-14 14:34:25,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 35. [2022-04-14 14:34:25,215 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 14:34:25,215 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 35 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 27 states have internal predecessors, (38), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-14 14:34:25,215 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 35 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 27 states have internal predecessors, (38), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-14 14:34:25,215 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 35 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 27 states have internal predecessors, (38), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-14 14:34:25,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:34:25,216 INFO L93 Difference]: Finished difference Result 44 states and 56 transitions. [2022-04-14 14:34:25,216 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 56 transitions. [2022-04-14 14:34:25,217 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:34:25,217 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:34:25,217 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 27 states have internal predecessors, (38), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 44 states. [2022-04-14 14:34:25,217 INFO L87 Difference]: Start difference. First operand has 35 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 27 states have internal predecessors, (38), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 44 states. [2022-04-14 14:34:25,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:34:25,218 INFO L93 Difference]: Finished difference Result 44 states and 56 transitions. [2022-04-14 14:34:25,218 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 56 transitions. [2022-04-14 14:34:25,219 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:34:25,219 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:34:25,219 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 14:34:25,219 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 14:34:25,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 27 states have internal predecessors, (38), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-14 14:34:25,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 45 transitions. [2022-04-14 14:34:25,220 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 45 transitions. Word has length 23 [2022-04-14 14:34:25,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 14:34:25,220 INFO L478 AbstractCegarLoop]: Abstraction has 35 states and 45 transitions. [2022-04-14 14:34:25,220 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 14:34:25,220 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 45 transitions. [2022-04-14 14:34:25,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-14 14:34:25,221 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 14:34:25,221 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 14:34:25,237 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-14 14:34:25,435 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-14 14:34:25,436 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 14:34:25,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 14:34:25,436 INFO L85 PathProgramCache]: Analyzing trace with hash 155789965, now seen corresponding path program 1 times [2022-04-14 14:34:25,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 14:34:25,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482875902] [2022-04-14 14:34:25,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 14:34:25,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 14:34:25,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:34:25,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 14:34:25,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:34:25,570 INFO L290 TraceCheckUtils]: 0: Hoare triple {1131#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {1120#true} is VALID [2022-04-14 14:34:25,571 INFO L290 TraceCheckUtils]: 1: Hoare triple {1120#true} assume true; {1120#true} is VALID [2022-04-14 14:34:25,571 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1120#true} {1120#true} #91#return; {1120#true} is VALID [2022-04-14 14:34:25,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-04-14 14:34:25,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:34:25,576 INFO L290 TraceCheckUtils]: 0: Hoare triple {1120#true} ~cond := #in~cond; {1120#true} is VALID [2022-04-14 14:34:25,576 INFO L290 TraceCheckUtils]: 1: Hoare triple {1120#true} assume !(0 == ~cond); {1120#true} is VALID [2022-04-14 14:34:25,576 INFO L290 TraceCheckUtils]: 2: Hoare triple {1120#true} assume true; {1120#true} is VALID [2022-04-14 14:34:25,577 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1120#true} {1126#(and (<= (+ (* 2 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* 1227133513 (div main_~l~0 4294967296)) (* 1227133513 (div (+ main_~l~0 (* (- 7) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296))) 0) (<= 1 main_~l~0))} #89#return; {1126#(and (<= (+ (* 2 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* 1227133513 (div main_~l~0 4294967296)) (* 1227133513 (div (+ main_~l~0 (* (- 7) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296))) 0) (<= 1 main_~l~0))} is VALID [2022-04-14 14:34:25,578 INFO L272 TraceCheckUtils]: 0: Hoare triple {1120#true} call ULTIMATE.init(); {1131#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 14:34:25,578 INFO L290 TraceCheckUtils]: 1: Hoare triple {1131#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {1120#true} is VALID [2022-04-14 14:34:25,578 INFO L290 TraceCheckUtils]: 2: Hoare triple {1120#true} assume true; {1120#true} is VALID [2022-04-14 14:34:25,578 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1120#true} {1120#true} #91#return; {1120#true} is VALID [2022-04-14 14:34:25,578 INFO L272 TraceCheckUtils]: 4: Hoare triple {1120#true} call #t~ret5 := main(); {1120#true} is VALID [2022-04-14 14:34:25,578 INFO L290 TraceCheckUtils]: 5: Hoare triple {1120#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v1~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;~v5~0 := 0;~v6~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {1125#(= main_~l~0 0)} is VALID [2022-04-14 14:34:25,579 INFO L290 TraceCheckUtils]: 6: Hoare triple {1125#(= main_~l~0 0)} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {1125#(= main_~l~0 0)} is VALID [2022-04-14 14:34:25,579 INFO L290 TraceCheckUtils]: 7: Hoare triple {1125#(= main_~l~0 0)} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {1125#(= main_~l~0 0)} is VALID [2022-04-14 14:34:25,582 INFO L290 TraceCheckUtils]: 8: Hoare triple {1125#(= main_~l~0 0)} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 9 then ~l~0 % 4294967296 % 9 - 9 else ~l~0 % 4294967296 % 9) % 4294967296;~v6~0 := 1 + ~v6~0; {1125#(= main_~l~0 0)} is VALID [2022-04-14 14:34:25,582 INFO L290 TraceCheckUtils]: 9: Hoare triple {1125#(= main_~l~0 0)} ~l~0 := 1 + ~l~0; {1126#(and (<= (+ (* 2 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* 1227133513 (div main_~l~0 4294967296)) (* 1227133513 (div (+ main_~l~0 (* (- 7) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296))) 0) (<= 1 main_~l~0))} is VALID [2022-04-14 14:34:25,582 INFO L272 TraceCheckUtils]: 10: Hoare triple {1126#(and (<= (+ (* 2 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* 1227133513 (div main_~l~0 4294967296)) (* 1227133513 (div (+ main_~l~0 (* (- 7) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296))) 0) (<= 1 main_~l~0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0 + ~v6~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {1120#true} is VALID [2022-04-14 14:34:25,582 INFO L290 TraceCheckUtils]: 11: Hoare triple {1120#true} ~cond := #in~cond; {1120#true} is VALID [2022-04-14 14:34:25,583 INFO L290 TraceCheckUtils]: 12: Hoare triple {1120#true} assume !(0 == ~cond); {1120#true} is VALID [2022-04-14 14:34:25,583 INFO L290 TraceCheckUtils]: 13: Hoare triple {1120#true} assume true; {1120#true} is VALID [2022-04-14 14:34:25,584 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {1120#true} {1126#(and (<= (+ (* 2 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* 1227133513 (div main_~l~0 4294967296)) (* 1227133513 (div (+ main_~l~0 (* (- 7) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296))) 0) (<= 1 main_~l~0))} #89#return; {1126#(and (<= (+ (* 2 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* 1227133513 (div main_~l~0 4294967296)) (* 1227133513 (div (+ main_~l~0 (* (- 7) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296))) 0) (<= 1 main_~l~0))} is VALID [2022-04-14 14:34:25,584 INFO L290 TraceCheckUtils]: 15: Hoare triple {1126#(and (<= (+ (* 2 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* 1227133513 (div main_~l~0 4294967296)) (* 1227133513 (div (+ main_~l~0 (* (- 7) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296))) 0) (<= 1 main_~l~0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {1126#(and (<= (+ (* 2 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* 1227133513 (div main_~l~0 4294967296)) (* 1227133513 (div (+ main_~l~0 (* (- 7) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296))) 0) (<= 1 main_~l~0))} is VALID [2022-04-14 14:34:25,585 INFO L290 TraceCheckUtils]: 16: Hoare triple {1126#(and (<= (+ (* 2 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* 1227133513 (div main_~l~0 4294967296)) (* 1227133513 (div (+ main_~l~0 (* (- 7) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296))) 0) (<= 1 main_~l~0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 9 then ~l~0 % 4294967296 % 9 - 9 else ~l~0 % 4294967296 % 9) % 4294967296); {1126#(and (<= (+ (* 2 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* 1227133513 (div main_~l~0 4294967296)) (* 1227133513 (div (+ main_~l~0 (* (- 7) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296))) 0) (<= 1 main_~l~0))} is VALID [2022-04-14 14:34:25,585 INFO L290 TraceCheckUtils]: 17: Hoare triple {1126#(and (<= (+ (* 2 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* 1227133513 (div main_~l~0 4294967296)) (* 1227133513 (div (+ main_~l~0 (* (- 7) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296))) 0) (<= 1 main_~l~0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {1126#(and (<= (+ (* 2 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* 1227133513 (div main_~l~0 4294967296)) (* 1227133513 (div (+ main_~l~0 (* (- 7) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296))) 0) (<= 1 main_~l~0))} is VALID [2022-04-14 14:34:25,590 INFO L290 TraceCheckUtils]: 18: Hoare triple {1126#(and (<= (+ (* 2 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* 1227133513 (div main_~l~0 4294967296)) (* 1227133513 (div (+ main_~l~0 (* (- 7) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296))) 0) (<= 1 main_~l~0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296;~v1~0 := 1 + ~v1~0; {1121#false} is VALID [2022-04-14 14:34:25,591 INFO L290 TraceCheckUtils]: 19: Hoare triple {1121#false} ~l~0 := 1 + ~l~0; {1121#false} is VALID [2022-04-14 14:34:25,591 INFO L272 TraceCheckUtils]: 20: Hoare triple {1121#false} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0 + ~v6~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {1121#false} is VALID [2022-04-14 14:34:25,591 INFO L290 TraceCheckUtils]: 21: Hoare triple {1121#false} ~cond := #in~cond; {1121#false} is VALID [2022-04-14 14:34:25,591 INFO L290 TraceCheckUtils]: 22: Hoare triple {1121#false} assume 0 == ~cond; {1121#false} is VALID [2022-04-14 14:34:25,591 INFO L290 TraceCheckUtils]: 23: Hoare triple {1121#false} assume !false; {1121#false} is VALID [2022-04-14 14:34:25,592 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 14:34:25,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 14:34:25,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482875902] [2022-04-14 14:34:25,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482875902] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-14 14:34:25,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1258338988] [2022-04-14 14:34:25,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 14:34:25,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 14:34:25,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 14:34:25,594 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 14:34:25,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-14 14:34:25,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:34:25,629 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-14 14:34:25,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:34:25,640 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 14:34:26,188 INFO L272 TraceCheckUtils]: 0: Hoare triple {1120#true} call ULTIMATE.init(); {1120#true} is VALID [2022-04-14 14:34:26,189 INFO L290 TraceCheckUtils]: 1: Hoare triple {1120#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {1120#true} is VALID [2022-04-14 14:34:26,189 INFO L290 TraceCheckUtils]: 2: Hoare triple {1120#true} assume true; {1120#true} is VALID [2022-04-14 14:34:26,189 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1120#true} {1120#true} #91#return; {1120#true} is VALID [2022-04-14 14:34:26,189 INFO L272 TraceCheckUtils]: 4: Hoare triple {1120#true} call #t~ret5 := main(); {1120#true} is VALID [2022-04-14 14:34:26,189 INFO L290 TraceCheckUtils]: 5: Hoare triple {1120#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v1~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;~v5~0 := 0;~v6~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {1150#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v6~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:34:26,190 INFO L290 TraceCheckUtils]: 6: Hoare triple {1150#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v6~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {1150#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v6~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:34:26,190 INFO L290 TraceCheckUtils]: 7: Hoare triple {1150#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v6~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {1150#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v6~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:34:26,191 INFO L290 TraceCheckUtils]: 8: Hoare triple {1150#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v6~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 9 then ~l~0 % 4294967296 % 9 - 9 else ~l~0 % 4294967296 % 9) % 4294967296;~v6~0 := 1 + ~v6~0; {1160#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:34:26,191 INFO L290 TraceCheckUtils]: 9: Hoare triple {1160#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {1164#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:34:26,191 INFO L272 TraceCheckUtils]: 10: Hoare triple {1164#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0 + ~v6~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {1120#true} is VALID [2022-04-14 14:34:26,191 INFO L290 TraceCheckUtils]: 11: Hoare triple {1120#true} ~cond := #in~cond; {1120#true} is VALID [2022-04-14 14:34:26,192 INFO L290 TraceCheckUtils]: 12: Hoare triple {1120#true} assume !(0 == ~cond); {1120#true} is VALID [2022-04-14 14:34:26,192 INFO L290 TraceCheckUtils]: 13: Hoare triple {1120#true} assume true; {1120#true} is VALID [2022-04-14 14:34:26,192 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {1120#true} {1164#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} #89#return; {1164#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:34:26,193 INFO L290 TraceCheckUtils]: 15: Hoare triple {1164#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {1164#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:34:26,193 INFO L290 TraceCheckUtils]: 16: Hoare triple {1164#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 9 then ~l~0 % 4294967296 % 9 - 9 else ~l~0 % 4294967296 % 9) % 4294967296); {1164#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:34:26,194 INFO L290 TraceCheckUtils]: 17: Hoare triple {1164#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {1164#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:34:26,194 INFO L290 TraceCheckUtils]: 18: Hoare triple {1164#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296;~v1~0 := 1 + ~v1~0; {1192#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:34:26,195 INFO L290 TraceCheckUtils]: 19: Hoare triple {1192#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {1196#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:34:26,196 INFO L272 TraceCheckUtils]: 20: Hoare triple {1196#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0 + ~v6~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {1200#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 14:34:26,196 INFO L290 TraceCheckUtils]: 21: Hoare triple {1200#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1204#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 14:34:26,197 INFO L290 TraceCheckUtils]: 22: Hoare triple {1204#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1121#false} is VALID [2022-04-14 14:34:26,197 INFO L290 TraceCheckUtils]: 23: Hoare triple {1121#false} assume !false; {1121#false} is VALID [2022-04-14 14:34:26,197 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 14:34:26,197 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 14:34:26,436 INFO L290 TraceCheckUtils]: 23: Hoare triple {1121#false} assume !false; {1121#false} is VALID [2022-04-14 14:34:26,437 INFO L290 TraceCheckUtils]: 22: Hoare triple {1204#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1121#false} is VALID [2022-04-14 14:34:26,437 INFO L290 TraceCheckUtils]: 21: Hoare triple {1200#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1204#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 14:34:26,438 INFO L272 TraceCheckUtils]: 20: Hoare triple {1220#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0 + ~v6~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {1200#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 14:34:26,439 INFO L290 TraceCheckUtils]: 19: Hoare triple {1224#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} ~l~0 := 1 + ~l~0; {1220#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:34:26,466 INFO L290 TraceCheckUtils]: 18: Hoare triple {1220#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296;~v1~0 := 1 + ~v1~0; {1224#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:34:26,467 INFO L290 TraceCheckUtils]: 17: Hoare triple {1220#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {1220#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:34:26,468 INFO L290 TraceCheckUtils]: 16: Hoare triple {1220#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 9 then ~l~0 % 4294967296 % 9 - 9 else ~l~0 % 4294967296 % 9) % 4294967296); {1220#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:34:26,469 INFO L290 TraceCheckUtils]: 15: Hoare triple {1220#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {1220#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:34:26,471 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {1120#true} {1220#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} #89#return; {1220#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:34:26,471 INFO L290 TraceCheckUtils]: 13: Hoare triple {1120#true} assume true; {1120#true} is VALID [2022-04-14 14:34:26,471 INFO L290 TraceCheckUtils]: 12: Hoare triple {1120#true} assume !(0 == ~cond); {1120#true} is VALID [2022-04-14 14:34:26,471 INFO L290 TraceCheckUtils]: 11: Hoare triple {1120#true} ~cond := #in~cond; {1120#true} is VALID [2022-04-14 14:34:26,471 INFO L272 TraceCheckUtils]: 10: Hoare triple {1220#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0 + ~v6~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {1120#true} is VALID [2022-04-14 14:34:26,474 INFO L290 TraceCheckUtils]: 9: Hoare triple {1224#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} ~l~0 := 1 + ~l~0; {1220#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:34:28,580 WARN L290 TraceCheckUtils]: 8: Hoare triple {1220#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 9 then ~l~0 % 4294967296 % 9 - 9 else ~l~0 % 4294967296 % 9) % 4294967296;~v6~0 := 1 + ~v6~0; {1224#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is UNKNOWN [2022-04-14 14:34:28,583 INFO L290 TraceCheckUtils]: 7: Hoare triple {1220#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {1220#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:34:28,584 INFO L290 TraceCheckUtils]: 6: Hoare triple {1220#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {1220#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:34:28,586 INFO L290 TraceCheckUtils]: 5: Hoare triple {1120#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v1~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;~v5~0 := 0;~v6~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {1220#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:34:28,586 INFO L272 TraceCheckUtils]: 4: Hoare triple {1120#true} call #t~ret5 := main(); {1120#true} is VALID [2022-04-14 14:34:28,586 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1120#true} {1120#true} #91#return; {1120#true} is VALID [2022-04-14 14:34:28,586 INFO L290 TraceCheckUtils]: 2: Hoare triple {1120#true} assume true; {1120#true} is VALID [2022-04-14 14:34:28,586 INFO L290 TraceCheckUtils]: 1: Hoare triple {1120#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {1120#true} is VALID [2022-04-14 14:34:28,587 INFO L272 TraceCheckUtils]: 0: Hoare triple {1120#true} call ULTIMATE.init(); {1120#true} is VALID [2022-04-14 14:34:28,587 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-14 14:34:28,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1258338988] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-14 14:34:28,587 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-14 14:34:28,587 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5, 9] total 14 [2022-04-14 14:34:28,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87280389] [2022-04-14 14:34:28,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 14:34:28,588 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2022-04-14 14:34:28,588 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 14:34:28,588 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 14:34:32,845 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 20 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-14 14:34:32,845 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-14 14:34:32,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 14:34:32,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-14 14:34:32,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-04-14 14:34:32,846 INFO L87 Difference]: Start difference. First operand 35 states and 45 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 14:34:34,969 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:34:37,196 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:34:39,386 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:34:43,674 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:34:48,013 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:34:54,524 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:34:58,869 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:35:03,221 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:35:07,506 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:35:11,839 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:35:16,208 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:35:18,329 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:35:18,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:35:18,331 INFO L93 Difference]: Finished difference Result 47 states and 60 transitions. [2022-04-14 14:35:18,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-14 14:35:18,447 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2022-04-14 14:35:18,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 14:35:18,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 14:35:18,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 47 transitions. [2022-04-14 14:35:18,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 14:35:18,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 47 transitions. [2022-04-14 14:35:18,449 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 47 transitions. [2022-04-14 14:35:22,762 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 45 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-14 14:35:22,763 INFO L225 Difference]: With dead ends: 47 [2022-04-14 14:35:22,763 INFO L226 Difference]: Without dead ends: 45 [2022-04-14 14:35:22,763 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 41 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-04-14 14:35:22,764 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 5 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 12 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 12 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.4s IncrementalHoareTripleChecker+Time [2022-04-14 14:35:22,764 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 83 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 12 Unknown, 0 Unchecked, 24.4s Time] [2022-04-14 14:35:22,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-14 14:35:22,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 36. [2022-04-14 14:35:22,784 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 14:35:22,784 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 36 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 28 states have internal predecessors, (40), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-14 14:35:22,785 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 36 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 28 states have internal predecessors, (40), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-14 14:35:22,785 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 36 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 28 states have internal predecessors, (40), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-14 14:35:22,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:35:22,786 INFO L93 Difference]: Finished difference Result 45 states and 58 transitions. [2022-04-14 14:35:22,786 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 58 transitions. [2022-04-14 14:35:22,786 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:35:22,786 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:35:22,787 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 28 states have internal predecessors, (40), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 45 states. [2022-04-14 14:35:22,787 INFO L87 Difference]: Start difference. First operand has 36 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 28 states have internal predecessors, (40), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 45 states. [2022-04-14 14:35:22,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:35:22,788 INFO L93 Difference]: Finished difference Result 45 states and 58 transitions. [2022-04-14 14:35:22,788 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 58 transitions. [2022-04-14 14:35:22,788 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:35:22,788 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:35:22,788 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 14:35:22,788 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 14:35:22,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 28 states have internal predecessors, (40), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-14 14:35:22,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 47 transitions. [2022-04-14 14:35:22,789 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 47 transitions. Word has length 24 [2022-04-14 14:35:22,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 14:35:22,790 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 47 transitions. [2022-04-14 14:35:22,790 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 14:35:22,790 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 47 transitions. [2022-04-14 14:35:22,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-14 14:35:22,790 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 14:35:22,790 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 14:35:22,806 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-14 14:35:23,002 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 14:35:23,002 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 14:35:23,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 14:35:23,003 INFO L85 PathProgramCache]: Analyzing trace with hash 1601513212, now seen corresponding path program 1 times [2022-04-14 14:35:23,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 14:35:23,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517116977] [2022-04-14 14:35:23,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 14:35:23,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 14:35:23,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:35:23,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 14:35:23,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:35:23,264 INFO L290 TraceCheckUtils]: 0: Hoare triple {1498#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {1499#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-14 14:35:23,265 INFO L290 TraceCheckUtils]: 1: Hoare triple {1499#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} assume true; {1499#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-14 14:35:23,265 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1499#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {1484#true} #91#return; {1489#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-14 14:35:23,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-04-14 14:35:23,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:35:23,270 INFO L290 TraceCheckUtils]: 0: Hoare triple {1484#true} ~cond := #in~cond; {1484#true} is VALID [2022-04-14 14:35:23,270 INFO L290 TraceCheckUtils]: 1: Hoare triple {1484#true} assume !(0 == ~cond); {1484#true} is VALID [2022-04-14 14:35:23,270 INFO L290 TraceCheckUtils]: 2: Hoare triple {1484#true} assume true; {1484#true} is VALID [2022-04-14 14:35:23,271 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1484#true} {1492#(and (or (<= (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296) 4274967296) (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296))) (<= 1 (+ (* 2 (div main_~l~0 4294967296)) main_~l~0))) (<= (+ (* 715827883 (div main_~l~0 4294967296)) (* 715827883 (div (+ main_~l~0 (* (- 6) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) 0))} #89#return; {1492#(and (or (<= (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296) 4274967296) (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296))) (<= 1 (+ (* 2 (div main_~l~0 4294967296)) main_~l~0))) (<= (+ (* 715827883 (div main_~l~0 4294967296)) (* 715827883 (div (+ main_~l~0 (* (- 6) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) 0))} is VALID [2022-04-14 14:35:23,272 INFO L272 TraceCheckUtils]: 0: Hoare triple {1484#true} call ULTIMATE.init(); {1498#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 14:35:23,272 INFO L290 TraceCheckUtils]: 1: Hoare triple {1498#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {1499#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-14 14:35:23,272 INFO L290 TraceCheckUtils]: 2: Hoare triple {1499#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} assume true; {1499#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-14 14:35:23,273 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1499#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {1484#true} #91#return; {1489#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-14 14:35:23,273 INFO L272 TraceCheckUtils]: 4: Hoare triple {1489#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} call #t~ret5 := main(); {1489#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-14 14:35:23,274 INFO L290 TraceCheckUtils]: 5: Hoare triple {1489#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v1~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;~v5~0 := 0;~v6~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {1490#(and (<= ~SIZE~0 20000001) (= main_~l~0 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-14 14:35:23,275 INFO L290 TraceCheckUtils]: 6: Hoare triple {1490#(and (<= ~SIZE~0 20000001) (= main_~l~0 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {1491#(and (= main_~l~0 0) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-14 14:35:23,275 INFO L290 TraceCheckUtils]: 7: Hoare triple {1491#(and (= main_~l~0 0) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {1491#(and (= main_~l~0 0) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-14 14:35:23,275 INFO L290 TraceCheckUtils]: 8: Hoare triple {1491#(and (= main_~l~0 0) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 9 then ~l~0 % 4294967296 % 9 - 9 else ~l~0 % 4294967296 % 9) % 4294967296;~v6~0 := 1 + ~v6~0; {1491#(and (= main_~l~0 0) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-14 14:35:23,276 INFO L290 TraceCheckUtils]: 9: Hoare triple {1491#(and (= main_~l~0 0) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))))} ~l~0 := 1 + ~l~0; {1492#(and (or (<= (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296) 4274967296) (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296))) (<= 1 (+ (* 2 (div main_~l~0 4294967296)) main_~l~0))) (<= (+ (* 715827883 (div main_~l~0 4294967296)) (* 715827883 (div (+ main_~l~0 (* (- 6) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) 0))} is VALID [2022-04-14 14:35:23,276 INFO L272 TraceCheckUtils]: 10: Hoare triple {1492#(and (or (<= (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296) 4274967296) (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296))) (<= 1 (+ (* 2 (div main_~l~0 4294967296)) main_~l~0))) (<= (+ (* 715827883 (div main_~l~0 4294967296)) (* 715827883 (div (+ main_~l~0 (* (- 6) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0 + ~v6~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {1484#true} is VALID [2022-04-14 14:35:23,276 INFO L290 TraceCheckUtils]: 11: Hoare triple {1484#true} ~cond := #in~cond; {1484#true} is VALID [2022-04-14 14:35:23,276 INFO L290 TraceCheckUtils]: 12: Hoare triple {1484#true} assume !(0 == ~cond); {1484#true} is VALID [2022-04-14 14:35:23,276 INFO L290 TraceCheckUtils]: 13: Hoare triple {1484#true} assume true; {1484#true} is VALID [2022-04-14 14:35:23,277 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {1484#true} {1492#(and (or (<= (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296) 4274967296) (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296))) (<= 1 (+ (* 2 (div main_~l~0 4294967296)) main_~l~0))) (<= (+ (* 715827883 (div main_~l~0 4294967296)) (* 715827883 (div (+ main_~l~0 (* (- 6) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) 0))} #89#return; {1492#(and (or (<= (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296) 4274967296) (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296))) (<= 1 (+ (* 2 (div main_~l~0 4294967296)) main_~l~0))) (<= (+ (* 715827883 (div main_~l~0 4294967296)) (* 715827883 (div (+ main_~l~0 (* (- 6) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) 0))} is VALID [2022-04-14 14:35:23,278 INFO L290 TraceCheckUtils]: 15: Hoare triple {1492#(and (or (<= (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296) 4274967296) (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296))) (<= 1 (+ (* 2 (div main_~l~0 4294967296)) main_~l~0))) (<= (+ (* 715827883 (div main_~l~0 4294967296)) (* 715827883 (div (+ main_~l~0 (* (- 6) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {1497#(and (<= (+ (* 715827883 (div main_~l~0 4294967296)) (* 715827883 (div (+ main_~l~0 (* (- 6) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) 0) (<= 1 (+ (* 2 (div main_~l~0 4294967296)) main_~l~0)))} is VALID [2022-04-14 14:35:23,279 INFO L290 TraceCheckUtils]: 16: Hoare triple {1497#(and (<= (+ (* 715827883 (div main_~l~0 4294967296)) (* 715827883 (div (+ main_~l~0 (* (- 6) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) 0) (<= 1 (+ (* 2 (div main_~l~0 4294967296)) main_~l~0)))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 9 then ~l~0 % 4294967296 % 9 - 9 else ~l~0 % 4294967296 % 9) % 4294967296); {1497#(and (<= (+ (* 715827883 (div main_~l~0 4294967296)) (* 715827883 (div (+ main_~l~0 (* (- 6) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) 0) (<= 1 (+ (* 2 (div main_~l~0 4294967296)) main_~l~0)))} is VALID [2022-04-14 14:35:23,279 INFO L290 TraceCheckUtils]: 17: Hoare triple {1497#(and (<= (+ (* 715827883 (div main_~l~0 4294967296)) (* 715827883 (div (+ main_~l~0 (* (- 6) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) 0) (<= 1 (+ (* 2 (div main_~l~0 4294967296)) main_~l~0)))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {1497#(and (<= (+ (* 715827883 (div main_~l~0 4294967296)) (* 715827883 (div (+ main_~l~0 (* (- 6) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) 0) (<= 1 (+ (* 2 (div main_~l~0 4294967296)) main_~l~0)))} is VALID [2022-04-14 14:35:23,280 INFO L290 TraceCheckUtils]: 18: Hoare triple {1497#(and (<= (+ (* 715827883 (div main_~l~0 4294967296)) (* 715827883 (div (+ main_~l~0 (* (- 6) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) 0) (<= 1 (+ (* 2 (div main_~l~0 4294967296)) main_~l~0)))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296); {1497#(and (<= (+ (* 715827883 (div main_~l~0 4294967296)) (* 715827883 (div (+ main_~l~0 (* (- 6) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) 0) (<= 1 (+ (* 2 (div main_~l~0 4294967296)) main_~l~0)))} is VALID [2022-04-14 14:35:23,281 INFO L290 TraceCheckUtils]: 19: Hoare triple {1497#(and (<= (+ (* 715827883 (div main_~l~0 4294967296)) (* 715827883 (div (+ main_~l~0 (* (- 6) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) 0) (<= 1 (+ (* 2 (div main_~l~0 4294967296)) main_~l~0)))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296;~v2~0 := 1 + ~v2~0; {1485#false} is VALID [2022-04-14 14:35:23,282 INFO L290 TraceCheckUtils]: 20: Hoare triple {1485#false} ~l~0 := 1 + ~l~0; {1485#false} is VALID [2022-04-14 14:35:23,282 INFO L272 TraceCheckUtils]: 21: Hoare triple {1485#false} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0 + ~v6~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {1485#false} is VALID [2022-04-14 14:35:23,282 INFO L290 TraceCheckUtils]: 22: Hoare triple {1485#false} ~cond := #in~cond; {1485#false} is VALID [2022-04-14 14:35:23,282 INFO L290 TraceCheckUtils]: 23: Hoare triple {1485#false} assume 0 == ~cond; {1485#false} is VALID [2022-04-14 14:35:23,282 INFO L290 TraceCheckUtils]: 24: Hoare triple {1485#false} assume !false; {1485#false} is VALID [2022-04-14 14:35:23,282 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 14:35:23,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 14:35:23,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517116977] [2022-04-14 14:35:23,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517116977] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-14 14:35:23,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1375822927] [2022-04-14 14:35:23,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 14:35:23,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 14:35:23,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 14:35:23,283 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 14:35:23,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-14 14:35:23,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:35:23,317 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-14 14:35:23,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:35:23,324 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 14:35:23,874 INFO L272 TraceCheckUtils]: 0: Hoare triple {1484#true} call ULTIMATE.init(); {1484#true} is VALID [2022-04-14 14:35:23,874 INFO L290 TraceCheckUtils]: 1: Hoare triple {1484#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {1484#true} is VALID [2022-04-14 14:35:23,875 INFO L290 TraceCheckUtils]: 2: Hoare triple {1484#true} assume true; {1484#true} is VALID [2022-04-14 14:35:23,875 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1484#true} {1484#true} #91#return; {1484#true} is VALID [2022-04-14 14:35:23,875 INFO L272 TraceCheckUtils]: 4: Hoare triple {1484#true} call #t~ret5 := main(); {1484#true} is VALID [2022-04-14 14:35:23,875 INFO L290 TraceCheckUtils]: 5: Hoare triple {1484#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v1~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;~v5~0 := 0;~v6~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {1518#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v6~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:35:23,876 INFO L290 TraceCheckUtils]: 6: Hoare triple {1518#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v6~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {1518#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v6~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:35:23,876 INFO L290 TraceCheckUtils]: 7: Hoare triple {1518#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v6~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {1518#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v6~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:35:23,876 INFO L290 TraceCheckUtils]: 8: Hoare triple {1518#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v6~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 9 then ~l~0 % 4294967296 % 9 - 9 else ~l~0 % 4294967296 % 9) % 4294967296;~v6~0 := 1 + ~v6~0; {1528#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:35:23,877 INFO L290 TraceCheckUtils]: 9: Hoare triple {1528#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {1532#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:35:23,877 INFO L272 TraceCheckUtils]: 10: Hoare triple {1532#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0 + ~v6~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {1484#true} is VALID [2022-04-14 14:35:23,877 INFO L290 TraceCheckUtils]: 11: Hoare triple {1484#true} ~cond := #in~cond; {1484#true} is VALID [2022-04-14 14:35:23,877 INFO L290 TraceCheckUtils]: 12: Hoare triple {1484#true} assume !(0 == ~cond); {1484#true} is VALID [2022-04-14 14:35:23,877 INFO L290 TraceCheckUtils]: 13: Hoare triple {1484#true} assume true; {1484#true} is VALID [2022-04-14 14:35:23,884 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {1484#true} {1532#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} #89#return; {1532#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:35:23,884 INFO L290 TraceCheckUtils]: 15: Hoare triple {1532#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {1532#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:35:23,885 INFO L290 TraceCheckUtils]: 16: Hoare triple {1532#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 9 then ~l~0 % 4294967296 % 9 - 9 else ~l~0 % 4294967296 % 9) % 4294967296); {1532#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:35:23,886 INFO L290 TraceCheckUtils]: 17: Hoare triple {1532#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {1532#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:35:23,886 INFO L290 TraceCheckUtils]: 18: Hoare triple {1532#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296); {1532#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:35:23,887 INFO L290 TraceCheckUtils]: 19: Hoare triple {1532#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296;~v2~0 := 1 + ~v2~0; {1563#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:35:23,887 INFO L290 TraceCheckUtils]: 20: Hoare triple {1563#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {1567#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:35:23,888 INFO L272 TraceCheckUtils]: 21: Hoare triple {1567#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0 + ~v6~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {1571#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 14:35:23,888 INFO L290 TraceCheckUtils]: 22: Hoare triple {1571#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1575#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 14:35:23,889 INFO L290 TraceCheckUtils]: 23: Hoare triple {1575#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1485#false} is VALID [2022-04-14 14:35:23,889 INFO L290 TraceCheckUtils]: 24: Hoare triple {1485#false} assume !false; {1485#false} is VALID [2022-04-14 14:35:23,889 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 14:35:23,889 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 14:35:24,151 INFO L290 TraceCheckUtils]: 24: Hoare triple {1485#false} assume !false; {1485#false} is VALID [2022-04-14 14:35:24,151 INFO L290 TraceCheckUtils]: 23: Hoare triple {1575#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1485#false} is VALID [2022-04-14 14:35:24,152 INFO L290 TraceCheckUtils]: 22: Hoare triple {1571#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1575#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 14:35:24,153 INFO L272 TraceCheckUtils]: 21: Hoare triple {1591#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0 + ~v6~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {1571#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 14:35:24,154 INFO L290 TraceCheckUtils]: 20: Hoare triple {1595#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} ~l~0 := 1 + ~l~0; {1591#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:35:26,265 WARN L290 TraceCheckUtils]: 19: Hoare triple {1591#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296;~v2~0 := 1 + ~v2~0; {1595#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is UNKNOWN [2022-04-14 14:35:26,266 INFO L290 TraceCheckUtils]: 18: Hoare triple {1591#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296); {1591#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:35:26,266 INFO L290 TraceCheckUtils]: 17: Hoare triple {1591#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {1591#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:35:26,267 INFO L290 TraceCheckUtils]: 16: Hoare triple {1591#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 9 then ~l~0 % 4294967296 % 9 - 9 else ~l~0 % 4294967296 % 9) % 4294967296); {1591#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:35:26,267 INFO L290 TraceCheckUtils]: 15: Hoare triple {1591#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {1591#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:35:26,268 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {1484#true} {1591#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} #89#return; {1591#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:35:26,268 INFO L290 TraceCheckUtils]: 13: Hoare triple {1484#true} assume true; {1484#true} is VALID [2022-04-14 14:35:26,268 INFO L290 TraceCheckUtils]: 12: Hoare triple {1484#true} assume !(0 == ~cond); {1484#true} is VALID [2022-04-14 14:35:26,268 INFO L290 TraceCheckUtils]: 11: Hoare triple {1484#true} ~cond := #in~cond; {1484#true} is VALID [2022-04-14 14:35:26,268 INFO L272 TraceCheckUtils]: 10: Hoare triple {1591#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0 + ~v6~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {1484#true} is VALID [2022-04-14 14:35:26,271 INFO L290 TraceCheckUtils]: 9: Hoare triple {1595#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} ~l~0 := 1 + ~l~0; {1591#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:35:28,381 WARN L290 TraceCheckUtils]: 8: Hoare triple {1591#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 9 then ~l~0 % 4294967296 % 9 - 9 else ~l~0 % 4294967296 % 9) % 4294967296;~v6~0 := 1 + ~v6~0; {1595#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is UNKNOWN [2022-04-14 14:35:28,381 INFO L290 TraceCheckUtils]: 7: Hoare triple {1591#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {1591#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:35:28,382 INFO L290 TraceCheckUtils]: 6: Hoare triple {1591#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {1591#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:35:28,384 INFO L290 TraceCheckUtils]: 5: Hoare triple {1484#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v1~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;~v5~0 := 0;~v6~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {1591#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:35:28,384 INFO L272 TraceCheckUtils]: 4: Hoare triple {1484#true} call #t~ret5 := main(); {1484#true} is VALID [2022-04-14 14:35:28,384 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1484#true} {1484#true} #91#return; {1484#true} is VALID [2022-04-14 14:35:28,384 INFO L290 TraceCheckUtils]: 2: Hoare triple {1484#true} assume true; {1484#true} is VALID [2022-04-14 14:35:28,384 INFO L290 TraceCheckUtils]: 1: Hoare triple {1484#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {1484#true} is VALID [2022-04-14 14:35:28,384 INFO L272 TraceCheckUtils]: 0: Hoare triple {1484#true} call ULTIMATE.init(); {1484#true} is VALID [2022-04-14 14:35:28,384 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-14 14:35:28,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1375822927] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-14 14:35:28,384 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-14 14:35:28,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9, 9] total 18 [2022-04-14 14:35:28,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51163477] [2022-04-14 14:35:28,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 14:35:28,385 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2022-04-14 14:35:28,385 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 14:35:28,385 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 14:35:30,527 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 22 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-14 14:35:30,527 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-14 14:35:30,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 14:35:30,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-14 14:35:30,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2022-04-14 14:35:30,528 INFO L87 Difference]: Start difference. First operand 36 states and 47 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 14:35:32,635 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:35:34,868 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:35:36,974 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:35:39,085 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:35:41,197 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:35:43,302 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:35:45,482 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:35:49,813 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:35:54,142 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:36:02,780 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:36:07,117 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:36:11,481 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:36:13,603 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:36:13,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:36:13,605 INFO L93 Difference]: Finished difference Result 59 states and 77 transitions. [2022-04-14 14:36:13,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-14 14:36:13,712 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2022-04-14 14:36:13,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 14:36:13,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 14:36:13,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 49 transitions. [2022-04-14 14:36:13,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 14:36:13,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 49 transitions. [2022-04-14 14:36:13,714 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 49 transitions. [2022-04-14 14:36:17,987 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 47 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-14 14:36:17,988 INFO L225 Difference]: With dead ends: 59 [2022-04-14 14:36:17,988 INFO L226 Difference]: Without dead ends: 57 [2022-04-14 14:36:17,989 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 42 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2022-04-14 14:36:17,989 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 5 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 1 mSolverCounterUnsat, 13 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 13 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 27.0s IncrementalHoareTripleChecker+Time [2022-04-14 14:36:17,989 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 77 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 60 Invalid, 13 Unknown, 0 Unchecked, 27.0s Time] [2022-04-14 14:36:17,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-04-14 14:36:18,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2022-04-14 14:36:18,021 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 14:36:18,021 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand has 57 states, 45 states have (on average 1.4222222222222223) internal successors, (64), 45 states have internal predecessors, (64), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-14 14:36:18,022 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand has 57 states, 45 states have (on average 1.4222222222222223) internal successors, (64), 45 states have internal predecessors, (64), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-14 14:36:18,022 INFO L87 Difference]: Start difference. First operand 57 states. Second operand has 57 states, 45 states have (on average 1.4222222222222223) internal successors, (64), 45 states have internal predecessors, (64), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-14 14:36:18,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:36:18,023 INFO L93 Difference]: Finished difference Result 57 states and 75 transitions. [2022-04-14 14:36:18,023 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 75 transitions. [2022-04-14 14:36:18,023 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:36:18,024 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:36:18,024 INFO L74 IsIncluded]: Start isIncluded. First operand has 57 states, 45 states have (on average 1.4222222222222223) internal successors, (64), 45 states have internal predecessors, (64), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 57 states. [2022-04-14 14:36:18,024 INFO L87 Difference]: Start difference. First operand has 57 states, 45 states have (on average 1.4222222222222223) internal successors, (64), 45 states have internal predecessors, (64), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 57 states. [2022-04-14 14:36:18,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:36:18,025 INFO L93 Difference]: Finished difference Result 57 states and 75 transitions. [2022-04-14 14:36:18,025 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 75 transitions. [2022-04-14 14:36:18,025 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:36:18,026 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:36:18,026 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 14:36:18,026 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 14:36:18,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 45 states have (on average 1.4222222222222223) internal successors, (64), 45 states have internal predecessors, (64), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-14 14:36:18,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 75 transitions. [2022-04-14 14:36:18,027 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 75 transitions. Word has length 25 [2022-04-14 14:36:18,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 14:36:18,027 INFO L478 AbstractCegarLoop]: Abstraction has 57 states and 75 transitions. [2022-04-14 14:36:18,027 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 14:36:18,027 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 75 transitions. [2022-04-14 14:36:18,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-14 14:36:18,028 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 14:36:18,028 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 14:36:18,044 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-14 14:36:18,228 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 14:36:18,228 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 14:36:18,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 14:36:18,229 INFO L85 PathProgramCache]: Analyzing trace with hash -682560632, now seen corresponding path program 1 times [2022-04-14 14:36:18,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 14:36:18,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551864624] [2022-04-14 14:36:18,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 14:36:18,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 14:36:18,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:36:18,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 14:36:18,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:36:18,472 INFO L290 TraceCheckUtils]: 0: Hoare triple {1938#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {1939#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-14 14:36:18,472 INFO L290 TraceCheckUtils]: 1: Hoare triple {1939#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} assume true; {1939#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-14 14:36:18,473 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1939#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {1924#true} #91#return; {1929#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-14 14:36:18,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-04-14 14:36:18,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:36:18,477 INFO L290 TraceCheckUtils]: 0: Hoare triple {1924#true} ~cond := #in~cond; {1924#true} is VALID [2022-04-14 14:36:18,478 INFO L290 TraceCheckUtils]: 1: Hoare triple {1924#true} assume !(0 == ~cond); {1924#true} is VALID [2022-04-14 14:36:18,478 INFO L290 TraceCheckUtils]: 2: Hoare triple {1924#true} assume true; {1924#true} is VALID [2022-04-14 14:36:18,478 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1924#true} {1932#(and (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (* (div main_~l~0 4294967296) 858993460)) 0) (or (<= 1 (+ (* (div main_~l~0 4294967296) 4) main_~l~0)) (<= (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296) 4274967296) (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296)))))} #89#return; {1932#(and (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (* (div main_~l~0 4294967296) 858993460)) 0) (or (<= 1 (+ (* (div main_~l~0 4294967296) 4) main_~l~0)) (<= (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296) 4274967296) (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296)))))} is VALID [2022-04-14 14:36:18,479 INFO L272 TraceCheckUtils]: 0: Hoare triple {1924#true} call ULTIMATE.init(); {1938#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 14:36:18,479 INFO L290 TraceCheckUtils]: 1: Hoare triple {1938#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {1939#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-14 14:36:18,480 INFO L290 TraceCheckUtils]: 2: Hoare triple {1939#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} assume true; {1939#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-14 14:36:18,480 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1939#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {1924#true} #91#return; {1929#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-14 14:36:18,481 INFO L272 TraceCheckUtils]: 4: Hoare triple {1929#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} call #t~ret5 := main(); {1929#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-14 14:36:18,481 INFO L290 TraceCheckUtils]: 5: Hoare triple {1929#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v1~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;~v5~0 := 0;~v6~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {1930#(and (<= ~SIZE~0 20000001) (= main_~l~0 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-14 14:36:18,482 INFO L290 TraceCheckUtils]: 6: Hoare triple {1930#(and (<= ~SIZE~0 20000001) (= main_~l~0 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {1931#(and (= main_~l~0 0) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-14 14:36:18,482 INFO L290 TraceCheckUtils]: 7: Hoare triple {1931#(and (= main_~l~0 0) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {1931#(and (= main_~l~0 0) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-14 14:36:18,483 INFO L290 TraceCheckUtils]: 8: Hoare triple {1931#(and (= main_~l~0 0) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 9 then ~l~0 % 4294967296 % 9 - 9 else ~l~0 % 4294967296 % 9) % 4294967296;~v6~0 := 1 + ~v6~0; {1931#(and (= main_~l~0 0) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-14 14:36:18,483 INFO L290 TraceCheckUtils]: 9: Hoare triple {1931#(and (= main_~l~0 0) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))))} ~l~0 := 1 + ~l~0; {1932#(and (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (* (div main_~l~0 4294967296) 858993460)) 0) (or (<= 1 (+ (* (div main_~l~0 4294967296) 4) main_~l~0)) (<= (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296) 4274967296) (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296)))))} is VALID [2022-04-14 14:36:18,483 INFO L272 TraceCheckUtils]: 10: Hoare triple {1932#(and (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (* (div main_~l~0 4294967296) 858993460)) 0) (or (<= 1 (+ (* (div main_~l~0 4294967296) 4) main_~l~0)) (<= (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296) 4274967296) (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296)))))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0 + ~v6~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {1924#true} is VALID [2022-04-14 14:36:18,484 INFO L290 TraceCheckUtils]: 11: Hoare triple {1924#true} ~cond := #in~cond; {1924#true} is VALID [2022-04-14 14:36:18,484 INFO L290 TraceCheckUtils]: 12: Hoare triple {1924#true} assume !(0 == ~cond); {1924#true} is VALID [2022-04-14 14:36:18,484 INFO L290 TraceCheckUtils]: 13: Hoare triple {1924#true} assume true; {1924#true} is VALID [2022-04-14 14:36:18,484 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {1924#true} {1932#(and (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (* (div main_~l~0 4294967296) 858993460)) 0) (or (<= 1 (+ (* (div main_~l~0 4294967296) 4) main_~l~0)) (<= (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296) 4274967296) (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296)))))} #89#return; {1932#(and (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (* (div main_~l~0 4294967296) 858993460)) 0) (or (<= 1 (+ (* (div main_~l~0 4294967296) 4) main_~l~0)) (<= (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296) 4274967296) (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296)))))} is VALID [2022-04-14 14:36:18,486 INFO L290 TraceCheckUtils]: 15: Hoare triple {1932#(and (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (* (div main_~l~0 4294967296) 858993460)) 0) (or (<= 1 (+ (* (div main_~l~0 4294967296) 4) main_~l~0)) (<= (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296) 4274967296) (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296)))))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {1937#(and (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (* (div main_~l~0 4294967296) 858993460)) 0) (<= 1 (+ (* (div main_~l~0 4294967296) 4) main_~l~0)))} is VALID [2022-04-14 14:36:18,486 INFO L290 TraceCheckUtils]: 16: Hoare triple {1937#(and (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (* (div main_~l~0 4294967296) 858993460)) 0) (<= 1 (+ (* (div main_~l~0 4294967296) 4) main_~l~0)))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 9 then ~l~0 % 4294967296 % 9 - 9 else ~l~0 % 4294967296 % 9) % 4294967296); {1937#(and (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (* (div main_~l~0 4294967296) 858993460)) 0) (<= 1 (+ (* (div main_~l~0 4294967296) 4) main_~l~0)))} is VALID [2022-04-14 14:36:18,487 INFO L290 TraceCheckUtils]: 17: Hoare triple {1937#(and (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (* (div main_~l~0 4294967296) 858993460)) 0) (<= 1 (+ (* (div main_~l~0 4294967296) 4) main_~l~0)))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {1937#(and (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (* (div main_~l~0 4294967296) 858993460)) 0) (<= 1 (+ (* (div main_~l~0 4294967296) 4) main_~l~0)))} is VALID [2022-04-14 14:36:18,487 INFO L290 TraceCheckUtils]: 18: Hoare triple {1937#(and (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (* (div main_~l~0 4294967296) 858993460)) 0) (<= 1 (+ (* (div main_~l~0 4294967296) 4) main_~l~0)))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296); {1937#(and (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (* (div main_~l~0 4294967296) 858993460)) 0) (<= 1 (+ (* (div main_~l~0 4294967296) 4) main_~l~0)))} is VALID [2022-04-14 14:36:18,488 INFO L290 TraceCheckUtils]: 19: Hoare triple {1937#(and (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (* (div main_~l~0 4294967296) 858993460)) 0) (<= 1 (+ (* (div main_~l~0 4294967296) 4) main_~l~0)))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {1937#(and (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (* (div main_~l~0 4294967296) 858993460)) 0) (<= 1 (+ (* (div main_~l~0 4294967296) 4) main_~l~0)))} is VALID [2022-04-14 14:36:18,489 INFO L290 TraceCheckUtils]: 20: Hoare triple {1937#(and (<= (+ (* (div (+ main_~l~0 (* (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (- 5)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 858993459) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 5) (* (div main_~l~0 4294967296) 858993460)) 0) (<= 1 (+ (* (div main_~l~0 4294967296) 4) main_~l~0)))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296;~v3~0 := 1 + ~v3~0; {1925#false} is VALID [2022-04-14 14:36:18,490 INFO L290 TraceCheckUtils]: 21: Hoare triple {1925#false} ~l~0 := 1 + ~l~0; {1925#false} is VALID [2022-04-14 14:36:18,490 INFO L272 TraceCheckUtils]: 22: Hoare triple {1925#false} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0 + ~v6~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {1925#false} is VALID [2022-04-14 14:36:18,490 INFO L290 TraceCheckUtils]: 23: Hoare triple {1925#false} ~cond := #in~cond; {1925#false} is VALID [2022-04-14 14:36:18,490 INFO L290 TraceCheckUtils]: 24: Hoare triple {1925#false} assume 0 == ~cond; {1925#false} is VALID [2022-04-14 14:36:18,490 INFO L290 TraceCheckUtils]: 25: Hoare triple {1925#false} assume !false; {1925#false} is VALID [2022-04-14 14:36:18,490 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 14:36:18,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 14:36:18,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551864624] [2022-04-14 14:36:18,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551864624] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-14 14:36:18,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1958069948] [2022-04-14 14:36:18,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 14:36:18,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 14:36:18,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 14:36:18,495 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 14:36:18,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-14 14:36:18,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:36:18,527 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-14 14:36:18,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:36:18,536 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 14:36:19,089 INFO L272 TraceCheckUtils]: 0: Hoare triple {1924#true} call ULTIMATE.init(); {1924#true} is VALID [2022-04-14 14:36:19,090 INFO L290 TraceCheckUtils]: 1: Hoare triple {1924#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {1924#true} is VALID [2022-04-14 14:36:19,090 INFO L290 TraceCheckUtils]: 2: Hoare triple {1924#true} assume true; {1924#true} is VALID [2022-04-14 14:36:19,090 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1924#true} {1924#true} #91#return; {1924#true} is VALID [2022-04-14 14:36:19,090 INFO L272 TraceCheckUtils]: 4: Hoare triple {1924#true} call #t~ret5 := main(); {1924#true} is VALID [2022-04-14 14:36:19,091 INFO L290 TraceCheckUtils]: 5: Hoare triple {1924#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v1~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;~v5~0 := 0;~v6~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {1958#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v6~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:36:19,092 INFO L290 TraceCheckUtils]: 6: Hoare triple {1958#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v6~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {1958#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v6~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:36:19,092 INFO L290 TraceCheckUtils]: 7: Hoare triple {1958#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v6~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {1958#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v6~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:36:19,093 INFO L290 TraceCheckUtils]: 8: Hoare triple {1958#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v6~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 9 then ~l~0 % 4294967296 % 9 - 9 else ~l~0 % 4294967296 % 9) % 4294967296;~v6~0 := 1 + ~v6~0; {1968#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:36:19,093 INFO L290 TraceCheckUtils]: 9: Hoare triple {1968#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {1972#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:36:19,093 INFO L272 TraceCheckUtils]: 10: Hoare triple {1972#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0 + ~v6~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {1924#true} is VALID [2022-04-14 14:36:19,093 INFO L290 TraceCheckUtils]: 11: Hoare triple {1924#true} ~cond := #in~cond; {1924#true} is VALID [2022-04-14 14:36:19,093 INFO L290 TraceCheckUtils]: 12: Hoare triple {1924#true} assume !(0 == ~cond); {1924#true} is VALID [2022-04-14 14:36:19,093 INFO L290 TraceCheckUtils]: 13: Hoare triple {1924#true} assume true; {1924#true} is VALID [2022-04-14 14:36:19,094 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {1924#true} {1972#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} #89#return; {1972#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:36:19,094 INFO L290 TraceCheckUtils]: 15: Hoare triple {1972#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {1972#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:36:19,095 INFO L290 TraceCheckUtils]: 16: Hoare triple {1972#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 9 then ~l~0 % 4294967296 % 9 - 9 else ~l~0 % 4294967296 % 9) % 4294967296); {1972#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:36:19,095 INFO L290 TraceCheckUtils]: 17: Hoare triple {1972#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {1972#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:36:19,096 INFO L290 TraceCheckUtils]: 18: Hoare triple {1972#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296); {1972#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:36:19,096 INFO L290 TraceCheckUtils]: 19: Hoare triple {1972#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {1972#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:36:19,097 INFO L290 TraceCheckUtils]: 20: Hoare triple {1972#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296;~v3~0 := 1 + ~v3~0; {2006#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0))} is VALID [2022-04-14 14:36:19,097 INFO L290 TraceCheckUtils]: 21: Hoare triple {2006#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0))} ~l~0 := 1 + ~l~0; {2010#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1) (= main_~v1~0 0))} is VALID [2022-04-14 14:36:19,098 INFO L272 TraceCheckUtils]: 22: Hoare triple {2010#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1) (= main_~v1~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0 + ~v6~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {2014#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 14:36:19,098 INFO L290 TraceCheckUtils]: 23: Hoare triple {2014#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2018#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 14:36:19,098 INFO L290 TraceCheckUtils]: 24: Hoare triple {2018#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1925#false} is VALID [2022-04-14 14:36:19,099 INFO L290 TraceCheckUtils]: 25: Hoare triple {1925#false} assume !false; {1925#false} is VALID [2022-04-14 14:36:19,099 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 14:36:19,099 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 14:36:19,344 INFO L290 TraceCheckUtils]: 25: Hoare triple {1925#false} assume !false; {1925#false} is VALID [2022-04-14 14:36:19,345 INFO L290 TraceCheckUtils]: 24: Hoare triple {2018#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1925#false} is VALID [2022-04-14 14:36:19,345 INFO L290 TraceCheckUtils]: 23: Hoare triple {2014#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2018#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 14:36:19,346 INFO L272 TraceCheckUtils]: 22: Hoare triple {2034#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0 + ~v6~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {2014#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 14:36:19,347 INFO L290 TraceCheckUtils]: 21: Hoare triple {2038#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} ~l~0 := 1 + ~l~0; {2034#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:36:21,450 WARN L290 TraceCheckUtils]: 20: Hoare triple {2034#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296;~v3~0 := 1 + ~v3~0; {2038#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is UNKNOWN [2022-04-14 14:36:21,450 INFO L290 TraceCheckUtils]: 19: Hoare triple {2034#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {2034#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:36:21,451 INFO L290 TraceCheckUtils]: 18: Hoare triple {2034#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296); {2034#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:36:21,451 INFO L290 TraceCheckUtils]: 17: Hoare triple {2034#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {2034#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:36:21,452 INFO L290 TraceCheckUtils]: 16: Hoare triple {2034#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 9 then ~l~0 % 4294967296 % 9 - 9 else ~l~0 % 4294967296 % 9) % 4294967296); {2034#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:36:21,452 INFO L290 TraceCheckUtils]: 15: Hoare triple {2034#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {2034#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:36:21,453 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {1924#true} {2034#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} #89#return; {2034#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:36:21,453 INFO L290 TraceCheckUtils]: 13: Hoare triple {1924#true} assume true; {1924#true} is VALID [2022-04-14 14:36:21,453 INFO L290 TraceCheckUtils]: 12: Hoare triple {1924#true} assume !(0 == ~cond); {1924#true} is VALID [2022-04-14 14:36:21,453 INFO L290 TraceCheckUtils]: 11: Hoare triple {1924#true} ~cond := #in~cond; {1924#true} is VALID [2022-04-14 14:36:21,453 INFO L272 TraceCheckUtils]: 10: Hoare triple {2034#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0 + ~v6~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {1924#true} is VALID [2022-04-14 14:36:21,457 INFO L290 TraceCheckUtils]: 9: Hoare triple {2038#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} ~l~0 := 1 + ~l~0; {2034#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:36:23,569 WARN L290 TraceCheckUtils]: 8: Hoare triple {2034#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 9 then ~l~0 % 4294967296 % 9 - 9 else ~l~0 % 4294967296 % 9) % 4294967296;~v6~0 := 1 + ~v6~0; {2038#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is UNKNOWN [2022-04-14 14:36:23,570 INFO L290 TraceCheckUtils]: 7: Hoare triple {2034#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {2034#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:36:23,577 INFO L290 TraceCheckUtils]: 6: Hoare triple {2034#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {2034#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:36:23,578 INFO L290 TraceCheckUtils]: 5: Hoare triple {1924#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v1~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;~v5~0 := 0;~v6~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {2034#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:36:23,578 INFO L272 TraceCheckUtils]: 4: Hoare triple {1924#true} call #t~ret5 := main(); {1924#true} is VALID [2022-04-14 14:36:23,578 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1924#true} {1924#true} #91#return; {1924#true} is VALID [2022-04-14 14:36:23,578 INFO L290 TraceCheckUtils]: 2: Hoare triple {1924#true} assume true; {1924#true} is VALID [2022-04-14 14:36:23,578 INFO L290 TraceCheckUtils]: 1: Hoare triple {1924#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {1924#true} is VALID [2022-04-14 14:36:23,578 INFO L272 TraceCheckUtils]: 0: Hoare triple {1924#true} call ULTIMATE.init(); {1924#true} is VALID [2022-04-14 14:36:23,579 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-14 14:36:23,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1958069948] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-14 14:36:23,579 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-14 14:36:23,579 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9, 9] total 18 [2022-04-14 14:36:23,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742621018] [2022-04-14 14:36:23,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 14:36:23,579 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2022-04-14 14:36:23,579 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 14:36:23,580 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 14:36:27,805 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 22 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-14 14:36:27,805 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-14 14:36:27,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 14:36:27,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-14 14:36:27,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2022-04-14 14:36:27,806 INFO L87 Difference]: Start difference. First operand 57 states and 75 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 14:36:29,928 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:36:32,130 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:36:34,245 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:36:36,424 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:36:38,532 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:36:40,646 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:36:42,757 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:36:44,933 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:36:51,464 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:36:53,629 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:36:56,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:36:56,020 INFO L93 Difference]: Finished difference Result 72 states and 96 transitions. [2022-04-14 14:36:56,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-14 14:36:56,021 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2022-04-14 14:36:56,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 14:36:56,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 14:36:56,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 51 transitions. [2022-04-14 14:36:56,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 14:36:56,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 51 transitions. [2022-04-14 14:36:56,034 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 51 transitions. [2022-04-14 14:37:00,301 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 49 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-14 14:37:00,302 INFO L225 Difference]: With dead ends: 72 [2022-04-14 14:37:00,302 INFO L226 Difference]: Without dead ends: 70 [2022-04-14 14:37:00,302 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 44 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2022-04-14 14:37:00,303 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 5 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.4s IncrementalHoareTripleChecker+Time [2022-04-14 14:37:00,303 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 71 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 10 Unknown, 0 Unchecked, 21.4s Time] [2022-04-14 14:37:00,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-04-14 14:37:00,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-04-14 14:37:00,340 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 14:37:00,340 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand has 70 states, 56 states have (on average 1.4464285714285714) internal successors, (81), 56 states have internal predecessors, (81), 7 states have call successors, (7), 7 states have call predecessors, (7), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-14 14:37:00,340 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand has 70 states, 56 states have (on average 1.4464285714285714) internal successors, (81), 56 states have internal predecessors, (81), 7 states have call successors, (7), 7 states have call predecessors, (7), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-14 14:37:00,340 INFO L87 Difference]: Start difference. First operand 70 states. Second operand has 70 states, 56 states have (on average 1.4464285714285714) internal successors, (81), 56 states have internal predecessors, (81), 7 states have call successors, (7), 7 states have call predecessors, (7), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-14 14:37:00,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:37:00,342 INFO L93 Difference]: Finished difference Result 70 states and 94 transitions. [2022-04-14 14:37:00,342 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 94 transitions. [2022-04-14 14:37:00,342 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:37:00,342 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:37:00,342 INFO L74 IsIncluded]: Start isIncluded. First operand has 70 states, 56 states have (on average 1.4464285714285714) internal successors, (81), 56 states have internal predecessors, (81), 7 states have call successors, (7), 7 states have call predecessors, (7), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 70 states. [2022-04-14 14:37:00,343 INFO L87 Difference]: Start difference. First operand has 70 states, 56 states have (on average 1.4464285714285714) internal successors, (81), 56 states have internal predecessors, (81), 7 states have call successors, (7), 7 states have call predecessors, (7), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 70 states. [2022-04-14 14:37:00,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:37:00,344 INFO L93 Difference]: Finished difference Result 70 states and 94 transitions. [2022-04-14 14:37:00,344 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 94 transitions. [2022-04-14 14:37:00,344 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:37:00,344 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:37:00,344 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 14:37:00,344 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 14:37:00,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 56 states have (on average 1.4464285714285714) internal successors, (81), 56 states have internal predecessors, (81), 7 states have call successors, (7), 7 states have call predecessors, (7), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-14 14:37:00,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 94 transitions. [2022-04-14 14:37:00,346 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 94 transitions. Word has length 26 [2022-04-14 14:37:00,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 14:37:00,346 INFO L478 AbstractCegarLoop]: Abstraction has 70 states and 94 transitions. [2022-04-14 14:37:00,346 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 14:37:00,346 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 94 transitions. [2022-04-14 14:37:00,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-14 14:37:00,347 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 14:37:00,347 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 14:37:00,365 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-14 14:37:00,547 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 14:37:00,547 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 14:37:00,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 14:37:00,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1668739991, now seen corresponding path program 1 times [2022-04-14 14:37:00,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 14:37:00,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420135265] [2022-04-14 14:37:00,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 14:37:00,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 14:37:00,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:37:00,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 14:37:00,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:37:00,597 INFO L290 TraceCheckUtils]: 0: Hoare triple {2439#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {2428#true} is VALID [2022-04-14 14:37:00,598 INFO L290 TraceCheckUtils]: 1: Hoare triple {2428#true} assume true; {2428#true} is VALID [2022-04-14 14:37:00,598 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2428#true} {2428#true} #91#return; {2428#true} is VALID [2022-04-14 14:37:00,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-04-14 14:37:00,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:37:00,603 INFO L290 TraceCheckUtils]: 0: Hoare triple {2428#true} ~cond := #in~cond; {2428#true} is VALID [2022-04-14 14:37:00,603 INFO L290 TraceCheckUtils]: 1: Hoare triple {2428#true} assume !(0 == ~cond); {2428#true} is VALID [2022-04-14 14:37:00,603 INFO L290 TraceCheckUtils]: 2: Hoare triple {2428#true} assume true; {2428#true} is VALID [2022-04-14 14:37:00,604 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2428#true} {2434#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} #89#return; {2434#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} is VALID [2022-04-14 14:37:00,604 INFO L272 TraceCheckUtils]: 0: Hoare triple {2428#true} call ULTIMATE.init(); {2439#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 14:37:00,604 INFO L290 TraceCheckUtils]: 1: Hoare triple {2439#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {2428#true} is VALID [2022-04-14 14:37:00,604 INFO L290 TraceCheckUtils]: 2: Hoare triple {2428#true} assume true; {2428#true} is VALID [2022-04-14 14:37:00,604 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2428#true} {2428#true} #91#return; {2428#true} is VALID [2022-04-14 14:37:00,605 INFO L272 TraceCheckUtils]: 4: Hoare triple {2428#true} call #t~ret5 := main(); {2428#true} is VALID [2022-04-14 14:37:00,605 INFO L290 TraceCheckUtils]: 5: Hoare triple {2428#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v1~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;~v5~0 := 0;~v6~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {2433#(= main_~l~0 0)} is VALID [2022-04-14 14:37:00,605 INFO L290 TraceCheckUtils]: 6: Hoare triple {2433#(= main_~l~0 0)} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {2433#(= main_~l~0 0)} is VALID [2022-04-14 14:37:00,605 INFO L290 TraceCheckUtils]: 7: Hoare triple {2433#(= main_~l~0 0)} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {2433#(= main_~l~0 0)} is VALID [2022-04-14 14:37:00,606 INFO L290 TraceCheckUtils]: 8: Hoare triple {2433#(= main_~l~0 0)} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 9 then ~l~0 % 4294967296 % 9 - 9 else ~l~0 % 4294967296 % 9) % 4294967296;~v6~0 := 1 + ~v6~0; {2433#(= main_~l~0 0)} is VALID [2022-04-14 14:37:00,606 INFO L290 TraceCheckUtils]: 9: Hoare triple {2433#(= main_~l~0 0)} ~l~0 := 1 + ~l~0; {2434#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} is VALID [2022-04-14 14:37:00,606 INFO L272 TraceCheckUtils]: 10: Hoare triple {2434#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0 + ~v6~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {2428#true} is VALID [2022-04-14 14:37:00,606 INFO L290 TraceCheckUtils]: 11: Hoare triple {2428#true} ~cond := #in~cond; {2428#true} is VALID [2022-04-14 14:37:00,606 INFO L290 TraceCheckUtils]: 12: Hoare triple {2428#true} assume !(0 == ~cond); {2428#true} is VALID [2022-04-14 14:37:00,606 INFO L290 TraceCheckUtils]: 13: Hoare triple {2428#true} assume true; {2428#true} is VALID [2022-04-14 14:37:00,607 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {2428#true} {2434#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} #89#return; {2434#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} is VALID [2022-04-14 14:37:00,607 INFO L290 TraceCheckUtils]: 15: Hoare triple {2434#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {2434#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} is VALID [2022-04-14 14:37:00,608 INFO L290 TraceCheckUtils]: 16: Hoare triple {2434#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 9 then ~l~0 % 4294967296 % 9 - 9 else ~l~0 % 4294967296 % 9) % 4294967296); {2434#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} is VALID [2022-04-14 14:37:00,608 INFO L290 TraceCheckUtils]: 17: Hoare triple {2434#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {2434#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} is VALID [2022-04-14 14:37:00,608 INFO L290 TraceCheckUtils]: 18: Hoare triple {2434#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296); {2434#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} is VALID [2022-04-14 14:37:00,609 INFO L290 TraceCheckUtils]: 19: Hoare triple {2434#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {2434#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} is VALID [2022-04-14 14:37:00,609 INFO L290 TraceCheckUtils]: 20: Hoare triple {2434#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {2434#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} is VALID [2022-04-14 14:37:00,610 INFO L290 TraceCheckUtils]: 21: Hoare triple {2434#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296;~v4~0 := 1 + ~v4~0; {2429#false} is VALID [2022-04-14 14:37:00,610 INFO L290 TraceCheckUtils]: 22: Hoare triple {2429#false} ~l~0 := 1 + ~l~0; {2429#false} is VALID [2022-04-14 14:37:00,610 INFO L272 TraceCheckUtils]: 23: Hoare triple {2429#false} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0 + ~v6~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {2429#false} is VALID [2022-04-14 14:37:00,610 INFO L290 TraceCheckUtils]: 24: Hoare triple {2429#false} ~cond := #in~cond; {2429#false} is VALID [2022-04-14 14:37:00,610 INFO L290 TraceCheckUtils]: 25: Hoare triple {2429#false} assume 0 == ~cond; {2429#false} is VALID [2022-04-14 14:37:00,610 INFO L290 TraceCheckUtils]: 26: Hoare triple {2429#false} assume !false; {2429#false} is VALID [2022-04-14 14:37:00,610 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 14:37:00,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 14:37:00,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420135265] [2022-04-14 14:37:00,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420135265] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-14 14:37:00,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1757204375] [2022-04-14 14:37:00,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 14:37:00,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 14:37:00,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 14:37:00,611 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 14:37:00,612 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-14 14:37:00,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:37:00,646 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-14 14:37:00,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:37:00,653 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 14:37:01,213 INFO L272 TraceCheckUtils]: 0: Hoare triple {2428#true} call ULTIMATE.init(); {2428#true} is VALID [2022-04-14 14:37:01,213 INFO L290 TraceCheckUtils]: 1: Hoare triple {2428#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {2428#true} is VALID [2022-04-14 14:37:01,213 INFO L290 TraceCheckUtils]: 2: Hoare triple {2428#true} assume true; {2428#true} is VALID [2022-04-14 14:37:01,213 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2428#true} {2428#true} #91#return; {2428#true} is VALID [2022-04-14 14:37:01,213 INFO L272 TraceCheckUtils]: 4: Hoare triple {2428#true} call #t~ret5 := main(); {2428#true} is VALID [2022-04-14 14:37:01,214 INFO L290 TraceCheckUtils]: 5: Hoare triple {2428#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v1~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;~v5~0 := 0;~v6~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {2458#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v6~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:37:01,214 INFO L290 TraceCheckUtils]: 6: Hoare triple {2458#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v6~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {2458#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v6~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:37:01,214 INFO L290 TraceCheckUtils]: 7: Hoare triple {2458#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v6~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {2458#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v6~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:37:01,215 INFO L290 TraceCheckUtils]: 8: Hoare triple {2458#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v6~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 9 then ~l~0 % 4294967296 % 9 - 9 else ~l~0 % 4294967296 % 9) % 4294967296;~v6~0 := 1 + ~v6~0; {2468#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:37:01,215 INFO L290 TraceCheckUtils]: 9: Hoare triple {2468#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {2472#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:37:01,215 INFO L272 TraceCheckUtils]: 10: Hoare triple {2472#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0 + ~v6~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {2428#true} is VALID [2022-04-14 14:37:01,215 INFO L290 TraceCheckUtils]: 11: Hoare triple {2428#true} ~cond := #in~cond; {2428#true} is VALID [2022-04-14 14:37:01,215 INFO L290 TraceCheckUtils]: 12: Hoare triple {2428#true} assume !(0 == ~cond); {2428#true} is VALID [2022-04-14 14:37:01,216 INFO L290 TraceCheckUtils]: 13: Hoare triple {2428#true} assume true; {2428#true} is VALID [2022-04-14 14:37:01,216 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {2428#true} {2472#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} #89#return; {2472#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:37:01,217 INFO L290 TraceCheckUtils]: 15: Hoare triple {2472#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {2472#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:37:01,217 INFO L290 TraceCheckUtils]: 16: Hoare triple {2472#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 9 then ~l~0 % 4294967296 % 9 - 9 else ~l~0 % 4294967296 % 9) % 4294967296); {2472#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:37:01,217 INFO L290 TraceCheckUtils]: 17: Hoare triple {2472#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {2472#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:37:01,218 INFO L290 TraceCheckUtils]: 18: Hoare triple {2472#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296); {2472#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:37:01,218 INFO L290 TraceCheckUtils]: 19: Hoare triple {2472#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {2472#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:37:01,219 INFO L290 TraceCheckUtils]: 20: Hoare triple {2472#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {2472#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:37:01,219 INFO L290 TraceCheckUtils]: 21: Hoare triple {2472#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296;~v4~0 := 1 + ~v4~0; {2509#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 1) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:37:01,220 INFO L290 TraceCheckUtils]: 22: Hoare triple {2509#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 1) (= main_~v1~0 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {2513#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~l~0 2) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 1) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:37:01,220 INFO L272 TraceCheckUtils]: 23: Hoare triple {2513#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~l~0 2) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 1) (= main_~v1~0 0) (= main_~v3~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0 + ~v6~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {2517#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 14:37:01,221 INFO L290 TraceCheckUtils]: 24: Hoare triple {2517#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2521#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 14:37:01,221 INFO L290 TraceCheckUtils]: 25: Hoare triple {2521#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2429#false} is VALID [2022-04-14 14:37:01,221 INFO L290 TraceCheckUtils]: 26: Hoare triple {2429#false} assume !false; {2429#false} is VALID [2022-04-14 14:37:01,221 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 14:37:01,221 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 14:37:01,476 INFO L290 TraceCheckUtils]: 26: Hoare triple {2429#false} assume !false; {2429#false} is VALID [2022-04-14 14:37:01,477 INFO L290 TraceCheckUtils]: 25: Hoare triple {2521#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2429#false} is VALID [2022-04-14 14:37:01,477 INFO L290 TraceCheckUtils]: 24: Hoare triple {2517#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2521#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 14:37:01,478 INFO L272 TraceCheckUtils]: 23: Hoare triple {2537#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0 + ~v6~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {2517#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 14:37:01,479 INFO L290 TraceCheckUtils]: 22: Hoare triple {2541#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} ~l~0 := 1 + ~l~0; {2537#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:37:01,484 INFO L290 TraceCheckUtils]: 21: Hoare triple {2537#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296;~v4~0 := 1 + ~v4~0; {2541#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:37:01,484 INFO L290 TraceCheckUtils]: 20: Hoare triple {2537#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {2537#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:37:01,484 INFO L290 TraceCheckUtils]: 19: Hoare triple {2537#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {2537#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:37:01,485 INFO L290 TraceCheckUtils]: 18: Hoare triple {2537#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296); {2537#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:37:01,486 INFO L290 TraceCheckUtils]: 17: Hoare triple {2537#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {2537#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:37:01,486 INFO L290 TraceCheckUtils]: 16: Hoare triple {2537#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 9 then ~l~0 % 4294967296 % 9 - 9 else ~l~0 % 4294967296 % 9) % 4294967296); {2537#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:37:01,486 INFO L290 TraceCheckUtils]: 15: Hoare triple {2537#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {2537#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:37:01,487 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {2428#true} {2537#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} #89#return; {2537#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:37:01,487 INFO L290 TraceCheckUtils]: 13: Hoare triple {2428#true} assume true; {2428#true} is VALID [2022-04-14 14:37:01,487 INFO L290 TraceCheckUtils]: 12: Hoare triple {2428#true} assume !(0 == ~cond); {2428#true} is VALID [2022-04-14 14:37:01,487 INFO L290 TraceCheckUtils]: 11: Hoare triple {2428#true} ~cond := #in~cond; {2428#true} is VALID [2022-04-14 14:37:01,488 INFO L272 TraceCheckUtils]: 10: Hoare triple {2537#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0 + ~v6~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {2428#true} is VALID [2022-04-14 14:37:01,488 INFO L290 TraceCheckUtils]: 9: Hoare triple {2541#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} ~l~0 := 1 + ~l~0; {2537#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:37:03,603 WARN L290 TraceCheckUtils]: 8: Hoare triple {2537#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 9 then ~l~0 % 4294967296 % 9 - 9 else ~l~0 % 4294967296 % 9) % 4294967296;~v6~0 := 1 + ~v6~0; {2541#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is UNKNOWN [2022-04-14 14:37:03,603 INFO L290 TraceCheckUtils]: 7: Hoare triple {2537#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {2537#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:37:03,604 INFO L290 TraceCheckUtils]: 6: Hoare triple {2537#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {2537#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:37:03,615 INFO L290 TraceCheckUtils]: 5: Hoare triple {2428#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v1~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;~v5~0 := 0;~v6~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {2537#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:37:03,616 INFO L272 TraceCheckUtils]: 4: Hoare triple {2428#true} call #t~ret5 := main(); {2428#true} is VALID [2022-04-14 14:37:03,616 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2428#true} {2428#true} #91#return; {2428#true} is VALID [2022-04-14 14:37:03,616 INFO L290 TraceCheckUtils]: 2: Hoare triple {2428#true} assume true; {2428#true} is VALID [2022-04-14 14:37:03,616 INFO L290 TraceCheckUtils]: 1: Hoare triple {2428#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {2428#true} is VALID [2022-04-14 14:37:03,616 INFO L272 TraceCheckUtils]: 0: Hoare triple {2428#true} call ULTIMATE.init(); {2428#true} is VALID [2022-04-14 14:37:03,616 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-14 14:37:03,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1757204375] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-14 14:37:03,616 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-14 14:37:03,616 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5, 9] total 14 [2022-04-14 14:37:03,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124344201] [2022-04-14 14:37:03,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 14:37:03,617 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 27 [2022-04-14 14:37:03,617 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 14:37:03,617 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 14:37:05,748 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 24 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-14 14:37:05,748 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-14 14:37:05,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 14:37:05,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-14 14:37:05,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-04-14 14:37:05,749 INFO L87 Difference]: Start difference. First operand 70 states and 94 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 14:37:07,850 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:37:10,083 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:37:12,199 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:37:14,315 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:37:16,432 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:37:18,607 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:37:20,733 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:37:22,737 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:37:24,918 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:37:27,092 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:37:29,210 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:37:31,347 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:37:33,463 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:37:35,721 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:37:37,847 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:37:37,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:37:37,975 INFO L93 Difference]: Finished difference Result 87 states and 119 transitions. [2022-04-14 14:37:37,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-14 14:37:37,975 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 27 [2022-04-14 14:37:37,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 14:37:37,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 14:37:37,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 55 transitions. [2022-04-14 14:37:37,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 14:37:37,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 55 transitions. [2022-04-14 14:37:37,977 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 55 transitions. [2022-04-14 14:37:38,107 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 14:37:38,108 INFO L225 Difference]: With dead ends: 87 [2022-04-14 14:37:38,108 INFO L226 Difference]: Without dead ends: 85 [2022-04-14 14:37:38,108 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 47 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-04-14 14:37:38,108 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 6 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 1 mSolverCounterUnsat, 14 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 30.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 14 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 31.6s IncrementalHoareTripleChecker+Time [2022-04-14 14:37:38,109 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 62 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 73 Invalid, 14 Unknown, 0 Unchecked, 31.6s Time] [2022-04-14 14:37:38,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-04-14 14:37:38,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 84. [2022-04-14 14:37:38,147 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 14:37:38,147 INFO L82 GeneralOperation]: Start isEquivalent. First operand 85 states. Second operand has 84 states, 68 states have (on average 1.4705882352941178) internal successors, (100), 68 states have internal predecessors, (100), 8 states have call successors, (8), 8 states have call predecessors, (8), 7 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-14 14:37:38,147 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand has 84 states, 68 states have (on average 1.4705882352941178) internal successors, (100), 68 states have internal predecessors, (100), 8 states have call successors, (8), 8 states have call predecessors, (8), 7 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-14 14:37:38,148 INFO L87 Difference]: Start difference. First operand 85 states. Second operand has 84 states, 68 states have (on average 1.4705882352941178) internal successors, (100), 68 states have internal predecessors, (100), 8 states have call successors, (8), 8 states have call predecessors, (8), 7 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-14 14:37:38,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:37:38,149 INFO L93 Difference]: Finished difference Result 85 states and 117 transitions. [2022-04-14 14:37:38,149 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 117 transitions. [2022-04-14 14:37:38,149 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:37:38,149 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:37:38,150 INFO L74 IsIncluded]: Start isIncluded. First operand has 84 states, 68 states have (on average 1.4705882352941178) internal successors, (100), 68 states have internal predecessors, (100), 8 states have call successors, (8), 8 states have call predecessors, (8), 7 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 85 states. [2022-04-14 14:37:38,150 INFO L87 Difference]: Start difference. First operand has 84 states, 68 states have (on average 1.4705882352941178) internal successors, (100), 68 states have internal predecessors, (100), 8 states have call successors, (8), 8 states have call predecessors, (8), 7 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 85 states. [2022-04-14 14:37:38,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:37:38,151 INFO L93 Difference]: Finished difference Result 85 states and 117 transitions. [2022-04-14 14:37:38,152 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 117 transitions. [2022-04-14 14:37:38,152 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:37:38,152 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:37:38,152 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 14:37:38,152 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 14:37:38,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 68 states have (on average 1.4705882352941178) internal successors, (100), 68 states have internal predecessors, (100), 8 states have call successors, (8), 8 states have call predecessors, (8), 7 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-14 14:37:38,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 115 transitions. [2022-04-14 14:37:38,154 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 115 transitions. Word has length 27 [2022-04-14 14:37:38,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 14:37:38,154 INFO L478 AbstractCegarLoop]: Abstraction has 84 states and 115 transitions. [2022-04-14 14:37:38,154 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 14:37:38,154 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 115 transitions. [2022-04-14 14:37:38,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-14 14:37:38,154 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 14:37:38,154 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 14:37:38,170 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-14 14:37:38,367 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 14:37:38,367 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 14:37:38,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 14:37:38,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1687761027, now seen corresponding path program 1 times [2022-04-14 14:37:38,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 14:37:38,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816004035] [2022-04-14 14:37:38,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 14:37:38,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 14:37:38,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:37:38,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 14:37:38,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:37:38,592 INFO L290 TraceCheckUtils]: 0: Hoare triple {3013#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {3014#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-14 14:37:38,593 INFO L290 TraceCheckUtils]: 1: Hoare triple {3014#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} assume true; {3014#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-14 14:37:38,593 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3014#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {2999#true} #91#return; {3004#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-14 14:37:38,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-04-14 14:37:38,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:37:38,599 INFO L290 TraceCheckUtils]: 0: Hoare triple {2999#true} ~cond := #in~cond; {2999#true} is VALID [2022-04-14 14:37:38,599 INFO L290 TraceCheckUtils]: 1: Hoare triple {2999#true} assume !(0 == ~cond); {2999#true} is VALID [2022-04-14 14:37:38,599 INFO L290 TraceCheckUtils]: 2: Hoare triple {2999#true} assume true; {2999#true} is VALID [2022-04-14 14:37:38,600 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2999#true} {3007#(or (<= (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296) 4274967296) (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ (* 3 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) (* (div main_~l~0 4294967296) 4294967296) (* (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 4294967298) 1) main_~l~0))} #89#return; {3007#(or (<= (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296) 4274967296) (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ (* 3 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) (* (div main_~l~0 4294967296) 4294967296) (* (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 4294967298) 1) main_~l~0))} is VALID [2022-04-14 14:37:38,601 INFO L272 TraceCheckUtils]: 0: Hoare triple {2999#true} call ULTIMATE.init(); {3013#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 14:37:38,601 INFO L290 TraceCheckUtils]: 1: Hoare triple {3013#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {3014#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-14 14:37:38,601 INFO L290 TraceCheckUtils]: 2: Hoare triple {3014#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} assume true; {3014#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-14 14:37:38,602 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3014#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {2999#true} #91#return; {3004#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-14 14:37:38,603 INFO L272 TraceCheckUtils]: 4: Hoare triple {3004#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} call #t~ret5 := main(); {3004#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-14 14:37:38,603 INFO L290 TraceCheckUtils]: 5: Hoare triple {3004#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v1~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;~v5~0 := 0;~v6~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {3005#(and (<= ~SIZE~0 20000001) (= main_~l~0 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-14 14:37:38,604 INFO L290 TraceCheckUtils]: 6: Hoare triple {3005#(and (<= ~SIZE~0 20000001) (= main_~l~0 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {3006#(and (= main_~l~0 0) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-14 14:37:38,604 INFO L290 TraceCheckUtils]: 7: Hoare triple {3006#(and (= main_~l~0 0) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {3006#(and (= main_~l~0 0) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-14 14:37:38,605 INFO L290 TraceCheckUtils]: 8: Hoare triple {3006#(and (= main_~l~0 0) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 9 then ~l~0 % 4294967296 % 9 - 9 else ~l~0 % 4294967296 % 9) % 4294967296;~v6~0 := 1 + ~v6~0; {3006#(and (= main_~l~0 0) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-14 14:37:38,605 INFO L290 TraceCheckUtils]: 9: Hoare triple {3006#(and (= main_~l~0 0) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))))} ~l~0 := 1 + ~l~0; {3007#(or (<= (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296) 4274967296) (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ (* 3 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) (* (div main_~l~0 4294967296) 4294967296) (* (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 4294967298) 1) main_~l~0))} is VALID [2022-04-14 14:37:38,605 INFO L272 TraceCheckUtils]: 10: Hoare triple {3007#(or (<= (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296) 4274967296) (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ (* 3 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) (* (div main_~l~0 4294967296) 4294967296) (* (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 4294967298) 1) main_~l~0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0 + ~v6~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {2999#true} is VALID [2022-04-14 14:37:38,605 INFO L290 TraceCheckUtils]: 11: Hoare triple {2999#true} ~cond := #in~cond; {2999#true} is VALID [2022-04-14 14:37:38,605 INFO L290 TraceCheckUtils]: 12: Hoare triple {2999#true} assume !(0 == ~cond); {2999#true} is VALID [2022-04-14 14:37:38,605 INFO L290 TraceCheckUtils]: 13: Hoare triple {2999#true} assume true; {2999#true} is VALID [2022-04-14 14:37:38,606 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {2999#true} {3007#(or (<= (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296) 4274967296) (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ (* 3 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) (* (div main_~l~0 4294967296) 4294967296) (* (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 4294967298) 1) main_~l~0))} #89#return; {3007#(or (<= (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296) 4274967296) (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ (* 3 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) (* (div main_~l~0 4294967296) 4294967296) (* (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 4294967298) 1) main_~l~0))} is VALID [2022-04-14 14:37:38,607 INFO L290 TraceCheckUtils]: 15: Hoare triple {3007#(or (<= (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296) 4274967296) (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ (* 3 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) (* (div main_~l~0 4294967296) 4294967296) (* (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 4294967298) 1) main_~l~0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {3012#(<= (+ (* 3 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) (* (div main_~l~0 4294967296) 4294967296) (* (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 4294967298) 1) main_~l~0)} is VALID [2022-04-14 14:37:38,608 INFO L290 TraceCheckUtils]: 16: Hoare triple {3012#(<= (+ (* 3 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) (* (div main_~l~0 4294967296) 4294967296) (* (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 4294967298) 1) main_~l~0)} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 9 then ~l~0 % 4294967296 % 9 - 9 else ~l~0 % 4294967296 % 9) % 4294967296); {3012#(<= (+ (* 3 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) (* (div main_~l~0 4294967296) 4294967296) (* (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 4294967298) 1) main_~l~0)} is VALID [2022-04-14 14:37:38,608 INFO L290 TraceCheckUtils]: 17: Hoare triple {3012#(<= (+ (* 3 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) (* (div main_~l~0 4294967296) 4294967296) (* (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 4294967298) 1) main_~l~0)} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {3012#(<= (+ (* 3 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) (* (div main_~l~0 4294967296) 4294967296) (* (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 4294967298) 1) main_~l~0)} is VALID [2022-04-14 14:37:38,608 INFO L290 TraceCheckUtils]: 18: Hoare triple {3012#(<= (+ (* 3 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) (* (div main_~l~0 4294967296) 4294967296) (* (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 4294967298) 1) main_~l~0)} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296); {3012#(<= (+ (* 3 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) (* (div main_~l~0 4294967296) 4294967296) (* (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 4294967298) 1) main_~l~0)} is VALID [2022-04-14 14:37:38,609 INFO L290 TraceCheckUtils]: 19: Hoare triple {3012#(<= (+ (* 3 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) (* (div main_~l~0 4294967296) 4294967296) (* (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 4294967298) 1) main_~l~0)} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {3012#(<= (+ (* 3 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) (* (div main_~l~0 4294967296) 4294967296) (* (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 4294967298) 1) main_~l~0)} is VALID [2022-04-14 14:37:38,609 INFO L290 TraceCheckUtils]: 20: Hoare triple {3012#(<= (+ (* 3 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) (* (div main_~l~0 4294967296) 4294967296) (* (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 4294967298) 1) main_~l~0)} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {3012#(<= (+ (* 3 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) (* (div main_~l~0 4294967296) 4294967296) (* (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 4294967298) 1) main_~l~0)} is VALID [2022-04-14 14:37:38,610 INFO L290 TraceCheckUtils]: 21: Hoare triple {3012#(<= (+ (* 3 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) (* (div main_~l~0 4294967296) 4294967296) (* (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 4294967298) 1) main_~l~0)} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296); {3012#(<= (+ (* 3 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) (* (div main_~l~0 4294967296) 4294967296) (* (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 4294967298) 1) main_~l~0)} is VALID [2022-04-14 14:37:38,611 INFO L290 TraceCheckUtils]: 22: Hoare triple {3012#(<= (+ (* 3 (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) (* (div main_~l~0 4294967296) 4294967296) (* (div (+ (* (- 3) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 3)) main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296) 4294967298) 1) main_~l~0)} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 3 then ~l~0 % 4294967296 % 3 - 3 else ~l~0 % 4294967296 % 3) % 4294967296;~i~0 := 1 + ~i~0; {3000#false} is VALID [2022-04-14 14:37:38,611 INFO L290 TraceCheckUtils]: 23: Hoare triple {3000#false} ~l~0 := 1 + ~l~0; {3000#false} is VALID [2022-04-14 14:37:38,611 INFO L272 TraceCheckUtils]: 24: Hoare triple {3000#false} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0 + ~v6~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {3000#false} is VALID [2022-04-14 14:37:38,611 INFO L290 TraceCheckUtils]: 25: Hoare triple {3000#false} ~cond := #in~cond; {3000#false} is VALID [2022-04-14 14:37:38,612 INFO L290 TraceCheckUtils]: 26: Hoare triple {3000#false} assume 0 == ~cond; {3000#false} is VALID [2022-04-14 14:37:38,612 INFO L290 TraceCheckUtils]: 27: Hoare triple {3000#false} assume !false; {3000#false} is VALID [2022-04-14 14:37:38,612 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 14:37:38,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 14:37:38,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816004035] [2022-04-14 14:37:38,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816004035] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-14 14:37:38,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [241679797] [2022-04-14 14:37:38,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 14:37:38,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 14:37:38,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 14:37:38,613 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 14:37:38,614 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-14 14:37:38,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:37:38,646 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-14 14:37:38,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:37:38,652 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 14:37:39,326 INFO L272 TraceCheckUtils]: 0: Hoare triple {2999#true} call ULTIMATE.init(); {2999#true} is VALID [2022-04-14 14:37:39,326 INFO L290 TraceCheckUtils]: 1: Hoare triple {2999#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {2999#true} is VALID [2022-04-14 14:37:39,327 INFO L290 TraceCheckUtils]: 2: Hoare triple {2999#true} assume true; {2999#true} is VALID [2022-04-14 14:37:39,327 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2999#true} {2999#true} #91#return; {2999#true} is VALID [2022-04-14 14:37:39,327 INFO L272 TraceCheckUtils]: 4: Hoare triple {2999#true} call #t~ret5 := main(); {2999#true} is VALID [2022-04-14 14:37:39,327 INFO L290 TraceCheckUtils]: 5: Hoare triple {2999#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v1~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;~v5~0 := 0;~v6~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {3033#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v6~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:37:39,328 INFO L290 TraceCheckUtils]: 6: Hoare triple {3033#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v6~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {3033#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v6~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:37:39,328 INFO L290 TraceCheckUtils]: 7: Hoare triple {3033#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v6~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {3033#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v6~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:37:39,328 INFO L290 TraceCheckUtils]: 8: Hoare triple {3033#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v6~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 9 then ~l~0 % 4294967296 % 9 - 9 else ~l~0 % 4294967296 % 9) % 4294967296;~v6~0 := 1 + ~v6~0; {3043#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:37:39,329 INFO L290 TraceCheckUtils]: 9: Hoare triple {3043#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {3047#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:37:39,329 INFO L272 TraceCheckUtils]: 10: Hoare triple {3047#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0 + ~v6~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {2999#true} is VALID [2022-04-14 14:37:39,329 INFO L290 TraceCheckUtils]: 11: Hoare triple {2999#true} ~cond := #in~cond; {2999#true} is VALID [2022-04-14 14:37:39,329 INFO L290 TraceCheckUtils]: 12: Hoare triple {2999#true} assume !(0 == ~cond); {2999#true} is VALID [2022-04-14 14:37:39,329 INFO L290 TraceCheckUtils]: 13: Hoare triple {2999#true} assume true; {2999#true} is VALID [2022-04-14 14:37:39,330 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {2999#true} {3047#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} #89#return; {3047#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:37:39,331 INFO L290 TraceCheckUtils]: 15: Hoare triple {3047#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {3047#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:37:39,331 INFO L290 TraceCheckUtils]: 16: Hoare triple {3047#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 9 then ~l~0 % 4294967296 % 9 - 9 else ~l~0 % 4294967296 % 9) % 4294967296); {3047#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:37:39,331 INFO L290 TraceCheckUtils]: 17: Hoare triple {3047#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {3047#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:37:39,332 INFO L290 TraceCheckUtils]: 18: Hoare triple {3047#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296); {3047#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:37:39,332 INFO L290 TraceCheckUtils]: 19: Hoare triple {3047#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {3047#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:37:39,333 INFO L290 TraceCheckUtils]: 20: Hoare triple {3047#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {3047#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:37:39,333 INFO L290 TraceCheckUtils]: 21: Hoare triple {3047#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296); {3047#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:37:39,334 INFO L290 TraceCheckUtils]: 22: Hoare triple {3047#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 3 then ~l~0 % 4294967296 % 3 - 3 else ~l~0 % 4294967296 % 3) % 4294967296;~i~0 := 1 + ~i~0; {3087#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:37:39,334 INFO L290 TraceCheckUtils]: 23: Hoare triple {3087#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v1~0 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {3091#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~l~0 2) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:37:39,335 INFO L272 TraceCheckUtils]: 24: Hoare triple {3091#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~l~0 2) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v1~0 0) (= main_~v3~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0 + ~v6~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {3095#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 14:37:39,335 INFO L290 TraceCheckUtils]: 25: Hoare triple {3095#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3099#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 14:37:39,335 INFO L290 TraceCheckUtils]: 26: Hoare triple {3099#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3000#false} is VALID [2022-04-14 14:37:39,335 INFO L290 TraceCheckUtils]: 27: Hoare triple {3000#false} assume !false; {3000#false} is VALID [2022-04-14 14:37:39,336 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 14:37:39,336 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 14:37:39,599 INFO L290 TraceCheckUtils]: 27: Hoare triple {3000#false} assume !false; {3000#false} is VALID [2022-04-14 14:37:39,600 INFO L290 TraceCheckUtils]: 26: Hoare triple {3099#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3000#false} is VALID [2022-04-14 14:37:39,600 INFO L290 TraceCheckUtils]: 25: Hoare triple {3095#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3099#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 14:37:39,601 INFO L272 TraceCheckUtils]: 24: Hoare triple {3115#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0 + ~v6~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {3095#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 14:37:39,602 INFO L290 TraceCheckUtils]: 23: Hoare triple {3119#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} ~l~0 := 1 + ~l~0; {3115#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:37:41,719 WARN L290 TraceCheckUtils]: 22: Hoare triple {3115#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 3 then ~l~0 % 4294967296 % 3 - 3 else ~l~0 % 4294967296 % 3) % 4294967296;~i~0 := 1 + ~i~0; {3119#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is UNKNOWN [2022-04-14 14:37:41,720 INFO L290 TraceCheckUtils]: 21: Hoare triple {3115#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296); {3115#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:37:41,720 INFO L290 TraceCheckUtils]: 20: Hoare triple {3115#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {3115#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:37:41,721 INFO L290 TraceCheckUtils]: 19: Hoare triple {3115#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {3115#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:37:41,721 INFO L290 TraceCheckUtils]: 18: Hoare triple {3115#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296); {3115#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:37:41,721 INFO L290 TraceCheckUtils]: 17: Hoare triple {3115#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {3115#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:37:41,722 INFO L290 TraceCheckUtils]: 16: Hoare triple {3115#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 9 then ~l~0 % 4294967296 % 9 - 9 else ~l~0 % 4294967296 % 9) % 4294967296); {3115#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:37:41,722 INFO L290 TraceCheckUtils]: 15: Hoare triple {3115#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {3115#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:37:41,723 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {2999#true} {3115#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} #89#return; {3115#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:37:41,723 INFO L290 TraceCheckUtils]: 13: Hoare triple {2999#true} assume true; {2999#true} is VALID [2022-04-14 14:37:41,723 INFO L290 TraceCheckUtils]: 12: Hoare triple {2999#true} assume !(0 == ~cond); {2999#true} is VALID [2022-04-14 14:37:41,723 INFO L290 TraceCheckUtils]: 11: Hoare triple {2999#true} ~cond := #in~cond; {2999#true} is VALID [2022-04-14 14:37:41,723 INFO L272 TraceCheckUtils]: 10: Hoare triple {3115#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0 + ~v6~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {2999#true} is VALID [2022-04-14 14:37:41,727 INFO L290 TraceCheckUtils]: 9: Hoare triple {3119#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} ~l~0 := 1 + ~l~0; {3115#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:37:43,847 WARN L290 TraceCheckUtils]: 8: Hoare triple {3115#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 9 then ~l~0 % 4294967296 % 9 - 9 else ~l~0 % 4294967296 % 9) % 4294967296;~v6~0 := 1 + ~v6~0; {3119#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is UNKNOWN [2022-04-14 14:37:43,848 INFO L290 TraceCheckUtils]: 7: Hoare triple {3115#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {3115#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:37:43,848 INFO L290 TraceCheckUtils]: 6: Hoare triple {3115#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {3115#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:37:43,850 INFO L290 TraceCheckUtils]: 5: Hoare triple {2999#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v1~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;~v5~0 := 0;~v6~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {3115#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:37:43,850 INFO L272 TraceCheckUtils]: 4: Hoare triple {2999#true} call #t~ret5 := main(); {2999#true} is VALID [2022-04-14 14:37:43,850 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2999#true} {2999#true} #91#return; {2999#true} is VALID [2022-04-14 14:37:43,851 INFO L290 TraceCheckUtils]: 2: Hoare triple {2999#true} assume true; {2999#true} is VALID [2022-04-14 14:37:43,851 INFO L290 TraceCheckUtils]: 1: Hoare triple {2999#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {2999#true} is VALID [2022-04-14 14:37:43,851 INFO L272 TraceCheckUtils]: 0: Hoare triple {2999#true} call ULTIMATE.init(); {2999#true} is VALID [2022-04-14 14:37:43,851 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-14 14:37:43,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [241679797] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-14 14:37:43,851 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-14 14:37:43,851 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9, 9] total 18 [2022-04-14 14:37:43,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040257665] [2022-04-14 14:37:43,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 14:37:43,852 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 28 [2022-04-14 14:37:43,852 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 14:37:43,852 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 14:37:48,123 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 24 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-14 14:37:48,123 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-14 14:37:48,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 14:37:48,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-14 14:37:48,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2022-04-14 14:37:48,124 INFO L87 Difference]: Start difference. First operand 84 states and 115 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 14:37:50,232 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:37:52,453 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:37:54,565 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:37:56,680 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:37:58,790 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:38:00,900 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:38:03,069 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:38:05,196 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:38:07,365 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:38:09,539 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:38:11,652 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:38:13,771 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:38:15,994 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:38:18,202 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:38:18,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:38:18,353 INFO L93 Difference]: Finished difference Result 100 states and 138 transitions. [2022-04-14 14:38:18,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-14 14:38:18,354 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 28 [2022-04-14 14:38:18,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 14:38:18,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 14:38:18,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 55 transitions. [2022-04-14 14:38:18,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 14:38:18,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 55 transitions. [2022-04-14 14:38:18,356 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 55 transitions. [2022-04-14 14:38:22,692 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 53 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-14 14:38:22,693 INFO L225 Difference]: With dead ends: 100 [2022-04-14 14:38:22,693 INFO L226 Difference]: Without dead ends: 98 [2022-04-14 14:38:22,694 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 48 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2022-04-14 14:38:22,694 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 5 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 2 mSolverCounterUnsat, 14 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 14 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 29.7s IncrementalHoareTripleChecker+Time [2022-04-14 14:38:22,694 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 59 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 69 Invalid, 14 Unknown, 0 Unchecked, 29.7s Time] [2022-04-14 14:38:22,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-04-14 14:38:22,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 85. [2022-04-14 14:38:22,731 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 14:38:22,732 INFO L82 GeneralOperation]: Start isEquivalent. First operand 98 states. Second operand has 85 states, 69 states have (on average 1.4782608695652173) internal successors, (102), 69 states have internal predecessors, (102), 8 states have call successors, (8), 8 states have call predecessors, (8), 7 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-14 14:38:22,732 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand has 85 states, 69 states have (on average 1.4782608695652173) internal successors, (102), 69 states have internal predecessors, (102), 8 states have call successors, (8), 8 states have call predecessors, (8), 7 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-14 14:38:22,732 INFO L87 Difference]: Start difference. First operand 98 states. Second operand has 85 states, 69 states have (on average 1.4782608695652173) internal successors, (102), 69 states have internal predecessors, (102), 8 states have call successors, (8), 8 states have call predecessors, (8), 7 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-14 14:38:22,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:38:22,734 INFO L93 Difference]: Finished difference Result 98 states and 136 transitions. [2022-04-14 14:38:22,734 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 136 transitions. [2022-04-14 14:38:22,734 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:38:22,735 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:38:22,735 INFO L74 IsIncluded]: Start isIncluded. First operand has 85 states, 69 states have (on average 1.4782608695652173) internal successors, (102), 69 states have internal predecessors, (102), 8 states have call successors, (8), 8 states have call predecessors, (8), 7 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 98 states. [2022-04-14 14:38:22,735 INFO L87 Difference]: Start difference. First operand has 85 states, 69 states have (on average 1.4782608695652173) internal successors, (102), 69 states have internal predecessors, (102), 8 states have call successors, (8), 8 states have call predecessors, (8), 7 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 98 states. [2022-04-14 14:38:22,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:38:22,737 INFO L93 Difference]: Finished difference Result 98 states and 136 transitions. [2022-04-14 14:38:22,737 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 136 transitions. [2022-04-14 14:38:22,737 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:38:22,737 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:38:22,737 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 14:38:22,737 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 14:38:22,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 69 states have (on average 1.4782608695652173) internal successors, (102), 69 states have internal predecessors, (102), 8 states have call successors, (8), 8 states have call predecessors, (8), 7 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-14 14:38:22,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 117 transitions. [2022-04-14 14:38:22,739 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 117 transitions. Word has length 28 [2022-04-14 14:38:22,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 14:38:22,739 INFO L478 AbstractCegarLoop]: Abstraction has 85 states and 117 transitions. [2022-04-14 14:38:22,739 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 14:38:22,739 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 117 transitions. [2022-04-14 14:38:22,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-14 14:38:22,740 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 14:38:22,740 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 14:38:22,760 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-14 14:38:22,959 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 14:38:22,960 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 14:38:22,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 14:38:22,960 INFO L85 PathProgramCache]: Analyzing trace with hash -1874408398, now seen corresponding path program 1 times [2022-04-14 14:38:22,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 14:38:22,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379329194] [2022-04-14 14:38:22,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 14:38:22,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 14:38:22,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:38:23,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 14:38:23,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:38:23,012 INFO L290 TraceCheckUtils]: 0: Hoare triple {3634#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {3623#true} is VALID [2022-04-14 14:38:23,012 INFO L290 TraceCheckUtils]: 1: Hoare triple {3623#true} assume true; {3623#true} is VALID [2022-04-14 14:38:23,012 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3623#true} {3623#true} #91#return; {3623#true} is VALID [2022-04-14 14:38:23,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-04-14 14:38:23,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:38:23,016 INFO L290 TraceCheckUtils]: 0: Hoare triple {3623#true} ~cond := #in~cond; {3623#true} is VALID [2022-04-14 14:38:23,016 INFO L290 TraceCheckUtils]: 1: Hoare triple {3623#true} assume !(0 == ~cond); {3623#true} is VALID [2022-04-14 14:38:23,016 INFO L290 TraceCheckUtils]: 2: Hoare triple {3623#true} assume true; {3623#true} is VALID [2022-04-14 14:38:23,016 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3623#true} {3629#(and (<= 1 main_~l~0) (<= main_~l~0 1))} #89#return; {3629#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-14 14:38:23,017 INFO L272 TraceCheckUtils]: 0: Hoare triple {3623#true} call ULTIMATE.init(); {3634#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 14:38:23,017 INFO L290 TraceCheckUtils]: 1: Hoare triple {3634#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {3623#true} is VALID [2022-04-14 14:38:23,017 INFO L290 TraceCheckUtils]: 2: Hoare triple {3623#true} assume true; {3623#true} is VALID [2022-04-14 14:38:23,017 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3623#true} {3623#true} #91#return; {3623#true} is VALID [2022-04-14 14:38:23,017 INFO L272 TraceCheckUtils]: 4: Hoare triple {3623#true} call #t~ret5 := main(); {3623#true} is VALID [2022-04-14 14:38:23,017 INFO L290 TraceCheckUtils]: 5: Hoare triple {3623#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v1~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;~v5~0 := 0;~v6~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {3628#(= main_~l~0 0)} is VALID [2022-04-14 14:38:23,018 INFO L290 TraceCheckUtils]: 6: Hoare triple {3628#(= main_~l~0 0)} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {3628#(= main_~l~0 0)} is VALID [2022-04-14 14:38:23,018 INFO L290 TraceCheckUtils]: 7: Hoare triple {3628#(= main_~l~0 0)} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {3628#(= main_~l~0 0)} is VALID [2022-04-14 14:38:23,018 INFO L290 TraceCheckUtils]: 8: Hoare triple {3628#(= main_~l~0 0)} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 9 then ~l~0 % 4294967296 % 9 - 9 else ~l~0 % 4294967296 % 9) % 4294967296;~v6~0 := 1 + ~v6~0; {3628#(= main_~l~0 0)} is VALID [2022-04-14 14:38:23,019 INFO L290 TraceCheckUtils]: 9: Hoare triple {3628#(= main_~l~0 0)} ~l~0 := 1 + ~l~0; {3629#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-14 14:38:23,019 INFO L272 TraceCheckUtils]: 10: Hoare triple {3629#(and (<= 1 main_~l~0) (<= main_~l~0 1))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0 + ~v6~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {3623#true} is VALID [2022-04-14 14:38:23,019 INFO L290 TraceCheckUtils]: 11: Hoare triple {3623#true} ~cond := #in~cond; {3623#true} is VALID [2022-04-14 14:38:23,019 INFO L290 TraceCheckUtils]: 12: Hoare triple {3623#true} assume !(0 == ~cond); {3623#true} is VALID [2022-04-14 14:38:23,019 INFO L290 TraceCheckUtils]: 13: Hoare triple {3623#true} assume true; {3623#true} is VALID [2022-04-14 14:38:23,020 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {3623#true} {3629#(and (<= 1 main_~l~0) (<= main_~l~0 1))} #89#return; {3629#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-14 14:38:23,020 INFO L290 TraceCheckUtils]: 15: Hoare triple {3629#(and (<= 1 main_~l~0) (<= main_~l~0 1))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {3629#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-14 14:38:23,020 INFO L290 TraceCheckUtils]: 16: Hoare triple {3629#(and (<= 1 main_~l~0) (<= main_~l~0 1))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 9 then ~l~0 % 4294967296 % 9 - 9 else ~l~0 % 4294967296 % 9) % 4294967296); {3629#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-14 14:38:23,021 INFO L290 TraceCheckUtils]: 17: Hoare triple {3629#(and (<= 1 main_~l~0) (<= main_~l~0 1))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {3629#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-14 14:38:23,021 INFO L290 TraceCheckUtils]: 18: Hoare triple {3629#(and (<= 1 main_~l~0) (<= main_~l~0 1))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296); {3629#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-14 14:38:23,021 INFO L290 TraceCheckUtils]: 19: Hoare triple {3629#(and (<= 1 main_~l~0) (<= main_~l~0 1))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {3629#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-14 14:38:23,022 INFO L290 TraceCheckUtils]: 20: Hoare triple {3629#(and (<= 1 main_~l~0) (<= main_~l~0 1))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {3629#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-14 14:38:23,022 INFO L290 TraceCheckUtils]: 21: Hoare triple {3629#(and (<= 1 main_~l~0) (<= main_~l~0 1))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296); {3629#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-14 14:38:23,022 INFO L290 TraceCheckUtils]: 22: Hoare triple {3629#(and (<= 1 main_~l~0) (<= main_~l~0 1))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 3 then ~l~0 % 4294967296 % 3 - 3 else ~l~0 % 4294967296 % 3) % 4294967296); {3629#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-14 14:38:23,023 INFO L290 TraceCheckUtils]: 23: Hoare triple {3629#(and (<= 1 main_~l~0) (<= main_~l~0 1))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 2 then ~l~0 % 4294967296 % 2 - 2 else ~l~0 % 4294967296 % 2) % 4294967296;~j~0 := 1 + ~j~0; {3624#false} is VALID [2022-04-14 14:38:23,023 INFO L290 TraceCheckUtils]: 24: Hoare triple {3624#false} ~l~0 := 1 + ~l~0; {3624#false} is VALID [2022-04-14 14:38:23,023 INFO L272 TraceCheckUtils]: 25: Hoare triple {3624#false} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0 + ~v6~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {3624#false} is VALID [2022-04-14 14:38:23,023 INFO L290 TraceCheckUtils]: 26: Hoare triple {3624#false} ~cond := #in~cond; {3624#false} is VALID [2022-04-14 14:38:23,023 INFO L290 TraceCheckUtils]: 27: Hoare triple {3624#false} assume 0 == ~cond; {3624#false} is VALID [2022-04-14 14:38:23,024 INFO L290 TraceCheckUtils]: 28: Hoare triple {3624#false} assume !false; {3624#false} is VALID [2022-04-14 14:38:23,024 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 14:38:23,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 14:38:23,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379329194] [2022-04-14 14:38:23,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379329194] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-14 14:38:23,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1270473556] [2022-04-14 14:38:23,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 14:38:23,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 14:38:23,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 14:38:23,025 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 14:38:23,026 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-14 14:38:23,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:38:23,063 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-14 14:38:23,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:38:23,074 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 14:38:23,670 INFO L272 TraceCheckUtils]: 0: Hoare triple {3623#true} call ULTIMATE.init(); {3623#true} is VALID [2022-04-14 14:38:23,671 INFO L290 TraceCheckUtils]: 1: Hoare triple {3623#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {3623#true} is VALID [2022-04-14 14:38:23,671 INFO L290 TraceCheckUtils]: 2: Hoare triple {3623#true} assume true; {3623#true} is VALID [2022-04-14 14:38:23,671 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3623#true} {3623#true} #91#return; {3623#true} is VALID [2022-04-14 14:38:23,671 INFO L272 TraceCheckUtils]: 4: Hoare triple {3623#true} call #t~ret5 := main(); {3623#true} is VALID [2022-04-14 14:38:23,671 INFO L290 TraceCheckUtils]: 5: Hoare triple {3623#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v1~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;~v5~0 := 0;~v6~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {3653#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v6~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:38:23,672 INFO L290 TraceCheckUtils]: 6: Hoare triple {3653#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v6~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {3653#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v6~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:38:23,672 INFO L290 TraceCheckUtils]: 7: Hoare triple {3653#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v6~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {3653#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v6~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:38:23,673 INFO L290 TraceCheckUtils]: 8: Hoare triple {3653#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v6~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 9 then ~l~0 % 4294967296 % 9 - 9 else ~l~0 % 4294967296 % 9) % 4294967296;~v6~0 := 1 + ~v6~0; {3663#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:38:23,673 INFO L290 TraceCheckUtils]: 9: Hoare triple {3663#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {3667#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:38:23,673 INFO L272 TraceCheckUtils]: 10: Hoare triple {3667#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0 + ~v6~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {3623#true} is VALID [2022-04-14 14:38:23,673 INFO L290 TraceCheckUtils]: 11: Hoare triple {3623#true} ~cond := #in~cond; {3623#true} is VALID [2022-04-14 14:38:23,673 INFO L290 TraceCheckUtils]: 12: Hoare triple {3623#true} assume !(0 == ~cond); {3623#true} is VALID [2022-04-14 14:38:23,673 INFO L290 TraceCheckUtils]: 13: Hoare triple {3623#true} assume true; {3623#true} is VALID [2022-04-14 14:38:23,674 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {3623#true} {3667#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} #89#return; {3667#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:38:23,674 INFO L290 TraceCheckUtils]: 15: Hoare triple {3667#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {3667#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:38:23,675 INFO L290 TraceCheckUtils]: 16: Hoare triple {3667#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 9 then ~l~0 % 4294967296 % 9 - 9 else ~l~0 % 4294967296 % 9) % 4294967296); {3667#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:38:23,675 INFO L290 TraceCheckUtils]: 17: Hoare triple {3667#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {3667#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:38:23,676 INFO L290 TraceCheckUtils]: 18: Hoare triple {3667#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296); {3667#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:38:23,676 INFO L290 TraceCheckUtils]: 19: Hoare triple {3667#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {3667#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:38:23,676 INFO L290 TraceCheckUtils]: 20: Hoare triple {3667#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {3667#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:38:23,677 INFO L290 TraceCheckUtils]: 21: Hoare triple {3667#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296); {3667#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:38:23,677 INFO L290 TraceCheckUtils]: 22: Hoare triple {3667#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 3 then ~l~0 % 4294967296 % 3 - 3 else ~l~0 % 4294967296 % 3) % 4294967296); {3667#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:38:23,678 INFO L290 TraceCheckUtils]: 23: Hoare triple {3667#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 2 then ~l~0 % 4294967296 % 2 - 2 else ~l~0 % 4294967296 % 2) % 4294967296;~j~0 := 1 + ~j~0; {3710#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~j~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:38:23,678 INFO L290 TraceCheckUtils]: 24: Hoare triple {3710#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~j~0 1) (= main_~k~0 0) (= main_~v2~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {3714#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~j~0 1) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~v2~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:38:23,679 INFO L272 TraceCheckUtils]: 25: Hoare triple {3714#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~j~0 1) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~v2~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0 + ~v6~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {3718#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 14:38:23,679 INFO L290 TraceCheckUtils]: 26: Hoare triple {3718#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3722#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 14:38:23,679 INFO L290 TraceCheckUtils]: 27: Hoare triple {3722#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3624#false} is VALID [2022-04-14 14:38:23,679 INFO L290 TraceCheckUtils]: 28: Hoare triple {3624#false} assume !false; {3624#false} is VALID [2022-04-14 14:38:23,680 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 14:38:23,680 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 14:38:23,922 INFO L290 TraceCheckUtils]: 28: Hoare triple {3624#false} assume !false; {3624#false} is VALID [2022-04-14 14:38:23,922 INFO L290 TraceCheckUtils]: 27: Hoare triple {3722#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3624#false} is VALID [2022-04-14 14:38:23,923 INFO L290 TraceCheckUtils]: 26: Hoare triple {3718#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3722#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 14:38:23,924 INFO L272 TraceCheckUtils]: 25: Hoare triple {3738#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0 + ~v6~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {3718#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 14:38:23,925 INFO L290 TraceCheckUtils]: 24: Hoare triple {3742#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} ~l~0 := 1 + ~l~0; {3738#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:38:23,931 INFO L290 TraceCheckUtils]: 23: Hoare triple {3738#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 2 then ~l~0 % 4294967296 % 2 - 2 else ~l~0 % 4294967296 % 2) % 4294967296;~j~0 := 1 + ~j~0; {3742#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:38:23,931 INFO L290 TraceCheckUtils]: 22: Hoare triple {3738#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 3 then ~l~0 % 4294967296 % 3 - 3 else ~l~0 % 4294967296 % 3) % 4294967296); {3738#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:38:23,931 INFO L290 TraceCheckUtils]: 21: Hoare triple {3738#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296); {3738#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:38:23,932 INFO L290 TraceCheckUtils]: 20: Hoare triple {3738#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {3738#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:38:23,932 INFO L290 TraceCheckUtils]: 19: Hoare triple {3738#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {3738#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:38:23,932 INFO L290 TraceCheckUtils]: 18: Hoare triple {3738#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296); {3738#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:38:23,933 INFO L290 TraceCheckUtils]: 17: Hoare triple {3738#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {3738#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:38:23,933 INFO L290 TraceCheckUtils]: 16: Hoare triple {3738#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 9 then ~l~0 % 4294967296 % 9 - 9 else ~l~0 % 4294967296 % 9) % 4294967296); {3738#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:38:23,933 INFO L290 TraceCheckUtils]: 15: Hoare triple {3738#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {3738#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:38:23,934 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {3623#true} {3738#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} #89#return; {3738#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:38:23,934 INFO L290 TraceCheckUtils]: 13: Hoare triple {3623#true} assume true; {3623#true} is VALID [2022-04-14 14:38:23,934 INFO L290 TraceCheckUtils]: 12: Hoare triple {3623#true} assume !(0 == ~cond); {3623#true} is VALID [2022-04-14 14:38:23,934 INFO L290 TraceCheckUtils]: 11: Hoare triple {3623#true} ~cond := #in~cond; {3623#true} is VALID [2022-04-14 14:38:23,934 INFO L272 TraceCheckUtils]: 10: Hoare triple {3738#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0 + ~v6~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {3623#true} is VALID [2022-04-14 14:38:23,935 INFO L290 TraceCheckUtils]: 9: Hoare triple {3742#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} ~l~0 := 1 + ~l~0; {3738#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:38:26,045 WARN L290 TraceCheckUtils]: 8: Hoare triple {3738#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 9 then ~l~0 % 4294967296 % 9 - 9 else ~l~0 % 4294967296 % 9) % 4294967296;~v6~0 := 1 + ~v6~0; {3742#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is UNKNOWN [2022-04-14 14:38:26,046 INFO L290 TraceCheckUtils]: 7: Hoare triple {3738#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {3738#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:38:26,046 INFO L290 TraceCheckUtils]: 6: Hoare triple {3738#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {3738#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:38:26,047 INFO L290 TraceCheckUtils]: 5: Hoare triple {3623#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v1~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;~v5~0 := 0;~v6~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {3738#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:38:26,047 INFO L272 TraceCheckUtils]: 4: Hoare triple {3623#true} call #t~ret5 := main(); {3623#true} is VALID [2022-04-14 14:38:26,047 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3623#true} {3623#true} #91#return; {3623#true} is VALID [2022-04-14 14:38:26,047 INFO L290 TraceCheckUtils]: 2: Hoare triple {3623#true} assume true; {3623#true} is VALID [2022-04-14 14:38:26,048 INFO L290 TraceCheckUtils]: 1: Hoare triple {3623#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {3623#true} is VALID [2022-04-14 14:38:26,048 INFO L272 TraceCheckUtils]: 0: Hoare triple {3623#true} call ULTIMATE.init(); {3623#true} is VALID [2022-04-14 14:38:26,048 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-14 14:38:26,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1270473556] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-14 14:38:26,048 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-14 14:38:26,048 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5, 9] total 14 [2022-04-14 14:38:26,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70353614] [2022-04-14 14:38:26,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 14:38:26,049 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 29 [2022-04-14 14:38:26,049 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 14:38:26,049 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 14:38:28,192 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 26 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-14 14:38:28,192 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-14 14:38:28,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 14:38:28,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-14 14:38:28,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-04-14 14:38:28,193 INFO L87 Difference]: Start difference. First operand 85 states and 117 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 14:38:30,304 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:38:34,709 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:38:36,819 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:38:38,991 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:38:41,111 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:38:43,282 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:38:45,447 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:38:47,563 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:38:49,672 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:38:51,921 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:38:54,037 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:38:56,159 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:38:58,459 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:38:58,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:38:58,592 INFO L93 Difference]: Finished difference Result 116 states and 163 transitions. [2022-04-14 14:38:58,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-14 14:38:58,593 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 29 [2022-04-14 14:38:58,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 14:38:58,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 14:38:58,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 57 transitions. [2022-04-14 14:38:58,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 14:38:58,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 57 transitions. [2022-04-14 14:38:58,594 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 57 transitions. [2022-04-14 14:39:00,813 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 56 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-14 14:39:00,814 INFO L225 Difference]: With dead ends: 116 [2022-04-14 14:39:00,815 INFO L226 Difference]: Without dead ends: 114 [2022-04-14 14:39:00,815 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 51 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2022-04-14 14:39:00,815 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 5 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 3 mSolverCounterUnsat, 13 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 13 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 27.7s IncrementalHoareTripleChecker+Time [2022-04-14 14:39:00,815 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 56 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 80 Invalid, 13 Unknown, 0 Unchecked, 27.7s Time] [2022-04-14 14:39:00,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-04-14 14:39:00,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2022-04-14 14:39:00,863 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 14:39:00,864 INFO L82 GeneralOperation]: Start isEquivalent. First operand 114 states. Second operand has 114 states, 94 states have (on average 1.5106382978723405) internal successors, (142), 94 states have internal predecessors, (142), 10 states have call successors, (10), 10 states have call predecessors, (10), 9 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-14 14:39:00,864 INFO L74 IsIncluded]: Start isIncluded. First operand 114 states. Second operand has 114 states, 94 states have (on average 1.5106382978723405) internal successors, (142), 94 states have internal predecessors, (142), 10 states have call successors, (10), 10 states have call predecessors, (10), 9 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-14 14:39:00,865 INFO L87 Difference]: Start difference. First operand 114 states. Second operand has 114 states, 94 states have (on average 1.5106382978723405) internal successors, (142), 94 states have internal predecessors, (142), 10 states have call successors, (10), 10 states have call predecessors, (10), 9 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-14 14:39:00,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:39:00,866 INFO L93 Difference]: Finished difference Result 114 states and 161 transitions. [2022-04-14 14:39:00,866 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 161 transitions. [2022-04-14 14:39:00,866 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:39:00,866 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:39:00,867 INFO L74 IsIncluded]: Start isIncluded. First operand has 114 states, 94 states have (on average 1.5106382978723405) internal successors, (142), 94 states have internal predecessors, (142), 10 states have call successors, (10), 10 states have call predecessors, (10), 9 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 114 states. [2022-04-14 14:39:00,867 INFO L87 Difference]: Start difference. First operand has 114 states, 94 states have (on average 1.5106382978723405) internal successors, (142), 94 states have internal predecessors, (142), 10 states have call successors, (10), 10 states have call predecessors, (10), 9 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 114 states. [2022-04-14 14:39:00,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:39:00,868 INFO L93 Difference]: Finished difference Result 114 states and 161 transitions. [2022-04-14 14:39:00,868 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 161 transitions. [2022-04-14 14:39:00,869 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:39:00,869 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:39:00,869 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 14:39:00,869 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 14:39:00,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 94 states have (on average 1.5106382978723405) internal successors, (142), 94 states have internal predecessors, (142), 10 states have call successors, (10), 10 states have call predecessors, (10), 9 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-14 14:39:00,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 161 transitions. [2022-04-14 14:39:00,870 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 161 transitions. Word has length 29 [2022-04-14 14:39:00,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 14:39:00,871 INFO L478 AbstractCegarLoop]: Abstraction has 114 states and 161 transitions. [2022-04-14 14:39:00,871 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 14:39:00,871 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 161 transitions. [2022-04-14 14:39:00,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-14 14:39:00,871 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 14:39:00,871 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 14:39:00,889 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-14 14:39:01,079 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-14 14:39:01,079 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 14:39:01,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 14:39:01,080 INFO L85 PathProgramCache]: Analyzing trace with hash 630645509, now seen corresponding path program 1 times [2022-04-14 14:39:01,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 14:39:01,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692823885] [2022-04-14 14:39:01,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 14:39:01,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 14:39:01,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:39:01,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 14:39:01,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:39:01,328 INFO L290 TraceCheckUtils]: 0: Hoare triple {4354#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {4355#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-14 14:39:01,329 INFO L290 TraceCheckUtils]: 1: Hoare triple {4355#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} assume true; {4355#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-14 14:39:01,329 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4355#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {4335#true} #91#return; {4340#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-14 14:39:01,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-04-14 14:39:01,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:39:01,346 INFO L290 TraceCheckUtils]: 0: Hoare triple {4335#true} ~cond := #in~cond; {4335#true} is VALID [2022-04-14 14:39:01,346 INFO L290 TraceCheckUtils]: 1: Hoare triple {4335#true} assume !(0 == ~cond); {4335#true} is VALID [2022-04-14 14:39:01,346 INFO L290 TraceCheckUtils]: 2: Hoare triple {4335#true} assume true; {4335#true} is VALID [2022-04-14 14:39:01,346 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4335#true} {4343#(and (<= (+ main_~n~0 (* (div (+ (* (- 1) main_~l~0) 2) 2) 4294967296)) (+ 20000000 main_~l~0 (* (div main_~n~0 4294967296) 4294967296))) (<= main_~l~0 1))} #89#return; {4343#(and (<= (+ main_~n~0 (* (div (+ (* (- 1) main_~l~0) 2) 2) 4294967296)) (+ 20000000 main_~l~0 (* (div main_~n~0 4294967296) 4294967296))) (<= main_~l~0 1))} is VALID [2022-04-14 14:39:01,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-04-14 14:39:01,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:39:01,351 INFO L290 TraceCheckUtils]: 0: Hoare triple {4335#true} ~cond := #in~cond; {4335#true} is VALID [2022-04-14 14:39:01,351 INFO L290 TraceCheckUtils]: 1: Hoare triple {4335#true} assume !(0 == ~cond); {4335#true} is VALID [2022-04-14 14:39:01,351 INFO L290 TraceCheckUtils]: 2: Hoare triple {4335#true} assume true; {4335#true} is VALID [2022-04-14 14:39:01,351 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4335#true} {4348#(and (or (<= (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296) 4274967297) (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296))) (<= 2 (+ (* 2 (div main_~l~0 4294967296)) main_~l~0))) (<= (+ (* 715827883 (div main_~l~0 4294967296)) (* 715827883 (div (+ main_~l~0 (* (- 6) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) 0))} #89#return; {4348#(and (or (<= (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296) 4274967297) (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296))) (<= 2 (+ (* 2 (div main_~l~0 4294967296)) main_~l~0))) (<= (+ (* 715827883 (div main_~l~0 4294967296)) (* 715827883 (div (+ main_~l~0 (* (- 6) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) 0))} is VALID [2022-04-14 14:39:01,352 INFO L272 TraceCheckUtils]: 0: Hoare triple {4335#true} call ULTIMATE.init(); {4354#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 14:39:01,352 INFO L290 TraceCheckUtils]: 1: Hoare triple {4354#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {4355#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-14 14:39:01,352 INFO L290 TraceCheckUtils]: 2: Hoare triple {4355#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} assume true; {4355#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-14 14:39:01,353 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4355#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {4335#true} #91#return; {4340#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-14 14:39:01,353 INFO L272 TraceCheckUtils]: 4: Hoare triple {4340#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} call #t~ret5 := main(); {4340#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-14 14:39:01,354 INFO L290 TraceCheckUtils]: 5: Hoare triple {4340#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v1~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;~v5~0 := 0;~v6~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {4341#(and (<= ~SIZE~0 20000001) (= main_~l~0 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-14 14:39:01,354 INFO L290 TraceCheckUtils]: 6: Hoare triple {4341#(and (<= ~SIZE~0 20000001) (= main_~l~0 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {4342#(and (= main_~l~0 0) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-14 14:39:01,355 INFO L290 TraceCheckUtils]: 7: Hoare triple {4342#(and (= main_~l~0 0) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {4342#(and (= main_~l~0 0) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-14 14:39:01,355 INFO L290 TraceCheckUtils]: 8: Hoare triple {4342#(and (= main_~l~0 0) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 9 then ~l~0 % 4294967296 % 9 - 9 else ~l~0 % 4294967296 % 9) % 4294967296;~v6~0 := 1 + ~v6~0; {4342#(and (= main_~l~0 0) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-14 14:39:01,356 INFO L290 TraceCheckUtils]: 9: Hoare triple {4342#(and (= main_~l~0 0) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))))} ~l~0 := 1 + ~l~0; {4343#(and (<= (+ main_~n~0 (* (div (+ (* (- 1) main_~l~0) 2) 2) 4294967296)) (+ 20000000 main_~l~0 (* (div main_~n~0 4294967296) 4294967296))) (<= main_~l~0 1))} is VALID [2022-04-14 14:39:01,356 INFO L272 TraceCheckUtils]: 10: Hoare triple {4343#(and (<= (+ main_~n~0 (* (div (+ (* (- 1) main_~l~0) 2) 2) 4294967296)) (+ 20000000 main_~l~0 (* (div main_~n~0 4294967296) 4294967296))) (<= main_~l~0 1))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0 + ~v6~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {4335#true} is VALID [2022-04-14 14:39:01,356 INFO L290 TraceCheckUtils]: 11: Hoare triple {4335#true} ~cond := #in~cond; {4335#true} is VALID [2022-04-14 14:39:01,356 INFO L290 TraceCheckUtils]: 12: Hoare triple {4335#true} assume !(0 == ~cond); {4335#true} is VALID [2022-04-14 14:39:01,356 INFO L290 TraceCheckUtils]: 13: Hoare triple {4335#true} assume true; {4335#true} is VALID [2022-04-14 14:39:01,356 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {4335#true} {4343#(and (<= (+ main_~n~0 (* (div (+ (* (- 1) main_~l~0) 2) 2) 4294967296)) (+ 20000000 main_~l~0 (* (div main_~n~0 4294967296) 4294967296))) (<= main_~l~0 1))} #89#return; {4343#(and (<= (+ main_~n~0 (* (div (+ (* (- 1) main_~l~0) 2) 2) 4294967296)) (+ 20000000 main_~l~0 (* (div main_~n~0 4294967296) 4294967296))) (<= main_~l~0 1))} is VALID [2022-04-14 14:39:01,357 INFO L290 TraceCheckUtils]: 15: Hoare triple {4343#(and (<= (+ main_~n~0 (* (div (+ (* (- 1) main_~l~0) 2) 2) 4294967296)) (+ 20000000 main_~l~0 (* (div main_~n~0 4294967296) 4294967296))) (<= main_~l~0 1))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {4343#(and (<= (+ main_~n~0 (* (div (+ (* (- 1) main_~l~0) 2) 2) 4294967296)) (+ 20000000 main_~l~0 (* (div main_~n~0 4294967296) 4294967296))) (<= main_~l~0 1))} is VALID [2022-04-14 14:39:01,357 INFO L290 TraceCheckUtils]: 16: Hoare triple {4343#(and (<= (+ main_~n~0 (* (div (+ (* (- 1) main_~l~0) 2) 2) 4294967296)) (+ 20000000 main_~l~0 (* (div main_~n~0 4294967296) 4294967296))) (<= main_~l~0 1))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 9 then ~l~0 % 4294967296 % 9 - 9 else ~l~0 % 4294967296 % 9) % 4294967296); {4343#(and (<= (+ main_~n~0 (* (div (+ (* (- 1) main_~l~0) 2) 2) 4294967296)) (+ 20000000 main_~l~0 (* (div main_~n~0 4294967296) 4294967296))) (<= main_~l~0 1))} is VALID [2022-04-14 14:39:01,357 INFO L290 TraceCheckUtils]: 17: Hoare triple {4343#(and (<= (+ main_~n~0 (* (div (+ (* (- 1) main_~l~0) 2) 2) 4294967296)) (+ 20000000 main_~l~0 (* (div main_~n~0 4294967296) 4294967296))) (<= main_~l~0 1))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {4343#(and (<= (+ main_~n~0 (* (div (+ (* (- 1) main_~l~0) 2) 2) 4294967296)) (+ 20000000 main_~l~0 (* (div main_~n~0 4294967296) 4294967296))) (<= main_~l~0 1))} is VALID [2022-04-14 14:39:01,358 INFO L290 TraceCheckUtils]: 18: Hoare triple {4343#(and (<= (+ main_~n~0 (* (div (+ (* (- 1) main_~l~0) 2) 2) 4294967296)) (+ 20000000 main_~l~0 (* (div main_~n~0 4294967296) 4294967296))) (<= main_~l~0 1))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296;~v1~0 := 1 + ~v1~0; {4343#(and (<= (+ main_~n~0 (* (div (+ (* (- 1) main_~l~0) 2) 2) 4294967296)) (+ 20000000 main_~l~0 (* (div main_~n~0 4294967296) 4294967296))) (<= main_~l~0 1))} is VALID [2022-04-14 14:39:01,361 INFO L290 TraceCheckUtils]: 19: Hoare triple {4343#(and (<= (+ main_~n~0 (* (div (+ (* (- 1) main_~l~0) 2) 2) 4294967296)) (+ 20000000 main_~l~0 (* (div main_~n~0 4294967296) 4294967296))) (<= main_~l~0 1))} ~l~0 := 1 + ~l~0; {4348#(and (or (<= (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296) 4274967297) (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296))) (<= 2 (+ (* 2 (div main_~l~0 4294967296)) main_~l~0))) (<= (+ (* 715827883 (div main_~l~0 4294967296)) (* 715827883 (div (+ main_~l~0 (* (- 6) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) 0))} is VALID [2022-04-14 14:39:01,361 INFO L272 TraceCheckUtils]: 20: Hoare triple {4348#(and (or (<= (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296) 4274967297) (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296))) (<= 2 (+ (* 2 (div main_~l~0 4294967296)) main_~l~0))) (<= (+ (* 715827883 (div main_~l~0 4294967296)) (* 715827883 (div (+ main_~l~0 (* (- 6) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0 + ~v6~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {4335#true} is VALID [2022-04-14 14:39:01,361 INFO L290 TraceCheckUtils]: 21: Hoare triple {4335#true} ~cond := #in~cond; {4335#true} is VALID [2022-04-14 14:39:01,361 INFO L290 TraceCheckUtils]: 22: Hoare triple {4335#true} assume !(0 == ~cond); {4335#true} is VALID [2022-04-14 14:39:01,361 INFO L290 TraceCheckUtils]: 23: Hoare triple {4335#true} assume true; {4335#true} is VALID [2022-04-14 14:39:01,361 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {4335#true} {4348#(and (or (<= (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296) 4274967297) (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296))) (<= 2 (+ (* 2 (div main_~l~0 4294967296)) main_~l~0))) (<= (+ (* 715827883 (div main_~l~0 4294967296)) (* 715827883 (div (+ main_~l~0 (* (- 6) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) 0))} #89#return; {4348#(and (or (<= (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296) 4274967297) (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296))) (<= 2 (+ (* 2 (div main_~l~0 4294967296)) main_~l~0))) (<= (+ (* 715827883 (div main_~l~0 4294967296)) (* 715827883 (div (+ main_~l~0 (* (- 6) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) 0))} is VALID [2022-04-14 14:39:01,362 INFO L290 TraceCheckUtils]: 25: Hoare triple {4348#(and (or (<= (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296) 4274967297) (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296))) (<= 2 (+ (* 2 (div main_~l~0 4294967296)) main_~l~0))) (<= (+ (* 715827883 (div main_~l~0 4294967296)) (* 715827883 (div (+ main_~l~0 (* (- 6) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {4353#(and (<= 2 (+ (* 2 (div main_~l~0 4294967296)) main_~l~0)) (<= (+ (* 715827883 (div main_~l~0 4294967296)) (* 715827883 (div (+ main_~l~0 (* (- 6) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) 0))} is VALID [2022-04-14 14:39:01,363 INFO L290 TraceCheckUtils]: 26: Hoare triple {4353#(and (<= 2 (+ (* 2 (div main_~l~0 4294967296)) main_~l~0)) (<= (+ (* 715827883 (div main_~l~0 4294967296)) (* 715827883 (div (+ main_~l~0 (* (- 6) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 9 then ~l~0 % 4294967296 % 9 - 9 else ~l~0 % 4294967296 % 9) % 4294967296); {4353#(and (<= 2 (+ (* 2 (div main_~l~0 4294967296)) main_~l~0)) (<= (+ (* 715827883 (div main_~l~0 4294967296)) (* 715827883 (div (+ main_~l~0 (* (- 6) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) 0))} is VALID [2022-04-14 14:39:01,363 INFO L290 TraceCheckUtils]: 27: Hoare triple {4353#(and (<= 2 (+ (* 2 (div main_~l~0 4294967296)) main_~l~0)) (<= (+ (* 715827883 (div main_~l~0 4294967296)) (* 715827883 (div (+ main_~l~0 (* (- 6) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {4353#(and (<= 2 (+ (* 2 (div main_~l~0 4294967296)) main_~l~0)) (<= (+ (* 715827883 (div main_~l~0 4294967296)) (* 715827883 (div (+ main_~l~0 (* (- 6) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) 0))} is VALID [2022-04-14 14:39:01,364 INFO L290 TraceCheckUtils]: 28: Hoare triple {4353#(and (<= 2 (+ (* 2 (div main_~l~0 4294967296)) main_~l~0)) (<= (+ (* 715827883 (div main_~l~0 4294967296)) (* 715827883 (div (+ main_~l~0 (* (- 6) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296); {4353#(and (<= 2 (+ (* 2 (div main_~l~0 4294967296)) main_~l~0)) (<= (+ (* 715827883 (div main_~l~0 4294967296)) (* 715827883 (div (+ main_~l~0 (* (- 6) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) 0))} is VALID [2022-04-14 14:39:01,365 INFO L290 TraceCheckUtils]: 29: Hoare triple {4353#(and (<= 2 (+ (* 2 (div main_~l~0 4294967296)) main_~l~0)) (<= (+ (* 715827883 (div main_~l~0 4294967296)) (* 715827883 (div (+ main_~l~0 (* (- 6) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296;~v2~0 := 1 + ~v2~0; {4336#false} is VALID [2022-04-14 14:39:01,365 INFO L290 TraceCheckUtils]: 30: Hoare triple {4336#false} ~l~0 := 1 + ~l~0; {4336#false} is VALID [2022-04-14 14:39:01,365 INFO L272 TraceCheckUtils]: 31: Hoare triple {4336#false} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0 + ~v6~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {4336#false} is VALID [2022-04-14 14:39:01,366 INFO L290 TraceCheckUtils]: 32: Hoare triple {4336#false} ~cond := #in~cond; {4336#false} is VALID [2022-04-14 14:39:01,366 INFO L290 TraceCheckUtils]: 33: Hoare triple {4336#false} assume 0 == ~cond; {4336#false} is VALID [2022-04-14 14:39:01,366 INFO L290 TraceCheckUtils]: 34: Hoare triple {4336#false} assume !false; {4336#false} is VALID [2022-04-14 14:39:01,366 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-14 14:39:01,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 14:39:01,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692823885] [2022-04-14 14:39:01,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692823885] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-14 14:39:01,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1877180863] [2022-04-14 14:39:01,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 14:39:01,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 14:39:01,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 14:39:01,367 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 14:39:01,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-14 14:39:01,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:39:01,405 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-14 14:39:01,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:39:01,412 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 14:39:02,200 INFO L272 TraceCheckUtils]: 0: Hoare triple {4335#true} call ULTIMATE.init(); {4335#true} is VALID [2022-04-14 14:39:02,200 INFO L290 TraceCheckUtils]: 1: Hoare triple {4335#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {4335#true} is VALID [2022-04-14 14:39:02,200 INFO L290 TraceCheckUtils]: 2: Hoare triple {4335#true} assume true; {4335#true} is VALID [2022-04-14 14:39:02,200 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4335#true} {4335#true} #91#return; {4335#true} is VALID [2022-04-14 14:39:02,200 INFO L272 TraceCheckUtils]: 4: Hoare triple {4335#true} call #t~ret5 := main(); {4335#true} is VALID [2022-04-14 14:39:02,201 INFO L290 TraceCheckUtils]: 5: Hoare triple {4335#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v1~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;~v5~0 := 0;~v6~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {4374#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v6~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:39:02,201 INFO L290 TraceCheckUtils]: 6: Hoare triple {4374#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v6~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {4374#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v6~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:39:02,202 INFO L290 TraceCheckUtils]: 7: Hoare triple {4374#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v6~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {4374#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v6~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:39:02,202 INFO L290 TraceCheckUtils]: 8: Hoare triple {4374#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v6~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 9 then ~l~0 % 4294967296 % 9 - 9 else ~l~0 % 4294967296 % 9) % 4294967296;~v6~0 := 1 + ~v6~0; {4384#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:39:02,202 INFO L290 TraceCheckUtils]: 9: Hoare triple {4384#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {4388#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:39:02,202 INFO L272 TraceCheckUtils]: 10: Hoare triple {4388#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0 + ~v6~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {4335#true} is VALID [2022-04-14 14:39:02,203 INFO L290 TraceCheckUtils]: 11: Hoare triple {4335#true} ~cond := #in~cond; {4335#true} is VALID [2022-04-14 14:39:02,203 INFO L290 TraceCheckUtils]: 12: Hoare triple {4335#true} assume !(0 == ~cond); {4335#true} is VALID [2022-04-14 14:39:02,203 INFO L290 TraceCheckUtils]: 13: Hoare triple {4335#true} assume true; {4335#true} is VALID [2022-04-14 14:39:02,203 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {4335#true} {4388#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} #89#return; {4388#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:39:02,204 INFO L290 TraceCheckUtils]: 15: Hoare triple {4388#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {4388#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:39:02,204 INFO L290 TraceCheckUtils]: 16: Hoare triple {4388#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 9 then ~l~0 % 4294967296 % 9 - 9 else ~l~0 % 4294967296 % 9) % 4294967296); {4388#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:39:02,205 INFO L290 TraceCheckUtils]: 17: Hoare triple {4388#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {4388#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:39:02,205 INFO L290 TraceCheckUtils]: 18: Hoare triple {4388#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296;~v1~0 := 1 + ~v1~0; {4416#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:39:02,205 INFO L290 TraceCheckUtils]: 19: Hoare triple {4416#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {4420#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~l~0 2) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:39:02,206 INFO L272 TraceCheckUtils]: 20: Hoare triple {4420#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~l~0 2) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0 + ~v6~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {4335#true} is VALID [2022-04-14 14:39:02,206 INFO L290 TraceCheckUtils]: 21: Hoare triple {4335#true} ~cond := #in~cond; {4335#true} is VALID [2022-04-14 14:39:02,206 INFO L290 TraceCheckUtils]: 22: Hoare triple {4335#true} assume !(0 == ~cond); {4335#true} is VALID [2022-04-14 14:39:02,206 INFO L290 TraceCheckUtils]: 23: Hoare triple {4335#true} assume true; {4335#true} is VALID [2022-04-14 14:39:02,208 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {4335#true} {4420#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~l~0 2) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} #89#return; {4420#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~l~0 2) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:39:02,208 INFO L290 TraceCheckUtils]: 25: Hoare triple {4420#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~l~0 2) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {4420#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~l~0 2) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:39:02,209 INFO L290 TraceCheckUtils]: 26: Hoare triple {4420#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~l~0 2) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 9 then ~l~0 % 4294967296 % 9 - 9 else ~l~0 % 4294967296 % 9) % 4294967296); {4420#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~l~0 2) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:39:02,209 INFO L290 TraceCheckUtils]: 27: Hoare triple {4420#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~l~0 2) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {4420#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~l~0 2) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:39:02,209 INFO L290 TraceCheckUtils]: 28: Hoare triple {4420#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~l~0 2) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296); {4420#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~l~0 2) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:39:02,210 INFO L290 TraceCheckUtils]: 29: Hoare triple {4420#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~l~0 2) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296;~v2~0 := 1 + ~v2~0; {4451#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:39:02,210 INFO L290 TraceCheckUtils]: 30: Hoare triple {4451#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {4455#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 3) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:39:02,211 INFO L272 TraceCheckUtils]: 31: Hoare triple {4455#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~l~0 3) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0 + ~v6~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {4459#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 14:39:02,212 INFO L290 TraceCheckUtils]: 32: Hoare triple {4459#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4463#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 14:39:02,212 INFO L290 TraceCheckUtils]: 33: Hoare triple {4463#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4336#false} is VALID [2022-04-14 14:39:02,212 INFO L290 TraceCheckUtils]: 34: Hoare triple {4336#false} assume !false; {4336#false} is VALID [2022-04-14 14:39:02,212 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-14 14:39:02,213 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 14:39:02,610 INFO L290 TraceCheckUtils]: 34: Hoare triple {4336#false} assume !false; {4336#false} is VALID [2022-04-14 14:39:02,613 INFO L290 TraceCheckUtils]: 33: Hoare triple {4463#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4336#false} is VALID [2022-04-14 14:39:02,613 INFO L290 TraceCheckUtils]: 32: Hoare triple {4459#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4463#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 14:39:02,614 INFO L272 TraceCheckUtils]: 31: Hoare triple {4479#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0 + ~v6~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {4459#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 14:39:02,615 INFO L290 TraceCheckUtils]: 30: Hoare triple {4483#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} ~l~0 := 1 + ~l~0; {4479#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:39:04,726 WARN L290 TraceCheckUtils]: 29: Hoare triple {4479#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296;~v2~0 := 1 + ~v2~0; {4483#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is UNKNOWN [2022-04-14 14:39:04,727 INFO L290 TraceCheckUtils]: 28: Hoare triple {4479#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296); {4479#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:39:04,727 INFO L290 TraceCheckUtils]: 27: Hoare triple {4479#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {4479#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:39:04,728 INFO L290 TraceCheckUtils]: 26: Hoare triple {4479#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 9 then ~l~0 % 4294967296 % 9 - 9 else ~l~0 % 4294967296 % 9) % 4294967296); {4479#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:39:04,728 INFO L290 TraceCheckUtils]: 25: Hoare triple {4479#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {4479#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:39:04,729 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {4335#true} {4479#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} #89#return; {4479#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:39:04,729 INFO L290 TraceCheckUtils]: 23: Hoare triple {4335#true} assume true; {4335#true} is VALID [2022-04-14 14:39:04,729 INFO L290 TraceCheckUtils]: 22: Hoare triple {4335#true} assume !(0 == ~cond); {4335#true} is VALID [2022-04-14 14:39:04,729 INFO L290 TraceCheckUtils]: 21: Hoare triple {4335#true} ~cond := #in~cond; {4335#true} is VALID [2022-04-14 14:39:04,729 INFO L272 TraceCheckUtils]: 20: Hoare triple {4479#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0 + ~v6~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {4335#true} is VALID [2022-04-14 14:39:04,732 INFO L290 TraceCheckUtils]: 19: Hoare triple {4483#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} ~l~0 := 1 + ~l~0; {4479#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:39:06,842 WARN L290 TraceCheckUtils]: 18: Hoare triple {4479#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296;~v1~0 := 1 + ~v1~0; {4483#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is UNKNOWN [2022-04-14 14:39:06,843 INFO L290 TraceCheckUtils]: 17: Hoare triple {4479#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {4479#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:39:06,843 INFO L290 TraceCheckUtils]: 16: Hoare triple {4479#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 9 then ~l~0 % 4294967296 % 9 - 9 else ~l~0 % 4294967296 % 9) % 4294967296); {4479#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:39:06,844 INFO L290 TraceCheckUtils]: 15: Hoare triple {4479#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {4479#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:39:06,844 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {4335#true} {4479#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} #89#return; {4479#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:39:06,844 INFO L290 TraceCheckUtils]: 13: Hoare triple {4335#true} assume true; {4335#true} is VALID [2022-04-14 14:39:06,845 INFO L290 TraceCheckUtils]: 12: Hoare triple {4335#true} assume !(0 == ~cond); {4335#true} is VALID [2022-04-14 14:39:06,845 INFO L290 TraceCheckUtils]: 11: Hoare triple {4335#true} ~cond := #in~cond; {4335#true} is VALID [2022-04-14 14:39:06,845 INFO L272 TraceCheckUtils]: 10: Hoare triple {4479#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0 + ~v6~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {4335#true} is VALID [2022-04-14 14:39:06,848 INFO L290 TraceCheckUtils]: 9: Hoare triple {4483#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} ~l~0 := 1 + ~l~0; {4479#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:39:08,958 WARN L290 TraceCheckUtils]: 8: Hoare triple {4479#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 9 then ~l~0 % 4294967296 % 9 - 9 else ~l~0 % 4294967296 % 9) % 4294967296;~v6~0 := 1 + ~v6~0; {4483#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is UNKNOWN [2022-04-14 14:39:08,959 INFO L290 TraceCheckUtils]: 7: Hoare triple {4479#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {4479#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:39:08,959 INFO L290 TraceCheckUtils]: 6: Hoare triple {4479#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {4479#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:39:08,961 INFO L290 TraceCheckUtils]: 5: Hoare triple {4335#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v1~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;~v5~0 := 0;~v6~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {4479#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:39:08,961 INFO L272 TraceCheckUtils]: 4: Hoare triple {4335#true} call #t~ret5 := main(); {4335#true} is VALID [2022-04-14 14:39:08,961 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4335#true} {4335#true} #91#return; {4335#true} is VALID [2022-04-14 14:39:08,961 INFO L290 TraceCheckUtils]: 2: Hoare triple {4335#true} assume true; {4335#true} is VALID [2022-04-14 14:39:08,961 INFO L290 TraceCheckUtils]: 1: Hoare triple {4335#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {4335#true} is VALID [2022-04-14 14:39:08,961 INFO L272 TraceCheckUtils]: 0: Hoare triple {4335#true} call ULTIMATE.init(); {4335#true} is VALID [2022-04-14 14:39:08,962 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-04-14 14:39:08,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1877180863] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-14 14:39:08,962 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-14 14:39:08,962 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10, 11] total 21 [2022-04-14 14:39:08,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514964488] [2022-04-14 14:39:08,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 14:39:08,962 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 35 [2022-04-14 14:39:08,963 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 14:39:08,963 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 14:39:15,319 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 21 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-14 14:39:15,319 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-14 14:39:15,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 14:39:15,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-14 14:39:15,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=365, Unknown=0, NotChecked=0, Total=420 [2022-04-14 14:39:15,320 INFO L87 Difference]: Start difference. First operand 114 states and 161 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 14:39:17,425 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:39:19,658 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:39:21,848 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:39:28,362 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:39:30,527 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:39:39,221 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:39:41,383 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:39:45,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:39:45,902 INFO L93 Difference]: Finished difference Result 127 states and 178 transitions. [2022-04-14 14:39:45,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-14 14:39:45,902 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 35 [2022-04-14 14:39:45,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 14:39:45,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 14:39:45,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 49 transitions. [2022-04-14 14:39:45,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 14:39:45,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 49 transitions. [2022-04-14 14:39:45,904 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 49 transitions. [2022-04-14 14:39:52,307 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 46 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-14 14:39:52,309 INFO L225 Difference]: With dead ends: 127 [2022-04-14 14:39:52,309 INFO L226 Difference]: Without dead ends: 125 [2022-04-14 14:39:52,309 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 61 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2022-04-14 14:39:52,309 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 5 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 1 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.6s IncrementalHoareTripleChecker+Time [2022-04-14 14:39:52,310 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 77 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 66 Invalid, 7 Unknown, 0 Unchecked, 14.6s Time] [2022-04-14 14:39:52,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-04-14 14:39:52,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 104. [2022-04-14 14:39:52,353 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 14:39:52,353 INFO L82 GeneralOperation]: Start isEquivalent. First operand 125 states. Second operand has 104 states, 86 states have (on average 1.5232558139534884) internal successors, (131), 86 states have internal predecessors, (131), 9 states have call successors, (9), 9 states have call predecessors, (9), 8 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-14 14:39:52,354 INFO L74 IsIncluded]: Start isIncluded. First operand 125 states. Second operand has 104 states, 86 states have (on average 1.5232558139534884) internal successors, (131), 86 states have internal predecessors, (131), 9 states have call successors, (9), 9 states have call predecessors, (9), 8 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-14 14:39:52,354 INFO L87 Difference]: Start difference. First operand 125 states. Second operand has 104 states, 86 states have (on average 1.5232558139534884) internal successors, (131), 86 states have internal predecessors, (131), 9 states have call successors, (9), 9 states have call predecessors, (9), 8 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-14 14:39:52,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:39:52,355 INFO L93 Difference]: Finished difference Result 125 states and 176 transitions. [2022-04-14 14:39:52,356 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 176 transitions. [2022-04-14 14:39:52,356 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:39:52,356 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:39:52,356 INFO L74 IsIncluded]: Start isIncluded. First operand has 104 states, 86 states have (on average 1.5232558139534884) internal successors, (131), 86 states have internal predecessors, (131), 9 states have call successors, (9), 9 states have call predecessors, (9), 8 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 125 states. [2022-04-14 14:39:52,356 INFO L87 Difference]: Start difference. First operand has 104 states, 86 states have (on average 1.5232558139534884) internal successors, (131), 86 states have internal predecessors, (131), 9 states have call successors, (9), 9 states have call predecessors, (9), 8 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 125 states. [2022-04-14 14:39:52,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:39:52,358 INFO L93 Difference]: Finished difference Result 125 states and 176 transitions. [2022-04-14 14:39:52,358 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 176 transitions. [2022-04-14 14:39:52,358 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:39:52,358 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:39:52,358 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 14:39:52,358 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 14:39:52,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 86 states have (on average 1.5232558139534884) internal successors, (131), 86 states have internal predecessors, (131), 9 states have call successors, (9), 9 states have call predecessors, (9), 8 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-14 14:39:52,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 148 transitions. [2022-04-14 14:39:52,360 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 148 transitions. Word has length 35 [2022-04-14 14:39:52,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 14:39:52,360 INFO L478 AbstractCegarLoop]: Abstraction has 104 states and 148 transitions. [2022-04-14 14:39:52,360 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 14:39:52,360 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 148 transitions. [2022-04-14 14:39:52,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-14 14:39:52,360 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 14:39:52,361 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 14:39:52,377 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-14 14:39:52,575 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 14:39:52,575 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 14:39:52,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 14:39:52,576 INFO L85 PathProgramCache]: Analyzing trace with hash -714688353, now seen corresponding path program 1 times [2022-04-14 14:39:52,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 14:39:52,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371243701] [2022-04-14 14:39:52,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 14:39:52,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 14:39:52,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:39:52,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 14:39:52,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:39:52,821 INFO L290 TraceCheckUtils]: 0: Hoare triple {5135#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {5136#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-14 14:39:52,821 INFO L290 TraceCheckUtils]: 1: Hoare triple {5136#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} assume true; {5136#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-14 14:39:52,822 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5136#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {5117#true} #91#return; {5122#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-14 14:39:52,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-04-14 14:39:52,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:39:52,827 INFO L290 TraceCheckUtils]: 0: Hoare triple {5117#true} ~cond := #in~cond; {5117#true} is VALID [2022-04-14 14:39:52,827 INFO L290 TraceCheckUtils]: 1: Hoare triple {5117#true} assume !(0 == ~cond); {5117#true} is VALID [2022-04-14 14:39:52,827 INFO L290 TraceCheckUtils]: 2: Hoare triple {5117#true} assume true; {5117#true} is VALID [2022-04-14 14:39:52,828 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5117#true} {5125#(and (<= (+ (* (div main_~l~0 4294967296) 613566757) (* 613566757 (div (+ main_~l~0 (* (- 7) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) 0) (or (<= (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296) 4274967296) (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296))) (<= 1 (+ (* 3 (div main_~l~0 4294967296)) main_~l~0))))} #89#return; {5125#(and (<= (+ (* (div main_~l~0 4294967296) 613566757) (* 613566757 (div (+ main_~l~0 (* (- 7) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) 0) (or (<= (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296) 4274967296) (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296))) (<= 1 (+ (* 3 (div main_~l~0 4294967296)) main_~l~0))))} is VALID [2022-04-14 14:39:52,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-04-14 14:39:52,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:39:52,832 INFO L290 TraceCheckUtils]: 0: Hoare triple {5117#true} ~cond := #in~cond; {5117#true} is VALID [2022-04-14 14:39:52,832 INFO L290 TraceCheckUtils]: 1: Hoare triple {5117#true} assume !(0 == ~cond); {5117#true} is VALID [2022-04-14 14:39:52,832 INFO L290 TraceCheckUtils]: 2: Hoare triple {5117#true} assume true; {5117#true} is VALID [2022-04-14 14:39:52,832 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5117#true} {5118#false} #89#return; {5118#false} is VALID [2022-04-14 14:39:52,832 INFO L272 TraceCheckUtils]: 0: Hoare triple {5117#true} call ULTIMATE.init(); {5135#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 14:39:52,833 INFO L290 TraceCheckUtils]: 1: Hoare triple {5135#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {5136#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-14 14:39:52,833 INFO L290 TraceCheckUtils]: 2: Hoare triple {5136#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} assume true; {5136#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-14 14:39:52,834 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5136#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {5117#true} #91#return; {5122#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-14 14:39:52,834 INFO L272 TraceCheckUtils]: 4: Hoare triple {5122#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} call #t~ret5 := main(); {5122#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-14 14:39:52,835 INFO L290 TraceCheckUtils]: 5: Hoare triple {5122#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v1~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;~v5~0 := 0;~v6~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {5123#(and (<= ~SIZE~0 20000001) (= main_~l~0 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-14 14:39:52,836 INFO L290 TraceCheckUtils]: 6: Hoare triple {5123#(and (<= ~SIZE~0 20000001) (= main_~l~0 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {5124#(and (= main_~l~0 0) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-14 14:39:52,836 INFO L290 TraceCheckUtils]: 7: Hoare triple {5124#(and (= main_~l~0 0) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {5124#(and (= main_~l~0 0) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-14 14:39:52,836 INFO L290 TraceCheckUtils]: 8: Hoare triple {5124#(and (= main_~l~0 0) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 9 then ~l~0 % 4294967296 % 9 - 9 else ~l~0 % 4294967296 % 9) % 4294967296;~v6~0 := 1 + ~v6~0; {5124#(and (= main_~l~0 0) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-14 14:39:52,837 INFO L290 TraceCheckUtils]: 9: Hoare triple {5124#(and (= main_~l~0 0) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))))} ~l~0 := 1 + ~l~0; {5125#(and (<= (+ (* (div main_~l~0 4294967296) 613566757) (* 613566757 (div (+ main_~l~0 (* (- 7) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) 0) (or (<= (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296) 4274967296) (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296))) (<= 1 (+ (* 3 (div main_~l~0 4294967296)) main_~l~0))))} is VALID [2022-04-14 14:39:52,837 INFO L272 TraceCheckUtils]: 10: Hoare triple {5125#(and (<= (+ (* (div main_~l~0 4294967296) 613566757) (* 613566757 (div (+ main_~l~0 (* (- 7) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) 0) (or (<= (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296) 4274967296) (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296))) (<= 1 (+ (* 3 (div main_~l~0 4294967296)) main_~l~0))))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0 + ~v6~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {5117#true} is VALID [2022-04-14 14:39:52,837 INFO L290 TraceCheckUtils]: 11: Hoare triple {5117#true} ~cond := #in~cond; {5117#true} is VALID [2022-04-14 14:39:52,837 INFO L290 TraceCheckUtils]: 12: Hoare triple {5117#true} assume !(0 == ~cond); {5117#true} is VALID [2022-04-14 14:39:52,837 INFO L290 TraceCheckUtils]: 13: Hoare triple {5117#true} assume true; {5117#true} is VALID [2022-04-14 14:39:52,838 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {5117#true} {5125#(and (<= (+ (* (div main_~l~0 4294967296) 613566757) (* 613566757 (div (+ main_~l~0 (* (- 7) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) 0) (or (<= (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296) 4274967296) (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296))) (<= 1 (+ (* 3 (div main_~l~0 4294967296)) main_~l~0))))} #89#return; {5125#(and (<= (+ (* (div main_~l~0 4294967296) 613566757) (* 613566757 (div (+ main_~l~0 (* (- 7) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) 0) (or (<= (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296) 4274967296) (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296))) (<= 1 (+ (* 3 (div main_~l~0 4294967296)) main_~l~0))))} is VALID [2022-04-14 14:39:52,839 INFO L290 TraceCheckUtils]: 15: Hoare triple {5125#(and (<= (+ (* (div main_~l~0 4294967296) 613566757) (* 613566757 (div (+ main_~l~0 (* (- 7) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) 0) (or (<= (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296) 4274967296) (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296))) (<= 1 (+ (* 3 (div main_~l~0 4294967296)) main_~l~0))))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {5130#(and (<= (+ (* (div main_~l~0 4294967296) 613566757) (* 613566757 (div (+ main_~l~0 (* (- 7) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) 0) (<= 1 (+ (* 3 (div main_~l~0 4294967296)) main_~l~0)))} is VALID [2022-04-14 14:39:52,840 INFO L290 TraceCheckUtils]: 16: Hoare triple {5130#(and (<= (+ (* (div main_~l~0 4294967296) 613566757) (* 613566757 (div (+ main_~l~0 (* (- 7) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) 0) (<= 1 (+ (* 3 (div main_~l~0 4294967296)) main_~l~0)))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 9 then ~l~0 % 4294967296 % 9 - 9 else ~l~0 % 4294967296 % 9) % 4294967296); {5130#(and (<= (+ (* (div main_~l~0 4294967296) 613566757) (* 613566757 (div (+ main_~l~0 (* (- 7) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) 0) (<= 1 (+ (* 3 (div main_~l~0 4294967296)) main_~l~0)))} is VALID [2022-04-14 14:39:52,840 INFO L290 TraceCheckUtils]: 17: Hoare triple {5130#(and (<= (+ (* (div main_~l~0 4294967296) 613566757) (* 613566757 (div (+ main_~l~0 (* (- 7) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) 0) (<= 1 (+ (* 3 (div main_~l~0 4294967296)) main_~l~0)))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {5130#(and (<= (+ (* (div main_~l~0 4294967296) 613566757) (* 613566757 (div (+ main_~l~0 (* (- 7) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) 0) (<= 1 (+ (* 3 (div main_~l~0 4294967296)) main_~l~0)))} is VALID [2022-04-14 14:39:52,843 INFO L290 TraceCheckUtils]: 18: Hoare triple {5130#(and (<= (+ (* (div main_~l~0 4294967296) 613566757) (* 613566757 (div (+ main_~l~0 (* (- 7) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) 0) (<= 1 (+ (* 3 (div main_~l~0 4294967296)) main_~l~0)))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296;~v1~0 := 1 + ~v1~0; {5118#false} is VALID [2022-04-14 14:39:52,843 INFO L290 TraceCheckUtils]: 19: Hoare triple {5118#false} ~l~0 := 1 + ~l~0; {5118#false} is VALID [2022-04-14 14:39:52,843 INFO L272 TraceCheckUtils]: 20: Hoare triple {5118#false} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0 + ~v6~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {5117#true} is VALID [2022-04-14 14:39:52,843 INFO L290 TraceCheckUtils]: 21: Hoare triple {5117#true} ~cond := #in~cond; {5117#true} is VALID [2022-04-14 14:39:52,843 INFO L290 TraceCheckUtils]: 22: Hoare triple {5117#true} assume !(0 == ~cond); {5117#true} is VALID [2022-04-14 14:39:52,843 INFO L290 TraceCheckUtils]: 23: Hoare triple {5117#true} assume true; {5117#true} is VALID [2022-04-14 14:39:52,843 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {5117#true} {5118#false} #89#return; {5118#false} is VALID [2022-04-14 14:39:52,843 INFO L290 TraceCheckUtils]: 25: Hoare triple {5118#false} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {5118#false} is VALID [2022-04-14 14:39:52,843 INFO L290 TraceCheckUtils]: 26: Hoare triple {5118#false} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 9 then ~l~0 % 4294967296 % 9 - 9 else ~l~0 % 4294967296 % 9) % 4294967296); {5118#false} is VALID [2022-04-14 14:39:52,843 INFO L290 TraceCheckUtils]: 27: Hoare triple {5118#false} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {5118#false} is VALID [2022-04-14 14:39:52,843 INFO L290 TraceCheckUtils]: 28: Hoare triple {5118#false} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296); {5118#false} is VALID [2022-04-14 14:39:52,843 INFO L290 TraceCheckUtils]: 29: Hoare triple {5118#false} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {5118#false} is VALID [2022-04-14 14:39:52,843 INFO L290 TraceCheckUtils]: 30: Hoare triple {5118#false} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296;~v3~0 := 1 + ~v3~0; {5118#false} is VALID [2022-04-14 14:39:52,843 INFO L290 TraceCheckUtils]: 31: Hoare triple {5118#false} ~l~0 := 1 + ~l~0; {5118#false} is VALID [2022-04-14 14:39:52,843 INFO L272 TraceCheckUtils]: 32: Hoare triple {5118#false} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0 + ~v6~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {5118#false} is VALID [2022-04-14 14:39:52,844 INFO L290 TraceCheckUtils]: 33: Hoare triple {5118#false} ~cond := #in~cond; {5118#false} is VALID [2022-04-14 14:39:52,844 INFO L290 TraceCheckUtils]: 34: Hoare triple {5118#false} assume 0 == ~cond; {5118#false} is VALID [2022-04-14 14:39:52,844 INFO L290 TraceCheckUtils]: 35: Hoare triple {5118#false} assume !false; {5118#false} is VALID [2022-04-14 14:39:52,844 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-14 14:39:52,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 14:39:52,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371243701] [2022-04-14 14:39:52,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371243701] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-14 14:39:52,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [968986425] [2022-04-14 14:39:52,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 14:39:52,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 14:39:52,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 14:39:52,845 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 14:39:52,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-14 14:39:52,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:39:52,878 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-14 14:39:52,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:39:52,885 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 14:39:53,718 INFO L272 TraceCheckUtils]: 0: Hoare triple {5117#true} call ULTIMATE.init(); {5117#true} is VALID [2022-04-14 14:39:53,718 INFO L290 TraceCheckUtils]: 1: Hoare triple {5117#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {5117#true} is VALID [2022-04-14 14:39:53,718 INFO L290 TraceCheckUtils]: 2: Hoare triple {5117#true} assume true; {5117#true} is VALID [2022-04-14 14:39:53,718 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5117#true} {5117#true} #91#return; {5117#true} is VALID [2022-04-14 14:39:53,719 INFO L272 TraceCheckUtils]: 4: Hoare triple {5117#true} call #t~ret5 := main(); {5117#true} is VALID [2022-04-14 14:39:53,719 INFO L290 TraceCheckUtils]: 5: Hoare triple {5117#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v1~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;~v5~0 := 0;~v6~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {5155#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v6~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:39:53,719 INFO L290 TraceCheckUtils]: 6: Hoare triple {5155#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v6~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {5155#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v6~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:39:53,720 INFO L290 TraceCheckUtils]: 7: Hoare triple {5155#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v6~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {5155#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v6~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:39:53,720 INFO L290 TraceCheckUtils]: 8: Hoare triple {5155#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v6~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 9 then ~l~0 % 4294967296 % 9 - 9 else ~l~0 % 4294967296 % 9) % 4294967296;~v6~0 := 1 + ~v6~0; {5165#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:39:53,721 INFO L290 TraceCheckUtils]: 9: Hoare triple {5165#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {5169#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:39:53,721 INFO L272 TraceCheckUtils]: 10: Hoare triple {5169#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0 + ~v6~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {5117#true} is VALID [2022-04-14 14:39:53,721 INFO L290 TraceCheckUtils]: 11: Hoare triple {5117#true} ~cond := #in~cond; {5117#true} is VALID [2022-04-14 14:39:53,721 INFO L290 TraceCheckUtils]: 12: Hoare triple {5117#true} assume !(0 == ~cond); {5117#true} is VALID [2022-04-14 14:39:53,721 INFO L290 TraceCheckUtils]: 13: Hoare triple {5117#true} assume true; {5117#true} is VALID [2022-04-14 14:39:53,722 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {5117#true} {5169#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} #89#return; {5169#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:39:53,722 INFO L290 TraceCheckUtils]: 15: Hoare triple {5169#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {5169#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:39:53,723 INFO L290 TraceCheckUtils]: 16: Hoare triple {5169#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 9 then ~l~0 % 4294967296 % 9 - 9 else ~l~0 % 4294967296 % 9) % 4294967296); {5169#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:39:53,728 INFO L290 TraceCheckUtils]: 17: Hoare triple {5169#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {5169#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:39:53,728 INFO L290 TraceCheckUtils]: 18: Hoare triple {5169#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296;~v1~0 := 1 + ~v1~0; {5197#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:39:53,729 INFO L290 TraceCheckUtils]: 19: Hoare triple {5197#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {5201#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~l~0 2) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:39:53,729 INFO L272 TraceCheckUtils]: 20: Hoare triple {5201#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~l~0 2) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0 + ~v6~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {5117#true} is VALID [2022-04-14 14:39:53,729 INFO L290 TraceCheckUtils]: 21: Hoare triple {5117#true} ~cond := #in~cond; {5117#true} is VALID [2022-04-14 14:39:53,729 INFO L290 TraceCheckUtils]: 22: Hoare triple {5117#true} assume !(0 == ~cond); {5117#true} is VALID [2022-04-14 14:39:53,729 INFO L290 TraceCheckUtils]: 23: Hoare triple {5117#true} assume true; {5117#true} is VALID [2022-04-14 14:39:53,730 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {5117#true} {5201#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~l~0 2) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} #89#return; {5201#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~l~0 2) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:39:53,731 INFO L290 TraceCheckUtils]: 25: Hoare triple {5201#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~l~0 2) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {5201#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~l~0 2) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:39:53,732 INFO L290 TraceCheckUtils]: 26: Hoare triple {5201#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~l~0 2) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 9 then ~l~0 % 4294967296 % 9 - 9 else ~l~0 % 4294967296 % 9) % 4294967296); {5201#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~l~0 2) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:39:53,732 INFO L290 TraceCheckUtils]: 27: Hoare triple {5201#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~l~0 2) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {5201#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~l~0 2) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:39:53,732 INFO L290 TraceCheckUtils]: 28: Hoare triple {5201#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~l~0 2) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296); {5201#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~l~0 2) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:39:53,733 INFO L290 TraceCheckUtils]: 29: Hoare triple {5201#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~l~0 2) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {5201#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~l~0 2) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:39:53,733 INFO L290 TraceCheckUtils]: 30: Hoare triple {5201#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~l~0 2) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296;~v3~0 := 1 + ~v3~0; {5235#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= (+ (- 1) main_~v3~0) 0) (= main_~l~0 2) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0))} is VALID [2022-04-14 14:39:53,734 INFO L290 TraceCheckUtils]: 31: Hoare triple {5235#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= (+ (- 1) main_~v3~0) 0) (= main_~l~0 2) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0))} ~l~0 := 1 + ~l~0; {5239#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 3) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0))} is VALID [2022-04-14 14:39:53,735 INFO L272 TraceCheckUtils]: 32: Hoare triple {5239#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 3) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0 + ~v6~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {5243#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 14:39:53,735 INFO L290 TraceCheckUtils]: 33: Hoare triple {5243#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5247#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 14:39:53,735 INFO L290 TraceCheckUtils]: 34: Hoare triple {5247#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5118#false} is VALID [2022-04-14 14:39:53,735 INFO L290 TraceCheckUtils]: 35: Hoare triple {5118#false} assume !false; {5118#false} is VALID [2022-04-14 14:39:53,735 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-14 14:39:53,736 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 14:39:54,073 INFO L290 TraceCheckUtils]: 35: Hoare triple {5118#false} assume !false; {5118#false} is VALID [2022-04-14 14:39:54,073 INFO L290 TraceCheckUtils]: 34: Hoare triple {5247#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5118#false} is VALID [2022-04-14 14:39:54,073 INFO L290 TraceCheckUtils]: 33: Hoare triple {5243#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5247#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 14:39:54,074 INFO L272 TraceCheckUtils]: 32: Hoare triple {5263#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0 + ~v6~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {5243#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 14:39:54,075 INFO L290 TraceCheckUtils]: 31: Hoare triple {5267#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} ~l~0 := 1 + ~l~0; {5263#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:39:56,189 WARN L290 TraceCheckUtils]: 30: Hoare triple {5263#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296;~v3~0 := 1 + ~v3~0; {5267#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is UNKNOWN [2022-04-14 14:39:56,190 INFO L290 TraceCheckUtils]: 29: Hoare triple {5263#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {5263#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:39:56,191 INFO L290 TraceCheckUtils]: 28: Hoare triple {5263#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296); {5263#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:39:56,191 INFO L290 TraceCheckUtils]: 27: Hoare triple {5263#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {5263#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:39:56,191 INFO L290 TraceCheckUtils]: 26: Hoare triple {5263#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 9 then ~l~0 % 4294967296 % 9 - 9 else ~l~0 % 4294967296 % 9) % 4294967296); {5263#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:39:56,192 INFO L290 TraceCheckUtils]: 25: Hoare triple {5263#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {5263#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:39:56,194 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {5117#true} {5263#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} #89#return; {5263#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:39:56,194 INFO L290 TraceCheckUtils]: 23: Hoare triple {5117#true} assume true; {5117#true} is VALID [2022-04-14 14:39:56,194 INFO L290 TraceCheckUtils]: 22: Hoare triple {5117#true} assume !(0 == ~cond); {5117#true} is VALID [2022-04-14 14:39:56,195 INFO L290 TraceCheckUtils]: 21: Hoare triple {5117#true} ~cond := #in~cond; {5117#true} is VALID [2022-04-14 14:39:56,195 INFO L272 TraceCheckUtils]: 20: Hoare triple {5263#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0 + ~v6~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {5117#true} is VALID [2022-04-14 14:39:56,198 INFO L290 TraceCheckUtils]: 19: Hoare triple {5267#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} ~l~0 := 1 + ~l~0; {5263#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:39:58,304 WARN L290 TraceCheckUtils]: 18: Hoare triple {5263#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296;~v1~0 := 1 + ~v1~0; {5267#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is UNKNOWN [2022-04-14 14:39:58,305 INFO L290 TraceCheckUtils]: 17: Hoare triple {5263#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {5263#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:39:58,305 INFO L290 TraceCheckUtils]: 16: Hoare triple {5263#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 9 then ~l~0 % 4294967296 % 9 - 9 else ~l~0 % 4294967296 % 9) % 4294967296); {5263#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:39:58,306 INFO L290 TraceCheckUtils]: 15: Hoare triple {5263#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {5263#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:39:58,306 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {5117#true} {5263#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} #89#return; {5263#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:39:58,307 INFO L290 TraceCheckUtils]: 13: Hoare triple {5117#true} assume true; {5117#true} is VALID [2022-04-14 14:39:58,307 INFO L290 TraceCheckUtils]: 12: Hoare triple {5117#true} assume !(0 == ~cond); {5117#true} is VALID [2022-04-14 14:39:58,307 INFO L290 TraceCheckUtils]: 11: Hoare triple {5117#true} ~cond := #in~cond; {5117#true} is VALID [2022-04-14 14:39:58,307 INFO L272 TraceCheckUtils]: 10: Hoare triple {5263#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0 + ~v6~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {5117#true} is VALID [2022-04-14 14:39:58,310 INFO L290 TraceCheckUtils]: 9: Hoare triple {5267#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} ~l~0 := 1 + ~l~0; {5263#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:40:00,415 WARN L290 TraceCheckUtils]: 8: Hoare triple {5263#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 9 then ~l~0 % 4294967296 % 9 - 9 else ~l~0 % 4294967296 % 9) % 4294967296;~v6~0 := 1 + ~v6~0; {5267#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is UNKNOWN [2022-04-14 14:40:00,415 INFO L290 TraceCheckUtils]: 7: Hoare triple {5263#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {5263#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:40:00,416 INFO L290 TraceCheckUtils]: 6: Hoare triple {5263#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {5263#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:40:00,418 INFO L290 TraceCheckUtils]: 5: Hoare triple {5117#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v1~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;~v5~0 := 0;~v6~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {5263#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:40:00,418 INFO L272 TraceCheckUtils]: 4: Hoare triple {5117#true} call #t~ret5 := main(); {5117#true} is VALID [2022-04-14 14:40:00,418 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5117#true} {5117#true} #91#return; {5117#true} is VALID [2022-04-14 14:40:00,418 INFO L290 TraceCheckUtils]: 2: Hoare triple {5117#true} assume true; {5117#true} is VALID [2022-04-14 14:40:00,418 INFO L290 TraceCheckUtils]: 1: Hoare triple {5117#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {5117#true} is VALID [2022-04-14 14:40:00,418 INFO L272 TraceCheckUtils]: 0: Hoare triple {5117#true} call ULTIMATE.init(); {5117#true} is VALID [2022-04-14 14:40:00,418 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-04-14 14:40:00,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [968986425] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-14 14:40:00,419 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-14 14:40:00,419 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9, 11] total 20 [2022-04-14 14:40:00,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252713711] [2022-04-14 14:40:00,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 14:40:00,419 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 36 [2022-04-14 14:40:00,420 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 14:40:00,420 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 14:40:06,757 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 22 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-14 14:40:06,757 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-14 14:40:06,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 14:40:06,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-14 14:40:06,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2022-04-14 14:40:06,757 INFO L87 Difference]: Start difference. First operand 104 states and 148 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 14:40:08,857 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:40:11,071 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:40:13,253 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:40:15,364 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:40:17,475 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:40:19,589 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:40:21,703 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:40:23,887 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:40:28,246 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:40:30,411 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:40:37,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:40:37,093 INFO L93 Difference]: Finished difference Result 129 states and 182 transitions. [2022-04-14 14:40:37,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-14 14:40:37,093 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 36 [2022-04-14 14:40:37,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 14:40:37,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 14:40:37,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 51 transitions. [2022-04-14 14:40:37,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 14:40:37,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 51 transitions. [2022-04-14 14:40:37,095 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 51 transitions. [2022-04-14 14:40:41,392 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 49 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-14 14:40:41,394 INFO L225 Difference]: With dead ends: 129 [2022-04-14 14:40:41,394 INFO L226 Difference]: Without dead ends: 127 [2022-04-14 14:40:41,394 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 63 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2022-04-14 14:40:41,395 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 5 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 1 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.1s IncrementalHoareTripleChecker+Time [2022-04-14 14:40:41,395 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 73 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 67 Invalid, 10 Unknown, 0 Unchecked, 21.1s Time] [2022-04-14 14:40:41,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-04-14 14:40:41,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 115. [2022-04-14 14:40:41,474 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 14:40:41,474 INFO L82 GeneralOperation]: Start isEquivalent. First operand 127 states. Second operand has 115 states, 95 states have (on average 1.5157894736842106) internal successors, (144), 95 states have internal predecessors, (144), 10 states have call successors, (10), 10 states have call predecessors, (10), 9 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-14 14:40:41,475 INFO L74 IsIncluded]: Start isIncluded. First operand 127 states. Second operand has 115 states, 95 states have (on average 1.5157894736842106) internal successors, (144), 95 states have internal predecessors, (144), 10 states have call successors, (10), 10 states have call predecessors, (10), 9 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-14 14:40:41,476 INFO L87 Difference]: Start difference. First operand 127 states. Second operand has 115 states, 95 states have (on average 1.5157894736842106) internal successors, (144), 95 states have internal predecessors, (144), 10 states have call successors, (10), 10 states have call predecessors, (10), 9 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-14 14:40:41,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:40:41,478 INFO L93 Difference]: Finished difference Result 127 states and 180 transitions. [2022-04-14 14:40:41,478 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 180 transitions. [2022-04-14 14:40:41,478 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:40:41,478 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:40:41,478 INFO L74 IsIncluded]: Start isIncluded. First operand has 115 states, 95 states have (on average 1.5157894736842106) internal successors, (144), 95 states have internal predecessors, (144), 10 states have call successors, (10), 10 states have call predecessors, (10), 9 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 127 states. [2022-04-14 14:40:41,478 INFO L87 Difference]: Start difference. First operand has 115 states, 95 states have (on average 1.5157894736842106) internal successors, (144), 95 states have internal predecessors, (144), 10 states have call successors, (10), 10 states have call predecessors, (10), 9 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 127 states. [2022-04-14 14:40:41,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:40:41,481 INFO L93 Difference]: Finished difference Result 127 states and 180 transitions. [2022-04-14 14:40:41,481 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 180 transitions. [2022-04-14 14:40:41,481 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:40:41,481 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:40:41,481 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 14:40:41,481 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 14:40:41,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 95 states have (on average 1.5157894736842106) internal successors, (144), 95 states have internal predecessors, (144), 10 states have call successors, (10), 10 states have call predecessors, (10), 9 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-14 14:40:41,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 163 transitions. [2022-04-14 14:40:41,483 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 163 transitions. Word has length 36 [2022-04-14 14:40:41,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 14:40:41,484 INFO L478 AbstractCegarLoop]: Abstraction has 115 states and 163 transitions. [2022-04-14 14:40:41,484 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 14:40:41,484 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 163 transitions. [2022-04-14 14:40:41,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-14 14:40:41,485 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 14:40:41,485 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 14:40:41,501 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-14 14:40:41,699 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-04-14 14:40:41,699 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 14:40:41,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 14:40:41,700 INFO L85 PathProgramCache]: Analyzing trace with hash 672780640, now seen corresponding path program 1 times [2022-04-14 14:40:41,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 14:40:41,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204882586] [2022-04-14 14:40:41,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 14:40:41,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 14:40:41,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:40:41,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 14:40:41,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:40:41,762 INFO L290 TraceCheckUtils]: 0: Hoare triple {5940#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {5924#true} is VALID [2022-04-14 14:40:41,762 INFO L290 TraceCheckUtils]: 1: Hoare triple {5924#true} assume true; {5924#true} is VALID [2022-04-14 14:40:41,762 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5924#true} {5924#true} #91#return; {5924#true} is VALID [2022-04-14 14:40:41,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-04-14 14:40:41,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:40:41,765 INFO L290 TraceCheckUtils]: 0: Hoare triple {5924#true} ~cond := #in~cond; {5924#true} is VALID [2022-04-14 14:40:41,765 INFO L290 TraceCheckUtils]: 1: Hoare triple {5924#true} assume !(0 == ~cond); {5924#true} is VALID [2022-04-14 14:40:41,766 INFO L290 TraceCheckUtils]: 2: Hoare triple {5924#true} assume true; {5924#true} is VALID [2022-04-14 14:40:41,766 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5924#true} {5930#(and (<= 1 main_~l~0) (<= main_~l~0 1))} #89#return; {5930#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-14 14:40:41,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-04-14 14:40:41,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:40:41,769 INFO L290 TraceCheckUtils]: 0: Hoare triple {5924#true} ~cond := #in~cond; {5924#true} is VALID [2022-04-14 14:40:41,769 INFO L290 TraceCheckUtils]: 1: Hoare triple {5924#true} assume !(0 == ~cond); {5924#true} is VALID [2022-04-14 14:40:41,769 INFO L290 TraceCheckUtils]: 2: Hoare triple {5924#true} assume true; {5924#true} is VALID [2022-04-14 14:40:41,770 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5924#true} {5935#(and (<= (div main_~l~0 4) 0) (<= 2 main_~l~0))} #89#return; {5935#(and (<= (div main_~l~0 4) 0) (<= 2 main_~l~0))} is VALID [2022-04-14 14:40:41,770 INFO L272 TraceCheckUtils]: 0: Hoare triple {5924#true} call ULTIMATE.init(); {5940#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 14:40:41,770 INFO L290 TraceCheckUtils]: 1: Hoare triple {5940#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {5924#true} is VALID [2022-04-14 14:40:41,770 INFO L290 TraceCheckUtils]: 2: Hoare triple {5924#true} assume true; {5924#true} is VALID [2022-04-14 14:40:41,770 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5924#true} {5924#true} #91#return; {5924#true} is VALID [2022-04-14 14:40:41,770 INFO L272 TraceCheckUtils]: 4: Hoare triple {5924#true} call #t~ret5 := main(); {5924#true} is VALID [2022-04-14 14:40:41,771 INFO L290 TraceCheckUtils]: 5: Hoare triple {5924#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v1~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;~v5~0 := 0;~v6~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {5929#(= main_~l~0 0)} is VALID [2022-04-14 14:40:41,771 INFO L290 TraceCheckUtils]: 6: Hoare triple {5929#(= main_~l~0 0)} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {5929#(= main_~l~0 0)} is VALID [2022-04-14 14:40:41,771 INFO L290 TraceCheckUtils]: 7: Hoare triple {5929#(= main_~l~0 0)} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {5929#(= main_~l~0 0)} is VALID [2022-04-14 14:40:41,771 INFO L290 TraceCheckUtils]: 8: Hoare triple {5929#(= main_~l~0 0)} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 9 then ~l~0 % 4294967296 % 9 - 9 else ~l~0 % 4294967296 % 9) % 4294967296;~v6~0 := 1 + ~v6~0; {5929#(= main_~l~0 0)} is VALID [2022-04-14 14:40:41,772 INFO L290 TraceCheckUtils]: 9: Hoare triple {5929#(= main_~l~0 0)} ~l~0 := 1 + ~l~0; {5930#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-14 14:40:41,772 INFO L272 TraceCheckUtils]: 10: Hoare triple {5930#(and (<= 1 main_~l~0) (<= main_~l~0 1))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0 + ~v6~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {5924#true} is VALID [2022-04-14 14:40:41,772 INFO L290 TraceCheckUtils]: 11: Hoare triple {5924#true} ~cond := #in~cond; {5924#true} is VALID [2022-04-14 14:40:41,772 INFO L290 TraceCheckUtils]: 12: Hoare triple {5924#true} assume !(0 == ~cond); {5924#true} is VALID [2022-04-14 14:40:41,772 INFO L290 TraceCheckUtils]: 13: Hoare triple {5924#true} assume true; {5924#true} is VALID [2022-04-14 14:40:41,773 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {5924#true} {5930#(and (<= 1 main_~l~0) (<= main_~l~0 1))} #89#return; {5930#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-14 14:40:41,773 INFO L290 TraceCheckUtils]: 15: Hoare triple {5930#(and (<= 1 main_~l~0) (<= main_~l~0 1))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {5930#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-14 14:40:41,773 INFO L290 TraceCheckUtils]: 16: Hoare triple {5930#(and (<= 1 main_~l~0) (<= main_~l~0 1))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 9 then ~l~0 % 4294967296 % 9 - 9 else ~l~0 % 4294967296 % 9) % 4294967296); {5930#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-14 14:40:41,774 INFO L290 TraceCheckUtils]: 17: Hoare triple {5930#(and (<= 1 main_~l~0) (<= main_~l~0 1))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {5930#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-14 14:40:41,774 INFO L290 TraceCheckUtils]: 18: Hoare triple {5930#(and (<= 1 main_~l~0) (<= main_~l~0 1))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296;~v1~0 := 1 + ~v1~0; {5930#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-14 14:40:41,775 INFO L290 TraceCheckUtils]: 19: Hoare triple {5930#(and (<= 1 main_~l~0) (<= main_~l~0 1))} ~l~0 := 1 + ~l~0; {5935#(and (<= (div main_~l~0 4) 0) (<= 2 main_~l~0))} is VALID [2022-04-14 14:40:41,775 INFO L272 TraceCheckUtils]: 20: Hoare triple {5935#(and (<= (div main_~l~0 4) 0) (<= 2 main_~l~0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0 + ~v6~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {5924#true} is VALID [2022-04-14 14:40:41,775 INFO L290 TraceCheckUtils]: 21: Hoare triple {5924#true} ~cond := #in~cond; {5924#true} is VALID [2022-04-14 14:40:41,775 INFO L290 TraceCheckUtils]: 22: Hoare triple {5924#true} assume !(0 == ~cond); {5924#true} is VALID [2022-04-14 14:40:41,775 INFO L290 TraceCheckUtils]: 23: Hoare triple {5924#true} assume true; {5924#true} is VALID [2022-04-14 14:40:41,776 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {5924#true} {5935#(and (<= (div main_~l~0 4) 0) (<= 2 main_~l~0))} #89#return; {5935#(and (<= (div main_~l~0 4) 0) (<= 2 main_~l~0))} is VALID [2022-04-14 14:40:41,776 INFO L290 TraceCheckUtils]: 25: Hoare triple {5935#(and (<= (div main_~l~0 4) 0) (<= 2 main_~l~0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {5935#(and (<= (div main_~l~0 4) 0) (<= 2 main_~l~0))} is VALID [2022-04-14 14:40:41,777 INFO L290 TraceCheckUtils]: 26: Hoare triple {5935#(and (<= (div main_~l~0 4) 0) (<= 2 main_~l~0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 9 then ~l~0 % 4294967296 % 9 - 9 else ~l~0 % 4294967296 % 9) % 4294967296); {5935#(and (<= (div main_~l~0 4) 0) (<= 2 main_~l~0))} is VALID [2022-04-14 14:40:41,777 INFO L290 TraceCheckUtils]: 27: Hoare triple {5935#(and (<= (div main_~l~0 4) 0) (<= 2 main_~l~0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {5935#(and (<= (div main_~l~0 4) 0) (<= 2 main_~l~0))} is VALID [2022-04-14 14:40:41,778 INFO L290 TraceCheckUtils]: 28: Hoare triple {5935#(and (<= (div main_~l~0 4) 0) (<= 2 main_~l~0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296); {5935#(and (<= (div main_~l~0 4) 0) (<= 2 main_~l~0))} is VALID [2022-04-14 14:40:41,778 INFO L290 TraceCheckUtils]: 29: Hoare triple {5935#(and (<= (div main_~l~0 4) 0) (<= 2 main_~l~0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {5935#(and (<= (div main_~l~0 4) 0) (<= 2 main_~l~0))} is VALID [2022-04-14 14:40:41,778 INFO L290 TraceCheckUtils]: 30: Hoare triple {5935#(and (<= (div main_~l~0 4) 0) (<= 2 main_~l~0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {5935#(and (<= (div main_~l~0 4) 0) (<= 2 main_~l~0))} is VALID [2022-04-14 14:40:41,779 INFO L290 TraceCheckUtils]: 31: Hoare triple {5935#(and (<= (div main_~l~0 4) 0) (<= 2 main_~l~0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296;~v4~0 := 1 + ~v4~0; {5925#false} is VALID [2022-04-14 14:40:41,779 INFO L290 TraceCheckUtils]: 32: Hoare triple {5925#false} ~l~0 := 1 + ~l~0; {5925#false} is VALID [2022-04-14 14:40:41,779 INFO L272 TraceCheckUtils]: 33: Hoare triple {5925#false} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0 + ~v6~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {5925#false} is VALID [2022-04-14 14:40:41,779 INFO L290 TraceCheckUtils]: 34: Hoare triple {5925#false} ~cond := #in~cond; {5925#false} is VALID [2022-04-14 14:40:41,779 INFO L290 TraceCheckUtils]: 35: Hoare triple {5925#false} assume 0 == ~cond; {5925#false} is VALID [2022-04-14 14:40:41,779 INFO L290 TraceCheckUtils]: 36: Hoare triple {5925#false} assume !false; {5925#false} is VALID [2022-04-14 14:40:41,779 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-14 14:40:41,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 14:40:41,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204882586] [2022-04-14 14:40:41,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204882586] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-14 14:40:41,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1081613654] [2022-04-14 14:40:41,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 14:40:41,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 14:40:41,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 14:40:41,781 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 14:40:41,782 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-04-14 14:40:41,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:40:41,817 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-14 14:40:41,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:40:41,825 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 14:40:42,625 INFO L272 TraceCheckUtils]: 0: Hoare triple {5924#true} call ULTIMATE.init(); {5924#true} is VALID [2022-04-14 14:40:42,625 INFO L290 TraceCheckUtils]: 1: Hoare triple {5924#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {5924#true} is VALID [2022-04-14 14:40:42,626 INFO L290 TraceCheckUtils]: 2: Hoare triple {5924#true} assume true; {5924#true} is VALID [2022-04-14 14:40:42,626 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5924#true} {5924#true} #91#return; {5924#true} is VALID [2022-04-14 14:40:42,626 INFO L272 TraceCheckUtils]: 4: Hoare triple {5924#true} call #t~ret5 := main(); {5924#true} is VALID [2022-04-14 14:40:42,626 INFO L290 TraceCheckUtils]: 5: Hoare triple {5924#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v1~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;~v5~0 := 0;~v6~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {5959#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v6~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:40:42,627 INFO L290 TraceCheckUtils]: 6: Hoare triple {5959#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v6~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {5959#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v6~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:40:42,627 INFO L290 TraceCheckUtils]: 7: Hoare triple {5959#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v6~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {5959#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v6~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:40:42,627 INFO L290 TraceCheckUtils]: 8: Hoare triple {5959#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v6~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 9 then ~l~0 % 4294967296 % 9 - 9 else ~l~0 % 4294967296 % 9) % 4294967296;~v6~0 := 1 + ~v6~0; {5969#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:40:42,628 INFO L290 TraceCheckUtils]: 9: Hoare triple {5969#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {5973#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:40:42,628 INFO L272 TraceCheckUtils]: 10: Hoare triple {5973#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0 + ~v6~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {5924#true} is VALID [2022-04-14 14:40:42,628 INFO L290 TraceCheckUtils]: 11: Hoare triple {5924#true} ~cond := #in~cond; {5924#true} is VALID [2022-04-14 14:40:42,628 INFO L290 TraceCheckUtils]: 12: Hoare triple {5924#true} assume !(0 == ~cond); {5924#true} is VALID [2022-04-14 14:40:42,628 INFO L290 TraceCheckUtils]: 13: Hoare triple {5924#true} assume true; {5924#true} is VALID [2022-04-14 14:40:42,629 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {5924#true} {5973#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} #89#return; {5973#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:40:42,629 INFO L290 TraceCheckUtils]: 15: Hoare triple {5973#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {5973#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:40:42,630 INFO L290 TraceCheckUtils]: 16: Hoare triple {5973#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 9 then ~l~0 % 4294967296 % 9 - 9 else ~l~0 % 4294967296 % 9) % 4294967296); {5973#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:40:42,630 INFO L290 TraceCheckUtils]: 17: Hoare triple {5973#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {5973#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:40:42,630 INFO L290 TraceCheckUtils]: 18: Hoare triple {5973#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296;~v1~0 := 1 + ~v1~0; {6001#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:40:42,637 INFO L290 TraceCheckUtils]: 19: Hoare triple {6001#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {6005#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~l~0 2) (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:40:42,637 INFO L272 TraceCheckUtils]: 20: Hoare triple {6005#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~l~0 2) (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0 + ~v6~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {5924#true} is VALID [2022-04-14 14:40:42,637 INFO L290 TraceCheckUtils]: 21: Hoare triple {5924#true} ~cond := #in~cond; {5924#true} is VALID [2022-04-14 14:40:42,637 INFO L290 TraceCheckUtils]: 22: Hoare triple {5924#true} assume !(0 == ~cond); {5924#true} is VALID [2022-04-14 14:40:42,637 INFO L290 TraceCheckUtils]: 23: Hoare triple {5924#true} assume true; {5924#true} is VALID [2022-04-14 14:40:42,638 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {5924#true} {6005#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~l~0 2) (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} #89#return; {6005#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~l~0 2) (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:40:42,639 INFO L290 TraceCheckUtils]: 25: Hoare triple {6005#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~l~0 2) (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {6005#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~l~0 2) (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:40:42,640 INFO L290 TraceCheckUtils]: 26: Hoare triple {6005#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~l~0 2) (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 9 then ~l~0 % 4294967296 % 9 - 9 else ~l~0 % 4294967296 % 9) % 4294967296); {6005#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~l~0 2) (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:40:42,641 INFO L290 TraceCheckUtils]: 27: Hoare triple {6005#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~l~0 2) (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {6005#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~l~0 2) (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:40:42,642 INFO L290 TraceCheckUtils]: 28: Hoare triple {6005#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~l~0 2) (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296); {6005#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~l~0 2) (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:40:42,642 INFO L290 TraceCheckUtils]: 29: Hoare triple {6005#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~l~0 2) (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {6005#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~l~0 2) (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:40:42,643 INFO L290 TraceCheckUtils]: 30: Hoare triple {6005#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~l~0 2) (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {6005#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~l~0 2) (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:40:42,645 INFO L290 TraceCheckUtils]: 31: Hoare triple {6005#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~l~0 2) (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296;~v4~0 := 1 + ~v4~0; {6042#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~l~0 2) (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 1) (= main_~v3~0 0))} is VALID [2022-04-14 14:40:42,646 INFO L290 TraceCheckUtils]: 32: Hoare triple {6042#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~l~0 2) (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 1) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {6046#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 1) (= 2 (+ (- 1) main_~l~0)) (= main_~v3~0 0))} is VALID [2022-04-14 14:40:42,647 INFO L272 TraceCheckUtils]: 33: Hoare triple {6046#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 1) (= 2 (+ (- 1) main_~l~0)) (= main_~v3~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0 + ~v6~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {6050#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 14:40:42,647 INFO L290 TraceCheckUtils]: 34: Hoare triple {6050#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6054#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 14:40:42,648 INFO L290 TraceCheckUtils]: 35: Hoare triple {6054#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5925#false} is VALID [2022-04-14 14:40:42,648 INFO L290 TraceCheckUtils]: 36: Hoare triple {5925#false} assume !false; {5925#false} is VALID [2022-04-14 14:40:42,648 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-14 14:40:42,648 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 14:40:42,972 INFO L290 TraceCheckUtils]: 36: Hoare triple {5925#false} assume !false; {5925#false} is VALID [2022-04-14 14:40:42,972 INFO L290 TraceCheckUtils]: 35: Hoare triple {6054#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5925#false} is VALID [2022-04-14 14:40:42,973 INFO L290 TraceCheckUtils]: 34: Hoare triple {6050#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6054#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 14:40:42,974 INFO L272 TraceCheckUtils]: 33: Hoare triple {6070#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0 + ~v6~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {6050#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 14:40:42,975 INFO L290 TraceCheckUtils]: 32: Hoare triple {6074#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} ~l~0 := 1 + ~l~0; {6070#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:40:42,980 INFO L290 TraceCheckUtils]: 31: Hoare triple {6070#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296;~v4~0 := 1 + ~v4~0; {6074#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:40:42,980 INFO L290 TraceCheckUtils]: 30: Hoare triple {6070#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {6070#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:40:42,981 INFO L290 TraceCheckUtils]: 29: Hoare triple {6070#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {6070#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:40:42,981 INFO L290 TraceCheckUtils]: 28: Hoare triple {6070#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296); {6070#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:40:42,981 INFO L290 TraceCheckUtils]: 27: Hoare triple {6070#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {6070#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:40:42,982 INFO L290 TraceCheckUtils]: 26: Hoare triple {6070#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 9 then ~l~0 % 4294967296 % 9 - 9 else ~l~0 % 4294967296 % 9) % 4294967296); {6070#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:40:42,982 INFO L290 TraceCheckUtils]: 25: Hoare triple {6070#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {6070#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:40:42,983 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {5924#true} {6070#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} #89#return; {6070#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:40:42,983 INFO L290 TraceCheckUtils]: 23: Hoare triple {5924#true} assume true; {5924#true} is VALID [2022-04-14 14:40:42,983 INFO L290 TraceCheckUtils]: 22: Hoare triple {5924#true} assume !(0 == ~cond); {5924#true} is VALID [2022-04-14 14:40:42,983 INFO L290 TraceCheckUtils]: 21: Hoare triple {5924#true} ~cond := #in~cond; {5924#true} is VALID [2022-04-14 14:40:42,983 INFO L272 TraceCheckUtils]: 20: Hoare triple {6070#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0 + ~v6~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {5924#true} is VALID [2022-04-14 14:40:42,984 INFO L290 TraceCheckUtils]: 19: Hoare triple {6074#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} ~l~0 := 1 + ~l~0; {6070#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:40:45,092 WARN L290 TraceCheckUtils]: 18: Hoare triple {6070#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296;~v1~0 := 1 + ~v1~0; {6074#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is UNKNOWN [2022-04-14 14:40:45,092 INFO L290 TraceCheckUtils]: 17: Hoare triple {6070#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {6070#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:40:45,093 INFO L290 TraceCheckUtils]: 16: Hoare triple {6070#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 9 then ~l~0 % 4294967296 % 9 - 9 else ~l~0 % 4294967296 % 9) % 4294967296); {6070#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:40:45,093 INFO L290 TraceCheckUtils]: 15: Hoare triple {6070#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {6070#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:40:45,094 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {5924#true} {6070#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} #89#return; {6070#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:40:45,094 INFO L290 TraceCheckUtils]: 13: Hoare triple {5924#true} assume true; {5924#true} is VALID [2022-04-14 14:40:45,094 INFO L290 TraceCheckUtils]: 12: Hoare triple {5924#true} assume !(0 == ~cond); {5924#true} is VALID [2022-04-14 14:40:45,094 INFO L290 TraceCheckUtils]: 11: Hoare triple {5924#true} ~cond := #in~cond; {5924#true} is VALID [2022-04-14 14:40:45,094 INFO L272 TraceCheckUtils]: 10: Hoare triple {6070#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0 + ~v6~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {5924#true} is VALID [2022-04-14 14:40:45,096 INFO L290 TraceCheckUtils]: 9: Hoare triple {6074#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} ~l~0 := 1 + ~l~0; {6070#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:40:47,198 WARN L290 TraceCheckUtils]: 8: Hoare triple {6070#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 9 then ~l~0 % 4294967296 % 9 - 9 else ~l~0 % 4294967296 % 9) % 4294967296;~v6~0 := 1 + ~v6~0; {6074#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is UNKNOWN [2022-04-14 14:40:47,199 INFO L290 TraceCheckUtils]: 7: Hoare triple {6070#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {6070#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:40:47,200 INFO L290 TraceCheckUtils]: 6: Hoare triple {6070#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {6070#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:40:47,201 INFO L290 TraceCheckUtils]: 5: Hoare triple {5924#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v1~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;~v5~0 := 0;~v6~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {6070#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:40:47,201 INFO L272 TraceCheckUtils]: 4: Hoare triple {5924#true} call #t~ret5 := main(); {5924#true} is VALID [2022-04-14 14:40:47,202 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5924#true} {5924#true} #91#return; {5924#true} is VALID [2022-04-14 14:40:47,202 INFO L290 TraceCheckUtils]: 2: Hoare triple {5924#true} assume true; {5924#true} is VALID [2022-04-14 14:40:47,202 INFO L290 TraceCheckUtils]: 1: Hoare triple {5924#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {5924#true} is VALID [2022-04-14 14:40:47,202 INFO L272 TraceCheckUtils]: 0: Hoare triple {5924#true} call ULTIMATE.init(); {5924#true} is VALID [2022-04-14 14:40:47,202 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-04-14 14:40:47,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1081613654] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-14 14:40:47,202 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-14 14:40:47,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 11] total 17 [2022-04-14 14:40:47,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326768076] [2022-04-14 14:40:47,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 14:40:47,203 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 37 [2022-04-14 14:40:47,203 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 14:40:47,203 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 14:40:51,457 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 24 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-14 14:40:51,457 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-14 14:40:51,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 14:40:51,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-14 14:40:51,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2022-04-14 14:40:51,458 INFO L87 Difference]: Start difference. First operand 115 states and 163 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 14:40:53,556 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:40:55,774 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:40:57,958 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:41:00,078 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:41:02,267 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:41:04,430 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:41:06,533 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:41:08,681 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:41:10,795 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:41:13,030 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:41:13,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:41:13,169 INFO L93 Difference]: Finished difference Result 132 states and 188 transitions. [2022-04-14 14:41:13,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-14 14:41:13,170 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 37 [2022-04-14 14:41:13,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 14:41:13,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 14:41:13,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 55 transitions. [2022-04-14 14:41:13,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 14:41:13,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 55 transitions. [2022-04-14 14:41:13,171 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 55 transitions. [2022-04-14 14:41:17,471 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 53 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-14 14:41:17,473 INFO L225 Difference]: With dead ends: 132 [2022-04-14 14:41:17,473 INFO L226 Difference]: Without dead ends: 130 [2022-04-14 14:41:17,473 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 66 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2022-04-14 14:41:17,473 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 6 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 1 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.9s IncrementalHoareTripleChecker+Time [2022-04-14 14:41:17,474 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 60 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 76 Invalid, 10 Unknown, 0 Unchecked, 20.9s Time] [2022-04-14 14:41:17,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-04-14 14:41:17,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 129. [2022-04-14 14:41:17,528 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 14:41:17,529 INFO L82 GeneralOperation]: Start isEquivalent. First operand 130 states. Second operand has 129 states, 107 states have (on average 1.5233644859813085) internal successors, (163), 107 states have internal predecessors, (163), 11 states have call successors, (11), 11 states have call predecessors, (11), 10 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-14 14:41:17,529 INFO L74 IsIncluded]: Start isIncluded. First operand 130 states. Second operand has 129 states, 107 states have (on average 1.5233644859813085) internal successors, (163), 107 states have internal predecessors, (163), 11 states have call successors, (11), 11 states have call predecessors, (11), 10 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-14 14:41:17,529 INFO L87 Difference]: Start difference. First operand 130 states. Second operand has 129 states, 107 states have (on average 1.5233644859813085) internal successors, (163), 107 states have internal predecessors, (163), 11 states have call successors, (11), 11 states have call predecessors, (11), 10 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-14 14:41:17,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:41:17,531 INFO L93 Difference]: Finished difference Result 130 states and 186 transitions. [2022-04-14 14:41:17,531 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 186 transitions. [2022-04-14 14:41:17,531 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:41:17,531 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:41:17,531 INFO L74 IsIncluded]: Start isIncluded. First operand has 129 states, 107 states have (on average 1.5233644859813085) internal successors, (163), 107 states have internal predecessors, (163), 11 states have call successors, (11), 11 states have call predecessors, (11), 10 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 130 states. [2022-04-14 14:41:17,531 INFO L87 Difference]: Start difference. First operand has 129 states, 107 states have (on average 1.5233644859813085) internal successors, (163), 107 states have internal predecessors, (163), 11 states have call successors, (11), 11 states have call predecessors, (11), 10 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 130 states. [2022-04-14 14:41:17,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:41:17,534 INFO L93 Difference]: Finished difference Result 130 states and 186 transitions. [2022-04-14 14:41:17,534 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 186 transitions. [2022-04-14 14:41:17,534 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:41:17,534 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:41:17,534 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 14:41:17,534 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 14:41:17,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 107 states have (on average 1.5233644859813085) internal successors, (163), 107 states have internal predecessors, (163), 11 states have call successors, (11), 11 states have call predecessors, (11), 10 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-14 14:41:17,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 184 transitions. [2022-04-14 14:41:17,536 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 184 transitions. Word has length 37 [2022-04-14 14:41:17,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 14:41:17,537 INFO L478 AbstractCegarLoop]: Abstraction has 129 states and 184 transitions. [2022-04-14 14:41:17,537 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 14:41:17,537 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 184 transitions. [2022-04-14 14:41:17,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-14 14:41:17,538 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 14:41:17,538 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 14:41:17,553 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-04-14 14:41:17,743 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-14 14:41:17,743 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 14:41:17,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 14:41:17,744 INFO L85 PathProgramCache]: Analyzing trace with hash -1471641970, now seen corresponding path program 1 times [2022-04-14 14:41:17,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 14:41:17,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766279607] [2022-04-14 14:41:17,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 14:41:17,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 14:41:17,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:41:17,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 14:41:17,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:41:17,989 INFO L290 TraceCheckUtils]: 0: Hoare triple {6778#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {6779#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-14 14:41:17,990 INFO L290 TraceCheckUtils]: 1: Hoare triple {6779#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} assume true; {6779#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-14 14:41:17,990 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6779#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {6760#true} #91#return; {6765#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-14 14:41:17,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-04-14 14:41:17,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:41:17,995 INFO L290 TraceCheckUtils]: 0: Hoare triple {6760#true} ~cond := #in~cond; {6760#true} is VALID [2022-04-14 14:41:17,995 INFO L290 TraceCheckUtils]: 1: Hoare triple {6760#true} assume !(0 == ~cond); {6760#true} is VALID [2022-04-14 14:41:17,995 INFO L290 TraceCheckUtils]: 2: Hoare triple {6760#true} assume true; {6760#true} is VALID [2022-04-14 14:41:17,996 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6760#true} {6768#(and (or (<= (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296) 4274967296) (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296))) (<= 1 (+ (* 2 (div main_~l~0 4294967296)) main_~l~0))) (<= (+ (* 715827883 (div main_~l~0 4294967296)) (* 715827883 (div (+ main_~l~0 (* (- 6) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) 0))} #89#return; {6768#(and (or (<= (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296) 4274967296) (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296))) (<= 1 (+ (* 2 (div main_~l~0 4294967296)) main_~l~0))) (<= (+ (* 715827883 (div main_~l~0 4294967296)) (* 715827883 (div (+ main_~l~0 (* (- 6) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) 0))} is VALID [2022-04-14 14:41:17,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-04-14 14:41:17,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:41:17,998 INFO L290 TraceCheckUtils]: 0: Hoare triple {6760#true} ~cond := #in~cond; {6760#true} is VALID [2022-04-14 14:41:17,998 INFO L290 TraceCheckUtils]: 1: Hoare triple {6760#true} assume !(0 == ~cond); {6760#true} is VALID [2022-04-14 14:41:17,998 INFO L290 TraceCheckUtils]: 2: Hoare triple {6760#true} assume true; {6760#true} is VALID [2022-04-14 14:41:17,998 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6760#true} {6761#false} #89#return; {6761#false} is VALID [2022-04-14 14:41:17,999 INFO L272 TraceCheckUtils]: 0: Hoare triple {6760#true} call ULTIMATE.init(); {6778#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 14:41:17,999 INFO L290 TraceCheckUtils]: 1: Hoare triple {6778#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {6779#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-14 14:41:18,000 INFO L290 TraceCheckUtils]: 2: Hoare triple {6779#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} assume true; {6779#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-14 14:41:18,000 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6779#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {6760#true} #91#return; {6765#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-14 14:41:18,001 INFO L272 TraceCheckUtils]: 4: Hoare triple {6765#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} call #t~ret5 := main(); {6765#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-14 14:41:18,001 INFO L290 TraceCheckUtils]: 5: Hoare triple {6765#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v1~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;~v5~0 := 0;~v6~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {6766#(and (<= ~SIZE~0 20000001) (= main_~l~0 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-14 14:41:18,002 INFO L290 TraceCheckUtils]: 6: Hoare triple {6766#(and (<= ~SIZE~0 20000001) (= main_~l~0 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {6767#(and (= main_~l~0 0) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-14 14:41:18,002 INFO L290 TraceCheckUtils]: 7: Hoare triple {6767#(and (= main_~l~0 0) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {6767#(and (= main_~l~0 0) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-14 14:41:18,003 INFO L290 TraceCheckUtils]: 8: Hoare triple {6767#(and (= main_~l~0 0) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 9 then ~l~0 % 4294967296 % 9 - 9 else ~l~0 % 4294967296 % 9) % 4294967296;~v6~0 := 1 + ~v6~0; {6767#(and (= main_~l~0 0) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-14 14:41:18,003 INFO L290 TraceCheckUtils]: 9: Hoare triple {6767#(and (= main_~l~0 0) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))))} ~l~0 := 1 + ~l~0; {6768#(and (or (<= (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296) 4274967296) (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296))) (<= 1 (+ (* 2 (div main_~l~0 4294967296)) main_~l~0))) (<= (+ (* 715827883 (div main_~l~0 4294967296)) (* 715827883 (div (+ main_~l~0 (* (- 6) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) 0))} is VALID [2022-04-14 14:41:18,003 INFO L272 TraceCheckUtils]: 10: Hoare triple {6768#(and (or (<= (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296) 4274967296) (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296))) (<= 1 (+ (* 2 (div main_~l~0 4294967296)) main_~l~0))) (<= (+ (* 715827883 (div main_~l~0 4294967296)) (* 715827883 (div (+ main_~l~0 (* (- 6) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0 + ~v6~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {6760#true} is VALID [2022-04-14 14:41:18,003 INFO L290 TraceCheckUtils]: 11: Hoare triple {6760#true} ~cond := #in~cond; {6760#true} is VALID [2022-04-14 14:41:18,003 INFO L290 TraceCheckUtils]: 12: Hoare triple {6760#true} assume !(0 == ~cond); {6760#true} is VALID [2022-04-14 14:41:18,003 INFO L290 TraceCheckUtils]: 13: Hoare triple {6760#true} assume true; {6760#true} is VALID [2022-04-14 14:41:18,004 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {6760#true} {6768#(and (or (<= (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296) 4274967296) (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296))) (<= 1 (+ (* 2 (div main_~l~0 4294967296)) main_~l~0))) (<= (+ (* 715827883 (div main_~l~0 4294967296)) (* 715827883 (div (+ main_~l~0 (* (- 6) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) 0))} #89#return; {6768#(and (or (<= (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296) 4274967296) (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296))) (<= 1 (+ (* 2 (div main_~l~0 4294967296)) main_~l~0))) (<= (+ (* 715827883 (div main_~l~0 4294967296)) (* 715827883 (div (+ main_~l~0 (* (- 6) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) 0))} is VALID [2022-04-14 14:41:18,005 INFO L290 TraceCheckUtils]: 15: Hoare triple {6768#(and (or (<= (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296) 4274967296) (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296))) (<= 1 (+ (* 2 (div main_~l~0 4294967296)) main_~l~0))) (<= (+ (* 715827883 (div main_~l~0 4294967296)) (* 715827883 (div (+ main_~l~0 (* (- 6) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {6773#(and (<= (+ (* 715827883 (div main_~l~0 4294967296)) (* 715827883 (div (+ main_~l~0 (* (- 6) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) 0) (<= 1 (+ (* 2 (div main_~l~0 4294967296)) main_~l~0)))} is VALID [2022-04-14 14:41:18,006 INFO L290 TraceCheckUtils]: 16: Hoare triple {6773#(and (<= (+ (* 715827883 (div main_~l~0 4294967296)) (* 715827883 (div (+ main_~l~0 (* (- 6) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) 0) (<= 1 (+ (* 2 (div main_~l~0 4294967296)) main_~l~0)))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 9 then ~l~0 % 4294967296 % 9 - 9 else ~l~0 % 4294967296 % 9) % 4294967296); {6773#(and (<= (+ (* 715827883 (div main_~l~0 4294967296)) (* 715827883 (div (+ main_~l~0 (* (- 6) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) 0) (<= 1 (+ (* 2 (div main_~l~0 4294967296)) main_~l~0)))} is VALID [2022-04-14 14:41:18,006 INFO L290 TraceCheckUtils]: 17: Hoare triple {6773#(and (<= (+ (* 715827883 (div main_~l~0 4294967296)) (* 715827883 (div (+ main_~l~0 (* (- 6) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) 0) (<= 1 (+ (* 2 (div main_~l~0 4294967296)) main_~l~0)))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {6773#(and (<= (+ (* 715827883 (div main_~l~0 4294967296)) (* 715827883 (div (+ main_~l~0 (* (- 6) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) 0) (<= 1 (+ (* 2 (div main_~l~0 4294967296)) main_~l~0)))} is VALID [2022-04-14 14:41:18,007 INFO L290 TraceCheckUtils]: 18: Hoare triple {6773#(and (<= (+ (* 715827883 (div main_~l~0 4294967296)) (* 715827883 (div (+ main_~l~0 (* (- 6) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) 0) (<= 1 (+ (* 2 (div main_~l~0 4294967296)) main_~l~0)))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296); {6773#(and (<= (+ (* 715827883 (div main_~l~0 4294967296)) (* 715827883 (div (+ main_~l~0 (* (- 6) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) 0) (<= 1 (+ (* 2 (div main_~l~0 4294967296)) main_~l~0)))} is VALID [2022-04-14 14:41:18,008 INFO L290 TraceCheckUtils]: 19: Hoare triple {6773#(and (<= (+ (* 715827883 (div main_~l~0 4294967296)) (* 715827883 (div (+ main_~l~0 (* (- 6) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) 0) (<= 1 (+ (* 2 (div main_~l~0 4294967296)) main_~l~0)))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296;~v2~0 := 1 + ~v2~0; {6761#false} is VALID [2022-04-14 14:41:18,009 INFO L290 TraceCheckUtils]: 20: Hoare triple {6761#false} ~l~0 := 1 + ~l~0; {6761#false} is VALID [2022-04-14 14:41:18,009 INFO L272 TraceCheckUtils]: 21: Hoare triple {6761#false} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0 + ~v6~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {6760#true} is VALID [2022-04-14 14:41:18,009 INFO L290 TraceCheckUtils]: 22: Hoare triple {6760#true} ~cond := #in~cond; {6760#true} is VALID [2022-04-14 14:41:18,009 INFO L290 TraceCheckUtils]: 23: Hoare triple {6760#true} assume !(0 == ~cond); {6760#true} is VALID [2022-04-14 14:41:18,009 INFO L290 TraceCheckUtils]: 24: Hoare triple {6760#true} assume true; {6760#true} is VALID [2022-04-14 14:41:18,009 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {6760#true} {6761#false} #89#return; {6761#false} is VALID [2022-04-14 14:41:18,009 INFO L290 TraceCheckUtils]: 26: Hoare triple {6761#false} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {6761#false} is VALID [2022-04-14 14:41:18,009 INFO L290 TraceCheckUtils]: 27: Hoare triple {6761#false} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 9 then ~l~0 % 4294967296 % 9 - 9 else ~l~0 % 4294967296 % 9) % 4294967296); {6761#false} is VALID [2022-04-14 14:41:18,009 INFO L290 TraceCheckUtils]: 28: Hoare triple {6761#false} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {6761#false} is VALID [2022-04-14 14:41:18,009 INFO L290 TraceCheckUtils]: 29: Hoare triple {6761#false} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296); {6761#false} is VALID [2022-04-14 14:41:18,009 INFO L290 TraceCheckUtils]: 30: Hoare triple {6761#false} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {6761#false} is VALID [2022-04-14 14:41:18,009 INFO L290 TraceCheckUtils]: 31: Hoare triple {6761#false} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296;~v3~0 := 1 + ~v3~0; {6761#false} is VALID [2022-04-14 14:41:18,009 INFO L290 TraceCheckUtils]: 32: Hoare triple {6761#false} ~l~0 := 1 + ~l~0; {6761#false} is VALID [2022-04-14 14:41:18,009 INFO L272 TraceCheckUtils]: 33: Hoare triple {6761#false} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0 + ~v6~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {6761#false} is VALID [2022-04-14 14:41:18,009 INFO L290 TraceCheckUtils]: 34: Hoare triple {6761#false} ~cond := #in~cond; {6761#false} is VALID [2022-04-14 14:41:18,009 INFO L290 TraceCheckUtils]: 35: Hoare triple {6761#false} assume 0 == ~cond; {6761#false} is VALID [2022-04-14 14:41:18,010 INFO L290 TraceCheckUtils]: 36: Hoare triple {6761#false} assume !false; {6761#false} is VALID [2022-04-14 14:41:18,010 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-14 14:41:18,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 14:41:18,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766279607] [2022-04-14 14:41:18,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766279607] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-14 14:41:18,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [572823427] [2022-04-14 14:41:18,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 14:41:18,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 14:41:18,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 14:41:18,011 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 14:41:18,012 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-04-14 14:41:18,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:41:18,047 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-14 14:41:18,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:41:18,055 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 14:41:18,894 INFO L272 TraceCheckUtils]: 0: Hoare triple {6760#true} call ULTIMATE.init(); {6760#true} is VALID [2022-04-14 14:41:18,895 INFO L290 TraceCheckUtils]: 1: Hoare triple {6760#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {6760#true} is VALID [2022-04-14 14:41:18,895 INFO L290 TraceCheckUtils]: 2: Hoare triple {6760#true} assume true; {6760#true} is VALID [2022-04-14 14:41:18,895 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6760#true} {6760#true} #91#return; {6760#true} is VALID [2022-04-14 14:41:18,895 INFO L272 TraceCheckUtils]: 4: Hoare triple {6760#true} call #t~ret5 := main(); {6760#true} is VALID [2022-04-14 14:41:18,895 INFO L290 TraceCheckUtils]: 5: Hoare triple {6760#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v1~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;~v5~0 := 0;~v6~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {6798#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v6~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:41:18,896 INFO L290 TraceCheckUtils]: 6: Hoare triple {6798#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v6~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {6798#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v6~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:41:18,896 INFO L290 TraceCheckUtils]: 7: Hoare triple {6798#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v6~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {6798#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v6~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:41:18,897 INFO L290 TraceCheckUtils]: 8: Hoare triple {6798#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v6~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 9 then ~l~0 % 4294967296 % 9 - 9 else ~l~0 % 4294967296 % 9) % 4294967296;~v6~0 := 1 + ~v6~0; {6808#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:41:18,897 INFO L290 TraceCheckUtils]: 9: Hoare triple {6808#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {6812#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:41:18,897 INFO L272 TraceCheckUtils]: 10: Hoare triple {6812#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0 + ~v6~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {6760#true} is VALID [2022-04-14 14:41:18,897 INFO L290 TraceCheckUtils]: 11: Hoare triple {6760#true} ~cond := #in~cond; {6760#true} is VALID [2022-04-14 14:41:18,897 INFO L290 TraceCheckUtils]: 12: Hoare triple {6760#true} assume !(0 == ~cond); {6760#true} is VALID [2022-04-14 14:41:18,897 INFO L290 TraceCheckUtils]: 13: Hoare triple {6760#true} assume true; {6760#true} is VALID [2022-04-14 14:41:18,898 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {6760#true} {6812#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} #89#return; {6812#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:41:18,898 INFO L290 TraceCheckUtils]: 15: Hoare triple {6812#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {6812#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:41:18,899 INFO L290 TraceCheckUtils]: 16: Hoare triple {6812#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 9 then ~l~0 % 4294967296 % 9 - 9 else ~l~0 % 4294967296 % 9) % 4294967296); {6812#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:41:18,899 INFO L290 TraceCheckUtils]: 17: Hoare triple {6812#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {6812#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:41:18,900 INFO L290 TraceCheckUtils]: 18: Hoare triple {6812#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296); {6812#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:41:18,900 INFO L290 TraceCheckUtils]: 19: Hoare triple {6812#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296;~v2~0 := 1 + ~v2~0; {6843#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:41:18,901 INFO L290 TraceCheckUtils]: 20: Hoare triple {6843#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {6847#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:41:18,901 INFO L272 TraceCheckUtils]: 21: Hoare triple {6847#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0 + ~v6~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {6760#true} is VALID [2022-04-14 14:41:18,901 INFO L290 TraceCheckUtils]: 22: Hoare triple {6760#true} ~cond := #in~cond; {6760#true} is VALID [2022-04-14 14:41:18,901 INFO L290 TraceCheckUtils]: 23: Hoare triple {6760#true} assume !(0 == ~cond); {6760#true} is VALID [2022-04-14 14:41:18,901 INFO L290 TraceCheckUtils]: 24: Hoare triple {6760#true} assume true; {6760#true} is VALID [2022-04-14 14:41:18,901 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {6760#true} {6847#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} #89#return; {6847#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:41:18,902 INFO L290 TraceCheckUtils]: 26: Hoare triple {6847#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {6847#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:41:18,902 INFO L290 TraceCheckUtils]: 27: Hoare triple {6847#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 9 then ~l~0 % 4294967296 % 9 - 9 else ~l~0 % 4294967296 % 9) % 4294967296); {6847#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:41:18,903 INFO L290 TraceCheckUtils]: 28: Hoare triple {6847#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {6847#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:41:18,903 INFO L290 TraceCheckUtils]: 29: Hoare triple {6847#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296); {6847#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:41:18,904 INFO L290 TraceCheckUtils]: 30: Hoare triple {6847#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {6847#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:41:18,904 INFO L290 TraceCheckUtils]: 31: Hoare triple {6847#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296;~v3~0 := 1 + ~v3~0; {6881#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0))} is VALID [2022-04-14 14:41:18,905 INFO L290 TraceCheckUtils]: 32: Hoare triple {6881#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0))} ~l~0 := 1 + ~l~0; {6885#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 3) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0))} is VALID [2022-04-14 14:41:18,905 INFO L272 TraceCheckUtils]: 33: Hoare triple {6885#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= (+ (- 1) main_~v3~0) 0) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 3) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0 + ~v6~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {6889#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 14:41:18,906 INFO L290 TraceCheckUtils]: 34: Hoare triple {6889#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6893#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 14:41:18,906 INFO L290 TraceCheckUtils]: 35: Hoare triple {6893#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6761#false} is VALID [2022-04-14 14:41:18,906 INFO L290 TraceCheckUtils]: 36: Hoare triple {6761#false} assume !false; {6761#false} is VALID [2022-04-14 14:41:18,906 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-14 14:41:18,906 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 14:41:19,223 INFO L290 TraceCheckUtils]: 36: Hoare triple {6761#false} assume !false; {6761#false} is VALID [2022-04-14 14:41:19,224 INFO L290 TraceCheckUtils]: 35: Hoare triple {6893#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6761#false} is VALID [2022-04-14 14:41:19,224 INFO L290 TraceCheckUtils]: 34: Hoare triple {6889#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6893#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 14:41:19,225 INFO L272 TraceCheckUtils]: 33: Hoare triple {6909#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0 + ~v6~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {6889#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 14:41:19,226 INFO L290 TraceCheckUtils]: 32: Hoare triple {6913#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} ~l~0 := 1 + ~l~0; {6909#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:41:21,336 WARN L290 TraceCheckUtils]: 31: Hoare triple {6909#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296;~v3~0 := 1 + ~v3~0; {6913#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is UNKNOWN [2022-04-14 14:41:21,337 INFO L290 TraceCheckUtils]: 30: Hoare triple {6909#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {6909#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:41:21,337 INFO L290 TraceCheckUtils]: 29: Hoare triple {6909#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296); {6909#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:41:21,338 INFO L290 TraceCheckUtils]: 28: Hoare triple {6909#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {6909#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:41:21,338 INFO L290 TraceCheckUtils]: 27: Hoare triple {6909#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 9 then ~l~0 % 4294967296 % 9 - 9 else ~l~0 % 4294967296 % 9) % 4294967296); {6909#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:41:21,338 INFO L290 TraceCheckUtils]: 26: Hoare triple {6909#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {6909#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:41:21,339 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {6760#true} {6909#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} #89#return; {6909#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:41:21,339 INFO L290 TraceCheckUtils]: 24: Hoare triple {6760#true} assume true; {6760#true} is VALID [2022-04-14 14:41:21,339 INFO L290 TraceCheckUtils]: 23: Hoare triple {6760#true} assume !(0 == ~cond); {6760#true} is VALID [2022-04-14 14:41:21,339 INFO L290 TraceCheckUtils]: 22: Hoare triple {6760#true} ~cond := #in~cond; {6760#true} is VALID [2022-04-14 14:41:21,339 INFO L272 TraceCheckUtils]: 21: Hoare triple {6909#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0 + ~v6~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {6760#true} is VALID [2022-04-14 14:41:21,341 INFO L290 TraceCheckUtils]: 20: Hoare triple {6913#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} ~l~0 := 1 + ~l~0; {6909#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:41:23,452 WARN L290 TraceCheckUtils]: 19: Hoare triple {6909#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296;~v2~0 := 1 + ~v2~0; {6913#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is UNKNOWN [2022-04-14 14:41:23,453 INFO L290 TraceCheckUtils]: 18: Hoare triple {6909#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296); {6909#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:41:23,453 INFO L290 TraceCheckUtils]: 17: Hoare triple {6909#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {6909#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:41:23,453 INFO L290 TraceCheckUtils]: 16: Hoare triple {6909#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 9 then ~l~0 % 4294967296 % 9 - 9 else ~l~0 % 4294967296 % 9) % 4294967296); {6909#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:41:23,454 INFO L290 TraceCheckUtils]: 15: Hoare triple {6909#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {6909#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:41:23,455 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {6760#true} {6909#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} #89#return; {6909#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:41:23,455 INFO L290 TraceCheckUtils]: 13: Hoare triple {6760#true} assume true; {6760#true} is VALID [2022-04-14 14:41:23,455 INFO L290 TraceCheckUtils]: 12: Hoare triple {6760#true} assume !(0 == ~cond); {6760#true} is VALID [2022-04-14 14:41:23,455 INFO L290 TraceCheckUtils]: 11: Hoare triple {6760#true} ~cond := #in~cond; {6760#true} is VALID [2022-04-14 14:41:23,455 INFO L272 TraceCheckUtils]: 10: Hoare triple {6909#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0 + ~v6~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {6760#true} is VALID [2022-04-14 14:41:23,458 INFO L290 TraceCheckUtils]: 9: Hoare triple {6913#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} ~l~0 := 1 + ~l~0; {6909#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:41:25,560 WARN L290 TraceCheckUtils]: 8: Hoare triple {6909#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 9 then ~l~0 % 4294967296 % 9 - 9 else ~l~0 % 4294967296 % 9) % 4294967296;~v6~0 := 1 + ~v6~0; {6913#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is UNKNOWN [2022-04-14 14:41:25,561 INFO L290 TraceCheckUtils]: 7: Hoare triple {6909#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {6909#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:41:25,561 INFO L290 TraceCheckUtils]: 6: Hoare triple {6909#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {6909#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:41:25,563 INFO L290 TraceCheckUtils]: 5: Hoare triple {6760#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v1~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;~v5~0 := 0;~v6~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {6909#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:41:25,564 INFO L272 TraceCheckUtils]: 4: Hoare triple {6760#true} call #t~ret5 := main(); {6760#true} is VALID [2022-04-14 14:41:25,564 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6760#true} {6760#true} #91#return; {6760#true} is VALID [2022-04-14 14:41:25,564 INFO L290 TraceCheckUtils]: 2: Hoare triple {6760#true} assume true; {6760#true} is VALID [2022-04-14 14:41:25,564 INFO L290 TraceCheckUtils]: 1: Hoare triple {6760#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {6760#true} is VALID [2022-04-14 14:41:25,564 INFO L272 TraceCheckUtils]: 0: Hoare triple {6760#true} call ULTIMATE.init(); {6760#true} is VALID [2022-04-14 14:41:25,564 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-04-14 14:41:25,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [572823427] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-14 14:41:25,564 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-14 14:41:25,564 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9, 11] total 20 [2022-04-14 14:41:25,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961580219] [2022-04-14 14:41:25,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 14:41:25,565 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 37 [2022-04-14 14:41:25,565 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 14:41:25,565 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 14:41:31,903 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 22 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-14 14:41:31,903 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-14 14:41:31,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 14:41:31,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-14 14:41:31,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2022-04-14 14:41:31,904 INFO L87 Difference]: Start difference. First operand 129 states and 184 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 14:41:34,006 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:41:36,274 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:41:38,394 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:41:42,683 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:41:44,852 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:41:49,156 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:41:53,432 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:41:57,761 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:42:02,139 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:42:04,262 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:42:04,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:42:04,440 INFO L93 Difference]: Finished difference Result 166 states and 235 transitions. [2022-04-14 14:42:04,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-14 14:42:04,440 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 37 [2022-04-14 14:42:04,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 14:42:04,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 14:42:04,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 51 transitions. [2022-04-14 14:42:04,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 14:42:04,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 51 transitions. [2022-04-14 14:42:04,441 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 51 transitions. [2022-04-14 14:42:10,815 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 48 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-14 14:42:10,817 INFO L225 Difference]: With dead ends: 166 [2022-04-14 14:42:10,817 INFO L226 Difference]: Without dead ends: 164 [2022-04-14 14:42:10,817 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 65 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2022-04-14 14:42:10,818 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 5 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 1 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.9s IncrementalHoareTripleChecker+Time [2022-04-14 14:42:10,818 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 71 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 66 Invalid, 10 Unknown, 0 Unchecked, 20.9s Time] [2022-04-14 14:42:10,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2022-04-14 14:42:10,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2022-04-14 14:42:10,898 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 14:42:10,898 INFO L82 GeneralOperation]: Start isEquivalent. First operand 164 states. Second operand has 164 states, 136 states have (on average 1.5147058823529411) internal successors, (206), 136 states have internal predecessors, (206), 14 states have call successors, (14), 14 states have call predecessors, (14), 13 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-14 14:42:10,899 INFO L74 IsIncluded]: Start isIncluded. First operand 164 states. Second operand has 164 states, 136 states have (on average 1.5147058823529411) internal successors, (206), 136 states have internal predecessors, (206), 14 states have call successors, (14), 14 states have call predecessors, (14), 13 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-14 14:42:10,899 INFO L87 Difference]: Start difference. First operand 164 states. Second operand has 164 states, 136 states have (on average 1.5147058823529411) internal successors, (206), 136 states have internal predecessors, (206), 14 states have call successors, (14), 14 states have call predecessors, (14), 13 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-14 14:42:10,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:42:10,901 INFO L93 Difference]: Finished difference Result 164 states and 233 transitions. [2022-04-14 14:42:10,901 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 233 transitions. [2022-04-14 14:42:10,901 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:42:10,902 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:42:10,902 INFO L74 IsIncluded]: Start isIncluded. First operand has 164 states, 136 states have (on average 1.5147058823529411) internal successors, (206), 136 states have internal predecessors, (206), 14 states have call successors, (14), 14 states have call predecessors, (14), 13 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 164 states. [2022-04-14 14:42:10,902 INFO L87 Difference]: Start difference. First operand has 164 states, 136 states have (on average 1.5147058823529411) internal successors, (206), 136 states have internal predecessors, (206), 14 states have call successors, (14), 14 states have call predecessors, (14), 13 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 164 states. [2022-04-14 14:42:10,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:42:10,904 INFO L93 Difference]: Finished difference Result 164 states and 233 transitions. [2022-04-14 14:42:10,904 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 233 transitions. [2022-04-14 14:42:10,904 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:42:10,904 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:42:10,905 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 14:42:10,905 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 14:42:10,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 136 states have (on average 1.5147058823529411) internal successors, (206), 136 states have internal predecessors, (206), 14 states have call successors, (14), 14 states have call predecessors, (14), 13 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-14 14:42:10,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 233 transitions. [2022-04-14 14:42:10,907 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 233 transitions. Word has length 37 [2022-04-14 14:42:10,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 14:42:10,907 INFO L478 AbstractCegarLoop]: Abstraction has 164 states and 233 transitions. [2022-04-14 14:42:10,907 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 14:42:10,907 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 233 transitions. [2022-04-14 14:42:10,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-14 14:42:10,908 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 14:42:10,908 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 14:42:10,937 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-04-14 14:42:11,127 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-04-14 14:42:11,127 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 14:42:11,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 14:42:11,128 INFO L85 PathProgramCache]: Analyzing trace with hash 877792218, now seen corresponding path program 1 times [2022-04-14 14:42:11,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 14:42:11,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297379808] [2022-04-14 14:42:11,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 14:42:11,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 14:42:11,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:42:11,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 14:42:11,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:42:11,343 INFO L290 TraceCheckUtils]: 0: Hoare triple {7772#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {7773#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-14 14:42:11,344 INFO L290 TraceCheckUtils]: 1: Hoare triple {7773#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} assume true; {7773#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-14 14:42:11,345 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7773#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {7754#true} #91#return; {7759#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-14 14:42:11,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-04-14 14:42:11,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:42:11,349 INFO L290 TraceCheckUtils]: 0: Hoare triple {7754#true} ~cond := #in~cond; {7754#true} is VALID [2022-04-14 14:42:11,349 INFO L290 TraceCheckUtils]: 1: Hoare triple {7754#true} assume !(0 == ~cond); {7754#true} is VALID [2022-04-14 14:42:11,349 INFO L290 TraceCheckUtils]: 2: Hoare triple {7754#true} assume true; {7754#true} is VALID [2022-04-14 14:42:11,350 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7754#true} {7762#(and (<= (+ (* (div main_~l~0 4294967296) 613566757) (* 613566757 (div (+ main_~l~0 (* (- 7) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) 0) (or (<= (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296) 4274967296) (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296))) (<= 1 (+ (* 3 (div main_~l~0 4294967296)) main_~l~0))))} #89#return; {7762#(and (<= (+ (* (div main_~l~0 4294967296) 613566757) (* 613566757 (div (+ main_~l~0 (* (- 7) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) 0) (or (<= (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296) 4274967296) (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296))) (<= 1 (+ (* 3 (div main_~l~0 4294967296)) main_~l~0))))} is VALID [2022-04-14 14:42:11,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-04-14 14:42:11,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:42:11,352 INFO L290 TraceCheckUtils]: 0: Hoare triple {7754#true} ~cond := #in~cond; {7754#true} is VALID [2022-04-14 14:42:11,352 INFO L290 TraceCheckUtils]: 1: Hoare triple {7754#true} assume !(0 == ~cond); {7754#true} is VALID [2022-04-14 14:42:11,352 INFO L290 TraceCheckUtils]: 2: Hoare triple {7754#true} assume true; {7754#true} is VALID [2022-04-14 14:42:11,352 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7754#true} {7755#false} #89#return; {7755#false} is VALID [2022-04-14 14:42:11,353 INFO L272 TraceCheckUtils]: 0: Hoare triple {7754#true} call ULTIMATE.init(); {7772#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 14:42:11,353 INFO L290 TraceCheckUtils]: 1: Hoare triple {7772#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {7773#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-14 14:42:11,354 INFO L290 TraceCheckUtils]: 2: Hoare triple {7773#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} assume true; {7773#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-14 14:42:11,354 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7773#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {7754#true} #91#return; {7759#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-14 14:42:11,355 INFO L272 TraceCheckUtils]: 4: Hoare triple {7759#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} call #t~ret5 := main(); {7759#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-14 14:42:11,355 INFO L290 TraceCheckUtils]: 5: Hoare triple {7759#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v1~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;~v5~0 := 0;~v6~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {7760#(and (<= ~SIZE~0 20000001) (= main_~l~0 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-14 14:42:11,356 INFO L290 TraceCheckUtils]: 6: Hoare triple {7760#(and (<= ~SIZE~0 20000001) (= main_~l~0 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {7761#(and (= main_~l~0 0) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-14 14:42:11,356 INFO L290 TraceCheckUtils]: 7: Hoare triple {7761#(and (= main_~l~0 0) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {7761#(and (= main_~l~0 0) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-14 14:42:11,357 INFO L290 TraceCheckUtils]: 8: Hoare triple {7761#(and (= main_~l~0 0) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 9 then ~l~0 % 4294967296 % 9 - 9 else ~l~0 % 4294967296 % 9) % 4294967296;~v6~0 := 1 + ~v6~0; {7761#(and (= main_~l~0 0) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-14 14:42:11,357 INFO L290 TraceCheckUtils]: 9: Hoare triple {7761#(and (= main_~l~0 0) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))))} ~l~0 := 1 + ~l~0; {7762#(and (<= (+ (* (div main_~l~0 4294967296) 613566757) (* 613566757 (div (+ main_~l~0 (* (- 7) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) 0) (or (<= (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296) 4274967296) (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296))) (<= 1 (+ (* 3 (div main_~l~0 4294967296)) main_~l~0))))} is VALID [2022-04-14 14:42:11,357 INFO L272 TraceCheckUtils]: 10: Hoare triple {7762#(and (<= (+ (* (div main_~l~0 4294967296) 613566757) (* 613566757 (div (+ main_~l~0 (* (- 7) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) 0) (or (<= (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296) 4274967296) (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296))) (<= 1 (+ (* 3 (div main_~l~0 4294967296)) main_~l~0))))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0 + ~v6~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {7754#true} is VALID [2022-04-14 14:42:11,357 INFO L290 TraceCheckUtils]: 11: Hoare triple {7754#true} ~cond := #in~cond; {7754#true} is VALID [2022-04-14 14:42:11,357 INFO L290 TraceCheckUtils]: 12: Hoare triple {7754#true} assume !(0 == ~cond); {7754#true} is VALID [2022-04-14 14:42:11,357 INFO L290 TraceCheckUtils]: 13: Hoare triple {7754#true} assume true; {7754#true} is VALID [2022-04-14 14:42:11,358 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {7754#true} {7762#(and (<= (+ (* (div main_~l~0 4294967296) 613566757) (* 613566757 (div (+ main_~l~0 (* (- 7) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) 0) (or (<= (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296) 4274967296) (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296))) (<= 1 (+ (* 3 (div main_~l~0 4294967296)) main_~l~0))))} #89#return; {7762#(and (<= (+ (* (div main_~l~0 4294967296) 613566757) (* 613566757 (div (+ main_~l~0 (* (- 7) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) 0) (or (<= (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296) 4274967296) (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296))) (<= 1 (+ (* 3 (div main_~l~0 4294967296)) main_~l~0))))} is VALID [2022-04-14 14:42:11,359 INFO L290 TraceCheckUtils]: 15: Hoare triple {7762#(and (<= (+ (* (div main_~l~0 4294967296) 613566757) (* 613566757 (div (+ main_~l~0 (* (- 7) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) 0) (or (<= (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296) 4274967296) (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296))) (<= 1 (+ (* 3 (div main_~l~0 4294967296)) main_~l~0))))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {7767#(and (<= (+ (* (div main_~l~0 4294967296) 613566757) (* 613566757 (div (+ main_~l~0 (* (- 7) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) 0) (<= 1 (+ (* 3 (div main_~l~0 4294967296)) main_~l~0)))} is VALID [2022-04-14 14:42:11,360 INFO L290 TraceCheckUtils]: 16: Hoare triple {7767#(and (<= (+ (* (div main_~l~0 4294967296) 613566757) (* 613566757 (div (+ main_~l~0 (* (- 7) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) 0) (<= 1 (+ (* 3 (div main_~l~0 4294967296)) main_~l~0)))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 9 then ~l~0 % 4294967296 % 9 - 9 else ~l~0 % 4294967296 % 9) % 4294967296); {7767#(and (<= (+ (* (div main_~l~0 4294967296) 613566757) (* 613566757 (div (+ main_~l~0 (* (- 7) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) 0) (<= 1 (+ (* 3 (div main_~l~0 4294967296)) main_~l~0)))} is VALID [2022-04-14 14:42:11,360 INFO L290 TraceCheckUtils]: 17: Hoare triple {7767#(and (<= (+ (* (div main_~l~0 4294967296) 613566757) (* 613566757 (div (+ main_~l~0 (* (- 7) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) 0) (<= 1 (+ (* 3 (div main_~l~0 4294967296)) main_~l~0)))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {7767#(and (<= (+ (* (div main_~l~0 4294967296) 613566757) (* 613566757 (div (+ main_~l~0 (* (- 7) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) 0) (<= 1 (+ (* 3 (div main_~l~0 4294967296)) main_~l~0)))} is VALID [2022-04-14 14:42:11,362 INFO L290 TraceCheckUtils]: 18: Hoare triple {7767#(and (<= (+ (* (div main_~l~0 4294967296) 613566757) (* 613566757 (div (+ main_~l~0 (* (- 7) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) 0) (<= 1 (+ (* 3 (div main_~l~0 4294967296)) main_~l~0)))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296;~v1~0 := 1 + ~v1~0; {7755#false} is VALID [2022-04-14 14:42:11,362 INFO L290 TraceCheckUtils]: 19: Hoare triple {7755#false} ~l~0 := 1 + ~l~0; {7755#false} is VALID [2022-04-14 14:42:11,362 INFO L272 TraceCheckUtils]: 20: Hoare triple {7755#false} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0 + ~v6~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {7754#true} is VALID [2022-04-14 14:42:11,362 INFO L290 TraceCheckUtils]: 21: Hoare triple {7754#true} ~cond := #in~cond; {7754#true} is VALID [2022-04-14 14:42:11,362 INFO L290 TraceCheckUtils]: 22: Hoare triple {7754#true} assume !(0 == ~cond); {7754#true} is VALID [2022-04-14 14:42:11,362 INFO L290 TraceCheckUtils]: 23: Hoare triple {7754#true} assume true; {7754#true} is VALID [2022-04-14 14:42:11,363 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {7754#true} {7755#false} #89#return; {7755#false} is VALID [2022-04-14 14:42:11,363 INFO L290 TraceCheckUtils]: 25: Hoare triple {7755#false} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {7755#false} is VALID [2022-04-14 14:42:11,363 INFO L290 TraceCheckUtils]: 26: Hoare triple {7755#false} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 9 then ~l~0 % 4294967296 % 9 - 9 else ~l~0 % 4294967296 % 9) % 4294967296); {7755#false} is VALID [2022-04-14 14:42:11,363 INFO L290 TraceCheckUtils]: 27: Hoare triple {7755#false} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {7755#false} is VALID [2022-04-14 14:42:11,363 INFO L290 TraceCheckUtils]: 28: Hoare triple {7755#false} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296); {7755#false} is VALID [2022-04-14 14:42:11,363 INFO L290 TraceCheckUtils]: 29: Hoare triple {7755#false} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {7755#false} is VALID [2022-04-14 14:42:11,363 INFO L290 TraceCheckUtils]: 30: Hoare triple {7755#false} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {7755#false} is VALID [2022-04-14 14:42:11,363 INFO L290 TraceCheckUtils]: 31: Hoare triple {7755#false} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296); {7755#false} is VALID [2022-04-14 14:42:11,363 INFO L290 TraceCheckUtils]: 32: Hoare triple {7755#false} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 3 then ~l~0 % 4294967296 % 3 - 3 else ~l~0 % 4294967296 % 3) % 4294967296;~i~0 := 1 + ~i~0; {7755#false} is VALID [2022-04-14 14:42:11,363 INFO L290 TraceCheckUtils]: 33: Hoare triple {7755#false} ~l~0 := 1 + ~l~0; {7755#false} is VALID [2022-04-14 14:42:11,363 INFO L272 TraceCheckUtils]: 34: Hoare triple {7755#false} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0 + ~v6~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {7755#false} is VALID [2022-04-14 14:42:11,363 INFO L290 TraceCheckUtils]: 35: Hoare triple {7755#false} ~cond := #in~cond; {7755#false} is VALID [2022-04-14 14:42:11,363 INFO L290 TraceCheckUtils]: 36: Hoare triple {7755#false} assume 0 == ~cond; {7755#false} is VALID [2022-04-14 14:42:11,363 INFO L290 TraceCheckUtils]: 37: Hoare triple {7755#false} assume !false; {7755#false} is VALID [2022-04-14 14:42:11,364 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-14 14:42:11,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 14:42:11,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297379808] [2022-04-14 14:42:11,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297379808] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-14 14:42:11,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [367147350] [2022-04-14 14:42:11,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 14:42:11,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 14:42:11,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 14:42:11,365 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 14:42:11,366 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-04-14 14:42:11,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:42:11,399 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-14 14:42:11,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:42:11,406 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 14:42:12,221 INFO L272 TraceCheckUtils]: 0: Hoare triple {7754#true} call ULTIMATE.init(); {7754#true} is VALID [2022-04-14 14:42:12,221 INFO L290 TraceCheckUtils]: 1: Hoare triple {7754#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {7754#true} is VALID [2022-04-14 14:42:12,221 INFO L290 TraceCheckUtils]: 2: Hoare triple {7754#true} assume true; {7754#true} is VALID [2022-04-14 14:42:12,221 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7754#true} {7754#true} #91#return; {7754#true} is VALID [2022-04-14 14:42:12,221 INFO L272 TraceCheckUtils]: 4: Hoare triple {7754#true} call #t~ret5 := main(); {7754#true} is VALID [2022-04-14 14:42:12,222 INFO L290 TraceCheckUtils]: 5: Hoare triple {7754#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v1~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;~v5~0 := 0;~v6~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {7792#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v6~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:42:12,222 INFO L290 TraceCheckUtils]: 6: Hoare triple {7792#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v6~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {7792#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v6~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:42:12,223 INFO L290 TraceCheckUtils]: 7: Hoare triple {7792#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v6~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {7792#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v6~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:42:12,223 INFO L290 TraceCheckUtils]: 8: Hoare triple {7792#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v6~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 9 then ~l~0 % 4294967296 % 9 - 9 else ~l~0 % 4294967296 % 9) % 4294967296;~v6~0 := 1 + ~v6~0; {7802#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:42:12,224 INFO L290 TraceCheckUtils]: 9: Hoare triple {7802#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {7806#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:42:12,224 INFO L272 TraceCheckUtils]: 10: Hoare triple {7806#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0 + ~v6~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {7754#true} is VALID [2022-04-14 14:42:12,224 INFO L290 TraceCheckUtils]: 11: Hoare triple {7754#true} ~cond := #in~cond; {7754#true} is VALID [2022-04-14 14:42:12,224 INFO L290 TraceCheckUtils]: 12: Hoare triple {7754#true} assume !(0 == ~cond); {7754#true} is VALID [2022-04-14 14:42:12,224 INFO L290 TraceCheckUtils]: 13: Hoare triple {7754#true} assume true; {7754#true} is VALID [2022-04-14 14:42:12,224 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {7754#true} {7806#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} #89#return; {7806#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:42:12,225 INFO L290 TraceCheckUtils]: 15: Hoare triple {7806#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {7806#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:42:12,225 INFO L290 TraceCheckUtils]: 16: Hoare triple {7806#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 9 then ~l~0 % 4294967296 % 9 - 9 else ~l~0 % 4294967296 % 9) % 4294967296); {7806#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:42:12,226 INFO L290 TraceCheckUtils]: 17: Hoare triple {7806#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {7806#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:42:12,226 INFO L290 TraceCheckUtils]: 18: Hoare triple {7806#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296;~v1~0 := 1 + ~v1~0; {7834#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:42:12,227 INFO L290 TraceCheckUtils]: 19: Hoare triple {7834#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {7838#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1) (= main_~v3~0 0))} is VALID [2022-04-14 14:42:12,227 INFO L272 TraceCheckUtils]: 20: Hoare triple {7838#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1) (= main_~v3~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0 + ~v6~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {7754#true} is VALID [2022-04-14 14:42:12,227 INFO L290 TraceCheckUtils]: 21: Hoare triple {7754#true} ~cond := #in~cond; {7754#true} is VALID [2022-04-14 14:42:12,227 INFO L290 TraceCheckUtils]: 22: Hoare triple {7754#true} assume !(0 == ~cond); {7754#true} is VALID [2022-04-14 14:42:12,227 INFO L290 TraceCheckUtils]: 23: Hoare triple {7754#true} assume true; {7754#true} is VALID [2022-04-14 14:42:12,231 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {7754#true} {7838#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1) (= main_~v3~0 0))} #89#return; {7838#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1) (= main_~v3~0 0))} is VALID [2022-04-14 14:42:12,231 INFO L290 TraceCheckUtils]: 25: Hoare triple {7838#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {7838#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1) (= main_~v3~0 0))} is VALID [2022-04-14 14:42:12,232 INFO L290 TraceCheckUtils]: 26: Hoare triple {7838#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 9 then ~l~0 % 4294967296 % 9 - 9 else ~l~0 % 4294967296 % 9) % 4294967296); {7838#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1) (= main_~v3~0 0))} is VALID [2022-04-14 14:42:12,232 INFO L290 TraceCheckUtils]: 27: Hoare triple {7838#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {7838#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1) (= main_~v3~0 0))} is VALID [2022-04-14 14:42:12,233 INFO L290 TraceCheckUtils]: 28: Hoare triple {7838#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296); {7838#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1) (= main_~v3~0 0))} is VALID [2022-04-14 14:42:12,233 INFO L290 TraceCheckUtils]: 29: Hoare triple {7838#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {7838#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1) (= main_~v3~0 0))} is VALID [2022-04-14 14:42:12,234 INFO L290 TraceCheckUtils]: 30: Hoare triple {7838#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {7838#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1) (= main_~v3~0 0))} is VALID [2022-04-14 14:42:12,234 INFO L290 TraceCheckUtils]: 31: Hoare triple {7838#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296); {7838#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1) (= main_~v3~0 0))} is VALID [2022-04-14 14:42:12,234 INFO L290 TraceCheckUtils]: 32: Hoare triple {7838#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 3 then ~l~0 % 4294967296 % 3 - 3 else ~l~0 % 4294967296 % 3) % 4294967296;~i~0 := 1 + ~i~0; {7878#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= (+ (- 1) main_~l~0) 1) (= main_~v3~0 0))} is VALID [2022-04-14 14:42:12,235 INFO L290 TraceCheckUtils]: 33: Hoare triple {7878#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= (+ (- 1) main_~l~0) 1) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {7882#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~l~0 3) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:42:12,236 INFO L272 TraceCheckUtils]: 34: Hoare triple {7882#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~v1~0 1) (= main_~j~0 0) (= main_~l~0 3) (= main_~v4~0 0) (= (+ (- 1) main_~i~0) 0) (= main_~v3~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0 + ~v6~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {7886#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 14:42:12,236 INFO L290 TraceCheckUtils]: 35: Hoare triple {7886#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7890#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 14:42:12,236 INFO L290 TraceCheckUtils]: 36: Hoare triple {7890#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7755#false} is VALID [2022-04-14 14:42:12,236 INFO L290 TraceCheckUtils]: 37: Hoare triple {7755#false} assume !false; {7755#false} is VALID [2022-04-14 14:42:12,237 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-14 14:42:12,237 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 14:42:12,595 INFO L290 TraceCheckUtils]: 37: Hoare triple {7755#false} assume !false; {7755#false} is VALID [2022-04-14 14:42:12,596 INFO L290 TraceCheckUtils]: 36: Hoare triple {7890#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7755#false} is VALID [2022-04-14 14:42:12,596 INFO L290 TraceCheckUtils]: 35: Hoare triple {7886#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7890#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 14:42:12,597 INFO L272 TraceCheckUtils]: 34: Hoare triple {7906#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0 + ~v6~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {7886#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 14:42:12,598 INFO L290 TraceCheckUtils]: 33: Hoare triple {7910#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} ~l~0 := 1 + ~l~0; {7906#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:42:14,710 WARN L290 TraceCheckUtils]: 32: Hoare triple {7906#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 3 then ~l~0 % 4294967296 % 3 - 3 else ~l~0 % 4294967296 % 3) % 4294967296;~i~0 := 1 + ~i~0; {7910#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is UNKNOWN [2022-04-14 14:42:14,710 INFO L290 TraceCheckUtils]: 31: Hoare triple {7906#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296); {7906#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:42:14,711 INFO L290 TraceCheckUtils]: 30: Hoare triple {7906#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {7906#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:42:14,711 INFO L290 TraceCheckUtils]: 29: Hoare triple {7906#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {7906#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:42:14,711 INFO L290 TraceCheckUtils]: 28: Hoare triple {7906#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296); {7906#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:42:14,712 INFO L290 TraceCheckUtils]: 27: Hoare triple {7906#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {7906#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:42:14,712 INFO L290 TraceCheckUtils]: 26: Hoare triple {7906#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 9 then ~l~0 % 4294967296 % 9 - 9 else ~l~0 % 4294967296 % 9) % 4294967296); {7906#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:42:14,712 INFO L290 TraceCheckUtils]: 25: Hoare triple {7906#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {7906#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:42:14,713 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {7754#true} {7906#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} #89#return; {7906#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:42:14,713 INFO L290 TraceCheckUtils]: 23: Hoare triple {7754#true} assume true; {7754#true} is VALID [2022-04-14 14:42:14,713 INFO L290 TraceCheckUtils]: 22: Hoare triple {7754#true} assume !(0 == ~cond); {7754#true} is VALID [2022-04-14 14:42:14,713 INFO L290 TraceCheckUtils]: 21: Hoare triple {7754#true} ~cond := #in~cond; {7754#true} is VALID [2022-04-14 14:42:14,713 INFO L272 TraceCheckUtils]: 20: Hoare triple {7906#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0 + ~v6~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {7754#true} is VALID [2022-04-14 14:42:14,717 INFO L290 TraceCheckUtils]: 19: Hoare triple {7910#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} ~l~0 := 1 + ~l~0; {7906#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:42:16,836 WARN L290 TraceCheckUtils]: 18: Hoare triple {7906#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296;~v1~0 := 1 + ~v1~0; {7910#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is UNKNOWN [2022-04-14 14:42:16,836 INFO L290 TraceCheckUtils]: 17: Hoare triple {7906#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {7906#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:42:16,837 INFO L290 TraceCheckUtils]: 16: Hoare triple {7906#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 9 then ~l~0 % 4294967296 % 9 - 9 else ~l~0 % 4294967296 % 9) % 4294967296); {7906#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:42:16,837 INFO L290 TraceCheckUtils]: 15: Hoare triple {7906#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {7906#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:42:16,838 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {7754#true} {7906#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} #89#return; {7906#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:42:16,838 INFO L290 TraceCheckUtils]: 13: Hoare triple {7754#true} assume true; {7754#true} is VALID [2022-04-14 14:42:16,838 INFO L290 TraceCheckUtils]: 12: Hoare triple {7754#true} assume !(0 == ~cond); {7754#true} is VALID [2022-04-14 14:42:16,838 INFO L290 TraceCheckUtils]: 11: Hoare triple {7754#true} ~cond := #in~cond; {7754#true} is VALID [2022-04-14 14:42:16,838 INFO L272 TraceCheckUtils]: 10: Hoare triple {7906#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0 + ~v6~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {7754#true} is VALID [2022-04-14 14:42:16,840 INFO L290 TraceCheckUtils]: 9: Hoare triple {7910#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} ~l~0 := 1 + ~l~0; {7906#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:42:18,953 WARN L290 TraceCheckUtils]: 8: Hoare triple {7906#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 9 then ~l~0 % 4294967296 % 9 - 9 else ~l~0 % 4294967296 % 9) % 4294967296;~v6~0 := 1 + ~v6~0; {7910#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is UNKNOWN [2022-04-14 14:42:18,954 INFO L290 TraceCheckUtils]: 7: Hoare triple {7906#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {7906#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:42:18,954 INFO L290 TraceCheckUtils]: 6: Hoare triple {7906#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {7906#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:42:18,956 INFO L290 TraceCheckUtils]: 5: Hoare triple {7754#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v1~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;~v5~0 := 0;~v6~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {7906#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:42:18,956 INFO L272 TraceCheckUtils]: 4: Hoare triple {7754#true} call #t~ret5 := main(); {7754#true} is VALID [2022-04-14 14:42:18,957 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7754#true} {7754#true} #91#return; {7754#true} is VALID [2022-04-14 14:42:18,957 INFO L290 TraceCheckUtils]: 2: Hoare triple {7754#true} assume true; {7754#true} is VALID [2022-04-14 14:42:18,957 INFO L290 TraceCheckUtils]: 1: Hoare triple {7754#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {7754#true} is VALID [2022-04-14 14:42:18,957 INFO L272 TraceCheckUtils]: 0: Hoare triple {7754#true} call ULTIMATE.init(); {7754#true} is VALID [2022-04-14 14:42:18,957 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-04-14 14:42:18,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [367147350] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-14 14:42:18,957 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-14 14:42:18,957 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9, 11] total 20 [2022-04-14 14:42:18,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690052649] [2022-04-14 14:42:18,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 14:42:18,958 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 38 [2022-04-14 14:42:18,958 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 14:42:18,958 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 14:42:25,320 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 24 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-14 14:42:25,321 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-14 14:42:25,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 14:42:25,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-14 14:42:25,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2022-04-14 14:42:25,321 INFO L87 Difference]: Start difference. First operand 164 states and 233 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 14:42:29,524 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:42:31,753 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:42:33,939 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:42:36,059 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:42:38,180 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:42:40,365 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:42:42,534 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:42:44,778 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:42:47,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:42:47,170 INFO L93 Difference]: Finished difference Result 180 states and 256 transitions. [2022-04-14 14:42:47,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-14 14:42:47,170 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 38 [2022-04-14 14:42:47,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 14:42:47,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 14:42:47,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 55 transitions. [2022-04-14 14:42:47,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 14:42:47,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 55 transitions. [2022-04-14 14:42:47,171 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 55 transitions. [2022-04-14 14:42:53,589 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 52 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-14 14:42:53,593 INFO L225 Difference]: With dead ends: 180 [2022-04-14 14:42:53,593 INFO L226 Difference]: Without dead ends: 178 [2022-04-14 14:42:53,593 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 67 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2022-04-14 14:42:53,594 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 5 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 2 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.9s IncrementalHoareTripleChecker+Time [2022-04-14 14:42:53,594 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 59 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 75 Invalid, 8 Unknown, 0 Unchecked, 16.9s Time] [2022-04-14 14:42:53,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2022-04-14 14:42:53,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 151. [2022-04-14 14:42:53,659 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 14:42:53,659 INFO L82 GeneralOperation]: Start isEquivalent. First operand 178 states. Second operand has 151 states, 125 states have (on average 1.512) internal successors, (189), 125 states have internal predecessors, (189), 13 states have call successors, (13), 13 states have call predecessors, (13), 12 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-14 14:42:53,659 INFO L74 IsIncluded]: Start isIncluded. First operand 178 states. Second operand has 151 states, 125 states have (on average 1.512) internal successors, (189), 125 states have internal predecessors, (189), 13 states have call successors, (13), 13 states have call predecessors, (13), 12 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-14 14:42:53,660 INFO L87 Difference]: Start difference. First operand 178 states. Second operand has 151 states, 125 states have (on average 1.512) internal successors, (189), 125 states have internal predecessors, (189), 13 states have call successors, (13), 13 states have call predecessors, (13), 12 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-14 14:42:53,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:42:53,662 INFO L93 Difference]: Finished difference Result 178 states and 254 transitions. [2022-04-14 14:42:53,662 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 254 transitions. [2022-04-14 14:42:53,663 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:42:53,663 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:42:53,663 INFO L74 IsIncluded]: Start isIncluded. First operand has 151 states, 125 states have (on average 1.512) internal successors, (189), 125 states have internal predecessors, (189), 13 states have call successors, (13), 13 states have call predecessors, (13), 12 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 178 states. [2022-04-14 14:42:53,663 INFO L87 Difference]: Start difference. First operand has 151 states, 125 states have (on average 1.512) internal successors, (189), 125 states have internal predecessors, (189), 13 states have call successors, (13), 13 states have call predecessors, (13), 12 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 178 states. [2022-04-14 14:42:53,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:42:53,666 INFO L93 Difference]: Finished difference Result 178 states and 254 transitions. [2022-04-14 14:42:53,666 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 254 transitions. [2022-04-14 14:42:53,667 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:42:53,667 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:42:53,667 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 14:42:53,667 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 14:42:53,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 125 states have (on average 1.512) internal successors, (189), 125 states have internal predecessors, (189), 13 states have call successors, (13), 13 states have call predecessors, (13), 12 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-14 14:42:53,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 214 transitions. [2022-04-14 14:42:53,669 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 214 transitions. Word has length 38 [2022-04-14 14:42:53,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 14:42:53,669 INFO L478 AbstractCegarLoop]: Abstraction has 151 states and 214 transitions. [2022-04-14 14:42:53,670 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 14:42:53,670 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 214 transitions. [2022-04-14 14:42:53,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-14 14:42:53,670 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 14:42:53,671 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 14:42:53,701 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-04-14 14:42:53,884 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-04-14 14:42:53,884 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 14:42:53,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 14:42:53,885 INFO L85 PathProgramCache]: Analyzing trace with hash -1317945007, now seen corresponding path program 1 times [2022-04-14 14:42:53,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 14:42:53,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732833849] [2022-04-14 14:42:53,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 14:42:53,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 14:42:53,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:42:53,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 14:42:53,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:42:53,948 INFO L290 TraceCheckUtils]: 0: Hoare triple {8799#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {8783#true} is VALID [2022-04-14 14:42:53,948 INFO L290 TraceCheckUtils]: 1: Hoare triple {8783#true} assume true; {8783#true} is VALID [2022-04-14 14:42:53,948 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8783#true} {8783#true} #91#return; {8783#true} is VALID [2022-04-14 14:42:53,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-04-14 14:42:53,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:42:53,951 INFO L290 TraceCheckUtils]: 0: Hoare triple {8783#true} ~cond := #in~cond; {8783#true} is VALID [2022-04-14 14:42:53,951 INFO L290 TraceCheckUtils]: 1: Hoare triple {8783#true} assume !(0 == ~cond); {8783#true} is VALID [2022-04-14 14:42:53,951 INFO L290 TraceCheckUtils]: 2: Hoare triple {8783#true} assume true; {8783#true} is VALID [2022-04-14 14:42:53,952 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8783#true} {8789#(and (<= 1 main_~l~0) (<= main_~l~0 1))} #89#return; {8789#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-14 14:42:53,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-04-14 14:42:53,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:42:53,955 INFO L290 TraceCheckUtils]: 0: Hoare triple {8783#true} ~cond := #in~cond; {8783#true} is VALID [2022-04-14 14:42:53,955 INFO L290 TraceCheckUtils]: 1: Hoare triple {8783#true} assume !(0 == ~cond); {8783#true} is VALID [2022-04-14 14:42:53,955 INFO L290 TraceCheckUtils]: 2: Hoare triple {8783#true} assume true; {8783#true} is VALID [2022-04-14 14:42:53,956 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8783#true} {8794#(and (<= (div main_~l~0 4) 0) (<= 2 main_~l~0))} #89#return; {8794#(and (<= (div main_~l~0 4) 0) (<= 2 main_~l~0))} is VALID [2022-04-14 14:42:53,956 INFO L272 TraceCheckUtils]: 0: Hoare triple {8783#true} call ULTIMATE.init(); {8799#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 14:42:53,956 INFO L290 TraceCheckUtils]: 1: Hoare triple {8799#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {8783#true} is VALID [2022-04-14 14:42:53,956 INFO L290 TraceCheckUtils]: 2: Hoare triple {8783#true} assume true; {8783#true} is VALID [2022-04-14 14:42:53,957 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8783#true} {8783#true} #91#return; {8783#true} is VALID [2022-04-14 14:42:53,957 INFO L272 TraceCheckUtils]: 4: Hoare triple {8783#true} call #t~ret5 := main(); {8783#true} is VALID [2022-04-14 14:42:53,957 INFO L290 TraceCheckUtils]: 5: Hoare triple {8783#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v1~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;~v5~0 := 0;~v6~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {8788#(= main_~l~0 0)} is VALID [2022-04-14 14:42:53,957 INFO L290 TraceCheckUtils]: 6: Hoare triple {8788#(= main_~l~0 0)} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {8788#(= main_~l~0 0)} is VALID [2022-04-14 14:42:53,957 INFO L290 TraceCheckUtils]: 7: Hoare triple {8788#(= main_~l~0 0)} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {8788#(= main_~l~0 0)} is VALID [2022-04-14 14:42:53,958 INFO L290 TraceCheckUtils]: 8: Hoare triple {8788#(= main_~l~0 0)} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 9 then ~l~0 % 4294967296 % 9 - 9 else ~l~0 % 4294967296 % 9) % 4294967296;~v6~0 := 1 + ~v6~0; {8788#(= main_~l~0 0)} is VALID [2022-04-14 14:42:53,958 INFO L290 TraceCheckUtils]: 9: Hoare triple {8788#(= main_~l~0 0)} ~l~0 := 1 + ~l~0; {8789#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-14 14:42:53,958 INFO L272 TraceCheckUtils]: 10: Hoare triple {8789#(and (<= 1 main_~l~0) (<= main_~l~0 1))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0 + ~v6~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {8783#true} is VALID [2022-04-14 14:42:53,958 INFO L290 TraceCheckUtils]: 11: Hoare triple {8783#true} ~cond := #in~cond; {8783#true} is VALID [2022-04-14 14:42:53,958 INFO L290 TraceCheckUtils]: 12: Hoare triple {8783#true} assume !(0 == ~cond); {8783#true} is VALID [2022-04-14 14:42:53,958 INFO L290 TraceCheckUtils]: 13: Hoare triple {8783#true} assume true; {8783#true} is VALID [2022-04-14 14:42:53,959 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {8783#true} {8789#(and (<= 1 main_~l~0) (<= main_~l~0 1))} #89#return; {8789#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-14 14:42:53,959 INFO L290 TraceCheckUtils]: 15: Hoare triple {8789#(and (<= 1 main_~l~0) (<= main_~l~0 1))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {8789#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-14 14:42:53,960 INFO L290 TraceCheckUtils]: 16: Hoare triple {8789#(and (<= 1 main_~l~0) (<= main_~l~0 1))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 9 then ~l~0 % 4294967296 % 9 - 9 else ~l~0 % 4294967296 % 9) % 4294967296); {8789#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-14 14:42:53,960 INFO L290 TraceCheckUtils]: 17: Hoare triple {8789#(and (<= 1 main_~l~0) (<= main_~l~0 1))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {8789#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-14 14:42:53,960 INFO L290 TraceCheckUtils]: 18: Hoare triple {8789#(and (<= 1 main_~l~0) (<= main_~l~0 1))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296); {8789#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-14 14:42:53,961 INFO L290 TraceCheckUtils]: 19: Hoare triple {8789#(and (<= 1 main_~l~0) (<= main_~l~0 1))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296;~v2~0 := 1 + ~v2~0; {8789#(and (<= 1 main_~l~0) (<= main_~l~0 1))} is VALID [2022-04-14 14:42:53,961 INFO L290 TraceCheckUtils]: 20: Hoare triple {8789#(and (<= 1 main_~l~0) (<= main_~l~0 1))} ~l~0 := 1 + ~l~0; {8794#(and (<= (div main_~l~0 4) 0) (<= 2 main_~l~0))} is VALID [2022-04-14 14:42:53,961 INFO L272 TraceCheckUtils]: 21: Hoare triple {8794#(and (<= (div main_~l~0 4) 0) (<= 2 main_~l~0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0 + ~v6~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {8783#true} is VALID [2022-04-14 14:42:53,962 INFO L290 TraceCheckUtils]: 22: Hoare triple {8783#true} ~cond := #in~cond; {8783#true} is VALID [2022-04-14 14:42:53,962 INFO L290 TraceCheckUtils]: 23: Hoare triple {8783#true} assume !(0 == ~cond); {8783#true} is VALID [2022-04-14 14:42:53,962 INFO L290 TraceCheckUtils]: 24: Hoare triple {8783#true} assume true; {8783#true} is VALID [2022-04-14 14:42:53,962 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {8783#true} {8794#(and (<= (div main_~l~0 4) 0) (<= 2 main_~l~0))} #89#return; {8794#(and (<= (div main_~l~0 4) 0) (<= 2 main_~l~0))} is VALID [2022-04-14 14:42:53,963 INFO L290 TraceCheckUtils]: 26: Hoare triple {8794#(and (<= (div main_~l~0 4) 0) (<= 2 main_~l~0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {8794#(and (<= (div main_~l~0 4) 0) (<= 2 main_~l~0))} is VALID [2022-04-14 14:42:53,963 INFO L290 TraceCheckUtils]: 27: Hoare triple {8794#(and (<= (div main_~l~0 4) 0) (<= 2 main_~l~0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 9 then ~l~0 % 4294967296 % 9 - 9 else ~l~0 % 4294967296 % 9) % 4294967296); {8794#(and (<= (div main_~l~0 4) 0) (<= 2 main_~l~0))} is VALID [2022-04-14 14:42:53,963 INFO L290 TraceCheckUtils]: 28: Hoare triple {8794#(and (<= (div main_~l~0 4) 0) (<= 2 main_~l~0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {8794#(and (<= (div main_~l~0 4) 0) (<= 2 main_~l~0))} is VALID [2022-04-14 14:42:53,964 INFO L290 TraceCheckUtils]: 29: Hoare triple {8794#(and (<= (div main_~l~0 4) 0) (<= 2 main_~l~0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296); {8794#(and (<= (div main_~l~0 4) 0) (<= 2 main_~l~0))} is VALID [2022-04-14 14:42:53,964 INFO L290 TraceCheckUtils]: 30: Hoare triple {8794#(and (<= (div main_~l~0 4) 0) (<= 2 main_~l~0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {8794#(and (<= (div main_~l~0 4) 0) (<= 2 main_~l~0))} is VALID [2022-04-14 14:42:53,964 INFO L290 TraceCheckUtils]: 31: Hoare triple {8794#(and (<= (div main_~l~0 4) 0) (<= 2 main_~l~0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {8794#(and (<= (div main_~l~0 4) 0) (<= 2 main_~l~0))} is VALID [2022-04-14 14:42:53,965 INFO L290 TraceCheckUtils]: 32: Hoare triple {8794#(and (<= (div main_~l~0 4) 0) (<= 2 main_~l~0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296;~v4~0 := 1 + ~v4~0; {8784#false} is VALID [2022-04-14 14:42:53,965 INFO L290 TraceCheckUtils]: 33: Hoare triple {8784#false} ~l~0 := 1 + ~l~0; {8784#false} is VALID [2022-04-14 14:42:53,965 INFO L272 TraceCheckUtils]: 34: Hoare triple {8784#false} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0 + ~v6~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {8784#false} is VALID [2022-04-14 14:42:53,965 INFO L290 TraceCheckUtils]: 35: Hoare triple {8784#false} ~cond := #in~cond; {8784#false} is VALID [2022-04-14 14:42:53,965 INFO L290 TraceCheckUtils]: 36: Hoare triple {8784#false} assume 0 == ~cond; {8784#false} is VALID [2022-04-14 14:42:53,965 INFO L290 TraceCheckUtils]: 37: Hoare triple {8784#false} assume !false; {8784#false} is VALID [2022-04-14 14:42:53,966 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 8 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-14 14:42:53,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 14:42:53,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732833849] [2022-04-14 14:42:53,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732833849] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-14 14:42:53,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [178669508] [2022-04-14 14:42:53,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 14:42:53,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 14:42:53,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 14:42:53,967 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 14:42:53,968 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-04-14 14:42:54,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:42:54,001 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-14 14:42:54,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:42:54,008 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 14:42:54,794 INFO L272 TraceCheckUtils]: 0: Hoare triple {8783#true} call ULTIMATE.init(); {8783#true} is VALID [2022-04-14 14:42:54,795 INFO L290 TraceCheckUtils]: 1: Hoare triple {8783#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {8783#true} is VALID [2022-04-14 14:42:54,795 INFO L290 TraceCheckUtils]: 2: Hoare triple {8783#true} assume true; {8783#true} is VALID [2022-04-14 14:42:54,795 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8783#true} {8783#true} #91#return; {8783#true} is VALID [2022-04-14 14:42:54,795 INFO L272 TraceCheckUtils]: 4: Hoare triple {8783#true} call #t~ret5 := main(); {8783#true} is VALID [2022-04-14 14:42:54,795 INFO L290 TraceCheckUtils]: 5: Hoare triple {8783#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v1~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;~v5~0 := 0;~v6~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {8818#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v6~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:42:54,796 INFO L290 TraceCheckUtils]: 6: Hoare triple {8818#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v6~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {8818#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v6~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:42:54,796 INFO L290 TraceCheckUtils]: 7: Hoare triple {8818#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v6~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {8818#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v6~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:42:54,797 INFO L290 TraceCheckUtils]: 8: Hoare triple {8818#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v6~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 9 then ~l~0 % 4294967296 % 9 - 9 else ~l~0 % 4294967296 % 9) % 4294967296;~v6~0 := 1 + ~v6~0; {8828#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:42:54,797 INFO L290 TraceCheckUtils]: 9: Hoare triple {8828#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {8832#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:42:54,797 INFO L272 TraceCheckUtils]: 10: Hoare triple {8832#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0 + ~v6~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {8783#true} is VALID [2022-04-14 14:42:54,797 INFO L290 TraceCheckUtils]: 11: Hoare triple {8783#true} ~cond := #in~cond; {8783#true} is VALID [2022-04-14 14:42:54,797 INFO L290 TraceCheckUtils]: 12: Hoare triple {8783#true} assume !(0 == ~cond); {8783#true} is VALID [2022-04-14 14:42:54,797 INFO L290 TraceCheckUtils]: 13: Hoare triple {8783#true} assume true; {8783#true} is VALID [2022-04-14 14:42:54,798 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {8783#true} {8832#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} #89#return; {8832#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:42:54,799 INFO L290 TraceCheckUtils]: 15: Hoare triple {8832#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {8832#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:42:54,799 INFO L290 TraceCheckUtils]: 16: Hoare triple {8832#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 9 then ~l~0 % 4294967296 % 9 - 9 else ~l~0 % 4294967296 % 9) % 4294967296); {8832#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:42:54,800 INFO L290 TraceCheckUtils]: 17: Hoare triple {8832#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {8832#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:42:54,800 INFO L290 TraceCheckUtils]: 18: Hoare triple {8832#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296); {8832#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:42:54,801 INFO L290 TraceCheckUtils]: 19: Hoare triple {8832#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296;~v2~0 := 1 + ~v2~0; {8863#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:42:54,801 INFO L290 TraceCheckUtils]: 20: Hoare triple {8863#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {8867#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:42:54,801 INFO L272 TraceCheckUtils]: 21: Hoare triple {8867#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0 + ~v6~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {8783#true} is VALID [2022-04-14 14:42:54,801 INFO L290 TraceCheckUtils]: 22: Hoare triple {8783#true} ~cond := #in~cond; {8783#true} is VALID [2022-04-14 14:42:54,801 INFO L290 TraceCheckUtils]: 23: Hoare triple {8783#true} assume !(0 == ~cond); {8783#true} is VALID [2022-04-14 14:42:54,801 INFO L290 TraceCheckUtils]: 24: Hoare triple {8783#true} assume true; {8783#true} is VALID [2022-04-14 14:42:54,802 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {8783#true} {8867#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} #89#return; {8867#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:42:54,803 INFO L290 TraceCheckUtils]: 26: Hoare triple {8867#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {8867#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:42:54,803 INFO L290 TraceCheckUtils]: 27: Hoare triple {8867#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 9 then ~l~0 % 4294967296 % 9 - 9 else ~l~0 % 4294967296 % 9) % 4294967296); {8867#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:42:54,804 INFO L290 TraceCheckUtils]: 28: Hoare triple {8867#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {8867#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:42:54,804 INFO L290 TraceCheckUtils]: 29: Hoare triple {8867#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296); {8867#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:42:54,805 INFO L290 TraceCheckUtils]: 30: Hoare triple {8867#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {8867#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:42:54,805 INFO L290 TraceCheckUtils]: 31: Hoare triple {8867#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {8867#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:42:54,806 INFO L290 TraceCheckUtils]: 32: Hoare triple {8867#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296;~v4~0 := 1 + ~v4~0; {8904#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 1) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:42:54,806 INFO L290 TraceCheckUtils]: 33: Hoare triple {8904#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~l~0 2) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 1) (= main_~v1~0 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {8908#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 1) (= main_~v1~0 0) (= 2 (+ (- 1) main_~l~0)) (= main_~v3~0 0))} is VALID [2022-04-14 14:42:54,807 INFO L272 TraceCheckUtils]: 34: Hoare triple {8908#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 1) (= main_~v1~0 0) (= 2 (+ (- 1) main_~l~0)) (= main_~v3~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0 + ~v6~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {8912#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 14:42:54,808 INFO L290 TraceCheckUtils]: 35: Hoare triple {8912#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8916#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 14:42:54,808 INFO L290 TraceCheckUtils]: 36: Hoare triple {8916#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8784#false} is VALID [2022-04-14 14:42:54,808 INFO L290 TraceCheckUtils]: 37: Hoare triple {8784#false} assume !false; {8784#false} is VALID [2022-04-14 14:42:54,808 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-14 14:42:54,808 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 14:42:55,182 INFO L290 TraceCheckUtils]: 37: Hoare triple {8784#false} assume !false; {8784#false} is VALID [2022-04-14 14:42:55,182 INFO L290 TraceCheckUtils]: 36: Hoare triple {8916#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8784#false} is VALID [2022-04-14 14:42:55,182 INFO L290 TraceCheckUtils]: 35: Hoare triple {8912#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8916#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 14:42:55,183 INFO L272 TraceCheckUtils]: 34: Hoare triple {8932#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0 + ~v6~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {8912#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 14:42:55,184 INFO L290 TraceCheckUtils]: 33: Hoare triple {8936#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} ~l~0 := 1 + ~l~0; {8932#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:42:55,192 INFO L290 TraceCheckUtils]: 32: Hoare triple {8932#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296;~v4~0 := 1 + ~v4~0; {8936#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:42:55,192 INFO L290 TraceCheckUtils]: 31: Hoare triple {8932#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {8932#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:42:55,192 INFO L290 TraceCheckUtils]: 30: Hoare triple {8932#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {8932#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:42:55,193 INFO L290 TraceCheckUtils]: 29: Hoare triple {8932#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296); {8932#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:42:55,193 INFO L290 TraceCheckUtils]: 28: Hoare triple {8932#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {8932#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:42:55,193 INFO L290 TraceCheckUtils]: 27: Hoare triple {8932#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 9 then ~l~0 % 4294967296 % 9 - 9 else ~l~0 % 4294967296 % 9) % 4294967296); {8932#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:42:55,194 INFO L290 TraceCheckUtils]: 26: Hoare triple {8932#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {8932#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:42:55,194 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {8783#true} {8932#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} #89#return; {8932#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:42:55,194 INFO L290 TraceCheckUtils]: 24: Hoare triple {8783#true} assume true; {8783#true} is VALID [2022-04-14 14:42:55,194 INFO L290 TraceCheckUtils]: 23: Hoare triple {8783#true} assume !(0 == ~cond); {8783#true} is VALID [2022-04-14 14:42:55,195 INFO L290 TraceCheckUtils]: 22: Hoare triple {8783#true} ~cond := #in~cond; {8783#true} is VALID [2022-04-14 14:42:55,195 INFO L272 TraceCheckUtils]: 21: Hoare triple {8932#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0 + ~v6~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {8783#true} is VALID [2022-04-14 14:42:55,196 INFO L290 TraceCheckUtils]: 20: Hoare triple {8936#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} ~l~0 := 1 + ~l~0; {8932#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:42:57,308 WARN L290 TraceCheckUtils]: 19: Hoare triple {8932#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296;~v2~0 := 1 + ~v2~0; {8936#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is UNKNOWN [2022-04-14 14:42:57,308 INFO L290 TraceCheckUtils]: 18: Hoare triple {8932#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296); {8932#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:42:57,309 INFO L290 TraceCheckUtils]: 17: Hoare triple {8932#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {8932#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:42:57,309 INFO L290 TraceCheckUtils]: 16: Hoare triple {8932#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 9 then ~l~0 % 4294967296 % 9 - 9 else ~l~0 % 4294967296 % 9) % 4294967296); {8932#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:42:57,309 INFO L290 TraceCheckUtils]: 15: Hoare triple {8932#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {8932#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:42:57,310 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {8783#true} {8932#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} #89#return; {8932#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:42:57,310 INFO L290 TraceCheckUtils]: 13: Hoare triple {8783#true} assume true; {8783#true} is VALID [2022-04-14 14:42:57,310 INFO L290 TraceCheckUtils]: 12: Hoare triple {8783#true} assume !(0 == ~cond); {8783#true} is VALID [2022-04-14 14:42:57,310 INFO L290 TraceCheckUtils]: 11: Hoare triple {8783#true} ~cond := #in~cond; {8783#true} is VALID [2022-04-14 14:42:57,310 INFO L272 TraceCheckUtils]: 10: Hoare triple {8932#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0 + ~v6~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {8783#true} is VALID [2022-04-14 14:42:57,318 INFO L290 TraceCheckUtils]: 9: Hoare triple {8936#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} ~l~0 := 1 + ~l~0; {8932#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:42:59,421 WARN L290 TraceCheckUtils]: 8: Hoare triple {8932#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 9 then ~l~0 % 4294967296 % 9 - 9 else ~l~0 % 4294967296 % 9) % 4294967296;~v6~0 := 1 + ~v6~0; {8936#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is UNKNOWN [2022-04-14 14:42:59,422 INFO L290 TraceCheckUtils]: 7: Hoare triple {8932#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {8932#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:42:59,422 INFO L290 TraceCheckUtils]: 6: Hoare triple {8932#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {8932#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:42:59,424 INFO L290 TraceCheckUtils]: 5: Hoare triple {8783#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v1~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;~v5~0 := 0;~v6~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {8932#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:42:59,424 INFO L272 TraceCheckUtils]: 4: Hoare triple {8783#true} call #t~ret5 := main(); {8783#true} is VALID [2022-04-14 14:42:59,424 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8783#true} {8783#true} #91#return; {8783#true} is VALID [2022-04-14 14:42:59,424 INFO L290 TraceCheckUtils]: 2: Hoare triple {8783#true} assume true; {8783#true} is VALID [2022-04-14 14:42:59,424 INFO L290 TraceCheckUtils]: 1: Hoare triple {8783#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {8783#true} is VALID [2022-04-14 14:42:59,424 INFO L272 TraceCheckUtils]: 0: Hoare triple {8783#true} call ULTIMATE.init(); {8783#true} is VALID [2022-04-14 14:42:59,425 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-04-14 14:42:59,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [178669508] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-14 14:42:59,425 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-14 14:42:59,425 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 11] total 17 [2022-04-14 14:42:59,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488490202] [2022-04-14 14:42:59,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 14:42:59,425 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 38 [2022-04-14 14:42:59,425 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 14:42:59,426 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 14:43:03,685 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 24 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-14 14:43:03,685 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-14 14:43:03,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 14:43:03,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-14 14:43:03,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2022-04-14 14:43:03,686 INFO L87 Difference]: Start difference. First operand 151 states and 214 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 14:43:05,784 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:43:08,049 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:43:10,169 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:43:12,355 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:43:14,540 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:43:16,713 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:43:18,859 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:43:20,973 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:43:21,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:43:21,255 INFO L93 Difference]: Finished difference Result 168 states and 239 transitions. [2022-04-14 14:43:21,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-14 14:43:21,255 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 38 [2022-04-14 14:43:21,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 14:43:21,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 14:43:21,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 55 transitions. [2022-04-14 14:43:21,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 14:43:21,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 55 transitions. [2022-04-14 14:43:21,257 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 55 transitions. [2022-04-14 14:43:25,643 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 53 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-14 14:43:25,645 INFO L225 Difference]: With dead ends: 168 [2022-04-14 14:43:25,645 INFO L226 Difference]: Without dead ends: 166 [2022-04-14 14:43:25,645 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 68 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2022-04-14 14:43:25,646 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 6 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 1 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.1s IncrementalHoareTripleChecker+Time [2022-04-14 14:43:25,646 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 59 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 78 Invalid, 8 Unknown, 0 Unchecked, 17.1s Time] [2022-04-14 14:43:25,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2022-04-14 14:43:25,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 165. [2022-04-14 14:43:25,719 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 14:43:25,720 INFO L82 GeneralOperation]: Start isEquivalent. First operand 166 states. Second operand has 165 states, 137 states have (on average 1.5182481751824817) internal successors, (208), 137 states have internal predecessors, (208), 14 states have call successors, (14), 14 states have call predecessors, (14), 13 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-14 14:43:25,720 INFO L74 IsIncluded]: Start isIncluded. First operand 166 states. Second operand has 165 states, 137 states have (on average 1.5182481751824817) internal successors, (208), 137 states have internal predecessors, (208), 14 states have call successors, (14), 14 states have call predecessors, (14), 13 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-14 14:43:25,720 INFO L87 Difference]: Start difference. First operand 166 states. Second operand has 165 states, 137 states have (on average 1.5182481751824817) internal successors, (208), 137 states have internal predecessors, (208), 14 states have call successors, (14), 14 states have call predecessors, (14), 13 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-14 14:43:25,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:43:25,722 INFO L93 Difference]: Finished difference Result 166 states and 237 transitions. [2022-04-14 14:43:25,722 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 237 transitions. [2022-04-14 14:43:25,722 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:43:25,723 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:43:25,723 INFO L74 IsIncluded]: Start isIncluded. First operand has 165 states, 137 states have (on average 1.5182481751824817) internal successors, (208), 137 states have internal predecessors, (208), 14 states have call successors, (14), 14 states have call predecessors, (14), 13 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 166 states. [2022-04-14 14:43:25,723 INFO L87 Difference]: Start difference. First operand has 165 states, 137 states have (on average 1.5182481751824817) internal successors, (208), 137 states have internal predecessors, (208), 14 states have call successors, (14), 14 states have call predecessors, (14), 13 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 166 states. [2022-04-14 14:43:25,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:43:25,725 INFO L93 Difference]: Finished difference Result 166 states and 237 transitions. [2022-04-14 14:43:25,725 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 237 transitions. [2022-04-14 14:43:25,725 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:43:25,725 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:43:25,725 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 14:43:25,725 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 14:43:25,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 137 states have (on average 1.5182481751824817) internal successors, (208), 137 states have internal predecessors, (208), 14 states have call successors, (14), 14 states have call predecessors, (14), 13 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-14 14:43:25,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 235 transitions. [2022-04-14 14:43:25,728 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 235 transitions. Word has length 38 [2022-04-14 14:43:25,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 14:43:25,728 INFO L478 AbstractCegarLoop]: Abstraction has 165 states and 235 transitions. [2022-04-14 14:43:25,728 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 14:43:25,728 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 235 transitions. [2022-04-14 14:43:25,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-14 14:43:25,728 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 14:43:25,728 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 14:43:25,745 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-04-14 14:43:25,944 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 14:43:25,945 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 14:43:25,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 14:43:25,945 INFO L85 PathProgramCache]: Analyzing trace with hash -1213637701, now seen corresponding path program 1 times [2022-04-14 14:43:25,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 14:43:25,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107475448] [2022-04-14 14:43:25,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 14:43:25,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 14:43:25,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:43:26,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 14:43:26,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:43:26,155 INFO L290 TraceCheckUtils]: 0: Hoare triple {9805#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {9806#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-14 14:43:26,156 INFO L290 TraceCheckUtils]: 1: Hoare triple {9806#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} assume true; {9806#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-14 14:43:26,156 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9806#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {9787#true} #91#return; {9792#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-14 14:43:26,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-04-14 14:43:26,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:43:26,162 INFO L290 TraceCheckUtils]: 0: Hoare triple {9787#true} ~cond := #in~cond; {9787#true} is VALID [2022-04-14 14:43:26,162 INFO L290 TraceCheckUtils]: 1: Hoare triple {9787#true} assume !(0 == ~cond); {9787#true} is VALID [2022-04-14 14:43:26,162 INFO L290 TraceCheckUtils]: 2: Hoare triple {9787#true} assume true; {9787#true} is VALID [2022-04-14 14:43:26,163 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9787#true} {9795#(and (<= (+ (* (div main_~l~0 4294967296) 613566757) (* 613566757 (div (+ main_~l~0 (* (- 7) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) 0) (or (<= (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296) 4274967296) (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296))) (<= 1 (+ (* 3 (div main_~l~0 4294967296)) main_~l~0))))} #89#return; {9795#(and (<= (+ (* (div main_~l~0 4294967296) 613566757) (* 613566757 (div (+ main_~l~0 (* (- 7) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) 0) (or (<= (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296) 4274967296) (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296))) (<= 1 (+ (* 3 (div main_~l~0 4294967296)) main_~l~0))))} is VALID [2022-04-14 14:43:26,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-04-14 14:43:26,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:43:26,166 INFO L290 TraceCheckUtils]: 0: Hoare triple {9787#true} ~cond := #in~cond; {9787#true} is VALID [2022-04-14 14:43:26,166 INFO L290 TraceCheckUtils]: 1: Hoare triple {9787#true} assume !(0 == ~cond); {9787#true} is VALID [2022-04-14 14:43:26,166 INFO L290 TraceCheckUtils]: 2: Hoare triple {9787#true} assume true; {9787#true} is VALID [2022-04-14 14:43:26,166 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9787#true} {9788#false} #89#return; {9788#false} is VALID [2022-04-14 14:43:26,166 INFO L272 TraceCheckUtils]: 0: Hoare triple {9787#true} call ULTIMATE.init(); {9805#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 14:43:26,168 INFO L290 TraceCheckUtils]: 1: Hoare triple {9805#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {9806#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-14 14:43:26,168 INFO L290 TraceCheckUtils]: 2: Hoare triple {9806#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} assume true; {9806#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-14 14:43:26,169 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9806#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {9787#true} #91#return; {9792#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-14 14:43:26,169 INFO L272 TraceCheckUtils]: 4: Hoare triple {9792#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} call #t~ret5 := main(); {9792#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-14 14:43:26,170 INFO L290 TraceCheckUtils]: 5: Hoare triple {9792#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v1~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;~v5~0 := 0;~v6~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {9793#(and (<= ~SIZE~0 20000001) (= main_~l~0 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-14 14:43:26,171 INFO L290 TraceCheckUtils]: 6: Hoare triple {9793#(and (<= ~SIZE~0 20000001) (= main_~l~0 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {9794#(and (= main_~l~0 0) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-14 14:43:26,171 INFO L290 TraceCheckUtils]: 7: Hoare triple {9794#(and (= main_~l~0 0) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {9794#(and (= main_~l~0 0) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-14 14:43:26,172 INFO L290 TraceCheckUtils]: 8: Hoare triple {9794#(and (= main_~l~0 0) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 9 then ~l~0 % 4294967296 % 9 - 9 else ~l~0 % 4294967296 % 9) % 4294967296;~v6~0 := 1 + ~v6~0; {9794#(and (= main_~l~0 0) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-14 14:43:26,172 INFO L290 TraceCheckUtils]: 9: Hoare triple {9794#(and (= main_~l~0 0) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))))} ~l~0 := 1 + ~l~0; {9795#(and (<= (+ (* (div main_~l~0 4294967296) 613566757) (* 613566757 (div (+ main_~l~0 (* (- 7) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) 0) (or (<= (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296) 4274967296) (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296))) (<= 1 (+ (* 3 (div main_~l~0 4294967296)) main_~l~0))))} is VALID [2022-04-14 14:43:26,172 INFO L272 TraceCheckUtils]: 10: Hoare triple {9795#(and (<= (+ (* (div main_~l~0 4294967296) 613566757) (* 613566757 (div (+ main_~l~0 (* (- 7) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) 0) (or (<= (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296) 4274967296) (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296))) (<= 1 (+ (* 3 (div main_~l~0 4294967296)) main_~l~0))))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0 + ~v6~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {9787#true} is VALID [2022-04-14 14:43:26,172 INFO L290 TraceCheckUtils]: 11: Hoare triple {9787#true} ~cond := #in~cond; {9787#true} is VALID [2022-04-14 14:43:26,172 INFO L290 TraceCheckUtils]: 12: Hoare triple {9787#true} assume !(0 == ~cond); {9787#true} is VALID [2022-04-14 14:43:26,172 INFO L290 TraceCheckUtils]: 13: Hoare triple {9787#true} assume true; {9787#true} is VALID [2022-04-14 14:43:26,173 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {9787#true} {9795#(and (<= (+ (* (div main_~l~0 4294967296) 613566757) (* 613566757 (div (+ main_~l~0 (* (- 7) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) 0) (or (<= (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296) 4274967296) (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296))) (<= 1 (+ (* 3 (div main_~l~0 4294967296)) main_~l~0))))} #89#return; {9795#(and (<= (+ (* (div main_~l~0 4294967296) 613566757) (* 613566757 (div (+ main_~l~0 (* (- 7) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) 0) (or (<= (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296) 4274967296) (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296))) (<= 1 (+ (* 3 (div main_~l~0 4294967296)) main_~l~0))))} is VALID [2022-04-14 14:43:26,174 INFO L290 TraceCheckUtils]: 15: Hoare triple {9795#(and (<= (+ (* (div main_~l~0 4294967296) 613566757) (* 613566757 (div (+ main_~l~0 (* (- 7) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) 0) (or (<= (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296) 4274967296) (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296))) (<= 1 (+ (* 3 (div main_~l~0 4294967296)) main_~l~0))))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {9800#(and (<= (+ (* (div main_~l~0 4294967296) 613566757) (* 613566757 (div (+ main_~l~0 (* (- 7) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) 0) (<= 1 (+ (* 3 (div main_~l~0 4294967296)) main_~l~0)))} is VALID [2022-04-14 14:43:26,175 INFO L290 TraceCheckUtils]: 16: Hoare triple {9800#(and (<= (+ (* (div main_~l~0 4294967296) 613566757) (* 613566757 (div (+ main_~l~0 (* (- 7) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) 0) (<= 1 (+ (* 3 (div main_~l~0 4294967296)) main_~l~0)))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 9 then ~l~0 % 4294967296 % 9 - 9 else ~l~0 % 4294967296 % 9) % 4294967296); {9800#(and (<= (+ (* (div main_~l~0 4294967296) 613566757) (* 613566757 (div (+ main_~l~0 (* (- 7) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) 0) (<= 1 (+ (* 3 (div main_~l~0 4294967296)) main_~l~0)))} is VALID [2022-04-14 14:43:26,175 INFO L290 TraceCheckUtils]: 17: Hoare triple {9800#(and (<= (+ (* (div main_~l~0 4294967296) 613566757) (* 613566757 (div (+ main_~l~0 (* (- 7) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) 0) (<= 1 (+ (* 3 (div main_~l~0 4294967296)) main_~l~0)))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {9800#(and (<= (+ (* (div main_~l~0 4294967296) 613566757) (* 613566757 (div (+ main_~l~0 (* (- 7) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) 0) (<= 1 (+ (* 3 (div main_~l~0 4294967296)) main_~l~0)))} is VALID [2022-04-14 14:43:26,177 INFO L290 TraceCheckUtils]: 18: Hoare triple {9800#(and (<= (+ (* (div main_~l~0 4294967296) 613566757) (* 613566757 (div (+ main_~l~0 (* (- 7) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 7)) 0) (<= 1 (+ (* 3 (div main_~l~0 4294967296)) main_~l~0)))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296;~v1~0 := 1 + ~v1~0; {9788#false} is VALID [2022-04-14 14:43:26,177 INFO L290 TraceCheckUtils]: 19: Hoare triple {9788#false} ~l~0 := 1 + ~l~0; {9788#false} is VALID [2022-04-14 14:43:26,177 INFO L272 TraceCheckUtils]: 20: Hoare triple {9788#false} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0 + ~v6~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {9787#true} is VALID [2022-04-14 14:43:26,177 INFO L290 TraceCheckUtils]: 21: Hoare triple {9787#true} ~cond := #in~cond; {9787#true} is VALID [2022-04-14 14:43:26,177 INFO L290 TraceCheckUtils]: 22: Hoare triple {9787#true} assume !(0 == ~cond); {9787#true} is VALID [2022-04-14 14:43:26,177 INFO L290 TraceCheckUtils]: 23: Hoare triple {9787#true} assume true; {9787#true} is VALID [2022-04-14 14:43:26,178 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {9787#true} {9788#false} #89#return; {9788#false} is VALID [2022-04-14 14:43:26,178 INFO L290 TraceCheckUtils]: 25: Hoare triple {9788#false} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {9788#false} is VALID [2022-04-14 14:43:26,178 INFO L290 TraceCheckUtils]: 26: Hoare triple {9788#false} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 9 then ~l~0 % 4294967296 % 9 - 9 else ~l~0 % 4294967296 % 9) % 4294967296); {9788#false} is VALID [2022-04-14 14:43:26,178 INFO L290 TraceCheckUtils]: 27: Hoare triple {9788#false} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {9788#false} is VALID [2022-04-14 14:43:26,178 INFO L290 TraceCheckUtils]: 28: Hoare triple {9788#false} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296); {9788#false} is VALID [2022-04-14 14:43:26,178 INFO L290 TraceCheckUtils]: 29: Hoare triple {9788#false} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {9788#false} is VALID [2022-04-14 14:43:26,178 INFO L290 TraceCheckUtils]: 30: Hoare triple {9788#false} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {9788#false} is VALID [2022-04-14 14:43:26,178 INFO L290 TraceCheckUtils]: 31: Hoare triple {9788#false} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296); {9788#false} is VALID [2022-04-14 14:43:26,178 INFO L290 TraceCheckUtils]: 32: Hoare triple {9788#false} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 3 then ~l~0 % 4294967296 % 3 - 3 else ~l~0 % 4294967296 % 3) % 4294967296); {9788#false} is VALID [2022-04-14 14:43:26,178 INFO L290 TraceCheckUtils]: 33: Hoare triple {9788#false} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 2 then ~l~0 % 4294967296 % 2 - 2 else ~l~0 % 4294967296 % 2) % 4294967296;~j~0 := 1 + ~j~0; {9788#false} is VALID [2022-04-14 14:43:26,178 INFO L290 TraceCheckUtils]: 34: Hoare triple {9788#false} ~l~0 := 1 + ~l~0; {9788#false} is VALID [2022-04-14 14:43:26,178 INFO L272 TraceCheckUtils]: 35: Hoare triple {9788#false} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0 + ~v6~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {9788#false} is VALID [2022-04-14 14:43:26,178 INFO L290 TraceCheckUtils]: 36: Hoare triple {9788#false} ~cond := #in~cond; {9788#false} is VALID [2022-04-14 14:43:26,178 INFO L290 TraceCheckUtils]: 37: Hoare triple {9788#false} assume 0 == ~cond; {9788#false} is VALID [2022-04-14 14:43:26,178 INFO L290 TraceCheckUtils]: 38: Hoare triple {9788#false} assume !false; {9788#false} is VALID [2022-04-14 14:43:26,179 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-14 14:43:26,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 14:43:26,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107475448] [2022-04-14 14:43:26,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107475448] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-14 14:43:26,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [395553823] [2022-04-14 14:43:26,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 14:43:26,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 14:43:26,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 14:43:26,180 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 14:43:26,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-04-14 14:43:26,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:43:26,215 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-14 14:43:26,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:43:26,226 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 14:43:27,087 INFO L272 TraceCheckUtils]: 0: Hoare triple {9787#true} call ULTIMATE.init(); {9787#true} is VALID [2022-04-14 14:43:27,087 INFO L290 TraceCheckUtils]: 1: Hoare triple {9787#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {9787#true} is VALID [2022-04-14 14:43:27,087 INFO L290 TraceCheckUtils]: 2: Hoare triple {9787#true} assume true; {9787#true} is VALID [2022-04-14 14:43:27,087 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9787#true} {9787#true} #91#return; {9787#true} is VALID [2022-04-14 14:43:27,087 INFO L272 TraceCheckUtils]: 4: Hoare triple {9787#true} call #t~ret5 := main(); {9787#true} is VALID [2022-04-14 14:43:27,088 INFO L290 TraceCheckUtils]: 5: Hoare triple {9787#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v1~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;~v5~0 := 0;~v6~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {9825#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v6~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:43:27,088 INFO L290 TraceCheckUtils]: 6: Hoare triple {9825#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v6~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {9825#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v6~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:43:27,089 INFO L290 TraceCheckUtils]: 7: Hoare triple {9825#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v6~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {9825#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v6~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:43:27,089 INFO L290 TraceCheckUtils]: 8: Hoare triple {9825#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v6~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 9 then ~l~0 % 4294967296 % 9 - 9 else ~l~0 % 4294967296 % 9) % 4294967296;~v6~0 := 1 + ~v6~0; {9835#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:43:27,089 INFO L290 TraceCheckUtils]: 9: Hoare triple {9835#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {9839#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:43:27,089 INFO L272 TraceCheckUtils]: 10: Hoare triple {9839#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0 + ~v6~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {9787#true} is VALID [2022-04-14 14:43:27,090 INFO L290 TraceCheckUtils]: 11: Hoare triple {9787#true} ~cond := #in~cond; {9787#true} is VALID [2022-04-14 14:43:27,090 INFO L290 TraceCheckUtils]: 12: Hoare triple {9787#true} assume !(0 == ~cond); {9787#true} is VALID [2022-04-14 14:43:27,090 INFO L290 TraceCheckUtils]: 13: Hoare triple {9787#true} assume true; {9787#true} is VALID [2022-04-14 14:43:27,090 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {9787#true} {9839#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} #89#return; {9839#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:43:27,091 INFO L290 TraceCheckUtils]: 15: Hoare triple {9839#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {9839#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:43:27,091 INFO L290 TraceCheckUtils]: 16: Hoare triple {9839#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 9 then ~l~0 % 4294967296 % 9 - 9 else ~l~0 % 4294967296 % 9) % 4294967296); {9839#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:43:27,092 INFO L290 TraceCheckUtils]: 17: Hoare triple {9839#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {9839#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:43:27,092 INFO L290 TraceCheckUtils]: 18: Hoare triple {9839#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296;~v1~0 := 1 + ~v1~0; {9867#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:43:27,092 INFO L290 TraceCheckUtils]: 19: Hoare triple {9867#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 1) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {9871#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1) (= main_~v3~0 0))} is VALID [2022-04-14 14:43:27,092 INFO L272 TraceCheckUtils]: 20: Hoare triple {9871#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1) (= main_~v3~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0 + ~v6~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {9787#true} is VALID [2022-04-14 14:43:27,093 INFO L290 TraceCheckUtils]: 21: Hoare triple {9787#true} ~cond := #in~cond; {9787#true} is VALID [2022-04-14 14:43:27,093 INFO L290 TraceCheckUtils]: 22: Hoare triple {9787#true} assume !(0 == ~cond); {9787#true} is VALID [2022-04-14 14:43:27,093 INFO L290 TraceCheckUtils]: 23: Hoare triple {9787#true} assume true; {9787#true} is VALID [2022-04-14 14:43:27,093 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {9787#true} {9871#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1) (= main_~v3~0 0))} #89#return; {9871#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1) (= main_~v3~0 0))} is VALID [2022-04-14 14:43:27,094 INFO L290 TraceCheckUtils]: 25: Hoare triple {9871#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {9871#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1) (= main_~v3~0 0))} is VALID [2022-04-14 14:43:27,094 INFO L290 TraceCheckUtils]: 26: Hoare triple {9871#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 9 then ~l~0 % 4294967296 % 9 - 9 else ~l~0 % 4294967296 % 9) % 4294967296); {9871#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1) (= main_~v3~0 0))} is VALID [2022-04-14 14:43:27,095 INFO L290 TraceCheckUtils]: 27: Hoare triple {9871#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {9871#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1) (= main_~v3~0 0))} is VALID [2022-04-14 14:43:27,095 INFO L290 TraceCheckUtils]: 28: Hoare triple {9871#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296); {9871#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1) (= main_~v3~0 0))} is VALID [2022-04-14 14:43:27,095 INFO L290 TraceCheckUtils]: 29: Hoare triple {9871#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {9871#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1) (= main_~v3~0 0))} is VALID [2022-04-14 14:43:27,096 INFO L290 TraceCheckUtils]: 30: Hoare triple {9871#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {9871#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1) (= main_~v3~0 0))} is VALID [2022-04-14 14:43:27,096 INFO L290 TraceCheckUtils]: 31: Hoare triple {9871#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296); {9871#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1) (= main_~v3~0 0))} is VALID [2022-04-14 14:43:27,097 INFO L290 TraceCheckUtils]: 32: Hoare triple {9871#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 3 then ~l~0 % 4294967296 % 3 - 3 else ~l~0 % 4294967296 % 3) % 4294967296); {9871#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1) (= main_~v3~0 0))} is VALID [2022-04-14 14:43:27,097 INFO L290 TraceCheckUtils]: 33: Hoare triple {9871#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 2 then ~l~0 % 4294967296 % 2 - 2 else ~l~0 % 4294967296 % 2) % 4294967296;~j~0 := 1 + ~j~0; {9914#(and (= main_~v6~0 1) (= main_~v5~0 0) (= (+ (- 1) main_~j~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1) (= main_~v3~0 0))} is VALID [2022-04-14 14:43:27,097 INFO L290 TraceCheckUtils]: 34: Hoare triple {9914#(and (= main_~v6~0 1) (= main_~v5~0 0) (= (+ (- 1) main_~j~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= (+ (- 1) main_~l~0) 1) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {9918#(and (= main_~v6~0 1) (= main_~v5~0 0) (= (+ (- 1) main_~j~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~l~0 3) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:43:27,098 INFO L272 TraceCheckUtils]: 35: Hoare triple {9918#(and (= main_~v6~0 1) (= main_~v5~0 0) (= (+ (- 1) main_~j~0) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~l~0 3) (= main_~i~0 0) (= (+ (- 1) main_~v1~0) 0) (= main_~v4~0 0) (= main_~v3~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0 + ~v6~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {9922#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 14:43:27,099 INFO L290 TraceCheckUtils]: 36: Hoare triple {9922#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {9926#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 14:43:27,099 INFO L290 TraceCheckUtils]: 37: Hoare triple {9926#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9788#false} is VALID [2022-04-14 14:43:27,099 INFO L290 TraceCheckUtils]: 38: Hoare triple {9788#false} assume !false; {9788#false} is VALID [2022-04-14 14:43:27,099 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-14 14:43:27,099 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 14:43:27,480 INFO L290 TraceCheckUtils]: 38: Hoare triple {9788#false} assume !false; {9788#false} is VALID [2022-04-14 14:43:27,480 INFO L290 TraceCheckUtils]: 37: Hoare triple {9926#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9788#false} is VALID [2022-04-14 14:43:27,480 INFO L290 TraceCheckUtils]: 36: Hoare triple {9922#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {9926#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 14:43:27,481 INFO L272 TraceCheckUtils]: 35: Hoare triple {9942#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0 + ~v6~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {9922#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 14:43:27,482 INFO L290 TraceCheckUtils]: 34: Hoare triple {9946#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} ~l~0 := 1 + ~l~0; {9942#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:43:27,495 INFO L290 TraceCheckUtils]: 33: Hoare triple {9942#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 2 then ~l~0 % 4294967296 % 2 - 2 else ~l~0 % 4294967296 % 2) % 4294967296;~j~0 := 1 + ~j~0; {9946#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:43:27,495 INFO L290 TraceCheckUtils]: 32: Hoare triple {9942#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 3 then ~l~0 % 4294967296 % 3 - 3 else ~l~0 % 4294967296 % 3) % 4294967296); {9942#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:43:27,495 INFO L290 TraceCheckUtils]: 31: Hoare triple {9942#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296); {9942#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:43:27,496 INFO L290 TraceCheckUtils]: 30: Hoare triple {9942#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {9942#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:43:27,496 INFO L290 TraceCheckUtils]: 29: Hoare triple {9942#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {9942#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:43:27,496 INFO L290 TraceCheckUtils]: 28: Hoare triple {9942#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296); {9942#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:43:27,497 INFO L290 TraceCheckUtils]: 27: Hoare triple {9942#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {9942#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:43:27,497 INFO L290 TraceCheckUtils]: 26: Hoare triple {9942#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 9 then ~l~0 % 4294967296 % 9 - 9 else ~l~0 % 4294967296 % 9) % 4294967296); {9942#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:43:27,497 INFO L290 TraceCheckUtils]: 25: Hoare triple {9942#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {9942#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:43:27,498 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {9787#true} {9942#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} #89#return; {9942#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:43:27,498 INFO L290 TraceCheckUtils]: 23: Hoare triple {9787#true} assume true; {9787#true} is VALID [2022-04-14 14:43:27,498 INFO L290 TraceCheckUtils]: 22: Hoare triple {9787#true} assume !(0 == ~cond); {9787#true} is VALID [2022-04-14 14:43:27,498 INFO L290 TraceCheckUtils]: 21: Hoare triple {9787#true} ~cond := #in~cond; {9787#true} is VALID [2022-04-14 14:43:27,498 INFO L272 TraceCheckUtils]: 20: Hoare triple {9942#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0 + ~v6~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {9787#true} is VALID [2022-04-14 14:43:27,499 INFO L290 TraceCheckUtils]: 19: Hoare triple {9946#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} ~l~0 := 1 + ~l~0; {9942#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:43:29,610 WARN L290 TraceCheckUtils]: 18: Hoare triple {9942#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296;~v1~0 := 1 + ~v1~0; {9946#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is UNKNOWN [2022-04-14 14:43:29,611 INFO L290 TraceCheckUtils]: 17: Hoare triple {9942#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {9942#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:43:29,611 INFO L290 TraceCheckUtils]: 16: Hoare triple {9942#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 9 then ~l~0 % 4294967296 % 9 - 9 else ~l~0 % 4294967296 % 9) % 4294967296); {9942#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:43:29,611 INFO L290 TraceCheckUtils]: 15: Hoare triple {9942#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {9942#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:43:29,616 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {9787#true} {9942#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} #89#return; {9942#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:43:29,616 INFO L290 TraceCheckUtils]: 13: Hoare triple {9787#true} assume true; {9787#true} is VALID [2022-04-14 14:43:29,616 INFO L290 TraceCheckUtils]: 12: Hoare triple {9787#true} assume !(0 == ~cond); {9787#true} is VALID [2022-04-14 14:43:29,616 INFO L290 TraceCheckUtils]: 11: Hoare triple {9787#true} ~cond := #in~cond; {9787#true} is VALID [2022-04-14 14:43:29,616 INFO L272 TraceCheckUtils]: 10: Hoare triple {9942#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0 + ~v6~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {9787#true} is VALID [2022-04-14 14:43:29,620 INFO L290 TraceCheckUtils]: 9: Hoare triple {9946#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} ~l~0 := 1 + ~l~0; {9942#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:43:31,761 WARN L290 TraceCheckUtils]: 8: Hoare triple {9942#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 9 then ~l~0 % 4294967296 % 9 - 9 else ~l~0 % 4294967296 % 9) % 4294967296;~v6~0 := 1 + ~v6~0; {9946#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is UNKNOWN [2022-04-14 14:43:31,761 INFO L290 TraceCheckUtils]: 7: Hoare triple {9942#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {9942#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:43:31,762 INFO L290 TraceCheckUtils]: 6: Hoare triple {9942#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {9942#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:43:31,764 INFO L290 TraceCheckUtils]: 5: Hoare triple {9787#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v1~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;~v5~0 := 0;~v6~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {9942#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:43:31,764 INFO L272 TraceCheckUtils]: 4: Hoare triple {9787#true} call #t~ret5 := main(); {9787#true} is VALID [2022-04-14 14:43:31,764 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9787#true} {9787#true} #91#return; {9787#true} is VALID [2022-04-14 14:43:31,764 INFO L290 TraceCheckUtils]: 2: Hoare triple {9787#true} assume true; {9787#true} is VALID [2022-04-14 14:43:31,764 INFO L290 TraceCheckUtils]: 1: Hoare triple {9787#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {9787#true} is VALID [2022-04-14 14:43:31,765 INFO L272 TraceCheckUtils]: 0: Hoare triple {9787#true} call ULTIMATE.init(); {9787#true} is VALID [2022-04-14 14:43:31,765 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-04-14 14:43:31,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [395553823] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-14 14:43:31,765 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-14 14:43:31,765 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9, 11] total 20 [2022-04-14 14:43:31,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040891069] [2022-04-14 14:43:31,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 14:43:31,766 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 39 [2022-04-14 14:43:31,766 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 14:43:31,766 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 14:43:36,016 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 26 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-14 14:43:36,016 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-14 14:43:36,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 14:43:36,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-14 14:43:36,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2022-04-14 14:43:36,017 INFO L87 Difference]: Start difference. First operand 165 states and 235 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 14:43:40,250 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:43:42,528 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:43:44,713 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:43:46,831 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:43:49,016 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:43:51,182 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:43:53,351 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:43:55,465 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:43:57,583 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:44:01,998 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:44:02,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:44:02,178 INFO L93 Difference]: Finished difference Result 196 states and 281 transitions. [2022-04-14 14:44:02,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-14 14:44:02,178 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 39 [2022-04-14 14:44:02,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 14:44:02,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 14:44:02,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 57 transitions. [2022-04-14 14:44:02,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 14:44:02,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 57 transitions. [2022-04-14 14:44:02,180 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 57 transitions. [2022-04-14 14:44:06,546 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 55 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-14 14:44:06,549 INFO L225 Difference]: With dead ends: 196 [2022-04-14 14:44:06,549 INFO L226 Difference]: Without dead ends: 194 [2022-04-14 14:44:06,549 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 69 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2022-04-14 14:44:06,550 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 5 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 3 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.0s IncrementalHoareTripleChecker+Time [2022-04-14 14:44:06,550 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 53 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 79 Invalid, 10 Unknown, 0 Unchecked, 21.0s Time] [2022-04-14 14:44:06,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2022-04-14 14:44:06,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 178. [2022-04-14 14:44:06,633 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 14:44:06,633 INFO L82 GeneralOperation]: Start isEquivalent. First operand 194 states. Second operand has 178 states, 148 states have (on average 1.5202702702702702) internal successors, (225), 148 states have internal predecessors, (225), 15 states have call successors, (15), 15 states have call predecessors, (15), 14 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-14 14:44:06,633 INFO L74 IsIncluded]: Start isIncluded. First operand 194 states. Second operand has 178 states, 148 states have (on average 1.5202702702702702) internal successors, (225), 148 states have internal predecessors, (225), 15 states have call successors, (15), 15 states have call predecessors, (15), 14 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-14 14:44:06,633 INFO L87 Difference]: Start difference. First operand 194 states. Second operand has 178 states, 148 states have (on average 1.5202702702702702) internal successors, (225), 148 states have internal predecessors, (225), 15 states have call successors, (15), 15 states have call predecessors, (15), 14 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-14 14:44:06,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:44:06,636 INFO L93 Difference]: Finished difference Result 194 states and 279 transitions. [2022-04-14 14:44:06,636 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 279 transitions. [2022-04-14 14:44:06,637 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:44:06,637 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:44:06,637 INFO L74 IsIncluded]: Start isIncluded. First operand has 178 states, 148 states have (on average 1.5202702702702702) internal successors, (225), 148 states have internal predecessors, (225), 15 states have call successors, (15), 15 states have call predecessors, (15), 14 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 194 states. [2022-04-14 14:44:06,637 INFO L87 Difference]: Start difference. First operand has 178 states, 148 states have (on average 1.5202702702702702) internal successors, (225), 148 states have internal predecessors, (225), 15 states have call successors, (15), 15 states have call predecessors, (15), 14 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 194 states. [2022-04-14 14:44:06,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:44:06,642 INFO L93 Difference]: Finished difference Result 194 states and 279 transitions. [2022-04-14 14:44:06,642 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 279 transitions. [2022-04-14 14:44:06,642 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:44:06,642 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:44:06,642 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 14:44:06,642 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 14:44:06,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 148 states have (on average 1.5202702702702702) internal successors, (225), 148 states have internal predecessors, (225), 15 states have call successors, (15), 15 states have call predecessors, (15), 14 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-14 14:44:06,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 254 transitions. [2022-04-14 14:44:06,645 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 254 transitions. Word has length 39 [2022-04-14 14:44:06,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 14:44:06,645 INFO L478 AbstractCegarLoop]: Abstraction has 178 states and 254 transitions. [2022-04-14 14:44:06,645 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 14:44:06,645 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 254 transitions. [2022-04-14 14:44:06,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-14 14:44:06,645 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 14:44:06,645 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 14:44:06,661 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-04-14 14:44:06,858 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-04-14 14:44:06,859 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 14:44:06,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 14:44:06,859 INFO L85 PathProgramCache]: Analyzing trace with hash -705160695, now seen corresponding path program 1 times [2022-04-14 14:44:06,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 14:44:06,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667953043] [2022-04-14 14:44:06,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 14:44:06,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 14:44:06,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:44:07,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 14:44:07,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:44:07,056 INFO L290 TraceCheckUtils]: 0: Hoare triple {10924#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {10925#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-14 14:44:07,056 INFO L290 TraceCheckUtils]: 1: Hoare triple {10925#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} assume true; {10925#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-14 14:44:07,057 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10925#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {10906#true} #91#return; {10911#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-14 14:44:07,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-04-14 14:44:07,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:44:07,061 INFO L290 TraceCheckUtils]: 0: Hoare triple {10906#true} ~cond := #in~cond; {10906#true} is VALID [2022-04-14 14:44:07,061 INFO L290 TraceCheckUtils]: 1: Hoare triple {10906#true} assume !(0 == ~cond); {10906#true} is VALID [2022-04-14 14:44:07,061 INFO L290 TraceCheckUtils]: 2: Hoare triple {10906#true} assume true; {10906#true} is VALID [2022-04-14 14:44:07,062 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10906#true} {10914#(and (or (<= (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296) 4274967296) (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296))) (<= 1 (+ (* 2 (div main_~l~0 4294967296)) main_~l~0))) (<= (+ (* 715827883 (div main_~l~0 4294967296)) (* 715827883 (div (+ main_~l~0 (* (- 6) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) 0))} #89#return; {10914#(and (or (<= (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296) 4274967296) (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296))) (<= 1 (+ (* 2 (div main_~l~0 4294967296)) main_~l~0))) (<= (+ (* 715827883 (div main_~l~0 4294967296)) (* 715827883 (div (+ main_~l~0 (* (- 6) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) 0))} is VALID [2022-04-14 14:44:07,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-04-14 14:44:07,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:44:07,065 INFO L290 TraceCheckUtils]: 0: Hoare triple {10906#true} ~cond := #in~cond; {10906#true} is VALID [2022-04-14 14:44:07,065 INFO L290 TraceCheckUtils]: 1: Hoare triple {10906#true} assume !(0 == ~cond); {10906#true} is VALID [2022-04-14 14:44:07,065 INFO L290 TraceCheckUtils]: 2: Hoare triple {10906#true} assume true; {10906#true} is VALID [2022-04-14 14:44:07,065 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10906#true} {10907#false} #89#return; {10907#false} is VALID [2022-04-14 14:44:07,066 INFO L272 TraceCheckUtils]: 0: Hoare triple {10906#true} call ULTIMATE.init(); {10924#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 14:44:07,066 INFO L290 TraceCheckUtils]: 1: Hoare triple {10924#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {10925#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-14 14:44:07,066 INFO L290 TraceCheckUtils]: 2: Hoare triple {10925#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} assume true; {10925#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-14 14:44:07,067 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10925#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {10906#true} #91#return; {10911#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-14 14:44:07,067 INFO L272 TraceCheckUtils]: 4: Hoare triple {10911#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} call #t~ret5 := main(); {10911#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-14 14:44:07,068 INFO L290 TraceCheckUtils]: 5: Hoare triple {10911#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v1~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;~v5~0 := 0;~v6~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {10912#(and (<= ~SIZE~0 20000001) (= main_~l~0 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-14 14:44:07,069 INFO L290 TraceCheckUtils]: 6: Hoare triple {10912#(and (<= ~SIZE~0 20000001) (= main_~l~0 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {10913#(and (= main_~l~0 0) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-14 14:44:07,069 INFO L290 TraceCheckUtils]: 7: Hoare triple {10913#(and (= main_~l~0 0) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {10913#(and (= main_~l~0 0) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-14 14:44:07,069 INFO L290 TraceCheckUtils]: 8: Hoare triple {10913#(and (= main_~l~0 0) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 9 then ~l~0 % 4294967296 % 9 - 9 else ~l~0 % 4294967296 % 9) % 4294967296;~v6~0 := 1 + ~v6~0; {10913#(and (= main_~l~0 0) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-14 14:44:07,070 INFO L290 TraceCheckUtils]: 9: Hoare triple {10913#(and (= main_~l~0 0) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))))} ~l~0 := 1 + ~l~0; {10914#(and (or (<= (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296) 4274967296) (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296))) (<= 1 (+ (* 2 (div main_~l~0 4294967296)) main_~l~0))) (<= (+ (* 715827883 (div main_~l~0 4294967296)) (* 715827883 (div (+ main_~l~0 (* (- 6) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) 0))} is VALID [2022-04-14 14:44:07,070 INFO L272 TraceCheckUtils]: 10: Hoare triple {10914#(and (or (<= (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296) 4274967296) (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296))) (<= 1 (+ (* 2 (div main_~l~0 4294967296)) main_~l~0))) (<= (+ (* 715827883 (div main_~l~0 4294967296)) (* 715827883 (div (+ main_~l~0 (* (- 6) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0 + ~v6~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {10906#true} is VALID [2022-04-14 14:44:07,070 INFO L290 TraceCheckUtils]: 11: Hoare triple {10906#true} ~cond := #in~cond; {10906#true} is VALID [2022-04-14 14:44:07,070 INFO L290 TraceCheckUtils]: 12: Hoare triple {10906#true} assume !(0 == ~cond); {10906#true} is VALID [2022-04-14 14:44:07,070 INFO L290 TraceCheckUtils]: 13: Hoare triple {10906#true} assume true; {10906#true} is VALID [2022-04-14 14:44:07,071 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {10906#true} {10914#(and (or (<= (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296) 4274967296) (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296))) (<= 1 (+ (* 2 (div main_~l~0 4294967296)) main_~l~0))) (<= (+ (* 715827883 (div main_~l~0 4294967296)) (* 715827883 (div (+ main_~l~0 (* (- 6) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) 0))} #89#return; {10914#(and (or (<= (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296) 4274967296) (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296))) (<= 1 (+ (* 2 (div main_~l~0 4294967296)) main_~l~0))) (<= (+ (* 715827883 (div main_~l~0 4294967296)) (* 715827883 (div (+ main_~l~0 (* (- 6) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) 0))} is VALID [2022-04-14 14:44:07,072 INFO L290 TraceCheckUtils]: 15: Hoare triple {10914#(and (or (<= (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296) 4274967296) (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296))) (<= 1 (+ (* 2 (div main_~l~0 4294967296)) main_~l~0))) (<= (+ (* 715827883 (div main_~l~0 4294967296)) (* 715827883 (div (+ main_~l~0 (* (- 6) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {10919#(and (<= (+ (* 715827883 (div main_~l~0 4294967296)) (* 715827883 (div (+ main_~l~0 (* (- 6) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) 0) (<= 1 (+ (* 2 (div main_~l~0 4294967296)) main_~l~0)))} is VALID [2022-04-14 14:44:07,073 INFO L290 TraceCheckUtils]: 16: Hoare triple {10919#(and (<= (+ (* 715827883 (div main_~l~0 4294967296)) (* 715827883 (div (+ main_~l~0 (* (- 6) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) 0) (<= 1 (+ (* 2 (div main_~l~0 4294967296)) main_~l~0)))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 9 then ~l~0 % 4294967296 % 9 - 9 else ~l~0 % 4294967296 % 9) % 4294967296); {10919#(and (<= (+ (* 715827883 (div main_~l~0 4294967296)) (* 715827883 (div (+ main_~l~0 (* (- 6) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) 0) (<= 1 (+ (* 2 (div main_~l~0 4294967296)) main_~l~0)))} is VALID [2022-04-14 14:44:07,073 INFO L290 TraceCheckUtils]: 17: Hoare triple {10919#(and (<= (+ (* 715827883 (div main_~l~0 4294967296)) (* 715827883 (div (+ main_~l~0 (* (- 6) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) 0) (<= 1 (+ (* 2 (div main_~l~0 4294967296)) main_~l~0)))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {10919#(and (<= (+ (* 715827883 (div main_~l~0 4294967296)) (* 715827883 (div (+ main_~l~0 (* (- 6) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) 0) (<= 1 (+ (* 2 (div main_~l~0 4294967296)) main_~l~0)))} is VALID [2022-04-14 14:44:07,073 INFO L290 TraceCheckUtils]: 18: Hoare triple {10919#(and (<= (+ (* 715827883 (div main_~l~0 4294967296)) (* 715827883 (div (+ main_~l~0 (* (- 6) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) 0) (<= 1 (+ (* 2 (div main_~l~0 4294967296)) main_~l~0)))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296); {10919#(and (<= (+ (* 715827883 (div main_~l~0 4294967296)) (* 715827883 (div (+ main_~l~0 (* (- 6) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) 0) (<= 1 (+ (* 2 (div main_~l~0 4294967296)) main_~l~0)))} is VALID [2022-04-14 14:44:07,075 INFO L290 TraceCheckUtils]: 19: Hoare triple {10919#(and (<= (+ (* 715827883 (div main_~l~0 4294967296)) (* 715827883 (div (+ main_~l~0 (* (- 6) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) 0) (<= 1 (+ (* 2 (div main_~l~0 4294967296)) main_~l~0)))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296;~v2~0 := 1 + ~v2~0; {10907#false} is VALID [2022-04-14 14:44:07,075 INFO L290 TraceCheckUtils]: 20: Hoare triple {10907#false} ~l~0 := 1 + ~l~0; {10907#false} is VALID [2022-04-14 14:44:07,075 INFO L272 TraceCheckUtils]: 21: Hoare triple {10907#false} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0 + ~v6~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {10906#true} is VALID [2022-04-14 14:44:07,075 INFO L290 TraceCheckUtils]: 22: Hoare triple {10906#true} ~cond := #in~cond; {10906#true} is VALID [2022-04-14 14:44:07,075 INFO L290 TraceCheckUtils]: 23: Hoare triple {10906#true} assume !(0 == ~cond); {10906#true} is VALID [2022-04-14 14:44:07,075 INFO L290 TraceCheckUtils]: 24: Hoare triple {10906#true} assume true; {10906#true} is VALID [2022-04-14 14:44:07,076 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {10906#true} {10907#false} #89#return; {10907#false} is VALID [2022-04-14 14:44:07,076 INFO L290 TraceCheckUtils]: 26: Hoare triple {10907#false} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {10907#false} is VALID [2022-04-14 14:44:07,076 INFO L290 TraceCheckUtils]: 27: Hoare triple {10907#false} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 9 then ~l~0 % 4294967296 % 9 - 9 else ~l~0 % 4294967296 % 9) % 4294967296); {10907#false} is VALID [2022-04-14 14:44:07,076 INFO L290 TraceCheckUtils]: 28: Hoare triple {10907#false} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {10907#false} is VALID [2022-04-14 14:44:07,076 INFO L290 TraceCheckUtils]: 29: Hoare triple {10907#false} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296); {10907#false} is VALID [2022-04-14 14:44:07,076 INFO L290 TraceCheckUtils]: 30: Hoare triple {10907#false} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {10907#false} is VALID [2022-04-14 14:44:07,076 INFO L290 TraceCheckUtils]: 31: Hoare triple {10907#false} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {10907#false} is VALID [2022-04-14 14:44:07,076 INFO L290 TraceCheckUtils]: 32: Hoare triple {10907#false} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296); {10907#false} is VALID [2022-04-14 14:44:07,076 INFO L290 TraceCheckUtils]: 33: Hoare triple {10907#false} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 3 then ~l~0 % 4294967296 % 3 - 3 else ~l~0 % 4294967296 % 3) % 4294967296;~i~0 := 1 + ~i~0; {10907#false} is VALID [2022-04-14 14:44:07,076 INFO L290 TraceCheckUtils]: 34: Hoare triple {10907#false} ~l~0 := 1 + ~l~0; {10907#false} is VALID [2022-04-14 14:44:07,076 INFO L272 TraceCheckUtils]: 35: Hoare triple {10907#false} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0 + ~v6~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {10907#false} is VALID [2022-04-14 14:44:07,076 INFO L290 TraceCheckUtils]: 36: Hoare triple {10907#false} ~cond := #in~cond; {10907#false} is VALID [2022-04-14 14:44:07,076 INFO L290 TraceCheckUtils]: 37: Hoare triple {10907#false} assume 0 == ~cond; {10907#false} is VALID [2022-04-14 14:44:07,076 INFO L290 TraceCheckUtils]: 38: Hoare triple {10907#false} assume !false; {10907#false} is VALID [2022-04-14 14:44:07,076 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-14 14:44:07,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 14:44:07,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667953043] [2022-04-14 14:44:07,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667953043] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-14 14:44:07,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1123923942] [2022-04-14 14:44:07,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 14:44:07,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 14:44:07,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 14:44:07,078 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 14:44:07,079 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-04-14 14:44:07,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:44:07,114 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-14 14:44:07,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:44:07,121 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 14:44:07,942 INFO L272 TraceCheckUtils]: 0: Hoare triple {10906#true} call ULTIMATE.init(); {10906#true} is VALID [2022-04-14 14:44:07,942 INFO L290 TraceCheckUtils]: 1: Hoare triple {10906#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {10906#true} is VALID [2022-04-14 14:44:07,942 INFO L290 TraceCheckUtils]: 2: Hoare triple {10906#true} assume true; {10906#true} is VALID [2022-04-14 14:44:07,942 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10906#true} {10906#true} #91#return; {10906#true} is VALID [2022-04-14 14:44:07,942 INFO L272 TraceCheckUtils]: 4: Hoare triple {10906#true} call #t~ret5 := main(); {10906#true} is VALID [2022-04-14 14:44:07,943 INFO L290 TraceCheckUtils]: 5: Hoare triple {10906#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v1~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;~v5~0 := 0;~v6~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {10944#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v6~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:44:07,943 INFO L290 TraceCheckUtils]: 6: Hoare triple {10944#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v6~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {10944#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v6~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:44:07,944 INFO L290 TraceCheckUtils]: 7: Hoare triple {10944#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v6~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {10944#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v6~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:44:07,944 INFO L290 TraceCheckUtils]: 8: Hoare triple {10944#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v6~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 9 then ~l~0 % 4294967296 % 9 - 9 else ~l~0 % 4294967296 % 9) % 4294967296;~v6~0 := 1 + ~v6~0; {10954#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:44:07,944 INFO L290 TraceCheckUtils]: 9: Hoare triple {10954#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {10958#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:44:07,945 INFO L272 TraceCheckUtils]: 10: Hoare triple {10958#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0 + ~v6~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {10906#true} is VALID [2022-04-14 14:44:07,945 INFO L290 TraceCheckUtils]: 11: Hoare triple {10906#true} ~cond := #in~cond; {10906#true} is VALID [2022-04-14 14:44:07,945 INFO L290 TraceCheckUtils]: 12: Hoare triple {10906#true} assume !(0 == ~cond); {10906#true} is VALID [2022-04-14 14:44:07,945 INFO L290 TraceCheckUtils]: 13: Hoare triple {10906#true} assume true; {10906#true} is VALID [2022-04-14 14:44:07,945 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {10906#true} {10958#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} #89#return; {10958#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:44:07,946 INFO L290 TraceCheckUtils]: 15: Hoare triple {10958#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {10958#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:44:07,946 INFO L290 TraceCheckUtils]: 16: Hoare triple {10958#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 9 then ~l~0 % 4294967296 % 9 - 9 else ~l~0 % 4294967296 % 9) % 4294967296); {10958#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:44:07,947 INFO L290 TraceCheckUtils]: 17: Hoare triple {10958#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {10958#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:44:07,947 INFO L290 TraceCheckUtils]: 18: Hoare triple {10958#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296); {10958#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:44:07,947 INFO L290 TraceCheckUtils]: 19: Hoare triple {10958#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296;~v2~0 := 1 + ~v2~0; {10989#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:44:07,948 INFO L290 TraceCheckUtils]: 20: Hoare triple {10989#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {10993#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:44:07,948 INFO L272 TraceCheckUtils]: 21: Hoare triple {10993#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0 + ~v6~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {10906#true} is VALID [2022-04-14 14:44:07,948 INFO L290 TraceCheckUtils]: 22: Hoare triple {10906#true} ~cond := #in~cond; {10906#true} is VALID [2022-04-14 14:44:07,948 INFO L290 TraceCheckUtils]: 23: Hoare triple {10906#true} assume !(0 == ~cond); {10906#true} is VALID [2022-04-14 14:44:07,948 INFO L290 TraceCheckUtils]: 24: Hoare triple {10906#true} assume true; {10906#true} is VALID [2022-04-14 14:44:07,949 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {10906#true} {10993#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} #89#return; {10993#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:44:07,949 INFO L290 TraceCheckUtils]: 26: Hoare triple {10993#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {10993#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:44:07,950 INFO L290 TraceCheckUtils]: 27: Hoare triple {10993#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 9 then ~l~0 % 4294967296 % 9 - 9 else ~l~0 % 4294967296 % 9) % 4294967296); {10993#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:44:07,950 INFO L290 TraceCheckUtils]: 28: Hoare triple {10993#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {10993#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:44:07,950 INFO L290 TraceCheckUtils]: 29: Hoare triple {10993#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296); {10993#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:44:07,951 INFO L290 TraceCheckUtils]: 30: Hoare triple {10993#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {10993#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:44:07,951 INFO L290 TraceCheckUtils]: 31: Hoare triple {10993#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {10993#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:44:07,952 INFO L290 TraceCheckUtils]: 32: Hoare triple {10993#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296); {10993#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:44:07,952 INFO L290 TraceCheckUtils]: 33: Hoare triple {10993#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= (+ (- 1) main_~v2~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 3 then ~l~0 % 4294967296 % 3 - 3 else ~l~0 % 4294967296 % 3) % 4294967296;~i~0 := 1 + ~i~0; {11033#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= main_~i~0 1) (= (+ (- 1) main_~v2~0) 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:44:07,953 INFO L290 TraceCheckUtils]: 34: Hoare triple {11033#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= main_~i~0 1) (= (+ (- 1) main_~v2~0) 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {11037#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 1) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 3) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:44:07,953 INFO L272 TraceCheckUtils]: 35: Hoare triple {11037#(and (= main_~v6~0 1) (= main_~v5~0 0) (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 1) (= (+ (- 1) main_~v2~0) 0) (= main_~l~0 3) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0 + ~v6~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {11041#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 14:44:07,954 INFO L290 TraceCheckUtils]: 36: Hoare triple {11041#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {11045#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 14:44:07,954 INFO L290 TraceCheckUtils]: 37: Hoare triple {11045#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10907#false} is VALID [2022-04-14 14:44:07,954 INFO L290 TraceCheckUtils]: 38: Hoare triple {10907#false} assume !false; {10907#false} is VALID [2022-04-14 14:44:07,954 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-14 14:44:07,954 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 14:44:08,330 INFO L290 TraceCheckUtils]: 38: Hoare triple {10907#false} assume !false; {10907#false} is VALID [2022-04-14 14:44:08,330 INFO L290 TraceCheckUtils]: 37: Hoare triple {11045#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10907#false} is VALID [2022-04-14 14:44:08,331 INFO L290 TraceCheckUtils]: 36: Hoare triple {11041#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {11045#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 14:44:08,331 INFO L272 TraceCheckUtils]: 35: Hoare triple {11061#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0 + ~v6~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {11041#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 14:44:08,333 INFO L290 TraceCheckUtils]: 34: Hoare triple {11065#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} ~l~0 := 1 + ~l~0; {11061#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:44:10,443 WARN L290 TraceCheckUtils]: 33: Hoare triple {11061#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 3 then ~l~0 % 4294967296 % 3 - 3 else ~l~0 % 4294967296 % 3) % 4294967296;~i~0 := 1 + ~i~0; {11065#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is UNKNOWN [2022-04-14 14:44:10,444 INFO L290 TraceCheckUtils]: 32: Hoare triple {11061#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296); {11061#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:44:10,445 INFO L290 TraceCheckUtils]: 31: Hoare triple {11061#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {11061#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:44:10,445 INFO L290 TraceCheckUtils]: 30: Hoare triple {11061#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {11061#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:44:10,445 INFO L290 TraceCheckUtils]: 29: Hoare triple {11061#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296); {11061#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:44:10,446 INFO L290 TraceCheckUtils]: 28: Hoare triple {11061#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {11061#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:44:10,446 INFO L290 TraceCheckUtils]: 27: Hoare triple {11061#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 9 then ~l~0 % 4294967296 % 9 - 9 else ~l~0 % 4294967296 % 9) % 4294967296); {11061#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:44:10,446 INFO L290 TraceCheckUtils]: 26: Hoare triple {11061#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {11061#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:44:10,447 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {10906#true} {11061#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} #89#return; {11061#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:44:10,447 INFO L290 TraceCheckUtils]: 24: Hoare triple {10906#true} assume true; {10906#true} is VALID [2022-04-14 14:44:10,447 INFO L290 TraceCheckUtils]: 23: Hoare triple {10906#true} assume !(0 == ~cond); {10906#true} is VALID [2022-04-14 14:44:10,447 INFO L290 TraceCheckUtils]: 22: Hoare triple {10906#true} ~cond := #in~cond; {10906#true} is VALID [2022-04-14 14:44:10,447 INFO L272 TraceCheckUtils]: 21: Hoare triple {11061#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0 + ~v6~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {10906#true} is VALID [2022-04-14 14:44:10,450 INFO L290 TraceCheckUtils]: 20: Hoare triple {11065#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} ~l~0 := 1 + ~l~0; {11061#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:44:12,557 WARN L290 TraceCheckUtils]: 19: Hoare triple {11061#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296;~v2~0 := 1 + ~v2~0; {11065#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is UNKNOWN [2022-04-14 14:44:12,558 INFO L290 TraceCheckUtils]: 18: Hoare triple {11061#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296); {11061#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:44:12,558 INFO L290 TraceCheckUtils]: 17: Hoare triple {11061#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {11061#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:44:12,558 INFO L290 TraceCheckUtils]: 16: Hoare triple {11061#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 9 then ~l~0 % 4294967296 % 9 - 9 else ~l~0 % 4294967296 % 9) % 4294967296); {11061#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:44:12,559 INFO L290 TraceCheckUtils]: 15: Hoare triple {11061#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {11061#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:44:12,559 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {10906#true} {11061#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} #89#return; {11061#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:44:12,559 INFO L290 TraceCheckUtils]: 13: Hoare triple {10906#true} assume true; {10906#true} is VALID [2022-04-14 14:44:12,560 INFO L290 TraceCheckUtils]: 12: Hoare triple {10906#true} assume !(0 == ~cond); {10906#true} is VALID [2022-04-14 14:44:12,560 INFO L290 TraceCheckUtils]: 11: Hoare triple {10906#true} ~cond := #in~cond; {10906#true} is VALID [2022-04-14 14:44:12,560 INFO L272 TraceCheckUtils]: 10: Hoare triple {11061#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0 + ~v6~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {10906#true} is VALID [2022-04-14 14:44:12,562 INFO L290 TraceCheckUtils]: 9: Hoare triple {11065#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} ~l~0 := 1 + ~l~0; {11061#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:44:14,672 WARN L290 TraceCheckUtils]: 8: Hoare triple {11061#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 9 then ~l~0 % 4294967296 % 9 - 9 else ~l~0 % 4294967296 % 9) % 4294967296;~v6~0 := 1 + ~v6~0; {11065#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is UNKNOWN [2022-04-14 14:44:14,673 INFO L290 TraceCheckUtils]: 7: Hoare triple {11061#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {11061#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:44:14,675 INFO L290 TraceCheckUtils]: 6: Hoare triple {11061#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {11061#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:44:14,676 INFO L290 TraceCheckUtils]: 5: Hoare triple {10906#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v1~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;~v5~0 := 0;~v6~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {11061#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:44:14,676 INFO L272 TraceCheckUtils]: 4: Hoare triple {10906#true} call #t~ret5 := main(); {10906#true} is VALID [2022-04-14 14:44:14,676 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10906#true} {10906#true} #91#return; {10906#true} is VALID [2022-04-14 14:44:14,676 INFO L290 TraceCheckUtils]: 2: Hoare triple {10906#true} assume true; {10906#true} is VALID [2022-04-14 14:44:14,676 INFO L290 TraceCheckUtils]: 1: Hoare triple {10906#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {10906#true} is VALID [2022-04-14 14:44:14,676 INFO L272 TraceCheckUtils]: 0: Hoare triple {10906#true} call ULTIMATE.init(); {10906#true} is VALID [2022-04-14 14:44:14,676 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-04-14 14:44:14,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1123923942] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-14 14:44:14,676 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-14 14:44:14,677 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9, 11] total 20 [2022-04-14 14:44:14,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046796002] [2022-04-14 14:44:14,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 14:44:14,677 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 39 [2022-04-14 14:44:14,677 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 14:44:14,677 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 14:44:21,028 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 24 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-14 14:44:21,029 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-14 14:44:21,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 14:44:21,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-14 14:44:21,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2022-04-14 14:44:21,029 INFO L87 Difference]: Start difference. First operand 178 states and 254 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 14:44:23,132 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:44:25,369 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:44:27,487 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:44:29,668 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:44:31,838 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:44:34,010 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:44:36,368 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:44:40,699 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:44:40,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:44:40,874 INFO L93 Difference]: Finished difference Result 209 states and 300 transitions. [2022-04-14 14:44:40,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-14 14:44:40,874 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 39 [2022-04-14 14:44:40,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 14:44:40,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 14:44:40,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 55 transitions. [2022-04-14 14:44:40,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 14:44:40,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 55 transitions. [2022-04-14 14:44:40,875 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 55 transitions. [2022-04-14 14:44:47,329 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 52 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-14 14:44:47,332 INFO L225 Difference]: With dead ends: 209 [2022-04-14 14:44:47,332 INFO L226 Difference]: Without dead ends: 207 [2022-04-14 14:44:47,332 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 69 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2022-04-14 14:44:47,332 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 5 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 2 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.2s IncrementalHoareTripleChecker+Time [2022-04-14 14:44:47,332 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 59 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 77 Invalid, 8 Unknown, 0 Unchecked, 17.2s Time] [2022-04-14 14:44:47,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2022-04-14 14:44:47,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 194. [2022-04-14 14:44:47,424 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 14:44:47,424 INFO L82 GeneralOperation]: Start isEquivalent. First operand 207 states. Second operand has 194 states, 162 states have (on average 1.5308641975308641) internal successors, (248), 162 states have internal predecessors, (248), 16 states have call successors, (16), 16 states have call predecessors, (16), 15 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-14 14:44:47,424 INFO L74 IsIncluded]: Start isIncluded. First operand 207 states. Second operand has 194 states, 162 states have (on average 1.5308641975308641) internal successors, (248), 162 states have internal predecessors, (248), 16 states have call successors, (16), 16 states have call predecessors, (16), 15 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-14 14:44:47,424 INFO L87 Difference]: Start difference. First operand 207 states. Second operand has 194 states, 162 states have (on average 1.5308641975308641) internal successors, (248), 162 states have internal predecessors, (248), 16 states have call successors, (16), 16 states have call predecessors, (16), 15 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-14 14:44:47,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:44:47,427 INFO L93 Difference]: Finished difference Result 207 states and 298 transitions. [2022-04-14 14:44:47,427 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 298 transitions. [2022-04-14 14:44:47,427 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:44:47,427 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:44:47,427 INFO L74 IsIncluded]: Start isIncluded. First operand has 194 states, 162 states have (on average 1.5308641975308641) internal successors, (248), 162 states have internal predecessors, (248), 16 states have call successors, (16), 16 states have call predecessors, (16), 15 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand 207 states. [2022-04-14 14:44:47,428 INFO L87 Difference]: Start difference. First operand has 194 states, 162 states have (on average 1.5308641975308641) internal successors, (248), 162 states have internal predecessors, (248), 16 states have call successors, (16), 16 states have call predecessors, (16), 15 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand 207 states. [2022-04-14 14:44:47,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:44:47,430 INFO L93 Difference]: Finished difference Result 207 states and 298 transitions. [2022-04-14 14:44:47,430 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 298 transitions. [2022-04-14 14:44:47,430 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:44:47,430 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:44:47,430 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 14:44:47,430 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 14:44:47,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 162 states have (on average 1.5308641975308641) internal successors, (248), 162 states have internal predecessors, (248), 16 states have call successors, (16), 16 states have call predecessors, (16), 15 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-14 14:44:47,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 279 transitions. [2022-04-14 14:44:47,433 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 279 transitions. Word has length 39 [2022-04-14 14:44:47,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 14:44:47,433 INFO L478 AbstractCegarLoop]: Abstraction has 194 states and 279 transitions. [2022-04-14 14:44:47,433 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 14:44:47,433 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 279 transitions. [2022-04-14 14:44:47,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-14 14:44:47,433 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 14:44:47,433 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 14:44:47,449 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-04-14 14:44:47,649 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-04-14 14:44:47,649 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 14:44:47,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 14:44:47,650 INFO L85 PathProgramCache]: Analyzing trace with hash -2058534231, now seen corresponding path program 1 times [2022-04-14 14:44:47,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 14:44:47,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668124140] [2022-04-14 14:44:47,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 14:44:47,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 14:44:47,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:44:47,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 14:44:47,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:44:47,700 INFO L290 TraceCheckUtils]: 0: Hoare triple {12101#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {12086#true} is VALID [2022-04-14 14:44:47,700 INFO L290 TraceCheckUtils]: 1: Hoare triple {12086#true} assume true; {12086#true} is VALID [2022-04-14 14:44:47,700 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12086#true} {12086#true} #91#return; {12086#true} is VALID [2022-04-14 14:44:47,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-04-14 14:44:47,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:44:47,703 INFO L290 TraceCheckUtils]: 0: Hoare triple {12086#true} ~cond := #in~cond; {12086#true} is VALID [2022-04-14 14:44:47,703 INFO L290 TraceCheckUtils]: 1: Hoare triple {12086#true} assume !(0 == ~cond); {12086#true} is VALID [2022-04-14 14:44:47,703 INFO L290 TraceCheckUtils]: 2: Hoare triple {12086#true} assume true; {12086#true} is VALID [2022-04-14 14:44:47,704 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12086#true} {12092#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} #89#return; {12092#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} is VALID [2022-04-14 14:44:47,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-04-14 14:44:47,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:44:47,706 INFO L290 TraceCheckUtils]: 0: Hoare triple {12086#true} ~cond := #in~cond; {12086#true} is VALID [2022-04-14 14:44:47,706 INFO L290 TraceCheckUtils]: 1: Hoare triple {12086#true} assume !(0 == ~cond); {12086#true} is VALID [2022-04-14 14:44:47,706 INFO L290 TraceCheckUtils]: 2: Hoare triple {12086#true} assume true; {12086#true} is VALID [2022-04-14 14:44:47,706 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12086#true} {12087#false} #89#return; {12087#false} is VALID [2022-04-14 14:44:47,707 INFO L272 TraceCheckUtils]: 0: Hoare triple {12086#true} call ULTIMATE.init(); {12101#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 14:44:47,707 INFO L290 TraceCheckUtils]: 1: Hoare triple {12101#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {12086#true} is VALID [2022-04-14 14:44:47,707 INFO L290 TraceCheckUtils]: 2: Hoare triple {12086#true} assume true; {12086#true} is VALID [2022-04-14 14:44:47,707 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12086#true} {12086#true} #91#return; {12086#true} is VALID [2022-04-14 14:44:47,707 INFO L272 TraceCheckUtils]: 4: Hoare triple {12086#true} call #t~ret5 := main(); {12086#true} is VALID [2022-04-14 14:44:47,707 INFO L290 TraceCheckUtils]: 5: Hoare triple {12086#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v1~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;~v5~0 := 0;~v6~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {12091#(= main_~l~0 0)} is VALID [2022-04-14 14:44:47,708 INFO L290 TraceCheckUtils]: 6: Hoare triple {12091#(= main_~l~0 0)} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {12091#(= main_~l~0 0)} is VALID [2022-04-14 14:44:47,708 INFO L290 TraceCheckUtils]: 7: Hoare triple {12091#(= main_~l~0 0)} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {12091#(= main_~l~0 0)} is VALID [2022-04-14 14:44:47,708 INFO L290 TraceCheckUtils]: 8: Hoare triple {12091#(= main_~l~0 0)} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 9 then ~l~0 % 4294967296 % 9 - 9 else ~l~0 % 4294967296 % 9) % 4294967296;~v6~0 := 1 + ~v6~0; {12091#(= main_~l~0 0)} is VALID [2022-04-14 14:44:47,708 INFO L290 TraceCheckUtils]: 9: Hoare triple {12091#(= main_~l~0 0)} ~l~0 := 1 + ~l~0; {12092#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} is VALID [2022-04-14 14:44:47,708 INFO L272 TraceCheckUtils]: 10: Hoare triple {12092#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0 + ~v6~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {12086#true} is VALID [2022-04-14 14:44:47,708 INFO L290 TraceCheckUtils]: 11: Hoare triple {12086#true} ~cond := #in~cond; {12086#true} is VALID [2022-04-14 14:44:47,709 INFO L290 TraceCheckUtils]: 12: Hoare triple {12086#true} assume !(0 == ~cond); {12086#true} is VALID [2022-04-14 14:44:47,709 INFO L290 TraceCheckUtils]: 13: Hoare triple {12086#true} assume true; {12086#true} is VALID [2022-04-14 14:44:47,709 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {12086#true} {12092#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} #89#return; {12092#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} is VALID [2022-04-14 14:44:47,710 INFO L290 TraceCheckUtils]: 15: Hoare triple {12092#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {12092#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} is VALID [2022-04-14 14:44:47,710 INFO L290 TraceCheckUtils]: 16: Hoare triple {12092#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 9 then ~l~0 % 4294967296 % 9 - 9 else ~l~0 % 4294967296 % 9) % 4294967296); {12092#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} is VALID [2022-04-14 14:44:47,710 INFO L290 TraceCheckUtils]: 17: Hoare triple {12092#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {12092#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} is VALID [2022-04-14 14:44:47,711 INFO L290 TraceCheckUtils]: 18: Hoare triple {12092#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296); {12092#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} is VALID [2022-04-14 14:44:47,711 INFO L290 TraceCheckUtils]: 19: Hoare triple {12092#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {12092#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} is VALID [2022-04-14 14:44:47,711 INFO L290 TraceCheckUtils]: 20: Hoare triple {12092#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {12092#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} is VALID [2022-04-14 14:44:47,712 INFO L290 TraceCheckUtils]: 21: Hoare triple {12092#(and (<= (div main_~l~0 4) 0) (<= 1 main_~l~0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296;~v4~0 := 1 + ~v4~0; {12087#false} is VALID [2022-04-14 14:44:47,712 INFO L290 TraceCheckUtils]: 22: Hoare triple {12087#false} ~l~0 := 1 + ~l~0; {12087#false} is VALID [2022-04-14 14:44:47,712 INFO L272 TraceCheckUtils]: 23: Hoare triple {12087#false} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0 + ~v6~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {12086#true} is VALID [2022-04-14 14:44:47,712 INFO L290 TraceCheckUtils]: 24: Hoare triple {12086#true} ~cond := #in~cond; {12086#true} is VALID [2022-04-14 14:44:47,712 INFO L290 TraceCheckUtils]: 25: Hoare triple {12086#true} assume !(0 == ~cond); {12086#true} is VALID [2022-04-14 14:44:47,712 INFO L290 TraceCheckUtils]: 26: Hoare triple {12086#true} assume true; {12086#true} is VALID [2022-04-14 14:44:47,712 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {12086#true} {12087#false} #89#return; {12087#false} is VALID [2022-04-14 14:44:47,712 INFO L290 TraceCheckUtils]: 28: Hoare triple {12087#false} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {12087#false} is VALID [2022-04-14 14:44:47,712 INFO L290 TraceCheckUtils]: 29: Hoare triple {12087#false} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 9 then ~l~0 % 4294967296 % 9 - 9 else ~l~0 % 4294967296 % 9) % 4294967296); {12087#false} is VALID [2022-04-14 14:44:47,712 INFO L290 TraceCheckUtils]: 30: Hoare triple {12087#false} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {12087#false} is VALID [2022-04-14 14:44:47,712 INFO L290 TraceCheckUtils]: 31: Hoare triple {12087#false} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296); {12087#false} is VALID [2022-04-14 14:44:47,713 INFO L290 TraceCheckUtils]: 32: Hoare triple {12087#false} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {12087#false} is VALID [2022-04-14 14:44:47,713 INFO L290 TraceCheckUtils]: 33: Hoare triple {12087#false} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296;~v3~0 := 1 + ~v3~0; {12087#false} is VALID [2022-04-14 14:44:47,713 INFO L290 TraceCheckUtils]: 34: Hoare triple {12087#false} ~l~0 := 1 + ~l~0; {12087#false} is VALID [2022-04-14 14:44:47,713 INFO L272 TraceCheckUtils]: 35: Hoare triple {12087#false} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0 + ~v6~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {12087#false} is VALID [2022-04-14 14:44:47,713 INFO L290 TraceCheckUtils]: 36: Hoare triple {12087#false} ~cond := #in~cond; {12087#false} is VALID [2022-04-14 14:44:47,713 INFO L290 TraceCheckUtils]: 37: Hoare triple {12087#false} assume 0 == ~cond; {12087#false} is VALID [2022-04-14 14:44:47,713 INFO L290 TraceCheckUtils]: 38: Hoare triple {12087#false} assume !false; {12087#false} is VALID [2022-04-14 14:44:47,713 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-14 14:44:47,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 14:44:47,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668124140] [2022-04-14 14:44:47,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668124140] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-14 14:44:47,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [215916615] [2022-04-14 14:44:47,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 14:44:47,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 14:44:47,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 14:44:47,714 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 14:44:47,715 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-04-14 14:44:47,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:44:47,750 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-14 14:44:47,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:44:47,757 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 14:44:48,578 INFO L272 TraceCheckUtils]: 0: Hoare triple {12086#true} call ULTIMATE.init(); {12086#true} is VALID [2022-04-14 14:44:48,578 INFO L290 TraceCheckUtils]: 1: Hoare triple {12086#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {12086#true} is VALID [2022-04-14 14:44:48,578 INFO L290 TraceCheckUtils]: 2: Hoare triple {12086#true} assume true; {12086#true} is VALID [2022-04-14 14:44:48,578 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12086#true} {12086#true} #91#return; {12086#true} is VALID [2022-04-14 14:44:48,579 INFO L272 TraceCheckUtils]: 4: Hoare triple {12086#true} call #t~ret5 := main(); {12086#true} is VALID [2022-04-14 14:44:48,579 INFO L290 TraceCheckUtils]: 5: Hoare triple {12086#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v1~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;~v5~0 := 0;~v6~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {12120#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v6~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:44:48,579 INFO L290 TraceCheckUtils]: 6: Hoare triple {12120#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v6~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {12120#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v6~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:44:48,580 INFO L290 TraceCheckUtils]: 7: Hoare triple {12120#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v6~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {12120#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v6~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:44:48,580 INFO L290 TraceCheckUtils]: 8: Hoare triple {12120#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v6~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 9 then ~l~0 % 4294967296 % 9 - 9 else ~l~0 % 4294967296 % 9) % 4294967296;~v6~0 := 1 + ~v6~0; {12130#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:44:48,581 INFO L290 TraceCheckUtils]: 9: Hoare triple {12130#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {12134#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:44:48,581 INFO L272 TraceCheckUtils]: 10: Hoare triple {12134#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0 + ~v6~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {12086#true} is VALID [2022-04-14 14:44:48,581 INFO L290 TraceCheckUtils]: 11: Hoare triple {12086#true} ~cond := #in~cond; {12086#true} is VALID [2022-04-14 14:44:48,581 INFO L290 TraceCheckUtils]: 12: Hoare triple {12086#true} assume !(0 == ~cond); {12086#true} is VALID [2022-04-14 14:44:48,581 INFO L290 TraceCheckUtils]: 13: Hoare triple {12086#true} assume true; {12086#true} is VALID [2022-04-14 14:44:48,582 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {12086#true} {12134#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} #89#return; {12134#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:44:48,582 INFO L290 TraceCheckUtils]: 15: Hoare triple {12134#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {12134#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:44:48,583 INFO L290 TraceCheckUtils]: 16: Hoare triple {12134#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 9 then ~l~0 % 4294967296 % 9 - 9 else ~l~0 % 4294967296 % 9) % 4294967296); {12134#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:44:48,583 INFO L290 TraceCheckUtils]: 17: Hoare triple {12134#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {12134#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:44:48,583 INFO L290 TraceCheckUtils]: 18: Hoare triple {12134#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296); {12134#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:44:48,584 INFO L290 TraceCheckUtils]: 19: Hoare triple {12134#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {12134#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:44:48,584 INFO L290 TraceCheckUtils]: 20: Hoare triple {12134#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {12134#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:44:48,585 INFO L290 TraceCheckUtils]: 21: Hoare triple {12134#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296;~v4~0 := 1 + ~v4~0; {12171#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= (+ (- 1) main_~v4~0) 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:44:48,585 INFO L290 TraceCheckUtils]: 22: Hoare triple {12171#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= (+ (- 1) main_~v4~0) 0) (= main_~v1~0 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {12175#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v4~0) 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:44:48,585 INFO L272 TraceCheckUtils]: 23: Hoare triple {12175#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v4~0) 0) (= main_~v1~0 0) (= main_~v3~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0 + ~v6~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {12086#true} is VALID [2022-04-14 14:44:48,585 INFO L290 TraceCheckUtils]: 24: Hoare triple {12086#true} ~cond := #in~cond; {12086#true} is VALID [2022-04-14 14:44:48,585 INFO L290 TraceCheckUtils]: 25: Hoare triple {12086#true} assume !(0 == ~cond); {12086#true} is VALID [2022-04-14 14:44:48,585 INFO L290 TraceCheckUtils]: 26: Hoare triple {12086#true} assume true; {12086#true} is VALID [2022-04-14 14:44:48,586 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {12086#true} {12175#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v4~0) 0) (= main_~v1~0 0) (= main_~v3~0 0))} #89#return; {12175#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v4~0) 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:44:48,586 INFO L290 TraceCheckUtils]: 28: Hoare triple {12175#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v4~0) 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {12175#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v4~0) 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:44:48,587 INFO L290 TraceCheckUtils]: 29: Hoare triple {12175#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v4~0) 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 9 then ~l~0 % 4294967296 % 9 - 9 else ~l~0 % 4294967296 % 9) % 4294967296); {12175#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v4~0) 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:44:48,587 INFO L290 TraceCheckUtils]: 30: Hoare triple {12175#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v4~0) 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {12175#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v4~0) 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:44:48,588 INFO L290 TraceCheckUtils]: 31: Hoare triple {12175#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v4~0) 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296); {12175#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v4~0) 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:44:48,588 INFO L290 TraceCheckUtils]: 32: Hoare triple {12175#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v4~0) 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {12175#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v4~0) 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:44:48,588 INFO L290 TraceCheckUtils]: 33: Hoare triple {12175#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v4~0) 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296;~v3~0 := 1 + ~v3~0; {12209#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v4~0) 0) (= main_~v1~0 0) (= main_~v3~0 1))} is VALID [2022-04-14 14:44:48,589 INFO L290 TraceCheckUtils]: 34: Hoare triple {12209#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= (+ (- 1) main_~v4~0) 0) (= main_~v1~0 0) (= main_~v3~0 1))} ~l~0 := 1 + ~l~0; {12213#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 3) (= main_~i~0 0) (= (+ (- 1) main_~v4~0) 0) (= main_~v1~0 0) (= main_~v3~0 1))} is VALID [2022-04-14 14:44:48,590 INFO L272 TraceCheckUtils]: 35: Hoare triple {12213#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 3) (= main_~i~0 0) (= (+ (- 1) main_~v4~0) 0) (= main_~v1~0 0) (= main_~v3~0 1))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0 + ~v6~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {12217#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 14:44:48,590 INFO L290 TraceCheckUtils]: 36: Hoare triple {12217#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {12221#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 14:44:48,590 INFO L290 TraceCheckUtils]: 37: Hoare triple {12221#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {12087#false} is VALID [2022-04-14 14:44:48,590 INFO L290 TraceCheckUtils]: 38: Hoare triple {12087#false} assume !false; {12087#false} is VALID [2022-04-14 14:44:48,591 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-14 14:44:48,591 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 14:44:48,907 INFO L290 TraceCheckUtils]: 38: Hoare triple {12087#false} assume !false; {12087#false} is VALID [2022-04-14 14:44:48,907 INFO L290 TraceCheckUtils]: 37: Hoare triple {12221#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {12087#false} is VALID [2022-04-14 14:44:48,908 INFO L290 TraceCheckUtils]: 36: Hoare triple {12217#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {12221#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 14:44:48,908 INFO L272 TraceCheckUtils]: 35: Hoare triple {12237#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0 + ~v6~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {12217#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 14:44:48,909 INFO L290 TraceCheckUtils]: 34: Hoare triple {12241#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} ~l~0 := 1 + ~l~0; {12237#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:44:51,021 WARN L290 TraceCheckUtils]: 33: Hoare triple {12237#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296;~v3~0 := 1 + ~v3~0; {12241#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is UNKNOWN [2022-04-14 14:44:51,022 INFO L290 TraceCheckUtils]: 32: Hoare triple {12237#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {12237#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:44:51,022 INFO L290 TraceCheckUtils]: 31: Hoare triple {12237#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296); {12237#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:44:51,022 INFO L290 TraceCheckUtils]: 30: Hoare triple {12237#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {12237#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:44:51,023 INFO L290 TraceCheckUtils]: 29: Hoare triple {12237#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 9 then ~l~0 % 4294967296 % 9 - 9 else ~l~0 % 4294967296 % 9) % 4294967296); {12237#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:44:51,023 INFO L290 TraceCheckUtils]: 28: Hoare triple {12237#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {12237#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:44:51,024 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {12086#true} {12237#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} #89#return; {12237#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:44:51,024 INFO L290 TraceCheckUtils]: 26: Hoare triple {12086#true} assume true; {12086#true} is VALID [2022-04-14 14:44:51,024 INFO L290 TraceCheckUtils]: 25: Hoare triple {12086#true} assume !(0 == ~cond); {12086#true} is VALID [2022-04-14 14:44:51,024 INFO L290 TraceCheckUtils]: 24: Hoare triple {12086#true} ~cond := #in~cond; {12086#true} is VALID [2022-04-14 14:44:51,024 INFO L272 TraceCheckUtils]: 23: Hoare triple {12237#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0 + ~v6~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {12086#true} is VALID [2022-04-14 14:44:51,027 INFO L290 TraceCheckUtils]: 22: Hoare triple {12241#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} ~l~0 := 1 + ~l~0; {12237#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:44:51,040 INFO L290 TraceCheckUtils]: 21: Hoare triple {12237#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296;~v4~0 := 1 + ~v4~0; {12241#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:44:51,040 INFO L290 TraceCheckUtils]: 20: Hoare triple {12237#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {12237#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:44:51,041 INFO L290 TraceCheckUtils]: 19: Hoare triple {12237#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {12237#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:44:51,041 INFO L290 TraceCheckUtils]: 18: Hoare triple {12237#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296); {12237#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:44:51,042 INFO L290 TraceCheckUtils]: 17: Hoare triple {12237#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {12237#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:44:51,042 INFO L290 TraceCheckUtils]: 16: Hoare triple {12237#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 9 then ~l~0 % 4294967296 % 9 - 9 else ~l~0 % 4294967296 % 9) % 4294967296); {12237#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:44:51,042 INFO L290 TraceCheckUtils]: 15: Hoare triple {12237#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {12237#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:44:51,043 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {12086#true} {12237#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} #89#return; {12237#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:44:51,043 INFO L290 TraceCheckUtils]: 13: Hoare triple {12086#true} assume true; {12086#true} is VALID [2022-04-14 14:44:51,043 INFO L290 TraceCheckUtils]: 12: Hoare triple {12086#true} assume !(0 == ~cond); {12086#true} is VALID [2022-04-14 14:44:51,043 INFO L290 TraceCheckUtils]: 11: Hoare triple {12086#true} ~cond := #in~cond; {12086#true} is VALID [2022-04-14 14:44:51,043 INFO L272 TraceCheckUtils]: 10: Hoare triple {12237#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0 + ~v6~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {12086#true} is VALID [2022-04-14 14:44:51,044 INFO L290 TraceCheckUtils]: 9: Hoare triple {12241#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} ~l~0 := 1 + ~l~0; {12237#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:44:53,149 WARN L290 TraceCheckUtils]: 8: Hoare triple {12237#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 9 then ~l~0 % 4294967296 % 9 - 9 else ~l~0 % 4294967296 % 9) % 4294967296;~v6~0 := 1 + ~v6~0; {12241#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is UNKNOWN [2022-04-14 14:44:53,150 INFO L290 TraceCheckUtils]: 7: Hoare triple {12237#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {12237#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:44:53,150 INFO L290 TraceCheckUtils]: 6: Hoare triple {12237#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {12237#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:44:53,152 INFO L290 TraceCheckUtils]: 5: Hoare triple {12086#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v1~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;~v5~0 := 0;~v6~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {12237#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:44:53,152 INFO L272 TraceCheckUtils]: 4: Hoare triple {12086#true} call #t~ret5 := main(); {12086#true} is VALID [2022-04-14 14:44:53,152 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12086#true} {12086#true} #91#return; {12086#true} is VALID [2022-04-14 14:44:53,152 INFO L290 TraceCheckUtils]: 2: Hoare triple {12086#true} assume true; {12086#true} is VALID [2022-04-14 14:44:53,152 INFO L290 TraceCheckUtils]: 1: Hoare triple {12086#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {12086#true} is VALID [2022-04-14 14:44:53,152 INFO L272 TraceCheckUtils]: 0: Hoare triple {12086#true} call ULTIMATE.init(); {12086#true} is VALID [2022-04-14 14:44:53,152 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-04-14 14:44:53,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [215916615] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-14 14:44:53,153 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-14 14:44:53,153 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5, 11] total 16 [2022-04-14 14:44:53,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577751129] [2022-04-14 14:44:53,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 14:44:53,153 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 39 [2022-04-14 14:44:53,153 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 14:44:53,153 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 14:44:57,434 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 24 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-14 14:44:57,434 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-14 14:44:57,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 14:44:57,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-14 14:44:57,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2022-04-14 14:44:57,435 INFO L87 Difference]: Start difference. First operand 194 states and 279 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 14:44:59,536 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:45:01,771 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:45:03,879 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:45:05,993 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:45:10,280 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:45:12,391 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:45:14,505 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:45:16,676 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:45:18,886 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:45:20,995 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:45:23,115 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:45:25,342 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:45:27,463 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 14:45:27,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:45:27,631 INFO L93 Difference]: Finished difference Result 210 states and 302 transitions. [2022-04-14 14:45:27,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-14 14:45:27,631 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 39 [2022-04-14 14:45:27,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 14:45:27,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 14:45:27,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 55 transitions. [2022-04-14 14:45:27,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 14:45:27,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 55 transitions. [2022-04-14 14:45:27,632 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 55 transitions. [2022-04-14 14:45:31,929 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 53 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-14 14:45:31,931 INFO L225 Difference]: With dead ends: 210 [2022-04-14 14:45:31,931 INFO L226 Difference]: Without dead ends: 208 [2022-04-14 14:45:31,932 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 70 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2022-04-14 14:45:31,932 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 6 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 1 mSolverCounterUnsat, 13 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 13 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 27.4s IncrementalHoareTripleChecker+Time [2022-04-14 14:45:31,932 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 62 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 73 Invalid, 13 Unknown, 0 Unchecked, 27.4s Time] [2022-04-14 14:45:31,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2022-04-14 14:45:32,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 207. [2022-04-14 14:45:32,019 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 14:45:32,019 INFO L82 GeneralOperation]: Start isEquivalent. First operand 208 states. Second operand has 207 states, 173 states have (on average 1.5317919075144508) internal successors, (265), 173 states have internal predecessors, (265), 17 states have call successors, (17), 17 states have call predecessors, (17), 16 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-14 14:45:32,019 INFO L74 IsIncluded]: Start isIncluded. First operand 208 states. Second operand has 207 states, 173 states have (on average 1.5317919075144508) internal successors, (265), 173 states have internal predecessors, (265), 17 states have call successors, (17), 17 states have call predecessors, (17), 16 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-14 14:45:32,020 INFO L87 Difference]: Start difference. First operand 208 states. Second operand has 207 states, 173 states have (on average 1.5317919075144508) internal successors, (265), 173 states have internal predecessors, (265), 17 states have call successors, (17), 17 states have call predecessors, (17), 16 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-14 14:45:32,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:45:32,022 INFO L93 Difference]: Finished difference Result 208 states and 300 transitions. [2022-04-14 14:45:32,022 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 300 transitions. [2022-04-14 14:45:32,022 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:45:32,022 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:45:32,022 INFO L74 IsIncluded]: Start isIncluded. First operand has 207 states, 173 states have (on average 1.5317919075144508) internal successors, (265), 173 states have internal predecessors, (265), 17 states have call successors, (17), 17 states have call predecessors, (17), 16 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 208 states. [2022-04-14 14:45:32,023 INFO L87 Difference]: Start difference. First operand has 207 states, 173 states have (on average 1.5317919075144508) internal successors, (265), 173 states have internal predecessors, (265), 17 states have call successors, (17), 17 states have call predecessors, (17), 16 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 208 states. [2022-04-14 14:45:32,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:45:32,025 INFO L93 Difference]: Finished difference Result 208 states and 300 transitions. [2022-04-14 14:45:32,025 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 300 transitions. [2022-04-14 14:45:32,025 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:45:32,025 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:45:32,025 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 14:45:32,025 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 14:45:32,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 173 states have (on average 1.5317919075144508) internal successors, (265), 173 states have internal predecessors, (265), 17 states have call successors, (17), 17 states have call predecessors, (17), 16 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-14 14:45:32,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 298 transitions. [2022-04-14 14:45:32,028 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 298 transitions. Word has length 39 [2022-04-14 14:45:32,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 14:45:32,028 INFO L478 AbstractCegarLoop]: Abstraction has 207 states and 298 transitions. [2022-04-14 14:45:32,028 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 14:45:32,028 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 298 transitions. [2022-04-14 14:45:32,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-14 14:45:32,029 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 14:45:32,029 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 14:45:32,046 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-04-14 14:45:32,244 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 14:45:32,244 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 14:45:32,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 14:45:32,244 INFO L85 PathProgramCache]: Analyzing trace with hash 1254429548, now seen corresponding path program 1 times [2022-04-14 14:45:32,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 14:45:32,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450818767] [2022-04-14 14:45:32,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 14:45:32,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 14:45:32,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:45:32,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 14:45:32,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:45:32,437 INFO L290 TraceCheckUtils]: 0: Hoare triple {13299#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {13300#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-14 14:45:32,438 INFO L290 TraceCheckUtils]: 1: Hoare triple {13300#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} assume true; {13300#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-14 14:45:32,438 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13300#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {13281#true} #91#return; {13286#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-14 14:45:32,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-04-14 14:45:32,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:45:32,445 INFO L290 TraceCheckUtils]: 0: Hoare triple {13281#true} ~cond := #in~cond; {13281#true} is VALID [2022-04-14 14:45:32,445 INFO L290 TraceCheckUtils]: 1: Hoare triple {13281#true} assume !(0 == ~cond); {13281#true} is VALID [2022-04-14 14:45:32,445 INFO L290 TraceCheckUtils]: 2: Hoare triple {13281#true} assume true; {13281#true} is VALID [2022-04-14 14:45:32,446 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13281#true} {13289#(and (or (<= (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296) 4274967296) (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296))) (<= 1 (+ (* 2 (div main_~l~0 4294967296)) main_~l~0))) (<= (+ (* 715827883 (div main_~l~0 4294967296)) (* 715827883 (div (+ main_~l~0 (* (- 6) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) 0))} #89#return; {13289#(and (or (<= (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296) 4274967296) (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296))) (<= 1 (+ (* 2 (div main_~l~0 4294967296)) main_~l~0))) (<= (+ (* 715827883 (div main_~l~0 4294967296)) (* 715827883 (div (+ main_~l~0 (* (- 6) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) 0))} is VALID [2022-04-14 14:45:32,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-04-14 14:45:32,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:45:32,448 INFO L290 TraceCheckUtils]: 0: Hoare triple {13281#true} ~cond := #in~cond; {13281#true} is VALID [2022-04-14 14:45:32,448 INFO L290 TraceCheckUtils]: 1: Hoare triple {13281#true} assume !(0 == ~cond); {13281#true} is VALID [2022-04-14 14:45:32,448 INFO L290 TraceCheckUtils]: 2: Hoare triple {13281#true} assume true; {13281#true} is VALID [2022-04-14 14:45:32,448 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13281#true} {13282#false} #89#return; {13282#false} is VALID [2022-04-14 14:45:32,450 INFO L272 TraceCheckUtils]: 0: Hoare triple {13281#true} call ULTIMATE.init(); {13299#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 14:45:32,451 INFO L290 TraceCheckUtils]: 1: Hoare triple {13299#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {13300#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-14 14:45:32,451 INFO L290 TraceCheckUtils]: 2: Hoare triple {13300#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} assume true; {13300#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-14 14:45:32,452 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13300#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {13281#true} #91#return; {13286#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-14 14:45:32,452 INFO L272 TraceCheckUtils]: 4: Hoare triple {13286#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} call #t~ret5 := main(); {13286#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-14 14:45:32,453 INFO L290 TraceCheckUtils]: 5: Hoare triple {13286#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v1~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;~v5~0 := 0;~v6~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {13287#(and (<= ~SIZE~0 20000001) (= main_~l~0 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-14 14:45:32,454 INFO L290 TraceCheckUtils]: 6: Hoare triple {13287#(and (<= ~SIZE~0 20000001) (= main_~l~0 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {13288#(and (= main_~l~0 0) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-14 14:45:32,454 INFO L290 TraceCheckUtils]: 7: Hoare triple {13288#(and (= main_~l~0 0) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {13288#(and (= main_~l~0 0) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-14 14:45:32,454 INFO L290 TraceCheckUtils]: 8: Hoare triple {13288#(and (= main_~l~0 0) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 9 then ~l~0 % 4294967296 % 9 - 9 else ~l~0 % 4294967296 % 9) % 4294967296;~v6~0 := 1 + ~v6~0; {13288#(and (= main_~l~0 0) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-14 14:45:32,455 INFO L290 TraceCheckUtils]: 9: Hoare triple {13288#(and (= main_~l~0 0) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))))} ~l~0 := 1 + ~l~0; {13289#(and (or (<= (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296) 4274967296) (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296))) (<= 1 (+ (* 2 (div main_~l~0 4294967296)) main_~l~0))) (<= (+ (* 715827883 (div main_~l~0 4294967296)) (* 715827883 (div (+ main_~l~0 (* (- 6) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) 0))} is VALID [2022-04-14 14:45:32,455 INFO L272 TraceCheckUtils]: 10: Hoare triple {13289#(and (or (<= (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296) 4274967296) (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296))) (<= 1 (+ (* 2 (div main_~l~0 4294967296)) main_~l~0))) (<= (+ (* 715827883 (div main_~l~0 4294967296)) (* 715827883 (div (+ main_~l~0 (* (- 6) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0 + ~v6~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {13281#true} is VALID [2022-04-14 14:45:32,455 INFO L290 TraceCheckUtils]: 11: Hoare triple {13281#true} ~cond := #in~cond; {13281#true} is VALID [2022-04-14 14:45:32,455 INFO L290 TraceCheckUtils]: 12: Hoare triple {13281#true} assume !(0 == ~cond); {13281#true} is VALID [2022-04-14 14:45:32,455 INFO L290 TraceCheckUtils]: 13: Hoare triple {13281#true} assume true; {13281#true} is VALID [2022-04-14 14:45:32,456 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {13281#true} {13289#(and (or (<= (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296) 4274967296) (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296))) (<= 1 (+ (* 2 (div main_~l~0 4294967296)) main_~l~0))) (<= (+ (* 715827883 (div main_~l~0 4294967296)) (* 715827883 (div (+ main_~l~0 (* (- 6) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) 0))} #89#return; {13289#(and (or (<= (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296) 4274967296) (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296))) (<= 1 (+ (* 2 (div main_~l~0 4294967296)) main_~l~0))) (<= (+ (* 715827883 (div main_~l~0 4294967296)) (* 715827883 (div (+ main_~l~0 (* (- 6) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) 0))} is VALID [2022-04-14 14:45:32,457 INFO L290 TraceCheckUtils]: 15: Hoare triple {13289#(and (or (<= (+ main_~n~0 (* (div main_~l~0 4294967296) 4294967296) 4274967296) (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296))) (<= 1 (+ (* 2 (div main_~l~0 4294967296)) main_~l~0))) (<= (+ (* 715827883 (div main_~l~0 4294967296)) (* 715827883 (div (+ main_~l~0 (* (- 6) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {13294#(and (<= (+ (* 715827883 (div main_~l~0 4294967296)) (* 715827883 (div (+ main_~l~0 (* (- 6) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) 0) (<= 1 (+ (* 2 (div main_~l~0 4294967296)) main_~l~0)))} is VALID [2022-04-14 14:45:32,458 INFO L290 TraceCheckUtils]: 16: Hoare triple {13294#(and (<= (+ (* 715827883 (div main_~l~0 4294967296)) (* 715827883 (div (+ main_~l~0 (* (- 6) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) 0) (<= 1 (+ (* 2 (div main_~l~0 4294967296)) main_~l~0)))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 9 then ~l~0 % 4294967296 % 9 - 9 else ~l~0 % 4294967296 % 9) % 4294967296); {13294#(and (<= (+ (* 715827883 (div main_~l~0 4294967296)) (* 715827883 (div (+ main_~l~0 (* (- 6) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) 0) (<= 1 (+ (* 2 (div main_~l~0 4294967296)) main_~l~0)))} is VALID [2022-04-14 14:45:32,458 INFO L290 TraceCheckUtils]: 17: Hoare triple {13294#(and (<= (+ (* 715827883 (div main_~l~0 4294967296)) (* 715827883 (div (+ main_~l~0 (* (- 6) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) 0) (<= 1 (+ (* 2 (div main_~l~0 4294967296)) main_~l~0)))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {13294#(and (<= (+ (* 715827883 (div main_~l~0 4294967296)) (* 715827883 (div (+ main_~l~0 (* (- 6) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) 0) (<= 1 (+ (* 2 (div main_~l~0 4294967296)) main_~l~0)))} is VALID [2022-04-14 14:45:32,459 INFO L290 TraceCheckUtils]: 18: Hoare triple {13294#(and (<= (+ (* 715827883 (div main_~l~0 4294967296)) (* 715827883 (div (+ main_~l~0 (* (- 6) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) 0) (<= 1 (+ (* 2 (div main_~l~0 4294967296)) main_~l~0)))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296); {13294#(and (<= (+ (* 715827883 (div main_~l~0 4294967296)) (* 715827883 (div (+ main_~l~0 (* (- 6) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) 0) (<= 1 (+ (* 2 (div main_~l~0 4294967296)) main_~l~0)))} is VALID [2022-04-14 14:45:32,460 INFO L290 TraceCheckUtils]: 19: Hoare triple {13294#(and (<= (+ (* 715827883 (div main_~l~0 4294967296)) (* 715827883 (div (+ main_~l~0 (* (- 6) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) (* (div main_~l~0 4294967296) (- 4294967296))) 4294967296)) (div (+ main_~l~0 (* (div main_~l~0 4294967296) (- 4294967296))) 6)) 0) (<= 1 (+ (* 2 (div main_~l~0 4294967296)) main_~l~0)))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296;~v2~0 := 1 + ~v2~0; {13282#false} is VALID [2022-04-14 14:45:32,460 INFO L290 TraceCheckUtils]: 20: Hoare triple {13282#false} ~l~0 := 1 + ~l~0; {13282#false} is VALID [2022-04-14 14:45:32,460 INFO L272 TraceCheckUtils]: 21: Hoare triple {13282#false} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0 + ~v6~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {13281#true} is VALID [2022-04-14 14:45:32,460 INFO L290 TraceCheckUtils]: 22: Hoare triple {13281#true} ~cond := #in~cond; {13281#true} is VALID [2022-04-14 14:45:32,461 INFO L290 TraceCheckUtils]: 23: Hoare triple {13281#true} assume !(0 == ~cond); {13281#true} is VALID [2022-04-14 14:45:32,461 INFO L290 TraceCheckUtils]: 24: Hoare triple {13281#true} assume true; {13281#true} is VALID [2022-04-14 14:45:32,461 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {13281#true} {13282#false} #89#return; {13282#false} is VALID [2022-04-14 14:45:32,461 INFO L290 TraceCheckUtils]: 26: Hoare triple {13282#false} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {13282#false} is VALID [2022-04-14 14:45:32,461 INFO L290 TraceCheckUtils]: 27: Hoare triple {13282#false} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 9 then ~l~0 % 4294967296 % 9 - 9 else ~l~0 % 4294967296 % 9) % 4294967296); {13282#false} is VALID [2022-04-14 14:45:32,461 INFO L290 TraceCheckUtils]: 28: Hoare triple {13282#false} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {13282#false} is VALID [2022-04-14 14:45:32,461 INFO L290 TraceCheckUtils]: 29: Hoare triple {13282#false} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296); {13282#false} is VALID [2022-04-14 14:45:32,461 INFO L290 TraceCheckUtils]: 30: Hoare triple {13282#false} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {13282#false} is VALID [2022-04-14 14:45:32,461 INFO L290 TraceCheckUtils]: 31: Hoare triple {13282#false} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {13282#false} is VALID [2022-04-14 14:45:32,461 INFO L290 TraceCheckUtils]: 32: Hoare triple {13282#false} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296); {13282#false} is VALID [2022-04-14 14:45:32,461 INFO L290 TraceCheckUtils]: 33: Hoare triple {13282#false} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 3 then ~l~0 % 4294967296 % 3 - 3 else ~l~0 % 4294967296 % 3) % 4294967296); {13282#false} is VALID [2022-04-14 14:45:32,461 INFO L290 TraceCheckUtils]: 34: Hoare triple {13282#false} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 2 then ~l~0 % 4294967296 % 2 - 2 else ~l~0 % 4294967296 % 2) % 4294967296;~j~0 := 1 + ~j~0; {13282#false} is VALID [2022-04-14 14:45:32,461 INFO L290 TraceCheckUtils]: 35: Hoare triple {13282#false} ~l~0 := 1 + ~l~0; {13282#false} is VALID [2022-04-14 14:45:32,461 INFO L272 TraceCheckUtils]: 36: Hoare triple {13282#false} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0 + ~v6~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {13282#false} is VALID [2022-04-14 14:45:32,461 INFO L290 TraceCheckUtils]: 37: Hoare triple {13282#false} ~cond := #in~cond; {13282#false} is VALID [2022-04-14 14:45:32,461 INFO L290 TraceCheckUtils]: 38: Hoare triple {13282#false} assume 0 == ~cond; {13282#false} is VALID [2022-04-14 14:45:32,461 INFO L290 TraceCheckUtils]: 39: Hoare triple {13282#false} assume !false; {13282#false} is VALID [2022-04-14 14:45:32,462 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-14 14:45:32,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 14:45:32,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450818767] [2022-04-14 14:45:32,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450818767] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-14 14:45:32,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [934747200] [2022-04-14 14:45:32,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 14:45:32,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 14:45:32,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 14:45:32,463 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 14:45:32,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-04-14 14:45:32,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:45:32,507 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-14 14:45:32,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:45:32,514 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 14:45:33,381 INFO L272 TraceCheckUtils]: 0: Hoare triple {13281#true} call ULTIMATE.init(); {13281#true} is VALID [2022-04-14 14:45:33,381 INFO L290 TraceCheckUtils]: 1: Hoare triple {13281#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {13281#true} is VALID [2022-04-14 14:45:33,381 INFO L290 TraceCheckUtils]: 2: Hoare triple {13281#true} assume true; {13281#true} is VALID [2022-04-14 14:45:33,382 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13281#true} {13281#true} #91#return; {13281#true} is VALID [2022-04-14 14:45:33,382 INFO L272 TraceCheckUtils]: 4: Hoare triple {13281#true} call #t~ret5 := main(); {13281#true} is VALID [2022-04-14 14:45:33,382 INFO L290 TraceCheckUtils]: 5: Hoare triple {13281#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v1~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;~v5~0 := 0;~v6~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {13319#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v6~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:45:33,382 INFO L290 TraceCheckUtils]: 6: Hoare triple {13319#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v6~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {13319#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v6~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:45:33,383 INFO L290 TraceCheckUtils]: 7: Hoare triple {13319#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v6~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {13319#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v6~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:45:33,383 INFO L290 TraceCheckUtils]: 8: Hoare triple {13319#(and (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v6~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 9 then ~l~0 % 4294967296 % 9 - 9 else ~l~0 % 4294967296 % 9) % 4294967296;~v6~0 := 1 + ~v6~0; {13329#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:45:33,384 INFO L290 TraceCheckUtils]: 9: Hoare triple {13329#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {13333#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:45:33,384 INFO L272 TraceCheckUtils]: 10: Hoare triple {13333#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0 + ~v6~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {13281#true} is VALID [2022-04-14 14:45:33,384 INFO L290 TraceCheckUtils]: 11: Hoare triple {13281#true} ~cond := #in~cond; {13281#true} is VALID [2022-04-14 14:45:33,384 INFO L290 TraceCheckUtils]: 12: Hoare triple {13281#true} assume !(0 == ~cond); {13281#true} is VALID [2022-04-14 14:45:33,384 INFO L290 TraceCheckUtils]: 13: Hoare triple {13281#true} assume true; {13281#true} is VALID [2022-04-14 14:45:33,385 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {13281#true} {13333#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} #89#return; {13333#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:45:33,385 INFO L290 TraceCheckUtils]: 15: Hoare triple {13333#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {13333#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:45:33,385 INFO L290 TraceCheckUtils]: 16: Hoare triple {13333#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 9 then ~l~0 % 4294967296 % 9 - 9 else ~l~0 % 4294967296 % 9) % 4294967296); {13333#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:45:33,386 INFO L290 TraceCheckUtils]: 17: Hoare triple {13333#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {13333#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:45:33,386 INFO L290 TraceCheckUtils]: 18: Hoare triple {13333#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296); {13333#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:45:33,387 INFO L290 TraceCheckUtils]: 19: Hoare triple {13333#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296;~v2~0 := 1 + ~v2~0; {13364#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:45:33,387 INFO L290 TraceCheckUtils]: 20: Hoare triple {13364#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~j~0 0) (= (+ (- 1) main_~l~0) 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {13368#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:45:33,387 INFO L272 TraceCheckUtils]: 21: Hoare triple {13368#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0 + ~v6~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {13281#true} is VALID [2022-04-14 14:45:33,387 INFO L290 TraceCheckUtils]: 22: Hoare triple {13281#true} ~cond := #in~cond; {13281#true} is VALID [2022-04-14 14:45:33,387 INFO L290 TraceCheckUtils]: 23: Hoare triple {13281#true} assume !(0 == ~cond); {13281#true} is VALID [2022-04-14 14:45:33,387 INFO L290 TraceCheckUtils]: 24: Hoare triple {13281#true} assume true; {13281#true} is VALID [2022-04-14 14:45:33,388 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {13281#true} {13368#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} #89#return; {13368#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:45:33,388 INFO L290 TraceCheckUtils]: 26: Hoare triple {13368#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {13368#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:45:33,389 INFO L290 TraceCheckUtils]: 27: Hoare triple {13368#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 9 then ~l~0 % 4294967296 % 9 - 9 else ~l~0 % 4294967296 % 9) % 4294967296); {13368#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:45:33,389 INFO L290 TraceCheckUtils]: 28: Hoare triple {13368#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {13368#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:45:33,390 INFO L290 TraceCheckUtils]: 29: Hoare triple {13368#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296); {13368#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:45:33,390 INFO L290 TraceCheckUtils]: 30: Hoare triple {13368#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {13368#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:45:33,391 INFO L290 TraceCheckUtils]: 31: Hoare triple {13368#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {13368#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:45:33,391 INFO L290 TraceCheckUtils]: 32: Hoare triple {13368#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296); {13368#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:45:33,391 INFO L290 TraceCheckUtils]: 33: Hoare triple {13368#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 3 then ~l~0 % 4294967296 % 3 - 3 else ~l~0 % 4294967296 % 3) % 4294967296); {13368#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:45:33,392 INFO L290 TraceCheckUtils]: 34: Hoare triple {13368#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~j~0 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 2 then ~l~0 % 4294967296 % 2 - 2 else ~l~0 % 4294967296 % 2) % 4294967296;~j~0 := 1 + ~j~0; {13411#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= (+ (- 1) main_~j~0) 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:45:33,392 INFO L290 TraceCheckUtils]: 35: Hoare triple {13411#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= (+ (- 1) main_~j~0) 0) (= main_~k~0 0) (= (+ (- 2) main_~l~0) 0) (= main_~v2~0 1) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} ~l~0 := 1 + ~l~0; {13415#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= (+ (- 1) main_~j~0) 0) (= main_~k~0 0) (= main_~v2~0 1) (= main_~l~0 3) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} is VALID [2022-04-14 14:45:33,393 INFO L272 TraceCheckUtils]: 36: Hoare triple {13415#(and (= (+ (- 1) main_~v6~0) 0) (= main_~v5~0 0) (= (+ (- 1) main_~j~0) 0) (= main_~k~0 0) (= main_~v2~0 1) (= main_~l~0 3) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v1~0 0) (= main_~v3~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0 + ~v6~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {13419#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 14:45:33,393 INFO L290 TraceCheckUtils]: 37: Hoare triple {13419#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {13423#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 14:45:33,394 INFO L290 TraceCheckUtils]: 38: Hoare triple {13423#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {13282#false} is VALID [2022-04-14 14:45:33,394 INFO L290 TraceCheckUtils]: 39: Hoare triple {13282#false} assume !false; {13282#false} is VALID [2022-04-14 14:45:33,394 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-14 14:45:33,394 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 14:45:33,761 INFO L290 TraceCheckUtils]: 39: Hoare triple {13282#false} assume !false; {13282#false} is VALID [2022-04-14 14:45:33,762 INFO L290 TraceCheckUtils]: 38: Hoare triple {13423#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {13282#false} is VALID [2022-04-14 14:45:33,762 INFO L290 TraceCheckUtils]: 37: Hoare triple {13419#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {13423#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 14:45:33,763 INFO L272 TraceCheckUtils]: 36: Hoare triple {13439#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0 + ~v6~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {13419#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 14:45:33,764 INFO L290 TraceCheckUtils]: 35: Hoare triple {13443#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} ~l~0 := 1 + ~l~0; {13439#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:45:33,797 INFO L290 TraceCheckUtils]: 34: Hoare triple {13439#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 2 then ~l~0 % 4294967296 % 2 - 2 else ~l~0 % 4294967296 % 2) % 4294967296;~j~0 := 1 + ~j~0; {13443#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:45:33,797 INFO L290 TraceCheckUtils]: 33: Hoare triple {13439#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 3 then ~l~0 % 4294967296 % 3 - 3 else ~l~0 % 4294967296 % 3) % 4294967296); {13439#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:45:33,797 INFO L290 TraceCheckUtils]: 32: Hoare triple {13439#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 4 then ~l~0 % 4294967296 % 4 - 4 else ~l~0 % 4294967296 % 4) % 4294967296); {13439#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:45:33,798 INFO L290 TraceCheckUtils]: 31: Hoare triple {13439#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 5 then ~l~0 % 4294967296 % 5 - 5 else ~l~0 % 4294967296 % 5) % 4294967296); {13439#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:45:33,798 INFO L290 TraceCheckUtils]: 30: Hoare triple {13439#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296); {13439#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:45:33,798 INFO L290 TraceCheckUtils]: 29: Hoare triple {13439#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296); {13439#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:45:33,799 INFO L290 TraceCheckUtils]: 28: Hoare triple {13439#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {13439#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:45:33,799 INFO L290 TraceCheckUtils]: 27: Hoare triple {13439#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 9 then ~l~0 % 4294967296 % 9 - 9 else ~l~0 % 4294967296 % 9) % 4294967296); {13439#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:45:33,799 INFO L290 TraceCheckUtils]: 26: Hoare triple {13439#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {13439#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:45:33,800 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {13281#true} {13439#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} #89#return; {13439#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:45:33,800 INFO L290 TraceCheckUtils]: 24: Hoare triple {13281#true} assume true; {13281#true} is VALID [2022-04-14 14:45:33,800 INFO L290 TraceCheckUtils]: 23: Hoare triple {13281#true} assume !(0 == ~cond); {13281#true} is VALID [2022-04-14 14:45:33,800 INFO L290 TraceCheckUtils]: 22: Hoare triple {13281#true} ~cond := #in~cond; {13281#true} is VALID [2022-04-14 14:45:33,800 INFO L272 TraceCheckUtils]: 21: Hoare triple {13439#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0 + ~v6~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {13281#true} is VALID [2022-04-14 14:45:33,801 INFO L290 TraceCheckUtils]: 20: Hoare triple {13443#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} ~l~0 := 1 + ~l~0; {13439#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:45:35,912 WARN L290 TraceCheckUtils]: 19: Hoare triple {13439#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 6 then ~l~0 % 4294967296 % 6 - 6 else ~l~0 % 4294967296 % 6) % 4294967296;~v2~0 := 1 + ~v2~0; {13443#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is UNKNOWN [2022-04-14 14:45:35,912 INFO L290 TraceCheckUtils]: 18: Hoare triple {13439#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 7 then ~l~0 % 4294967296 % 7 - 7 else ~l~0 % 4294967296 % 7) % 4294967296); {13439#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:45:35,913 INFO L290 TraceCheckUtils]: 17: Hoare triple {13439#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 8 then ~l~0 % 4294967296 % 8 - 8 else ~l~0 % 4294967296 % 8) % 4294967296); {13439#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:45:35,913 INFO L290 TraceCheckUtils]: 16: Hoare triple {13439#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !(0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 9 then ~l~0 % 4294967296 % 9 - 9 else ~l~0 % 4294967296 % 9) % 4294967296); {13439#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:45:35,913 INFO L290 TraceCheckUtils]: 15: Hoare triple {13439#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {13439#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:45:35,914 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {13281#true} {13439#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} #89#return; {13439#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:45:35,914 INFO L290 TraceCheckUtils]: 13: Hoare triple {13281#true} assume true; {13281#true} is VALID [2022-04-14 14:45:35,914 INFO L290 TraceCheckUtils]: 12: Hoare triple {13281#true} assume !(0 == ~cond); {13281#true} is VALID [2022-04-14 14:45:35,914 INFO L290 TraceCheckUtils]: 11: Hoare triple {13281#true} ~cond := #in~cond; {13281#true} is VALID [2022-04-14 14:45:35,914 INFO L272 TraceCheckUtils]: 10: Hoare triple {13439#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v1~0 + ~v2~0 + ~v3~0 + ~v4~0 + ~v5~0 + ~v6~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {13281#true} is VALID [2022-04-14 14:45:35,917 INFO L290 TraceCheckUtils]: 9: Hoare triple {13443#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} ~l~0 := 1 + ~l~0; {13439#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:45:38,027 WARN L290 TraceCheckUtils]: 8: Hoare triple {13439#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume 0 == (if ~l~0 % 4294967296 < 0 && 0 != ~l~0 % 4294967296 % 9 then ~l~0 % 4294967296 % 9 - 9 else ~l~0 % 4294967296 % 9) % 4294967296;~v6~0 := 1 + ~v6~0; {13443#(= (mod (+ main_~l~0 1) 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is UNKNOWN [2022-04-14 14:45:38,028 INFO L290 TraceCheckUtils]: 7: Hoare triple {13439#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !!(~l~0 % 4294967296 < ~n~0 % 4294967296); {13439#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:45:38,028 INFO L290 TraceCheckUtils]: 6: Hoare triple {13439#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {13439#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:45:38,030 INFO L290 TraceCheckUtils]: 5: Hoare triple {13281#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v1~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;~v5~0 := 0;~v6~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {13439#(= (mod main_~l~0 4294967296) (mod (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v1~0 main_~v6~0 main_~v5~0 main_~v4~0) 4294967296))} is VALID [2022-04-14 14:45:38,030 INFO L272 TraceCheckUtils]: 4: Hoare triple {13281#true} call #t~ret5 := main(); {13281#true} is VALID [2022-04-14 14:45:38,030 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13281#true} {13281#true} #91#return; {13281#true} is VALID [2022-04-14 14:45:38,030 INFO L290 TraceCheckUtils]: 2: Hoare triple {13281#true} assume true; {13281#true} is VALID [2022-04-14 14:45:38,030 INFO L290 TraceCheckUtils]: 1: Hoare triple {13281#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {13281#true} is VALID [2022-04-14 14:45:38,030 INFO L272 TraceCheckUtils]: 0: Hoare triple {13281#true} call ULTIMATE.init(); {13281#true} is VALID [2022-04-14 14:45:38,031 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-04-14 14:45:38,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [934747200] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-14 14:45:38,031 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-14 14:45:38,031 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9, 11] total 20 [2022-04-14 14:45:38,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223284118] [2022-04-14 14:45:38,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 14:45:38,031 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 40 [2022-04-14 14:45:38,031 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 14:45:38,032 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 14:45:42,280 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 26 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-14 14:45:42,280 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-14 14:45:42,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 14:45:42,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-14 14:45:42,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2022-04-14 14:45:42,281 INFO L87 Difference]: Start difference. First operand 207 states and 298 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)