/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/count_up_down-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 10:16:50,233 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 10:16:50,234 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 10:16:50,276 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 10:16:50,277 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 10:16:50,278 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 10:16:50,280 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 10:16:50,282 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 10:16:50,284 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 10:16:50,290 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 10:16:50,291 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 10:16:50,292 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 10:16:50,292 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 10:16:50,295 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 10:16:50,296 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 10:16:50,300 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 10:16:50,302 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 10:16:50,303 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 10:16:50,304 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 10:16:50,305 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 10:16:50,306 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 10:16:50,308 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 10:16:50,308 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 10:16:50,309 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 10:16:50,311 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 10:16:50,320 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 10:16:50,320 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 10:16:50,321 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 10:16:50,321 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 10:16:50,322 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 10:16:50,322 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 10:16:50,323 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 10:16:50,323 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 10:16:50,324 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 10:16:50,324 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 10:16:50,325 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 10:16:50,325 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 10:16:50,326 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 10:16:50,326 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 10:16:50,326 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 10:16:50,327 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 10:16:50,329 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 10:16:50,330 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-27 10:16:50,362 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 10:16:50,363 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 10:16:50,363 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 10:16:50,363 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 10:16:50,364 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 10:16:50,364 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 10:16:50,365 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 10:16:50,365 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 10:16:50,365 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 10:16:50,366 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 10:16:50,366 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 10:16:50,367 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 10:16:50,367 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 10:16:50,367 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 10:16:50,367 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 10:16:50,367 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 10:16:50,367 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 10:16:50,368 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 10:16:50,368 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 10:16:50,368 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 10:16:50,369 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 10:16:50,369 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 10:16:50,369 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 10:16:50,369 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 10:16:50,369 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 10:16:50,369 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 10:16:50,369 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 10:16:50,370 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 10:16:50,370 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 10:16:50,370 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 10:16:50,370 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 10:16:50,370 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 10:16:50,370 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 10:16:50,370 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-27 10:16:50,607 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 10:16:50,632 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 10:16:50,634 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 10:16:50,635 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 10:16:50,636 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 10:16:50,637 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/count_up_down-1.c [2022-04-27 10:16:50,684 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d43a40e5/c643b852fe2f4e35acd68f0c0bd9ec96/FLAG2dcf16934 [2022-04-27 10:16:51,032 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 10:16:51,033 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/count_up_down-1.c [2022-04-27 10:16:51,037 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d43a40e5/c643b852fe2f4e35acd68f0c0bd9ec96/FLAG2dcf16934 [2022-04-27 10:16:51,047 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d43a40e5/c643b852fe2f4e35acd68f0c0bd9ec96 [2022-04-27 10:16:51,049 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 10:16:51,050 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 10:16:51,055 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 10:16:51,055 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 10:16:51,058 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 10:16:51,059 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:16:51" (1/1) ... [2022-04-27 10:16:51,060 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@488b88a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:16:51, skipping insertion in model container [2022-04-27 10:16:51,060 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:16:51" (1/1) ... [2022-04-27 10:16:51,066 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 10:16:51,075 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 10:16:51,275 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/count_up_down-1.c[327,340] [2022-04-27 10:16:51,295 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 10:16:51,302 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 10:16:51,318 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/count_up_down-1.c[327,340] [2022-04-27 10:16:51,323 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 10:16:51,336 INFO L208 MainTranslator]: Completed translation [2022-04-27 10:16:51,337 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:16:51 WrapperNode [2022-04-27 10:16:51,337 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 10:16:51,338 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 10:16:51,338 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 10:16:51,339 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 10:16:51,346 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:16:51" (1/1) ... [2022-04-27 10:16:51,347 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:16:51" (1/1) ... [2022-04-27 10:16:51,352 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:16:51" (1/1) ... [2022-04-27 10:16:51,352 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:16:51" (1/1) ... [2022-04-27 10:16:51,356 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:16:51" (1/1) ... [2022-04-27 10:16:51,359 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:16:51" (1/1) ... [2022-04-27 10:16:51,360 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:16:51" (1/1) ... [2022-04-27 10:16:51,361 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 10:16:51,362 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 10:16:51,362 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 10:16:51,362 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 10:16:51,363 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:16:51" (1/1) ... [2022-04-27 10:16:51,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 10:16:51,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:16:51,388 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-27 10:16:51,413 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-27 10:16:51,426 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 10:16:51,427 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 10:16:51,427 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 10:16:51,428 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 10:16:51,430 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 10:16:51,430 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 10:16:51,430 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 10:16:51,430 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 10:16:51,430 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 10:16:51,430 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 10:16:51,430 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-27 10:16:51,430 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 10:16:51,431 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 10:16:51,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 10:16:51,431 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 10:16:51,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 10:16:51,431 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 10:16:51,431 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 10:16:51,483 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 10:16:51,484 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 10:16:51,568 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 10:16:51,574 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 10:16:51,575 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 10:16:51,576 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:16:51 BoogieIcfgContainer [2022-04-27 10:16:51,576 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 10:16:51,578 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 10:16:51,578 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 10:16:51,581 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 10:16:51,581 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 10:16:51" (1/3) ... [2022-04-27 10:16:51,582 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6900afac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:16:51, skipping insertion in model container [2022-04-27 10:16:51,582 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:16:51" (2/3) ... [2022-04-27 10:16:51,582 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6900afac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:16:51, skipping insertion in model container [2022-04-27 10:16:51,582 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:16:51" (3/3) ... [2022-04-27 10:16:51,583 INFO L111 eAbstractionObserver]: Analyzing ICFG count_up_down-1.c [2022-04-27 10:16:51,595 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 10:16:51,595 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 10:16:51,644 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 10:16:51,651 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@34f040f5, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@36c6aa1d [2022-04-27 10:16:51,651 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 10:16:51,671 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 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-27 10:16:51,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-27 10:16:51,682 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:16:51,682 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:16:51,683 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:16:51,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:16:51,693 INFO L85 PathProgramCache]: Analyzing trace with hash 1301225826, now seen corresponding path program 1 times [2022-04-27 10:16:51,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:16:51,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907977292] [2022-04-27 10:16:51,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:16:51,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:16:51,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:16:52,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:16:52,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:16:52,056 INFO L290 TraceCheckUtils]: 0: Hoare triple {30#(and (= |#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(18, 2);call #Ultimate.allocInit(12, 3); {21#true} is VALID [2022-04-27 10:16:52,057 INFO L290 TraceCheckUtils]: 1: Hoare triple {21#true} assume true; {21#true} is VALID [2022-04-27 10:16:52,057 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21#true} {21#true} #36#return; {21#true} is VALID [2022-04-27 10:16:52,058 INFO L272 TraceCheckUtils]: 0: Hoare triple {21#true} call ULTIMATE.init(); {30#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:16:52,059 INFO L290 TraceCheckUtils]: 1: Hoare triple {30#(and (= |#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(18, 2);call #Ultimate.allocInit(12, 3); {21#true} is VALID [2022-04-27 10:16:52,059 INFO L290 TraceCheckUtils]: 2: Hoare triple {21#true} assume true; {21#true} is VALID [2022-04-27 10:16:52,059 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21#true} {21#true} #36#return; {21#true} is VALID [2022-04-27 10:16:52,059 INFO L272 TraceCheckUtils]: 4: Hoare triple {21#true} call #t~ret7 := main(); {21#true} is VALID [2022-04-27 10:16:52,060 INFO L290 TraceCheckUtils]: 5: Hoare triple {21#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0; {26#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-27 10:16:52,062 INFO L290 TraceCheckUtils]: 6: Hoare triple {26#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} assume !(~x~0 % 4294967296 > 0); {27#(and (= main_~y~0 0) (<= (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-27 10:16:52,063 INFO L272 TraceCheckUtils]: 7: Hoare triple {27#(and (= main_~y~0 0) (<= (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296))))} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {28#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 10:16:52,063 INFO L290 TraceCheckUtils]: 8: Hoare triple {28#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {29#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 10:16:52,064 INFO L290 TraceCheckUtils]: 9: Hoare triple {29#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {22#false} is VALID [2022-04-27 10:16:52,064 INFO L290 TraceCheckUtils]: 10: Hoare triple {22#false} assume !false; {22#false} is VALID [2022-04-27 10:16:52,065 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-27 10:16:52,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:16:52,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907977292] [2022-04-27 10:16:52,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907977292] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:16:52,066 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:16:52,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-27 10:16:52,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153632814] [2022-04-27 10:16:52,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:16:52,073 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 5 states have internal predecessors, (7), 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 11 [2022-04-27 10:16:52,074 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:16:52,077 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 5 states have internal predecessors, (7), 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-27 10:16:52,095 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:16:52,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 10:16:52,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:16:52,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 10:16:52,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-27 10:16:52,129 INFO L87 Difference]: Start difference. First operand has 18 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 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 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 5 states have internal predecessors, (7), 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-27 10:16:52,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:16:52,467 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2022-04-27 10:16:52,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 10:16:52,468 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 5 states have internal predecessors, (7), 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 11 [2022-04-27 10:16:52,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:16:52,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 5 states have internal predecessors, (7), 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-27 10:16:52,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 44 transitions. [2022-04-27 10:16:52,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 5 states have internal predecessors, (7), 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-27 10:16:52,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 44 transitions. [2022-04-27 10:16:52,478 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 44 transitions. [2022-04-27 10:16:52,522 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:16:52,529 INFO L225 Difference]: With dead ends: 37 [2022-04-27 10:16:52,529 INFO L226 Difference]: Without dead ends: 13 [2022-04-27 10:16:52,531 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-04-27 10:16:52,536 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 23 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 10:16:52,538 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 40 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 10:16:52,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-04-27 10:16:52,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-04-27 10:16:52,578 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:16:52,578 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 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-27 10:16:52,579 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 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-27 10:16:52,579 INFO L87 Difference]: Start difference. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 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-27 10:16:52,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:16:52,581 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-27 10:16:52,581 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-27 10:16:52,582 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:16:52,582 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:16:52,582 INFO L74 IsIncluded]: Start isIncluded. First operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 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) Second operand 13 states. [2022-04-27 10:16:52,582 INFO L87 Difference]: Start difference. First operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 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) Second operand 13 states. [2022-04-27 10:16:52,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:16:52,586 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-27 10:16:52,586 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-27 10:16:52,586 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:16:52,587 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:16:52,587 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:16:52,587 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:16:52,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 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-27 10:16:52,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2022-04-27 10:16:52,592 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2022-04-27 10:16:52,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:16:52,593 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2022-04-27 10:16:52,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 5 states have internal predecessors, (7), 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-27 10:16:52,595 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-27 10:16:52,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 10:16:52,596 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:16:52,597 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:16:52,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 10:16:52,601 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:16:52,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:16:52,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1718713523, now seen corresponding path program 1 times [2022-04-27 10:16:52,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:16:52,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065656289] [2022-04-27 10:16:52,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:16:52,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:16:52,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:16:52,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:16:52,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:16:52,882 INFO L290 TraceCheckUtils]: 0: Hoare triple {149#(and (= |#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(18, 2);call #Ultimate.allocInit(12, 3); {139#true} is VALID [2022-04-27 10:16:52,882 INFO L290 TraceCheckUtils]: 1: Hoare triple {139#true} assume true; {139#true} is VALID [2022-04-27 10:16:52,883 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {139#true} {139#true} #36#return; {139#true} is VALID [2022-04-27 10:16:52,883 INFO L272 TraceCheckUtils]: 0: Hoare triple {139#true} call ULTIMATE.init(); {149#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:16:52,883 INFO L290 TraceCheckUtils]: 1: Hoare triple {149#(and (= |#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(18, 2);call #Ultimate.allocInit(12, 3); {139#true} is VALID [2022-04-27 10:16:52,884 INFO L290 TraceCheckUtils]: 2: Hoare triple {139#true} assume true; {139#true} is VALID [2022-04-27 10:16:52,884 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {139#true} {139#true} #36#return; {139#true} is VALID [2022-04-27 10:16:52,884 INFO L272 TraceCheckUtils]: 4: Hoare triple {139#true} call #t~ret7 := main(); {139#true} is VALID [2022-04-27 10:16:52,884 INFO L290 TraceCheckUtils]: 5: Hoare triple {139#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0; {144#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-27 10:16:52,886 INFO L290 TraceCheckUtils]: 6: Hoare triple {144#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {145#(and (<= (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~y~0 main_~x~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-27 10:16:52,891 INFO L290 TraceCheckUtils]: 7: Hoare triple {145#(and (<= (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~y~0 main_~x~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} assume !(~x~0 % 4294967296 > 0); {146#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-27 10:16:52,893 INFO L272 TraceCheckUtils]: 8: Hoare triple {146#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {147#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 10:16:52,893 INFO L290 TraceCheckUtils]: 9: Hoare triple {147#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {148#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 10:16:52,894 INFO L290 TraceCheckUtils]: 10: Hoare triple {148#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {140#false} is VALID [2022-04-27 10:16:52,894 INFO L290 TraceCheckUtils]: 11: Hoare triple {140#false} assume !false; {140#false} is VALID [2022-04-27 10:16:52,894 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:16:52,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:16:52,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065656289] [2022-04-27 10:16:52,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065656289] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:16:52,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [701516583] [2022-04-27 10:16:52,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:16:52,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:16:52,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:16:52,897 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-27 10:16:52,902 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-27 10:16:52,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:16:52,950 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-27 10:16:52,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:16:52,972 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:16:53,360 INFO L272 TraceCheckUtils]: 0: Hoare triple {139#true} call ULTIMATE.init(); {139#true} is VALID [2022-04-27 10:16:53,360 INFO L290 TraceCheckUtils]: 1: Hoare triple {139#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(18, 2);call #Ultimate.allocInit(12, 3); {139#true} is VALID [2022-04-27 10:16:53,361 INFO L290 TraceCheckUtils]: 2: Hoare triple {139#true} assume true; {139#true} is VALID [2022-04-27 10:16:53,361 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {139#true} {139#true} #36#return; {139#true} is VALID [2022-04-27 10:16:53,361 INFO L272 TraceCheckUtils]: 4: Hoare triple {139#true} call #t~ret7 := main(); {139#true} is VALID [2022-04-27 10:16:53,362 INFO L290 TraceCheckUtils]: 5: Hoare triple {139#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0; {144#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-27 10:16:53,363 INFO L290 TraceCheckUtils]: 6: Hoare triple {144#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {171#(and (= (+ main_~x~0 (* (- 1) main_~n~0) 1) 0) (= (+ (- 1) main_~y~0) 0) (< 0 (mod (+ main_~x~0 1) 4294967296)))} is VALID [2022-04-27 10:16:53,364 INFO L290 TraceCheckUtils]: 7: Hoare triple {171#(and (= (+ main_~x~0 (* (- 1) main_~n~0) 1) 0) (= (+ (- 1) main_~y~0) 0) (< 0 (mod (+ main_~x~0 1) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {175#(and (= main_~y~0 1) (<= (mod (+ main_~n~0 4294967295) 4294967296) 0))} is VALID [2022-04-27 10:16:53,365 INFO L272 TraceCheckUtils]: 8: Hoare triple {175#(and (= main_~y~0 1) (<= (mod (+ main_~n~0 4294967295) 4294967296) 0))} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {179#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:16:53,366 INFO L290 TraceCheckUtils]: 9: Hoare triple {179#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {183#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 10:16:53,366 INFO L290 TraceCheckUtils]: 10: Hoare triple {183#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {140#false} is VALID [2022-04-27 10:16:53,366 INFO L290 TraceCheckUtils]: 11: Hoare triple {140#false} assume !false; {140#false} is VALID [2022-04-27 10:16:53,367 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:16:53,367 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:16:53,759 INFO L290 TraceCheckUtils]: 11: Hoare triple {140#false} assume !false; {140#false} is VALID [2022-04-27 10:16:53,759 INFO L290 TraceCheckUtils]: 10: Hoare triple {183#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {140#false} is VALID [2022-04-27 10:16:53,760 INFO L290 TraceCheckUtils]: 9: Hoare triple {179#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {183#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 10:16:53,761 INFO L272 TraceCheckUtils]: 8: Hoare triple {146#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {179#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:16:53,762 INFO L290 TraceCheckUtils]: 7: Hoare triple {202#(or (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))))} assume !(~x~0 % 4294967296 > 0); {146#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-27 10:16:53,765 INFO L290 TraceCheckUtils]: 6: Hoare triple {206#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296)) (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {202#(or (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))))} is VALID [2022-04-27 10:16:53,766 INFO L290 TraceCheckUtils]: 5: Hoare triple {139#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0; {206#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296)) (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)))))} is VALID [2022-04-27 10:16:53,769 INFO L272 TraceCheckUtils]: 4: Hoare triple {139#true} call #t~ret7 := main(); {139#true} is VALID [2022-04-27 10:16:53,770 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {139#true} {139#true} #36#return; {139#true} is VALID [2022-04-27 10:16:53,770 INFO L290 TraceCheckUtils]: 2: Hoare triple {139#true} assume true; {139#true} is VALID [2022-04-27 10:16:53,770 INFO L290 TraceCheckUtils]: 1: Hoare triple {139#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(18, 2);call #Ultimate.allocInit(12, 3); {139#true} is VALID [2022-04-27 10:16:53,772 INFO L272 TraceCheckUtils]: 0: Hoare triple {139#true} call ULTIMATE.init(); {139#true} is VALID [2022-04-27 10:16:53,772 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:16:53,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [701516583] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:16:53,775 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:16:53,775 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2022-04-27 10:16:53,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312479046] [2022-04-27 10:16:53,776 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:16:53,778 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 states have internal predecessors, (16), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 10:16:53,778 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:16:53,779 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 states have internal predecessors, (16), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:16:53,802 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:16:53,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-27 10:16:53,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:16:53,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-27 10:16:53,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2022-04-27 10:16:53,805 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand has 14 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 states have internal predecessors, (16), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:16:54,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:16:54,301 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2022-04-27 10:16:54,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-27 10:16:54,302 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 states have internal predecessors, (16), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 10:16:54,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:16:54,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 states have internal predecessors, (16), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:16:54,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 24 transitions. [2022-04-27 10:16:54,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 states have internal predecessors, (16), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:16:54,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 24 transitions. [2022-04-27 10:16:54,305 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 24 transitions. [2022-04-27 10:16:54,344 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:16:54,345 INFO L225 Difference]: With dead ends: 22 [2022-04-27 10:16:54,345 INFO L226 Difference]: Without dead ends: 16 [2022-04-27 10:16:54,346 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 17 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=112, Invalid=394, Unknown=0, NotChecked=0, Total=506 [2022-04-27 10:16:54,347 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 15 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 10:16:54,347 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 51 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 10:16:54,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-04-27 10:16:54,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-04-27 10:16:54,360 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:16:54,360 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 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-27 10:16:54,361 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 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-27 10:16:54,361 INFO L87 Difference]: Start difference. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 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-27 10:16:54,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:16:54,362 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-04-27 10:16:54,362 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-27 10:16:54,363 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:16:54,363 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:16:54,363 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 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) Second operand 16 states. [2022-04-27 10:16:54,363 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 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) Second operand 16 states. [2022-04-27 10:16:54,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:16:54,364 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-04-27 10:16:54,365 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-27 10:16:54,365 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:16:54,365 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:16:54,365 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:16:54,365 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:16:54,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 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-27 10:16:54,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2022-04-27 10:16:54,366 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 12 [2022-04-27 10:16:54,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:16:54,367 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2022-04-27 10:16:54,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 states have internal predecessors, (16), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:16:54,367 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-27 10:16:54,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-27 10:16:54,368 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:16:54,368 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:16:54,395 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-27 10:16:54,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:16:54,569 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:16:54,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:16:54,569 INFO L85 PathProgramCache]: Analyzing trace with hash -1594626654, now seen corresponding path program 2 times [2022-04-27 10:16:54,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:16:54,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175721687] [2022-04-27 10:16:54,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:16:54,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:16:54,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:16:55,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:16:55,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:16:55,121 INFO L290 TraceCheckUtils]: 0: Hoare triple {353#(and (= |#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(18, 2);call #Ultimate.allocInit(12, 3); {340#true} is VALID [2022-04-27 10:16:55,122 INFO L290 TraceCheckUtils]: 1: Hoare triple {340#true} assume true; {340#true} is VALID [2022-04-27 10:16:55,122 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {340#true} {340#true} #36#return; {340#true} is VALID [2022-04-27 10:16:55,123 INFO L272 TraceCheckUtils]: 0: Hoare triple {340#true} call ULTIMATE.init(); {353#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:16:55,123 INFO L290 TraceCheckUtils]: 1: Hoare triple {353#(and (= |#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(18, 2);call #Ultimate.allocInit(12, 3); {340#true} is VALID [2022-04-27 10:16:55,123 INFO L290 TraceCheckUtils]: 2: Hoare triple {340#true} assume true; {340#true} is VALID [2022-04-27 10:16:55,123 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {340#true} {340#true} #36#return; {340#true} is VALID [2022-04-27 10:16:55,123 INFO L272 TraceCheckUtils]: 4: Hoare triple {340#true} call #t~ret7 := main(); {340#true} is VALID [2022-04-27 10:16:55,124 INFO L290 TraceCheckUtils]: 5: Hoare triple {340#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0; {345#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-27 10:16:55,126 INFO L290 TraceCheckUtils]: 6: Hoare triple {345#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {346#(and (<= main_~x~0 (+ 4294967294 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 10:16:55,142 INFO L290 TraceCheckUtils]: 7: Hoare triple {346#(and (<= main_~x~0 (+ 4294967294 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {347#(and (<= 2 main_~y~0) (<= main_~y~0 2) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967293)) (<= (+ main_~y~0 main_~x~0) main_~n~0))} is VALID [2022-04-27 10:16:55,145 INFO L290 TraceCheckUtils]: 8: Hoare triple {347#(and (<= 2 main_~y~0) (<= main_~y~0 2) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967293)) (<= (+ main_~y~0 main_~x~0) main_~n~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {348#(and (<= main_~y~0 3) (<= (+ main_~x~0 3) main_~n~0) (<= main_~x~0 (+ 4294967292 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} is VALID [2022-04-27 10:16:55,158 INFO L290 TraceCheckUtils]: 9: Hoare triple {348#(and (<= main_~y~0 3) (<= (+ main_~x~0 3) main_~n~0) (<= main_~x~0 (+ 4294967292 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {349#(and (<= (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~y~0 main_~x~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-27 10:16:55,159 INFO L290 TraceCheckUtils]: 10: Hoare triple {349#(and (<= (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~y~0 main_~x~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} assume !(~x~0 % 4294967296 > 0); {350#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-27 10:16:55,160 INFO L272 TraceCheckUtils]: 11: Hoare triple {350#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {351#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 10:16:55,161 INFO L290 TraceCheckUtils]: 12: Hoare triple {351#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {352#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 10:16:55,161 INFO L290 TraceCheckUtils]: 13: Hoare triple {352#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {341#false} is VALID [2022-04-27 10:16:55,161 INFO L290 TraceCheckUtils]: 14: Hoare triple {341#false} assume !false; {341#false} is VALID [2022-04-27 10:16:55,161 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:16:55,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:16:55,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175721687] [2022-04-27 10:16:55,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175721687] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:16:55,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1961295727] [2022-04-27 10:16:55,162 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 10:16:55,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:16:55,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:16:55,168 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-27 10:16:55,193 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-27 10:16:55,248 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 10:16:55,248 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 10:16:55,249 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-27 10:16:55,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:16:55,266 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:17:56,040 INFO L272 TraceCheckUtils]: 0: Hoare triple {340#true} call ULTIMATE.init(); {340#true} is VALID [2022-04-27 10:17:56,040 INFO L290 TraceCheckUtils]: 1: Hoare triple {340#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(18, 2);call #Ultimate.allocInit(12, 3); {340#true} is VALID [2022-04-27 10:17:56,040 INFO L290 TraceCheckUtils]: 2: Hoare triple {340#true} assume true; {340#true} is VALID [2022-04-27 10:17:56,040 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {340#true} {340#true} #36#return; {340#true} is VALID [2022-04-27 10:17:56,040 INFO L272 TraceCheckUtils]: 4: Hoare triple {340#true} call #t~ret7 := main(); {340#true} is VALID [2022-04-27 10:17:56,041 INFO L290 TraceCheckUtils]: 5: Hoare triple {340#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0; {345#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-27 10:17:56,042 INFO L290 TraceCheckUtils]: 6: Hoare triple {345#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {346#(and (<= main_~x~0 (+ 4294967294 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 10:17:56,061 INFO L290 TraceCheckUtils]: 7: Hoare triple {346#(and (<= main_~x~0 (+ 4294967294 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {347#(and (<= 2 main_~y~0) (<= main_~y~0 2) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967293)) (<= (+ main_~y~0 main_~x~0) main_~n~0))} is VALID [2022-04-27 10:17:56,063 INFO L290 TraceCheckUtils]: 8: Hoare triple {347#(and (<= 2 main_~y~0) (<= main_~y~0 2) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967293)) (<= (+ main_~y~0 main_~x~0) main_~n~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {348#(and (<= main_~y~0 3) (<= (+ main_~x~0 3) main_~n~0) (<= main_~x~0 (+ 4294967292 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} is VALID [2022-04-27 10:17:56,065 INFO L290 TraceCheckUtils]: 9: Hoare triple {348#(and (<= main_~y~0 3) (<= (+ main_~x~0 3) main_~n~0) (<= main_~x~0 (+ 4294967292 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {384#(and (< 0 (mod (+ main_~x~0 1) 4294967296)) (<= main_~y~0 4) (<= (+ main_~x~0 4) main_~n~0) (<= main_~x~0 (+ 4294967291 (* (div (+ main_~y~0 main_~x~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} is VALID [2022-04-27 10:17:56,076 INFO L290 TraceCheckUtils]: 10: Hoare triple {384#(and (< 0 (mod (+ main_~x~0 1) 4294967296)) (<= main_~y~0 4) (<= (+ main_~x~0 4) main_~n~0) (<= main_~x~0 (+ 4294967291 (* (div (+ main_~y~0 main_~x~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} assume !(~x~0 % 4294967296 > 0); {388#(and (<= main_~y~0 4) (<= (div (+ (* main_~y~0 (- 4294967295)) (* (- 1) main_~n~0)) (- 4294967296)) (+ (div (+ main_~n~0 (- 3)) 4294967296) main_~y~0)) (< 0 (+ (div (+ (div (+ main_~n~0 (- 4)) 4294967296) (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296)) 2) (div (+ main_~y~0 (- 4)) 4294967296) (div (+ main_~y~0 4294967294 (* (- 1) main_~n~0)) 4294967296) 1)))} is VALID [2022-04-27 10:17:56,140 INFO L272 TraceCheckUtils]: 11: Hoare triple {388#(and (<= main_~y~0 4) (<= (div (+ (* main_~y~0 (- 4294967295)) (* (- 1) main_~n~0)) (- 4294967296)) (+ (div (+ main_~n~0 (- 3)) 4294967296) main_~y~0)) (< 0 (+ (div (+ (div (+ main_~n~0 (- 4)) 4294967296) (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296)) 2) (div (+ main_~y~0 (- 4)) 4294967296) (div (+ main_~y~0 4294967294 (* (- 1) main_~n~0)) 4294967296) 1)))} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {392#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:17:56,141 INFO L290 TraceCheckUtils]: 12: Hoare triple {392#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {396#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 10:17:56,141 INFO L290 TraceCheckUtils]: 13: Hoare triple {396#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {341#false} is VALID [2022-04-27 10:17:56,141 INFO L290 TraceCheckUtils]: 14: Hoare triple {341#false} assume !false; {341#false} is VALID [2022-04-27 10:17:56,142 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:17:56,142 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:17:57,139 INFO L290 TraceCheckUtils]: 14: Hoare triple {341#false} assume !false; {341#false} is VALID [2022-04-27 10:17:57,139 INFO L290 TraceCheckUtils]: 13: Hoare triple {396#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {341#false} is VALID [2022-04-27 10:17:57,140 INFO L290 TraceCheckUtils]: 12: Hoare triple {392#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {396#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 10:17:57,141 INFO L272 TraceCheckUtils]: 11: Hoare triple {350#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {392#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:17:57,142 INFO L290 TraceCheckUtils]: 10: Hoare triple {415#(or (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))))} assume !(~x~0 % 4294967296 > 0); {350#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-27 10:17:57,144 INFO L290 TraceCheckUtils]: 9: Hoare triple {419#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296)) (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {415#(or (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))))} is VALID [2022-04-27 10:17:57,145 INFO L290 TraceCheckUtils]: 8: Hoare triple {423#(or (and (< (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~y~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0))) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {419#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296)) (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)))))} is VALID [2022-04-27 10:17:57,148 INFO L290 TraceCheckUtils]: 7: Hoare triple {427#(or (and (<= (+ main_~y~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~y~0 3) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 3) 4294967296) 4294967296)) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 4))) (< 0 (mod (+ main_~x~0 4294967293) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {423#(or (and (< (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~y~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0))) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} is VALID [2022-04-27 10:17:57,149 INFO L290 TraceCheckUtils]: 6: Hoare triple {431#(or (and (< (+ main_~n~0 (* 4294967296 (div (+ main_~y~0 4) 4294967296))) (+ 5 main_~y~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ main_~n~0 (* 4294967296 (div (+ main_~y~0 4) 4294967296))))) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {427#(or (and (<= (+ main_~y~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~y~0 3) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 3) 4294967296) 4294967296)) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 4))) (< 0 (mod (+ main_~x~0 4294967293) 4294967296)))} is VALID [2022-04-27 10:17:57,150 INFO L290 TraceCheckUtils]: 5: Hoare triple {340#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0; {431#(or (and (< (+ main_~n~0 (* 4294967296 (div (+ main_~y~0 4) 4294967296))) (+ 5 main_~y~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ main_~n~0 (* 4294967296 (div (+ main_~y~0 4) 4294967296))))) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} is VALID [2022-04-27 10:17:57,151 INFO L272 TraceCheckUtils]: 4: Hoare triple {340#true} call #t~ret7 := main(); {340#true} is VALID [2022-04-27 10:17:57,151 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {340#true} {340#true} #36#return; {340#true} is VALID [2022-04-27 10:17:57,151 INFO L290 TraceCheckUtils]: 2: Hoare triple {340#true} assume true; {340#true} is VALID [2022-04-27 10:17:57,151 INFO L290 TraceCheckUtils]: 1: Hoare triple {340#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(18, 2);call #Ultimate.allocInit(12, 3); {340#true} is VALID [2022-04-27 10:17:57,151 INFO L272 TraceCheckUtils]: 0: Hoare triple {340#true} call ULTIMATE.init(); {340#true} is VALID [2022-04-27 10:17:57,151 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:17:57,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1961295727] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:17:57,152 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:17:57,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 20 [2022-04-27 10:17:57,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967514376] [2022-04-27 10:17:57,152 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:17:57,153 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 17 states have internal predecessors, (22), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-27 10:17:57,153 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:17:57,153 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 17 states have internal predecessors, (22), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:17:57,284 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:17:57,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-27 10:17:57,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:17:57,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-27 10:17:57,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2022-04-27 10:17:57,286 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand has 20 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 17 states have internal predecessors, (22), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:18:05,747 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 10:18:18,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:18:18,836 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2022-04-27 10:18:18,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-27 10:18:18,836 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 17 states have internal predecessors, (22), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-27 10:18:18,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:18:18,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 17 states have internal predecessors, (22), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:18:18,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2022-04-27 10:18:18,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 17 states have internal predecessors, (22), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:18:18,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 33 transitions. [2022-04-27 10:18:18,839 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 33 transitions. [2022-04-27 10:18:21,266 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 32 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-27 10:18:21,267 INFO L225 Difference]: With dead ends: 28 [2022-04-27 10:18:21,267 INFO L226 Difference]: Without dead ends: 22 [2022-04-27 10:18:21,268 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 17 SyntacticMatches, 6 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 16.0s TimeCoverageRelationStatistics Valid=252, Invalid=937, Unknown=1, NotChecked=0, Total=1190 [2022-04-27 10:18:21,269 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 31 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2022-04-27 10:18:21,270 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 57 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2022-04-27 10:18:21,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-27 10:18:21,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-04-27 10:18:21,316 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:18:21,316 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 22 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 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-27 10:18:21,317 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 22 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 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-27 10:18:21,317 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 22 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 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-27 10:18:21,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:18:21,318 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-04-27 10:18:21,318 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2022-04-27 10:18:21,319 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:18:21,319 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:18:21,319 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 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) Second operand 22 states. [2022-04-27 10:18:21,319 INFO L87 Difference]: Start difference. First operand has 22 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 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) Second operand 22 states. [2022-04-27 10:18:21,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:18:21,321 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-04-27 10:18:21,321 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2022-04-27 10:18:21,321 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:18:21,321 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:18:21,321 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:18:21,321 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:18:21,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 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-27 10:18:21,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2022-04-27 10:18:21,323 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 15 [2022-04-27 10:18:21,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:18:21,323 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2022-04-27 10:18:21,323 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 17 states have internal predecessors, (22), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:18:21,323 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2022-04-27 10:18:21,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-27 10:18:21,324 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:18:21,324 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:18:21,344 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-27 10:18:21,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-27 10:18:21,540 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:18:21,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:18:21,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1617421314, now seen corresponding path program 3 times [2022-04-27 10:18:21,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:18:21,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963924004] [2022-04-27 10:18:21,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:18:21,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:18:21,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:18:22,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:18:22,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:18:22,724 INFO L290 TraceCheckUtils]: 0: Hoare triple {632#(and (= |#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(18, 2);call #Ultimate.allocInit(12, 3); {613#true} is VALID [2022-04-27 10:18:22,725 INFO L290 TraceCheckUtils]: 1: Hoare triple {613#true} assume true; {613#true} is VALID [2022-04-27 10:18:22,725 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {613#true} {613#true} #36#return; {613#true} is VALID [2022-04-27 10:18:22,726 INFO L272 TraceCheckUtils]: 0: Hoare triple {613#true} call ULTIMATE.init(); {632#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:18:22,726 INFO L290 TraceCheckUtils]: 1: Hoare triple {632#(and (= |#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(18, 2);call #Ultimate.allocInit(12, 3); {613#true} is VALID [2022-04-27 10:18:22,726 INFO L290 TraceCheckUtils]: 2: Hoare triple {613#true} assume true; {613#true} is VALID [2022-04-27 10:18:22,726 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {613#true} {613#true} #36#return; {613#true} is VALID [2022-04-27 10:18:22,726 INFO L272 TraceCheckUtils]: 4: Hoare triple {613#true} call #t~ret7 := main(); {613#true} is VALID [2022-04-27 10:18:22,727 INFO L290 TraceCheckUtils]: 5: Hoare triple {613#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0; {618#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-27 10:18:22,729 INFO L290 TraceCheckUtils]: 6: Hoare triple {618#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {619#(and (<= main_~x~0 (+ 4294967294 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 10:18:22,783 INFO L290 TraceCheckUtils]: 7: Hoare triple {619#(and (<= main_~x~0 (+ 4294967294 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {620#(and (<= 2 main_~y~0) (<= main_~y~0 2) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967293)) (<= (+ main_~y~0 main_~x~0) main_~n~0))} is VALID [2022-04-27 10:18:22,846 INFO L290 TraceCheckUtils]: 8: Hoare triple {620#(and (<= 2 main_~y~0) (<= main_~y~0 2) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967293)) (<= (+ main_~y~0 main_~x~0) main_~n~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {621#(and (<= main_~y~0 3) (<= (+ main_~x~0 3) main_~n~0) (<= main_~x~0 (+ 4294967292 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} is VALID [2022-04-27 10:18:23,049 INFO L290 TraceCheckUtils]: 9: Hoare triple {621#(and (<= main_~y~0 3) (<= (+ main_~x~0 3) main_~n~0) (<= main_~x~0 (+ 4294967292 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {622#(and (<= main_~x~0 (+ 4294967291 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= main_~y~0 4) (<= 4 main_~y~0) (<= (+ main_~y~0 main_~x~0) main_~n~0))} is VALID [2022-04-27 10:18:23,065 INFO L290 TraceCheckUtils]: 10: Hoare triple {622#(and (<= main_~x~0 (+ 4294967291 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= main_~y~0 4) (<= 4 main_~y~0) (<= (+ main_~y~0 main_~x~0) main_~n~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {623#(and (<= (+ 5 main_~x~0) main_~n~0) (<= main_~y~0 5) (<= main_~x~0 (+ 4294967290 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} is VALID [2022-04-27 10:18:23,074 INFO L290 TraceCheckUtils]: 11: Hoare triple {623#(and (<= (+ 5 main_~x~0) main_~n~0) (<= main_~y~0 5) (<= main_~x~0 (+ 4294967290 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {624#(and (<= main_~y~0 6) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967289)) (<= (+ main_~x~0 6) main_~n~0))} is VALID [2022-04-27 10:18:23,084 INFO L290 TraceCheckUtils]: 12: Hoare triple {624#(and (<= main_~y~0 6) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967289)) (<= (+ main_~x~0 6) main_~n~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {625#(and (<= 7 main_~y~0) (<= main_~y~0 7) (<= main_~x~0 (+ 4294967288 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~y~0 main_~x~0) main_~n~0))} is VALID [2022-04-27 10:18:23,088 INFO L290 TraceCheckUtils]: 13: Hoare triple {625#(and (<= 7 main_~y~0) (<= main_~y~0 7) (<= main_~x~0 (+ 4294967288 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~y~0 main_~x~0) main_~n~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {626#(and (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967287)) (<= main_~y~0 8) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= 8 main_~y~0))} is VALID [2022-04-27 10:18:23,104 INFO L290 TraceCheckUtils]: 14: Hoare triple {626#(and (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967287)) (<= main_~y~0 8) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {627#(and (<= main_~x~0 (+ 4294967286 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-27 10:18:23,114 INFO L290 TraceCheckUtils]: 15: Hoare triple {627#(and (<= main_~x~0 (+ 4294967286 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {628#(and (<= (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~y~0 main_~x~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-27 10:18:23,115 INFO L290 TraceCheckUtils]: 16: Hoare triple {628#(and (<= (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~y~0 main_~x~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} assume !(~x~0 % 4294967296 > 0); {629#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-27 10:18:23,116 INFO L272 TraceCheckUtils]: 17: Hoare triple {629#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {630#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 10:18:23,116 INFO L290 TraceCheckUtils]: 18: Hoare triple {630#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {631#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 10:18:23,117 INFO L290 TraceCheckUtils]: 19: Hoare triple {631#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {614#false} is VALID [2022-04-27 10:18:23,117 INFO L290 TraceCheckUtils]: 20: Hoare triple {614#false} assume !false; {614#false} is VALID [2022-04-27 10:18:23,117 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:18:23,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:18:23,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963924004] [2022-04-27 10:18:23,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963924004] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:18:23,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1418821875] [2022-04-27 10:18:23,118 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 10:18:23,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:18:23,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:18:23,120 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-27 10:18:23,122 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-27 10:18:23,264 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-04-27 10:18:23,265 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 10:18:23,266 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 50 conjunts are in the unsatisfiable core [2022-04-27 10:18:23,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:18:23,279 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:18:55,507 INFO L272 TraceCheckUtils]: 0: Hoare triple {613#true} call ULTIMATE.init(); {613#true} is VALID [2022-04-27 10:18:55,507 INFO L290 TraceCheckUtils]: 1: Hoare triple {613#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(18, 2);call #Ultimate.allocInit(12, 3); {613#true} is VALID [2022-04-27 10:18:55,507 INFO L290 TraceCheckUtils]: 2: Hoare triple {613#true} assume true; {613#true} is VALID [2022-04-27 10:18:55,507 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {613#true} {613#true} #36#return; {613#true} is VALID [2022-04-27 10:18:55,507 INFO L272 TraceCheckUtils]: 4: Hoare triple {613#true} call #t~ret7 := main(); {613#true} is VALID [2022-04-27 10:18:55,508 INFO L290 TraceCheckUtils]: 5: Hoare triple {613#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0; {618#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-27 10:18:55,510 INFO L290 TraceCheckUtils]: 6: Hoare triple {618#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {619#(and (<= main_~x~0 (+ 4294967294 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 10:18:55,519 INFO L290 TraceCheckUtils]: 7: Hoare triple {619#(and (<= main_~x~0 (+ 4294967294 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {657#(and (<= 2 main_~y~0) (<= main_~y~0 2) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967293)))} is VALID [2022-04-27 10:18:55,521 INFO L290 TraceCheckUtils]: 8: Hoare triple {657#(and (<= 2 main_~y~0) (<= main_~y~0 2) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967293)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {661#(and (<= main_~y~0 3) (<= 3 main_~y~0) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= main_~x~0 (+ 4294967292 (* (div (+ main_~y~0 main_~x~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} is VALID [2022-04-27 10:18:55,523 INFO L290 TraceCheckUtils]: 9: Hoare triple {661#(and (<= main_~y~0 3) (<= 3 main_~y~0) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= main_~x~0 (+ 4294967292 (* (div (+ main_~y~0 main_~x~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {665#(and (<= main_~x~0 (+ 4294967291 (* (div (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~y~0 main_~x~0 (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= main_~y~0 4) (<= 4 main_~y~0) (<= (+ main_~y~0 main_~x~0) main_~n~0))} is VALID [2022-04-27 10:18:55,526 INFO L290 TraceCheckUtils]: 10: Hoare triple {665#(and (<= main_~x~0 (+ 4294967291 (* (div (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~y~0 main_~x~0 (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= main_~y~0 4) (<= 4 main_~y~0) (<= (+ main_~y~0 main_~x~0) main_~n~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {669#(and (<= 5 main_~y~0) (< 0 (mod (+ main_~x~0 1) 4294967296)) (<= main_~x~0 (+ 4294967290 (* (div (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~y~0 main_~x~0 (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= main_~y~0 5))} is VALID [2022-04-27 10:18:55,528 INFO L290 TraceCheckUtils]: 11: Hoare triple {669#(and (<= 5 main_~y~0) (< 0 (mod (+ main_~x~0 1) 4294967296)) (<= main_~x~0 (+ 4294967290 (* (div (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~y~0 main_~x~0 (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {673#(and (<= main_~y~0 6) (<= main_~x~0 (+ 4294967289 (* (div (+ main_~y~0 main_~x~0 (* (div (+ 5 main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= 6 main_~y~0) (<= (+ main_~y~0 main_~x~0) main_~n~0) (< 0 (mod (+ main_~x~0 2) 4294967296)))} is VALID [2022-04-27 10:18:55,530 INFO L290 TraceCheckUtils]: 12: Hoare triple {673#(and (<= main_~y~0 6) (<= main_~x~0 (+ 4294967289 (* (div (+ main_~y~0 main_~x~0 (* (div (+ 5 main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= 6 main_~y~0) (<= (+ main_~y~0 main_~x~0) main_~n~0) (< 0 (mod (+ main_~x~0 2) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {677#(and (< 0 (mod (+ main_~x~0 3) 4294967296)) (<= 7 main_~y~0) (<= main_~y~0 7) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= main_~x~0 (+ 4294967288 (* 4294967296 (div (+ main_~y~0 main_~x~0 (* 4294967296 (div (+ main_~x~0 6) 4294967296)) (* (- 1) main_~n~0)) 4294967296)))))} is VALID [2022-04-27 10:18:55,536 INFO L290 TraceCheckUtils]: 13: Hoare triple {677#(and (< 0 (mod (+ main_~x~0 3) 4294967296)) (<= 7 main_~y~0) (<= main_~y~0 7) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= main_~x~0 (+ 4294967288 (* 4294967296 (div (+ main_~y~0 main_~x~0 (* 4294967296 (div (+ main_~x~0 6) 4294967296)) (* (- 1) main_~n~0)) 4294967296)))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {681#(and (< 0 (mod (+ main_~x~0 4) 4294967296)) (<= main_~y~0 8) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= 8 main_~y~0) (<= main_~x~0 (+ 4294967287 (* (div (+ (* (div (+ 7 main_~x~0) 4294967296) 4294967296) main_~y~0 main_~x~0 (* (- 1) main_~n~0)) 4294967296) 4294967296))))} is VALID [2022-04-27 10:18:55,539 INFO L290 TraceCheckUtils]: 14: Hoare triple {681#(and (< 0 (mod (+ main_~x~0 4) 4294967296)) (<= main_~y~0 8) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= 8 main_~y~0) (<= main_~x~0 (+ 4294967287 (* (div (+ (* (div (+ 7 main_~x~0) 4294967296) 4294967296) main_~y~0 main_~x~0 (* (- 1) main_~n~0)) 4294967296) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {685#(and (< 0 (mod (+ 5 main_~x~0) 4294967296)) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= 9 main_~y~0) (<= main_~y~0 9) (<= main_~x~0 (+ (* (div (+ (* (div (+ main_~x~0 8) 4294967296) 4294967296) main_~y~0 main_~x~0 (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967286)))} is VALID [2022-04-27 10:18:55,553 INFO L290 TraceCheckUtils]: 15: Hoare triple {685#(and (< 0 (mod (+ 5 main_~x~0) 4294967296)) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= 9 main_~y~0) (<= main_~y~0 9) (<= main_~x~0 (+ (* (div (+ (* (div (+ main_~x~0 8) 4294967296) 4294967296) main_~y~0 main_~x~0 (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967286)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {689#(and (<= main_~y~0 10) (<= 10 main_~y~0) (<= main_~x~0 (+ (* 4294967296 (div (+ main_~y~0 main_~x~0 (* 4294967296 (div (+ main_~x~0 9) 4294967296)) (* (- 1) main_~n~0)) 4294967296)) 4294967285)) (< 0 (mod (+ main_~x~0 6) 4294967296)) (<= (+ main_~y~0 main_~x~0) main_~n~0))} is VALID [2022-04-27 10:18:55,864 INFO L290 TraceCheckUtils]: 16: Hoare triple {689#(and (<= main_~y~0 10) (<= 10 main_~y~0) (<= main_~x~0 (+ (* 4294967296 (div (+ main_~y~0 main_~x~0 (* 4294967296 (div (+ main_~x~0 9) 4294967296)) (* (- 1) main_~n~0)) 4294967296)) 4294967285)) (< 0 (mod (+ main_~x~0 6) 4294967296)) (<= (+ main_~y~0 main_~x~0) main_~n~0))} assume !(~x~0 % 4294967296 > 0); {693#(and (<= main_~y~0 10) (<= 10 main_~y~0) (< (div (+ main_~y~0 4294967289 (* (- 1) main_~n~0)) (- 4294967296)) (+ (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 1)) (exists ((aux_div_aux_mod_aux_mod_aux_mod_main_~x~0_26_43_137_159 Int) (aux_div_aux_mod_aux_mod_main_~x~0_26_43_137 Int)) (and (< (+ (div (+ main_~y~0 4294967289 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~y~0 (* (- 1) main_~n~0)) (- 4294967296)) aux_div_aux_mod_aux_mod_aux_mod_main_~x~0_26_43_137_159) (+ (* aux_div_aux_mod_aux_mod_main_~x~0_26_43_137 3) 1)) (< aux_div_aux_mod_aux_mod_main_~x~0_26_43_137 (+ (div (+ 5 main_~n~0 (* (- 1) main_~y~0)) 4294967296) 1)) (<= aux_div_aux_mod_aux_mod_main_~x~0_26_43_137 aux_div_aux_mod_aux_mod_aux_mod_main_~x~0_26_43_137_159))))} is VALID [2022-04-27 10:18:55,898 INFO L272 TraceCheckUtils]: 17: Hoare triple {693#(and (<= main_~y~0 10) (<= 10 main_~y~0) (< (div (+ main_~y~0 4294967289 (* (- 1) main_~n~0)) (- 4294967296)) (+ (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 1)) (exists ((aux_div_aux_mod_aux_mod_aux_mod_main_~x~0_26_43_137_159 Int) (aux_div_aux_mod_aux_mod_main_~x~0_26_43_137 Int)) (and (< (+ (div (+ main_~y~0 4294967289 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~y~0 (* (- 1) main_~n~0)) (- 4294967296)) aux_div_aux_mod_aux_mod_aux_mod_main_~x~0_26_43_137_159) (+ (* aux_div_aux_mod_aux_mod_main_~x~0_26_43_137 3) 1)) (< aux_div_aux_mod_aux_mod_main_~x~0_26_43_137 (+ (div (+ 5 main_~n~0 (* (- 1) main_~y~0)) 4294967296) 1)) (<= aux_div_aux_mod_aux_mod_main_~x~0_26_43_137 aux_div_aux_mod_aux_mod_aux_mod_main_~x~0_26_43_137_159))))} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {697#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:18:55,898 INFO L290 TraceCheckUtils]: 18: Hoare triple {697#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {701#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 10:18:55,899 INFO L290 TraceCheckUtils]: 19: Hoare triple {701#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {614#false} is VALID [2022-04-27 10:18:55,899 INFO L290 TraceCheckUtils]: 20: Hoare triple {614#false} assume !false; {614#false} is VALID [2022-04-27 10:18:55,899 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:18:55,899 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:19:08,230 INFO L290 TraceCheckUtils]: 20: Hoare triple {614#false} assume !false; {614#false} is VALID [2022-04-27 10:19:08,230 INFO L290 TraceCheckUtils]: 19: Hoare triple {701#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {614#false} is VALID [2022-04-27 10:19:08,231 INFO L290 TraceCheckUtils]: 18: Hoare triple {697#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {701#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 10:19:08,232 INFO L272 TraceCheckUtils]: 17: Hoare triple {629#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {697#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:19:08,232 INFO L290 TraceCheckUtils]: 16: Hoare triple {720#(or (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))))} assume !(~x~0 % 4294967296 > 0); {629#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-27 10:19:08,234 INFO L290 TraceCheckUtils]: 15: Hoare triple {724#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296)) (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {720#(or (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))))} is VALID [2022-04-27 10:19:08,235 INFO L290 TraceCheckUtils]: 14: Hoare triple {728#(or (and (< (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~y~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0))) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {724#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296)) (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)))))} is VALID [2022-04-27 10:19:08,237 INFO L290 TraceCheckUtils]: 13: Hoare triple {732#(or (and (<= (+ main_~y~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~y~0 3) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 3) 4294967296) 4294967296)) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 4))) (< 0 (mod (+ main_~x~0 4294967293) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {728#(or (and (< (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~y~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0))) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} is VALID [2022-04-27 10:19:08,238 INFO L290 TraceCheckUtils]: 12: Hoare triple {736#(or (and (< (+ main_~n~0 (* 4294967296 (div (+ main_~y~0 4) 4294967296))) (+ 5 main_~y~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ main_~n~0 (* 4294967296 (div (+ main_~y~0 4) 4294967296))))) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {732#(or (and (<= (+ main_~y~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~y~0 3) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 3) 4294967296) 4294967296)) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 4))) (< 0 (mod (+ main_~x~0 4294967293) 4294967296)))} is VALID [2022-04-27 10:19:08,240 INFO L290 TraceCheckUtils]: 11: Hoare triple {740#(or (< 0 (mod (+ 4294967291 main_~x~0) 4294967296)) (and (<= (+ 5 main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ 5 main_~y~0) 4294967296) 4294967296) main_~n~0)) (< (+ (* (div (+ 5 main_~y~0) 4294967296) 4294967296) main_~n~0) (+ main_~y~0 6 (* (div main_~n~0 4294967296) 4294967296)))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {736#(or (and (< (+ main_~n~0 (* 4294967296 (div (+ main_~y~0 4) 4294967296))) (+ 5 main_~y~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ main_~n~0 (* 4294967296 (div (+ main_~y~0 4) 4294967296))))) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} is VALID [2022-04-27 10:19:08,242 INFO L290 TraceCheckUtils]: 10: Hoare triple {744#(or (and (< (+ main_~n~0 (* (div (+ main_~y~0 6) 4294967296) 4294967296)) (+ 7 main_~y~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 6 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~y~0 6) 4294967296) 4294967296)))) (< 0 (mod (+ 4294967290 main_~x~0) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {740#(or (< 0 (mod (+ 4294967291 main_~x~0) 4294967296)) (and (<= (+ 5 main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ 5 main_~y~0) 4294967296) 4294967296) main_~n~0)) (< (+ (* (div (+ 5 main_~y~0) 4294967296) 4294967296) main_~n~0) (+ main_~y~0 6 (* (div main_~n~0 4294967296) 4294967296)))))} is VALID [2022-04-27 10:19:08,243 INFO L290 TraceCheckUtils]: 9: Hoare triple {748#(or (and (<= (+ 7 main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div (+ 7 main_~y~0) 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div (+ 7 main_~y~0) 4294967296))) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 8))) (< 0 (mod (+ main_~x~0 4294967289) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {744#(or (and (< (+ main_~n~0 (* (div (+ main_~y~0 6) 4294967296) 4294967296)) (+ 7 main_~y~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 6 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~y~0 6) 4294967296) 4294967296)))) (< 0 (mod (+ 4294967290 main_~x~0) 4294967296)))} is VALID [2022-04-27 10:19:08,245 INFO L290 TraceCheckUtils]: 8: Hoare triple {752#(or (< 0 (mod (+ 4294967288 main_~x~0) 4294967296)) (and (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 8) (+ (* (div (+ main_~y~0 8) 4294967296) 4294967296) main_~n~0)) (< (+ (* (div (+ main_~y~0 8) 4294967296) 4294967296) main_~n~0) (+ main_~y~0 9 (* (div main_~n~0 4294967296) 4294967296)))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {748#(or (and (<= (+ 7 main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div (+ 7 main_~y~0) 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div (+ 7 main_~y~0) 4294967296))) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 8))) (< 0 (mod (+ main_~x~0 4294967289) 4294967296)))} is VALID [2022-04-27 10:19:08,247 INFO L290 TraceCheckUtils]: 7: Hoare triple {756#(or (and (< (+ (* 4294967296 (div (+ main_~y~0 9) 4294967296)) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 10)) (<= (+ main_~y~0 9 (* (div main_~n~0 4294967296) 4294967296)) (+ (* 4294967296 (div (+ main_~y~0 9) 4294967296)) main_~n~0))) (< 0 (mod (+ main_~x~0 4294967287) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {752#(or (< 0 (mod (+ 4294967288 main_~x~0) 4294967296)) (and (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 8) (+ (* (div (+ main_~y~0 8) 4294967296) 4294967296) main_~n~0)) (< (+ (* (div (+ main_~y~0 8) 4294967296) 4294967296) main_~n~0) (+ main_~y~0 9 (* (div main_~n~0 4294967296) 4294967296)))))} is VALID [2022-04-27 10:19:08,248 INFO L290 TraceCheckUtils]: 6: Hoare triple {760#(or (and (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 10) (+ main_~n~0 (* (div (+ main_~y~0 10) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 10) 4294967296) 4294967296)) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 11))) (< 0 (mod (+ main_~x~0 4294967286) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {756#(or (and (< (+ (* 4294967296 (div (+ main_~y~0 9) 4294967296)) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 10)) (<= (+ main_~y~0 9 (* (div main_~n~0 4294967296) 4294967296)) (+ (* 4294967296 (div (+ main_~y~0 9) 4294967296)) main_~n~0))) (< 0 (mod (+ main_~x~0 4294967287) 4294967296)))} is VALID [2022-04-27 10:19:08,250 INFO L290 TraceCheckUtils]: 5: Hoare triple {613#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0; {760#(or (and (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 10) (+ main_~n~0 (* (div (+ main_~y~0 10) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 10) 4294967296) 4294967296)) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 11))) (< 0 (mod (+ main_~x~0 4294967286) 4294967296)))} is VALID [2022-04-27 10:19:08,250 INFO L272 TraceCheckUtils]: 4: Hoare triple {613#true} call #t~ret7 := main(); {613#true} is VALID [2022-04-27 10:19:08,250 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {613#true} {613#true} #36#return; {613#true} is VALID [2022-04-27 10:19:08,250 INFO L290 TraceCheckUtils]: 2: Hoare triple {613#true} assume true; {613#true} is VALID [2022-04-27 10:19:08,250 INFO L290 TraceCheckUtils]: 1: Hoare triple {613#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(18, 2);call #Ultimate.allocInit(12, 3); {613#true} is VALID [2022-04-27 10:19:08,251 INFO L272 TraceCheckUtils]: 0: Hoare triple {613#true} call ULTIMATE.init(); {613#true} is VALID [2022-04-27 10:19:08,251 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:19:08,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1418821875] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:19:08,251 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:19:08,251 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 40 [2022-04-27 10:19:08,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715681614] [2022-04-27 10:19:08,252 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:19:08,252 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 38 states have (on average 1.105263157894737) internal successors, (42), 37 states have internal predecessors, (42), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-27 10:19:08,253 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:19:08,253 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 40 states, 38 states have (on average 1.105263157894737) internal successors, (42), 37 states have internal predecessors, (42), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:10,643 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 48 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-27 10:19:10,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-04-27 10:19:10,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:19:10,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-04-27 10:19:10,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=312, Invalid=1248, Unknown=0, NotChecked=0, Total=1560 [2022-04-27 10:19:10,645 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand has 40 states, 38 states have (on average 1.105263157894737) internal successors, (42), 37 states have internal predecessors, (42), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:19:13,915 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-27 10:19:18,647 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 10:22:09,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:22:09,188 INFO L93 Difference]: Finished difference Result 41 states and 52 transitions. [2022-04-27 10:22:09,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-27 10:22:09,188 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 38 states have (on average 1.105263157894737) internal successors, (42), 37 states have internal predecessors, (42), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-27 10:22:09,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:22:09,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 38 states have (on average 1.105263157894737) internal successors, (42), 37 states have internal predecessors, (42), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:22:09,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 52 transitions. [2022-04-27 10:22:09,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 38 states have (on average 1.105263157894737) internal successors, (42), 37 states have internal predecessors, (42), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:22:09,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 52 transitions. [2022-04-27 10:22:09,193 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 52 transitions. [2022-04-27 10:22:14,546 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 51 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-27 10:22:14,548 INFO L225 Difference]: With dead ends: 41 [2022-04-27 10:22:14,548 INFO L226 Difference]: Without dead ends: 34 [2022-04-27 10:22:14,550 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 17 SyntacticMatches, 4 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 652 ImplicationChecksByTransitivity, 178.5s TimeCoverageRelationStatistics Valid=851, Invalid=3548, Unknown=23, NotChecked=0, Total=4422 [2022-04-27 10:22:14,550 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 79 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 132 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 17 IncrementalHoareTripleChecker+Unchecked, 10.2s IncrementalHoareTripleChecker+Time [2022-04-27 10:22:14,550 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 102 Invalid, 527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 377 Invalid, 1 Unknown, 17 Unchecked, 10.2s Time] [2022-04-27 10:22:14,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-27 10:22:14,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-04-27 10:22:14,713 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:22:14,713 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 34 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 29 states have internal predecessors, (30), 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-27 10:22:14,714 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 34 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 29 states have internal predecessors, (30), 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-27 10:22:14,714 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 34 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 29 states have internal predecessors, (30), 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-27 10:22:14,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:22:14,715 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2022-04-27 10:22:14,715 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2022-04-27 10:22:14,715 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:22:14,715 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:22:14,716 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 29 states have internal predecessors, (30), 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) Second operand 34 states. [2022-04-27 10:22:14,716 INFO L87 Difference]: Start difference. First operand has 34 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 29 states have internal predecessors, (30), 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) Second operand 34 states. [2022-04-27 10:22:14,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:22:14,718 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2022-04-27 10:22:14,719 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2022-04-27 10:22:14,719 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:22:14,719 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:22:14,719 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:22:14,719 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:22:14,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 29 states have internal predecessors, (30), 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-27 10:22:14,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2022-04-27 10:22:14,721 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 21 [2022-04-27 10:22:14,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:22:14,721 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2022-04-27 10:22:14,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 38 states have (on average 1.105263157894737) internal successors, (42), 37 states have internal predecessors, (42), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:22:14,721 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2022-04-27 10:22:14,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-27 10:22:14,722 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:22:14,722 INFO L195 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:22:14,731 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-27 10:22:14,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:22:14,926 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:22:14,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:22:14,927 INFO L85 PathProgramCache]: Analyzing trace with hash 355924162, now seen corresponding path program 4 times [2022-04-27 10:22:14,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:22:14,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284103395] [2022-04-27 10:22:14,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:22:14,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:22:15,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:22:17,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:22:17,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:22:17,164 INFO L290 TraceCheckUtils]: 0: Hoare triple {1071#(and (= |#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(18, 2);call #Ultimate.allocInit(12, 3); {1040#true} is VALID [2022-04-27 10:22:17,164 INFO L290 TraceCheckUtils]: 1: Hoare triple {1040#true} assume true; {1040#true} is VALID [2022-04-27 10:22:17,164 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1040#true} {1040#true} #36#return; {1040#true} is VALID [2022-04-27 10:22:17,164 INFO L272 TraceCheckUtils]: 0: Hoare triple {1040#true} call ULTIMATE.init(); {1071#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:22:17,164 INFO L290 TraceCheckUtils]: 1: Hoare triple {1071#(and (= |#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(18, 2);call #Ultimate.allocInit(12, 3); {1040#true} is VALID [2022-04-27 10:22:17,165 INFO L290 TraceCheckUtils]: 2: Hoare triple {1040#true} assume true; {1040#true} is VALID [2022-04-27 10:22:17,165 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1040#true} {1040#true} #36#return; {1040#true} is VALID [2022-04-27 10:22:17,165 INFO L272 TraceCheckUtils]: 4: Hoare triple {1040#true} call #t~ret7 := main(); {1040#true} is VALID [2022-04-27 10:22:17,167 INFO L290 TraceCheckUtils]: 5: Hoare triple {1040#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0; {1045#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-27 10:22:17,169 INFO L290 TraceCheckUtils]: 6: Hoare triple {1045#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1046#(and (<= main_~x~0 (+ 4294967294 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 10:22:17,177 INFO L290 TraceCheckUtils]: 7: Hoare triple {1046#(and (<= main_~x~0 (+ 4294967294 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1047#(and (<= 2 main_~y~0) (<= main_~y~0 2) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967293)) (<= (+ main_~y~0 main_~x~0) main_~n~0))} is VALID [2022-04-27 10:22:17,184 INFO L290 TraceCheckUtils]: 8: Hoare triple {1047#(and (<= 2 main_~y~0) (<= main_~y~0 2) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967293)) (<= (+ main_~y~0 main_~x~0) main_~n~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1048#(and (<= main_~y~0 3) (<= (+ main_~x~0 3) main_~n~0) (<= main_~x~0 (+ 4294967292 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} is VALID [2022-04-27 10:22:17,189 INFO L290 TraceCheckUtils]: 9: Hoare triple {1048#(and (<= main_~y~0 3) (<= (+ main_~x~0 3) main_~n~0) (<= main_~x~0 (+ 4294967292 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1049#(and (<= main_~x~0 (+ 4294967291 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= main_~y~0 4) (<= 4 main_~y~0) (<= (+ main_~y~0 main_~x~0) main_~n~0))} is VALID [2022-04-27 10:22:17,214 INFO L290 TraceCheckUtils]: 10: Hoare triple {1049#(and (<= main_~x~0 (+ 4294967291 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= main_~y~0 4) (<= 4 main_~y~0) (<= (+ main_~y~0 main_~x~0) main_~n~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1050#(and (<= (+ 5 main_~x~0) main_~n~0) (<= main_~y~0 5) (<= main_~x~0 (+ 4294967290 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} is VALID [2022-04-27 10:22:17,222 INFO L290 TraceCheckUtils]: 11: Hoare triple {1050#(and (<= (+ 5 main_~x~0) main_~n~0) (<= main_~y~0 5) (<= main_~x~0 (+ 4294967290 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1051#(and (<= main_~y~0 6) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967289)) (<= (+ main_~x~0 6) main_~n~0))} is VALID [2022-04-27 10:22:17,229 INFO L290 TraceCheckUtils]: 12: Hoare triple {1051#(and (<= main_~y~0 6) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967289)) (<= (+ main_~x~0 6) main_~n~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1052#(and (<= 7 main_~y~0) (<= main_~y~0 7) (<= main_~x~0 (+ 4294967288 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~y~0 main_~x~0) main_~n~0))} is VALID [2022-04-27 10:22:17,832 INFO L290 TraceCheckUtils]: 13: Hoare triple {1052#(and (<= 7 main_~y~0) (<= main_~y~0 7) (<= main_~x~0 (+ 4294967288 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~y~0 main_~x~0) main_~n~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1053#(and (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967287)) (<= main_~y~0 8) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= 8 main_~y~0))} is VALID [2022-04-27 10:22:19,441 INFO L290 TraceCheckUtils]: 14: Hoare triple {1053#(and (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967287)) (<= main_~y~0 8) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= 8 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1054#(and (<= main_~x~0 (+ 4294967286 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-27 10:22:19,471 INFO L290 TraceCheckUtils]: 15: Hoare triple {1054#(and (<= main_~x~0 (+ 4294967286 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1055#(and (<= main_~y~0 10) (<= main_~x~0 (+ 4294967285 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~x~0 10) main_~n~0))} is VALID [2022-04-27 10:22:19,474 INFO L290 TraceCheckUtils]: 16: Hoare triple {1055#(and (<= main_~y~0 10) (<= main_~x~0 (+ 4294967285 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~x~0 10) main_~n~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1056#(and (<= main_~y~0 11) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967284)) (<= (+ main_~x~0 11) main_~n~0))} is VALID [2022-04-27 10:22:19,477 INFO L290 TraceCheckUtils]: 17: Hoare triple {1056#(and (<= main_~y~0 11) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967284)) (<= (+ main_~x~0 11) main_~n~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1057#(and (<= main_~x~0 (+ 4294967283 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= main_~y~0 12) (<= (+ main_~x~0 12) main_~n~0))} is VALID [2022-04-27 10:22:19,496 INFO L290 TraceCheckUtils]: 18: Hoare triple {1057#(and (<= main_~x~0 (+ 4294967283 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= main_~y~0 12) (<= (+ main_~x~0 12) main_~n~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1058#(and (<= main_~y~0 13) (<= main_~x~0 (+ 4294967282 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= 13 main_~y~0))} is VALID [2022-04-27 10:22:19,503 INFO L290 TraceCheckUtils]: 19: Hoare triple {1058#(and (<= main_~y~0 13) (<= main_~x~0 (+ 4294967282 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1059#(and (<= (+ main_~x~0 14) main_~n~0) (<= main_~y~0 14) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967281)))} is VALID [2022-04-27 10:22:19,505 INFO L290 TraceCheckUtils]: 20: Hoare triple {1059#(and (<= (+ main_~x~0 14) main_~n~0) (<= main_~y~0 14) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967281)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1060#(and (<= main_~y~0 15) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967280)) (<= (+ main_~x~0 15) main_~n~0))} is VALID [2022-04-27 10:22:19,507 INFO L290 TraceCheckUtils]: 21: Hoare triple {1060#(and (<= main_~y~0 15) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967280)) (<= (+ main_~x~0 15) main_~n~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1061#(and (<= (+ main_~x~0 16) main_~n~0) (<= main_~y~0 16) (<= main_~x~0 (+ 4294967279 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} is VALID [2022-04-27 10:22:19,510 INFO L290 TraceCheckUtils]: 22: Hoare triple {1061#(and (<= (+ main_~x~0 16) main_~n~0) (<= main_~y~0 16) (<= main_~x~0 (+ 4294967279 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1062#(and (<= main_~y~0 17) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967278)) (<= (+ main_~x~0 17) main_~n~0))} is VALID [2022-04-27 10:22:19,512 INFO L290 TraceCheckUtils]: 23: Hoare triple {1062#(and (<= main_~y~0 17) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967278)) (<= (+ main_~x~0 17) main_~n~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1063#(and (<= (+ main_~x~0 18) main_~n~0) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967277)) (<= main_~y~0 18))} is VALID [2022-04-27 10:22:19,514 INFO L290 TraceCheckUtils]: 24: Hoare triple {1063#(and (<= (+ main_~x~0 18) main_~n~0) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967277)) (<= main_~y~0 18))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1064#(and (<= main_~x~0 (+ 4294967276 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ 19 main_~x~0) main_~n~0) (<= main_~y~0 19))} is VALID [2022-04-27 10:22:19,520 INFO L290 TraceCheckUtils]: 25: Hoare triple {1064#(and (<= main_~x~0 (+ 4294967276 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ 19 main_~x~0) main_~n~0) (<= main_~y~0 19))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1065#(and (<= main_~x~0 (+ 4294967275 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= 20 main_~y~0) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= main_~y~0 20))} is VALID [2022-04-27 10:22:19,529 INFO L290 TraceCheckUtils]: 26: Hoare triple {1065#(and (<= main_~x~0 (+ 4294967275 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= 20 main_~y~0) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= main_~y~0 20))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1066#(and (<= main_~x~0 (+ 4294967274 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= main_~y~0 21) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= 21 main_~y~0))} is VALID [2022-04-27 10:22:19,533 INFO L290 TraceCheckUtils]: 27: Hoare triple {1066#(and (<= main_~x~0 (+ 4294967274 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= main_~y~0 21) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= 21 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1067#(and (<= (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~y~0 main_~x~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-27 10:22:19,534 INFO L290 TraceCheckUtils]: 28: Hoare triple {1067#(and (<= (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~y~0 main_~x~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} assume !(~x~0 % 4294967296 > 0); {1068#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-27 10:22:19,535 INFO L272 TraceCheckUtils]: 29: Hoare triple {1068#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1069#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 10:22:19,535 INFO L290 TraceCheckUtils]: 30: Hoare triple {1069#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {1070#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 10:22:19,535 INFO L290 TraceCheckUtils]: 31: Hoare triple {1070#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1041#false} is VALID [2022-04-27 10:22:19,535 INFO L290 TraceCheckUtils]: 32: Hoare triple {1041#false} assume !false; {1041#false} is VALID [2022-04-27 10:22:19,536 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:22:19,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:22:19,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284103395] [2022-04-27 10:22:19,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284103395] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:22:19,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1855504887] [2022-04-27 10:22:19,537 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-27 10:22:19,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:22:19,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:22:19,540 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-27 10:22:19,541 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-27 10:22:19,882 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-27 10:22:19,882 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 10:22:19,884 WARN L261 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 97 conjunts are in the unsatisfiable core [2022-04-27 10:22:19,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:22:19,931 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:22:52,880 INFO L272 TraceCheckUtils]: 0: Hoare triple {1040#true} call ULTIMATE.init(); {1040#true} is VALID [2022-04-27 10:22:52,881 INFO L290 TraceCheckUtils]: 1: Hoare triple {1040#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(18, 2);call #Ultimate.allocInit(12, 3); {1040#true} is VALID [2022-04-27 10:22:52,881 INFO L290 TraceCheckUtils]: 2: Hoare triple {1040#true} assume true; {1040#true} is VALID [2022-04-27 10:22:52,881 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1040#true} {1040#true} #36#return; {1040#true} is VALID [2022-04-27 10:22:52,881 INFO L272 TraceCheckUtils]: 4: Hoare triple {1040#true} call #t~ret7 := main(); {1040#true} is VALID [2022-04-27 10:22:52,882 INFO L290 TraceCheckUtils]: 5: Hoare triple {1040#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0; {1045#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-27 10:22:52,884 INFO L290 TraceCheckUtils]: 6: Hoare triple {1045#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1046#(and (<= main_~x~0 (+ 4294967294 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-27 10:22:52,886 INFO L290 TraceCheckUtils]: 7: Hoare triple {1046#(and (<= main_~x~0 (+ 4294967294 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1096#(and (<= 2 main_~y~0) (<= main_~y~0 2) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967293)))} is VALID [2022-04-27 10:22:52,904 INFO L290 TraceCheckUtils]: 8: Hoare triple {1096#(and (<= 2 main_~y~0) (<= main_~y~0 2) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967293)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1100#(and (<= main_~y~0 3) (<= 3 main_~y~0) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= main_~x~0 (+ 4294967292 (* (div (+ main_~y~0 main_~x~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} is VALID [2022-04-27 10:22:52,906 INFO L290 TraceCheckUtils]: 9: Hoare triple {1100#(and (<= main_~y~0 3) (<= 3 main_~y~0) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= main_~x~0 (+ 4294967292 (* (div (+ main_~y~0 main_~x~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1104#(and (<= main_~x~0 (+ 4294967291 (* (div (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~y~0 main_~x~0 (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= main_~y~0 4) (<= 4 main_~y~0) (<= (+ main_~y~0 main_~x~0) main_~n~0))} is VALID [2022-04-27 10:22:52,909 INFO L290 TraceCheckUtils]: 10: Hoare triple {1104#(and (<= main_~x~0 (+ 4294967291 (* (div (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~y~0 main_~x~0 (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= main_~y~0 4) (<= 4 main_~y~0) (<= (+ main_~y~0 main_~x~0) main_~n~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1108#(and (<= 5 main_~y~0) (<= main_~x~0 (+ 4294967290 (* (div (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~y~0 main_~x~0 (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= main_~y~0 5))} is VALID [2022-04-27 10:22:52,912 INFO L290 TraceCheckUtils]: 11: Hoare triple {1108#(and (<= 5 main_~y~0) (<= main_~x~0 (+ 4294967290 (* (div (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~y~0 main_~x~0 (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= main_~y~0 5))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1112#(and (<= main_~y~0 6) (<= main_~x~0 (+ 4294967289 (* (div (+ main_~y~0 main_~x~0 (* (div (+ 5 main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= 6 main_~y~0) (<= (+ main_~y~0 main_~x~0) main_~n~0))} is VALID [2022-04-27 10:22:52,915 INFO L290 TraceCheckUtils]: 12: Hoare triple {1112#(and (<= main_~y~0 6) (<= main_~x~0 (+ 4294967289 (* (div (+ main_~y~0 main_~x~0 (* (div (+ 5 main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= 6 main_~y~0) (<= (+ main_~y~0 main_~x~0) main_~n~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1116#(and (<= 7 main_~y~0) (<= main_~y~0 7) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= main_~x~0 (+ 4294967288 (* 4294967296 (div (+ main_~y~0 main_~x~0 (* 4294967296 (div (+ main_~x~0 6) 4294967296)) (* (- 1) main_~n~0)) 4294967296)))))} is VALID [2022-04-27 10:22:52,917 INFO L290 TraceCheckUtils]: 13: Hoare triple {1116#(and (<= 7 main_~y~0) (<= main_~y~0 7) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= main_~x~0 (+ 4294967288 (* 4294967296 (div (+ main_~y~0 main_~x~0 (* 4294967296 (div (+ main_~x~0 6) 4294967296)) (* (- 1) main_~n~0)) 4294967296)))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1120#(and (<= main_~y~0 8) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= 8 main_~y~0) (<= main_~x~0 (+ 4294967287 (* (div (+ (* (div (+ 7 main_~x~0) 4294967296) 4294967296) main_~y~0 main_~x~0 (* (- 1) main_~n~0)) 4294967296) 4294967296))))} is VALID [2022-04-27 10:22:52,922 INFO L290 TraceCheckUtils]: 14: Hoare triple {1120#(and (<= main_~y~0 8) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= 8 main_~y~0) (<= main_~x~0 (+ 4294967287 (* (div (+ (* (div (+ 7 main_~x~0) 4294967296) 4294967296) main_~y~0 main_~x~0 (* (- 1) main_~n~0)) 4294967296) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1124#(and (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= 9 main_~y~0) (<= main_~y~0 9) (<= main_~x~0 (+ (* (div (+ (* (div (+ main_~x~0 8) 4294967296) 4294967296) main_~y~0 main_~x~0 (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967286)))} is VALID [2022-04-27 10:22:52,933 INFO L290 TraceCheckUtils]: 15: Hoare triple {1124#(and (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= 9 main_~y~0) (<= main_~y~0 9) (<= main_~x~0 (+ (* (div (+ (* (div (+ main_~x~0 8) 4294967296) 4294967296) main_~y~0 main_~x~0 (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967286)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1128#(and (<= main_~y~0 10) (<= 10 main_~y~0) (<= main_~x~0 (+ (* 4294967296 (div (+ main_~y~0 main_~x~0 (* 4294967296 (div (+ main_~x~0 9) 4294967296)) (* (- 1) main_~n~0)) 4294967296)) 4294967285)) (<= (+ main_~y~0 main_~x~0) main_~n~0))} is VALID [2022-04-27 10:22:52,935 INFO L290 TraceCheckUtils]: 16: Hoare triple {1128#(and (<= main_~y~0 10) (<= 10 main_~y~0) (<= main_~x~0 (+ (* 4294967296 (div (+ main_~y~0 main_~x~0 (* 4294967296 (div (+ main_~x~0 9) 4294967296)) (* (- 1) main_~n~0)) 4294967296)) 4294967285)) (<= (+ main_~y~0 main_~x~0) main_~n~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1132#(and (<= main_~y~0 11) (<= main_~x~0 (+ (* (div (+ (* (div (+ main_~x~0 10) 4294967296) 4294967296) main_~y~0 main_~x~0 (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967284)) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= 11 main_~y~0))} is VALID [2022-04-27 10:22:52,937 INFO L290 TraceCheckUtils]: 17: Hoare triple {1132#(and (<= main_~y~0 11) (<= main_~x~0 (+ (* (div (+ (* (div (+ main_~x~0 10) 4294967296) 4294967296) main_~y~0 main_~x~0 (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967284)) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= 11 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1136#(and (<= main_~x~0 (+ 4294967283 (* (div (+ (* (div (+ main_~x~0 11) 4294967296) 4294967296) main_~y~0 main_~x~0 (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= 12 main_~y~0) (<= main_~y~0 12) (<= (+ main_~y~0 main_~x~0) main_~n~0))} is VALID [2022-04-27 10:22:52,939 INFO L290 TraceCheckUtils]: 18: Hoare triple {1136#(and (<= main_~x~0 (+ 4294967283 (* (div (+ (* (div (+ main_~x~0 11) 4294967296) 4294967296) main_~y~0 main_~x~0 (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= 12 main_~y~0) (<= main_~y~0 12) (<= (+ main_~y~0 main_~x~0) main_~n~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1140#(and (<= main_~y~0 13) (<= main_~x~0 (+ 4294967282 (* (div (+ main_~y~0 main_~x~0 (* (div (+ main_~x~0 12) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= 13 main_~y~0))} is VALID [2022-04-27 10:22:52,941 INFO L290 TraceCheckUtils]: 19: Hoare triple {1140#(and (<= main_~y~0 13) (<= main_~x~0 (+ 4294967282 (* (div (+ main_~y~0 main_~x~0 (* (div (+ main_~x~0 12) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= 13 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1144#(and (<= 14 main_~y~0) (<= main_~y~0 14) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* (div (+ main_~x~0 13) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967281)))} is VALID [2022-04-27 10:22:52,945 INFO L290 TraceCheckUtils]: 20: Hoare triple {1144#(and (<= 14 main_~y~0) (<= main_~y~0 14) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* (div (+ main_~x~0 13) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967281)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1148#(and (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* (div (+ main_~x~0 14) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967280)) (<= main_~y~0 15) (<= 15 main_~y~0) (<= (+ main_~y~0 main_~x~0) main_~n~0))} is VALID [2022-04-27 10:22:52,947 INFO L290 TraceCheckUtils]: 21: Hoare triple {1148#(and (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* (div (+ main_~x~0 14) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967280)) (<= main_~y~0 15) (<= 15 main_~y~0) (<= (+ main_~y~0 main_~x~0) main_~n~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1152#(and (<= 16 main_~y~0) (<= main_~y~0 16) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div (+ main_~x~0 15) 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967279)))} is VALID [2022-04-27 10:22:52,949 INFO L290 TraceCheckUtils]: 22: Hoare triple {1152#(and (<= 16 main_~y~0) (<= main_~y~0 16) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div (+ main_~x~0 15) 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967279)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1156#(and (<= main_~y~0 17) (<= 17 main_~y~0) (<= main_~x~0 (+ 4294967278 (* (div (+ main_~y~0 main_~x~0 (* (div (+ main_~x~0 16) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~y~0 main_~x~0) main_~n~0))} is VALID [2022-04-27 10:22:52,957 INFO L290 TraceCheckUtils]: 23: Hoare triple {1156#(and (<= main_~y~0 17) (<= 17 main_~y~0) (<= main_~x~0 (+ 4294967278 (* (div (+ main_~y~0 main_~x~0 (* (div (+ main_~x~0 16) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~y~0 main_~x~0) main_~n~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1160#(and (<= 18 main_~y~0) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* (div (+ main_~x~0 17) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967277)) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= main_~y~0 18))} is VALID [2022-04-27 10:22:52,967 INFO L290 TraceCheckUtils]: 24: Hoare triple {1160#(and (<= 18 main_~y~0) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* (div (+ main_~x~0 17) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967277)) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= main_~y~0 18))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1164#(and (<= 19 main_~y~0) (<= main_~y~0 19) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= main_~x~0 (+ 4294967276 (* 4294967296 (div (+ (* 4294967296 (div (+ main_~x~0 18) 4294967296)) main_~y~0 main_~x~0 (* (- 1) main_~n~0)) 4294967296)))))} is VALID [2022-04-27 10:22:52,969 INFO L290 TraceCheckUtils]: 25: Hoare triple {1164#(and (<= 19 main_~y~0) (<= main_~y~0 19) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= main_~x~0 (+ 4294967276 (* 4294967296 (div (+ (* 4294967296 (div (+ main_~x~0 18) 4294967296)) main_~y~0 main_~x~0 (* (- 1) main_~n~0)) 4294967296)))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1168#(and (<= main_~x~0 (+ 4294967275 (* (div (+ main_~y~0 main_~x~0 (* (div (+ 19 main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= 20 main_~y~0) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= main_~y~0 20))} is VALID [2022-04-27 10:22:52,971 INFO L290 TraceCheckUtils]: 26: Hoare triple {1168#(and (<= main_~x~0 (+ 4294967275 (* (div (+ main_~y~0 main_~x~0 (* (div (+ 19 main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= 20 main_~y~0) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= main_~y~0 20))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1172#(and (<= main_~x~0 (+ (* 4294967296 (div (+ main_~y~0 main_~x~0 (* (div (+ main_~x~0 20) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296)) 4294967274)) (<= main_~y~0 21) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= 21 main_~y~0))} is VALID [2022-04-27 10:22:52,975 INFO L290 TraceCheckUtils]: 27: Hoare triple {1172#(and (<= main_~x~0 (+ (* 4294967296 (div (+ main_~y~0 main_~x~0 (* (div (+ main_~x~0 20) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296)) 4294967274)) (<= main_~y~0 21) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= 21 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1176#(and (<= main_~x~0 (+ 4294967273 (* (div (+ (* (div (+ main_~x~0 21) 4294967296) 4294967296) main_~y~0 main_~x~0 (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= main_~y~0 22) (<= 22 main_~y~0) (<= (+ main_~y~0 main_~x~0) main_~n~0))} is VALID [2022-04-27 10:22:52,977 INFO L290 TraceCheckUtils]: 28: Hoare triple {1176#(and (<= main_~x~0 (+ 4294967273 (* (div (+ (* (div (+ main_~x~0 21) 4294967296) 4294967296) main_~y~0 main_~x~0 (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= main_~y~0 22) (<= 22 main_~y~0) (<= (+ main_~y~0 main_~x~0) main_~n~0))} assume !(~x~0 % 4294967296 > 0); {1180#(and (<= main_~y~0 22) (<= 22 main_~y~0) (<= (div (+ (* main_~y~0 (- 4294967295)) (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (* main_~y~0 4294967295)) 4294967296)))} is VALID [2022-04-27 10:22:52,979 INFO L272 TraceCheckUtils]: 29: Hoare triple {1180#(and (<= main_~y~0 22) (<= 22 main_~y~0) (<= (div (+ (* main_~y~0 (- 4294967295)) (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (* main_~y~0 4294967295)) 4294967296)))} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1184#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:22:52,979 INFO L290 TraceCheckUtils]: 30: Hoare triple {1184#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1188#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 10:22:52,979 INFO L290 TraceCheckUtils]: 31: Hoare triple {1188#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1041#false} is VALID [2022-04-27 10:22:52,979 INFO L290 TraceCheckUtils]: 32: Hoare triple {1041#false} assume !false; {1041#false} is VALID [2022-04-27 10:22:52,980 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:22:52,980 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:23:47,488 INFO L290 TraceCheckUtils]: 32: Hoare triple {1041#false} assume !false; {1041#false} is VALID [2022-04-27 10:23:47,489 INFO L290 TraceCheckUtils]: 31: Hoare triple {1188#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1041#false} is VALID [2022-04-27 10:23:47,489 INFO L290 TraceCheckUtils]: 30: Hoare triple {1184#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1188#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 10:23:47,496 INFO L272 TraceCheckUtils]: 29: Hoare triple {1068#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1184#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:23:47,497 INFO L290 TraceCheckUtils]: 28: Hoare triple {1207#(or (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))))} assume !(~x~0 % 4294967296 > 0); {1068#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-27 10:23:47,499 INFO L290 TraceCheckUtils]: 27: Hoare triple {1211#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296)) (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1207#(or (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))))} is VALID [2022-04-27 10:23:47,501 INFO L290 TraceCheckUtils]: 26: Hoare triple {1215#(or (and (< (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~y~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0))) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1211#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296)) (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)))))} is VALID [2022-04-27 10:23:47,506 INFO L290 TraceCheckUtils]: 25: Hoare triple {1219#(or (and (<= (+ main_~y~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~y~0 3) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 3) 4294967296) 4294967296)) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 4))) (< 0 (mod (+ main_~x~0 4294967293) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1215#(or (and (< (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~y~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0))) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} is VALID [2022-04-27 10:23:47,511 INFO L290 TraceCheckUtils]: 24: Hoare triple {1223#(or (and (< (+ main_~n~0 (* 4294967296 (div (+ main_~y~0 4) 4294967296))) (+ 5 main_~y~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ main_~n~0 (* 4294967296 (div (+ main_~y~0 4) 4294967296))))) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1219#(or (and (<= (+ main_~y~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~y~0 3) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 3) 4294967296) 4294967296)) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 4))) (< 0 (mod (+ main_~x~0 4294967293) 4294967296)))} is VALID [2022-04-27 10:23:47,512 INFO L290 TraceCheckUtils]: 23: Hoare triple {1227#(or (< 0 (mod (+ 4294967291 main_~x~0) 4294967296)) (and (<= (+ 5 main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ 5 main_~y~0) 4294967296) 4294967296) main_~n~0)) (< (+ (* (div (+ 5 main_~y~0) 4294967296) 4294967296) main_~n~0) (+ main_~y~0 6 (* (div main_~n~0 4294967296) 4294967296)))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1223#(or (and (< (+ main_~n~0 (* 4294967296 (div (+ main_~y~0 4) 4294967296))) (+ 5 main_~y~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ main_~n~0 (* 4294967296 (div (+ main_~y~0 4) 4294967296))))) (< 0 (mod (+ 4294967292 main_~x~0) 4294967296)))} is VALID [2022-04-27 10:23:47,514 INFO L290 TraceCheckUtils]: 22: Hoare triple {1231#(or (and (< (+ main_~n~0 (* (div (+ main_~y~0 6) 4294967296) 4294967296)) (+ 7 main_~y~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 6 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~y~0 6) 4294967296) 4294967296)))) (< 0 (mod (+ 4294967290 main_~x~0) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1227#(or (< 0 (mod (+ 4294967291 main_~x~0) 4294967296)) (and (<= (+ 5 main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ 5 main_~y~0) 4294967296) 4294967296) main_~n~0)) (< (+ (* (div (+ 5 main_~y~0) 4294967296) 4294967296) main_~n~0) (+ main_~y~0 6 (* (div main_~n~0 4294967296) 4294967296)))))} is VALID [2022-04-27 10:23:47,516 INFO L290 TraceCheckUtils]: 21: Hoare triple {1235#(or (and (<= (+ 7 main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div (+ 7 main_~y~0) 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div (+ 7 main_~y~0) 4294967296))) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 8))) (< 0 (mod (+ main_~x~0 4294967289) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1231#(or (and (< (+ main_~n~0 (* (div (+ main_~y~0 6) 4294967296) 4294967296)) (+ 7 main_~y~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 6 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~y~0 6) 4294967296) 4294967296)))) (< 0 (mod (+ 4294967290 main_~x~0) 4294967296)))} is VALID [2022-04-27 10:23:47,517 INFO L290 TraceCheckUtils]: 20: Hoare triple {1239#(or (< 0 (mod (+ 4294967288 main_~x~0) 4294967296)) (and (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 8) (+ (* (div (+ main_~y~0 8) 4294967296) 4294967296) main_~n~0)) (< (+ (* (div (+ main_~y~0 8) 4294967296) 4294967296) main_~n~0) (+ main_~y~0 9 (* (div main_~n~0 4294967296) 4294967296)))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1235#(or (and (<= (+ 7 main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div (+ 7 main_~y~0) 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div (+ 7 main_~y~0) 4294967296))) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 8))) (< 0 (mod (+ main_~x~0 4294967289) 4294967296)))} is VALID [2022-04-27 10:23:47,519 INFO L290 TraceCheckUtils]: 19: Hoare triple {1243#(or (and (< (+ (* 4294967296 (div (+ main_~y~0 9) 4294967296)) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 10)) (<= (+ main_~y~0 9 (* (div main_~n~0 4294967296) 4294967296)) (+ (* 4294967296 (div (+ main_~y~0 9) 4294967296)) main_~n~0))) (< 0 (mod (+ main_~x~0 4294967287) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1239#(or (< 0 (mod (+ 4294967288 main_~x~0) 4294967296)) (and (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 8) (+ (* (div (+ main_~y~0 8) 4294967296) 4294967296) main_~n~0)) (< (+ (* (div (+ main_~y~0 8) 4294967296) 4294967296) main_~n~0) (+ main_~y~0 9 (* (div main_~n~0 4294967296) 4294967296)))))} is VALID [2022-04-27 10:23:47,520 INFO L290 TraceCheckUtils]: 18: Hoare triple {1247#(or (and (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 10) (+ main_~n~0 (* (div (+ main_~y~0 10) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 10) 4294967296) 4294967296)) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 11))) (< 0 (mod (+ main_~x~0 4294967286) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1243#(or (and (< (+ (* 4294967296 (div (+ main_~y~0 9) 4294967296)) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 10)) (<= (+ main_~y~0 9 (* (div main_~n~0 4294967296) 4294967296)) (+ (* 4294967296 (div (+ main_~y~0 9) 4294967296)) main_~n~0))) (< 0 (mod (+ main_~x~0 4294967287) 4294967296)))} is VALID [2022-04-27 10:23:47,522 INFO L290 TraceCheckUtils]: 17: Hoare triple {1251#(or (and (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 11) (+ main_~n~0 (* (div (+ main_~y~0 11) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 11) 4294967296) 4294967296)) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 12))) (< 0 (mod (+ main_~x~0 4294967285) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1247#(or (and (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 10) (+ main_~n~0 (* (div (+ main_~y~0 10) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 10) 4294967296) 4294967296)) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 11))) (< 0 (mod (+ main_~x~0 4294967286) 4294967296)))} is VALID [2022-04-27 10:23:47,524 INFO L290 TraceCheckUtils]: 16: Hoare triple {1255#(or (< 0 (mod (+ main_~x~0 4294967284) 4294967296)) (and (< (+ (* (div (+ main_~y~0 12) 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 13)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 12) (+ (* (div (+ main_~y~0 12) 4294967296) 4294967296) main_~n~0))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1251#(or (and (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 11) (+ main_~n~0 (* (div (+ main_~y~0 11) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 11) 4294967296) 4294967296)) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 12))) (< 0 (mod (+ main_~x~0 4294967285) 4294967296)))} is VALID [2022-04-27 10:23:47,526 INFO L290 TraceCheckUtils]: 15: Hoare triple {1259#(or (< 0 (mod (+ 4294967283 main_~x~0) 4294967296)) (and (< (+ (* (div (+ main_~y~0 13) 4294967296) 4294967296) main_~n~0) (+ main_~y~0 14 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 13) (+ (* (div (+ main_~y~0 13) 4294967296) 4294967296) main_~n~0))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1255#(or (< 0 (mod (+ main_~x~0 4294967284) 4294967296)) (and (< (+ (* (div (+ main_~y~0 12) 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 13)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 12) (+ (* (div (+ main_~y~0 12) 4294967296) 4294967296) main_~n~0))))} is VALID [2022-04-27 10:23:47,527 INFO L290 TraceCheckUtils]: 14: Hoare triple {1263#(or (and (< (+ main_~n~0 (* (div (+ main_~y~0 14) 4294967296) 4294967296)) (+ main_~y~0 15 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 14 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~y~0 14) 4294967296) 4294967296)))) (< 0 (mod (+ 4294967282 main_~x~0) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1259#(or (< 0 (mod (+ 4294967283 main_~x~0) 4294967296)) (and (< (+ (* (div (+ main_~y~0 13) 4294967296) 4294967296) main_~n~0) (+ main_~y~0 14 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 13) (+ (* (div (+ main_~y~0 13) 4294967296) 4294967296) main_~n~0))))} is VALID [2022-04-27 10:23:47,530 INFO L290 TraceCheckUtils]: 13: Hoare triple {1267#(or (and (<= (+ main_~y~0 15 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~y~0 15) 4294967296) 4294967296) main_~n~0)) (< (+ (* (div (+ main_~y~0 15) 4294967296) 4294967296) main_~n~0) (+ main_~y~0 16 (* (div main_~n~0 4294967296) 4294967296)))) (< 0 (mod (+ main_~x~0 4294967281) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1263#(or (and (< (+ main_~n~0 (* (div (+ main_~y~0 14) 4294967296) 4294967296)) (+ main_~y~0 15 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 14 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~y~0 14) 4294967296) 4294967296)))) (< 0 (mod (+ 4294967282 main_~x~0) 4294967296)))} is VALID [2022-04-27 10:23:47,531 INFO L290 TraceCheckUtils]: 12: Hoare triple {1271#(or (and (< (+ (* (div (+ main_~y~0 16) 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 17)) (<= (+ main_~y~0 16 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~y~0 16) 4294967296) 4294967296) main_~n~0))) (< 0 (mod (+ main_~x~0 4294967280) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1267#(or (and (<= (+ main_~y~0 15 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~y~0 15) 4294967296) 4294967296) main_~n~0)) (< (+ (* (div (+ main_~y~0 15) 4294967296) 4294967296) main_~n~0) (+ main_~y~0 16 (* (div main_~n~0 4294967296) 4294967296)))) (< 0 (mod (+ main_~x~0 4294967281) 4294967296)))} is VALID [2022-04-27 10:23:47,532 INFO L290 TraceCheckUtils]: 11: Hoare triple {1275#(or (and (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 17) (+ main_~n~0 (* (div (+ main_~y~0 17) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 17) 4294967296) 4294967296)) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 18))) (< 0 (mod (+ main_~x~0 4294967279) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1271#(or (and (< (+ (* (div (+ main_~y~0 16) 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 17)) (<= (+ main_~y~0 16 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~y~0 16) 4294967296) 4294967296) main_~n~0))) (< 0 (mod (+ main_~x~0 4294967280) 4294967296)))} is VALID [2022-04-27 10:23:47,534 INFO L290 TraceCheckUtils]: 10: Hoare triple {1279#(or (and (< (+ (* (div (+ main_~y~0 18) 4294967296) 4294967296) main_~n~0) (+ 19 main_~y~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 18) (+ (* (div (+ main_~y~0 18) 4294967296) 4294967296) main_~n~0))) (< 0 (mod (+ main_~x~0 4294967278) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1275#(or (and (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 17) (+ main_~n~0 (* (div (+ main_~y~0 17) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 17) 4294967296) 4294967296)) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 18))) (< 0 (mod (+ main_~x~0 4294967279) 4294967296)))} is VALID [2022-04-27 10:23:47,535 INFO L290 TraceCheckUtils]: 9: Hoare triple {1283#(or (and (<= (+ 19 main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ 19 main_~y~0) 4294967296) 4294967296) main_~n~0)) (< (+ (* (div (+ 19 main_~y~0) 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 20))) (< 0 (mod (+ main_~x~0 4294967277) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1279#(or (and (< (+ (* (div (+ main_~y~0 18) 4294967296) 4294967296) main_~n~0) (+ 19 main_~y~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 18) (+ (* (div (+ main_~y~0 18) 4294967296) 4294967296) main_~n~0))) (< 0 (mod (+ main_~x~0 4294967278) 4294967296)))} is VALID [2022-04-27 10:23:47,536 INFO L290 TraceCheckUtils]: 8: Hoare triple {1287#(or (and (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 20) (+ (* 4294967296 (div (+ main_~y~0 20) 4294967296)) main_~n~0)) (< (+ (* 4294967296 (div (+ main_~y~0 20) 4294967296)) main_~n~0) (+ main_~y~0 21 (* (div main_~n~0 4294967296) 4294967296)))) (< 0 (mod (+ 4294967276 main_~x~0) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1283#(or (and (<= (+ 19 main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ 19 main_~y~0) 4294967296) 4294967296) main_~n~0)) (< (+ (* (div (+ 19 main_~y~0) 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 20))) (< 0 (mod (+ main_~x~0 4294967277) 4294967296)))} is VALID [2022-04-27 10:23:47,538 INFO L290 TraceCheckUtils]: 7: Hoare triple {1291#(or (< 0 (mod (+ 4294967275 main_~x~0) 4294967296)) (and (< (+ main_~n~0 (* (div (+ main_~y~0 21) 4294967296) 4294967296)) (+ main_~y~0 22 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 21 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~y~0 21) 4294967296) 4294967296)))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1287#(or (and (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 20) (+ (* 4294967296 (div (+ main_~y~0 20) 4294967296)) main_~n~0)) (< (+ (* 4294967296 (div (+ main_~y~0 20) 4294967296)) main_~n~0) (+ main_~y~0 21 (* (div main_~n~0 4294967296) 4294967296)))) (< 0 (mod (+ 4294967276 main_~x~0) 4294967296)))} is VALID [2022-04-27 10:23:47,539 INFO L290 TraceCheckUtils]: 6: Hoare triple {1295#(or (< 0 (mod (+ 4294967274 main_~x~0) 4294967296)) (and (<= (+ main_~y~0 22 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~y~0 22) 4294967296) 4294967296) main_~n~0)) (< (+ (* (div (+ main_~y~0 22) 4294967296) 4294967296) main_~n~0) (+ 23 main_~y~0 (* (div main_~n~0 4294967296) 4294967296)))))} assume !!(~x~0 % 4294967296 > 0);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {1291#(or (< 0 (mod (+ 4294967275 main_~x~0) 4294967296)) (and (< (+ main_~n~0 (* (div (+ main_~y~0 21) 4294967296) 4294967296)) (+ main_~y~0 22 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 21 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~y~0 21) 4294967296) 4294967296)))))} is VALID [2022-04-27 10:23:47,540 INFO L290 TraceCheckUtils]: 5: Hoare triple {1040#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0; {1295#(or (< 0 (mod (+ 4294967274 main_~x~0) 4294967296)) (and (<= (+ main_~y~0 22 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~y~0 22) 4294967296) 4294967296) main_~n~0)) (< (+ (* (div (+ main_~y~0 22) 4294967296) 4294967296) main_~n~0) (+ 23 main_~y~0 (* (div main_~n~0 4294967296) 4294967296)))))} is VALID [2022-04-27 10:23:47,540 INFO L272 TraceCheckUtils]: 4: Hoare triple {1040#true} call #t~ret7 := main(); {1040#true} is VALID [2022-04-27 10:23:47,540 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1040#true} {1040#true} #36#return; {1040#true} is VALID [2022-04-27 10:23:47,540 INFO L290 TraceCheckUtils]: 2: Hoare triple {1040#true} assume true; {1040#true} is VALID [2022-04-27 10:23:47,541 INFO L290 TraceCheckUtils]: 1: Hoare triple {1040#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(18, 2);call #Ultimate.allocInit(12, 3); {1040#true} is VALID [2022-04-27 10:23:47,541 INFO L272 TraceCheckUtils]: 0: Hoare triple {1040#true} call ULTIMATE.init(); {1040#true} is VALID [2022-04-27 10:23:47,541 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:23:47,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1855504887] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:23:47,542 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:23:47,542 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 28, 28] total 76 [2022-04-27 10:23:47,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147235557] [2022-04-27 10:23:47,542 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:23:47,543 INFO L78 Accepts]: Start accepts. Automaton has has 76 states, 74 states have (on average 1.054054054054054) internal successors, (78), 73 states have internal predecessors, (78), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-04-27 10:23:47,543 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:23:47,544 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 76 states, 74 states have (on average 1.054054054054054) internal successors, (78), 73 states have internal predecessors, (78), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:23:50,742 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 84 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-27 10:23:50,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 76 states [2022-04-27 10:23:50,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:23:50,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2022-04-27 10:23:50,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1187, Invalid=4512, Unknown=1, NotChecked=0, Total=5700 [2022-04-27 10:23:50,746 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand has 76 states, 74 states have (on average 1.054054054054054) internal successors, (78), 73 states have internal predecessors, (78), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:23:53,519 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 10:23:58,775 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-27 10:24:01,273 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-27 10:24:17,859 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.91s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 10:24:20,980 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-27 10:24:22,695 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 10:28:23,376 WARN L232 SmtUtils]: Spent 2.30m on a formula simplification that was a NOOP. DAG size: 334 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 10:28:29,386 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 10:28:32,637 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 10:28:33,982 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 10:28:39,344 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-27 10:28:44,972 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 10:28:49,334 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-27 10:28:51,353 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 10:28:55,266 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers []