/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/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/loops-crafted-1/in-de31.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 10:03:27,438 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 10:03:27,439 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 10:03:27,471 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 10:03:27,471 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 10:03:27,472 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 10:03:27,473 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 10:03:27,474 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 10:03:27,475 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 10:03:27,475 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 10:03:27,476 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 10:03:27,477 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 10:03:27,477 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 10:03:27,485 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 10:03:27,486 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 10:03:27,486 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 10:03:27,487 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 10:03:27,487 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 10:03:27,488 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 10:03:27,489 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 10:03:27,490 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 10:03:27,493 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 10:03:27,494 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 10:03:27,496 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 10:03:27,498 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 10:03:27,500 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 10:03:27,500 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 10:03:27,500 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 10:03:27,500 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 10:03:27,501 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 10:03:27,501 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 10:03:27,501 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 10:03:27,502 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 10:03:27,502 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 10:03:27,502 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 10:03:27,503 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 10:03:27,503 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 10:03:27,503 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 10:03:27,503 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 10:03:27,504 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 10:03:27,504 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 10:03:27,505 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 10:03:27,505 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-28 10:03:27,510 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 10:03:27,510 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 10:03:27,511 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 10:03:27,511 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 10:03:27,511 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 10:03:27,512 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 10:03:27,512 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 10:03:27,512 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 10:03:27,512 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 10:03:27,512 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 10:03:27,512 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 10:03:27,512 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 10:03:27,512 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 10:03:27,513 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 10:03:27,513 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 10:03:27,513 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 10:03:27,513 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 10:03:27,513 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 10:03:27,513 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 10:03:27,513 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 10:03:27,513 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 10:03:27,513 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 10:03:27,514 INFO L138 SettingsManager]: * Use separate solver for trace checks=false 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-28 10:03:27,666 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 10:03:27,692 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 10:03:27,693 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 10:03:27,694 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 10:03:27,695 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 10:03:27,696 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/in-de31.c [2022-04-28 10:03:27,731 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ffbf95ce/28fcef502dfb4ca2b5fc2d76d1bcf1f5/FLAG17241b43e [2022-04-28 10:03:28,068 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 10:03:28,068 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/in-de31.c [2022-04-28 10:03:28,072 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ffbf95ce/28fcef502dfb4ca2b5fc2d76d1bcf1f5/FLAG17241b43e [2022-04-28 10:03:28,516 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ffbf95ce/28fcef502dfb4ca2b5fc2d76d1bcf1f5 [2022-04-28 10:03:28,519 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 10:03:28,521 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 10:03:28,523 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 10:03:28,523 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 10:03:28,526 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 10:03:28,526 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 10:03:28" (1/1) ... [2022-04-28 10:03:28,527 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cf358e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:03:28, skipping insertion in model container [2022-04-28 10:03:28,527 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 10:03:28" (1/1) ... [2022-04-28 10:03:28,531 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 10:03:28,541 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 10:03:28,636 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/in-de31.c[368,381] [2022-04-28 10:03:28,653 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 10:03:28,663 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 10:03:28,670 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/in-de31.c[368,381] [2022-04-28 10:03:28,673 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 10:03:28,680 INFO L208 MainTranslator]: Completed translation [2022-04-28 10:03:28,680 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:03:28 WrapperNode [2022-04-28 10:03:28,681 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 10:03:28,681 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 10:03:28,681 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 10:03:28,681 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 10:03:28,687 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:03:28" (1/1) ... [2022-04-28 10:03:28,688 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:03:28" (1/1) ... [2022-04-28 10:03:28,691 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:03:28" (1/1) ... [2022-04-28 10:03:28,691 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:03:28" (1/1) ... [2022-04-28 10:03:28,694 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:03:28" (1/1) ... [2022-04-28 10:03:28,698 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:03:28" (1/1) ... [2022-04-28 10:03:28,698 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:03:28" (1/1) ... [2022-04-28 10:03:28,699 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 10:03:28,700 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 10:03:28,700 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 10:03:28,700 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 10:03:28,701 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:03:28" (1/1) ... [2022-04-28 10:03:28,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 10:03:28,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:03:28,720 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-28 10:03:28,739 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-28 10:03:28,752 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 10:03:28,752 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 10:03:28,752 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 10:03:28,752 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 10:03:28,752 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 10:03:28,753 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 10:03:28,753 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 10:03:28,753 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 10:03:28,753 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 10:03:28,753 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-28 10:03:28,753 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 10:03:28,753 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 10:03:28,754 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 10:03:28,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 10:03:28,754 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 10:03:28,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 10:03:28,754 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 10:03:28,754 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 10:03:28,798 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 10:03:28,799 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 10:03:28,892 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 10:03:28,896 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 10:03:28,896 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-04-28 10:03:28,897 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 10:03:28 BoogieIcfgContainer [2022-04-28 10:03:28,898 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 10:03:28,899 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 10:03:28,899 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 10:03:28,901 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 10:03:28,901 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 10:03:28" (1/3) ... [2022-04-28 10:03:28,902 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@179a6056 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 10:03:28, skipping insertion in model container [2022-04-28 10:03:28,902 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:03:28" (2/3) ... [2022-04-28 10:03:28,902 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@179a6056 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 10:03:28, skipping insertion in model container [2022-04-28 10:03:28,902 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 10:03:28" (3/3) ... [2022-04-28 10:03:28,903 INFO L111 eAbstractionObserver]: Analyzing ICFG in-de31.c [2022-04-28 10:03:28,911 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 10:03:28,912 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 10:03:28,937 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 10:03:28,942 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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@5e193554, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@c806ef4 [2022-04-28 10:03:28,942 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 10:03:28,947 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 15 states have internal predecessors, (22), 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-28 10:03:28,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-28 10:03:28,952 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:03:28,952 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:03:28,952 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:03:28,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:03:28,956 INFO L85 PathProgramCache]: Analyzing trace with hash 1792812365, now seen corresponding path program 1 times [2022-04-28 10:03:28,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:03:28,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [846004468] [2022-04-28 10:03:28,968 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 10:03:28,969 INFO L85 PathProgramCache]: Analyzing trace with hash 1792812365, now seen corresponding path program 2 times [2022-04-28 10:03:28,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:03:28,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492900902] [2022-04-28 10:03:28,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:03:28,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:03:29,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:03:29,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:03:29,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:03:29,430 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#(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(10, 2);call #Ultimate.allocInit(12, 3); {25#true} is VALID [2022-04-28 10:03:29,430 INFO L290 TraceCheckUtils]: 1: Hoare triple {25#true} assume true; {25#true} is VALID [2022-04-28 10:03:29,430 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25#true} {25#true} #61#return; {25#true} is VALID [2022-04-28 10:03:29,432 INFO L272 TraceCheckUtils]: 0: Hoare triple {25#true} call ULTIMATE.init(); {35#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:03:29,432 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#(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(10, 2);call #Ultimate.allocInit(12, 3); {25#true} is VALID [2022-04-28 10:03:29,432 INFO L290 TraceCheckUtils]: 2: Hoare triple {25#true} assume true; {25#true} is VALID [2022-04-28 10:03:29,432 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25#true} {25#true} #61#return; {25#true} is VALID [2022-04-28 10:03:29,433 INFO L272 TraceCheckUtils]: 4: Hoare triple {25#true} call #t~ret11 := main(); {25#true} is VALID [2022-04-28 10:03:29,433 INFO L290 TraceCheckUtils]: 5: Hoare triple {25#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {30#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-28 10:03:29,434 INFO L290 TraceCheckUtils]: 6: Hoare triple {30#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} assume !(~x~0 % 4294967296 > 0); {31#(and (<= main_~n~0 (* (div main_~n~0 4294967296) 4294967296)) (= main_~y~0 0))} is VALID [2022-04-28 10:03:29,435 INFO L290 TraceCheckUtils]: 7: Hoare triple {31#(and (<= main_~n~0 (* (div main_~n~0 4294967296) 4294967296)) (= main_~y~0 0))} ~z~0 := ~y~0; {32#(and (= main_~z~0 0) (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-28 10:03:29,438 INFO L290 TraceCheckUtils]: 8: Hoare triple {32#(and (= main_~z~0 0) (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !(~z~0 % 4294967296 > 0); {32#(and (= main_~z~0 0) (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-28 10:03:29,439 INFO L290 TraceCheckUtils]: 9: Hoare triple {32#(and (= main_~z~0 0) (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !(~y~0 % 4294967296 > 0); {32#(and (= main_~z~0 0) (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-28 10:03:29,440 INFO L272 TraceCheckUtils]: 10: Hoare triple {32#(and (= main_~z~0 0) (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {33#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:03:29,441 INFO L290 TraceCheckUtils]: 11: Hoare triple {33#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {34#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 10:03:29,441 INFO L290 TraceCheckUtils]: 12: Hoare triple {34#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {26#false} is VALID [2022-04-28 10:03:29,441 INFO L290 TraceCheckUtils]: 13: Hoare triple {26#false} assume !false; {26#false} is VALID [2022-04-28 10:03:29,442 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-28 10:03:29,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:03:29,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492900902] [2022-04-28 10:03:29,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492900902] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:03:29,443 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:03:29,443 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 10:03:29,445 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:03:29,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [846004468] [2022-04-28 10:03:29,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [846004468] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:03:29,446 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:03:29,446 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 10:03:29,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862448701] [2022-04-28 10:03:29,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:03:29,451 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.25) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-28 10:03:29,452 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:03:29,454 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 1.25) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:03:29,473 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:03:29,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 10:03:29,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:03:29,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 10:03:29,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-04-28 10:03:29,497 INFO L87 Difference]: Start difference. First operand has 22 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 15 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 8 states, 8 states have (on average 1.25) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:03:29,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:03:29,900 INFO L93 Difference]: Finished difference Result 49 states and 68 transitions. [2022-04-28 10:03:29,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 10:03:29,901 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.25) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-28 10:03:29,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:03:29,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.25) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:03:29,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 68 transitions. [2022-04-28 10:03:29,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.25) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:03:29,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 68 transitions. [2022-04-28 10:03:29,909 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 68 transitions. [2022-04-28 10:03:29,957 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:03:29,962 INFO L225 Difference]: With dead ends: 49 [2022-04-28 10:03:29,962 INFO L226 Difference]: Without dead ends: 16 [2022-04-28 10:03:29,964 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2022-04-28 10:03:29,966 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 43 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:03:29,967 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 49 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 10:03:29,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-04-28 10:03:29,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-04-28 10:03:29,984 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:03:29,985 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 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-28 10:03:29,985 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 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-28 10:03:29,985 INFO L87 Difference]: Start difference. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 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-28 10:03:29,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:03:29,989 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2022-04-28 10:03:29,989 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2022-04-28 10:03:29,989 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:03:29,989 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:03:29,990 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 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-28 10:03:29,991 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 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-28 10:03:29,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:03:29,993 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2022-04-28 10:03:29,993 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2022-04-28 10:03:29,993 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:03:29,993 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:03:29,993 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:03:29,993 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:03:29,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 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-28 10:03:29,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2022-04-28 10:03:29,999 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 14 [2022-04-28 10:03:30,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:03:30,000 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2022-04-28 10:03:30,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.25) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:03:30,001 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 18 transitions. [2022-04-28 10:03:30,014 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:03:30,015 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2022-04-28 10:03:30,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-28 10:03:30,018 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:03:30,022 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:03:30,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 10:03:30,022 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:03:30,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:03:30,024 INFO L85 PathProgramCache]: Analyzing trace with hash 595464366, now seen corresponding path program 1 times [2022-04-28 10:03:30,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:03:30,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2006460073] [2022-04-28 10:03:30,041 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:03:30,042 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:03:30,042 INFO L85 PathProgramCache]: Analyzing trace with hash 595464366, now seen corresponding path program 2 times [2022-04-28 10:03:30,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:03:30,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372461320] [2022-04-28 10:03:30,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:03:30,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:03:30,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:03:30,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:03:30,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:03:30,159 INFO L290 TraceCheckUtils]: 0: Hoare triple {220#(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(10, 2);call #Ultimate.allocInit(12, 3); {212#true} is VALID [2022-04-28 10:03:30,159 INFO L290 TraceCheckUtils]: 1: Hoare triple {212#true} assume true; {212#true} is VALID [2022-04-28 10:03:30,161 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {212#true} {212#true} #61#return; {212#true} is VALID [2022-04-28 10:03:30,162 INFO L272 TraceCheckUtils]: 0: Hoare triple {212#true} call ULTIMATE.init(); {220#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:03:30,162 INFO L290 TraceCheckUtils]: 1: Hoare triple {220#(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(10, 2);call #Ultimate.allocInit(12, 3); {212#true} is VALID [2022-04-28 10:03:30,162 INFO L290 TraceCheckUtils]: 2: Hoare triple {212#true} assume true; {212#true} is VALID [2022-04-28 10:03:30,162 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {212#true} {212#true} #61#return; {212#true} is VALID [2022-04-28 10:03:30,163 INFO L272 TraceCheckUtils]: 4: Hoare triple {212#true} call #t~ret11 := main(); {212#true} is VALID [2022-04-28 10:03:30,163 INFO L290 TraceCheckUtils]: 5: Hoare triple {212#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {217#(= main_~y~0 0)} is VALID [2022-04-28 10:03:30,163 INFO L290 TraceCheckUtils]: 6: Hoare triple {217#(= 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; {218#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:03:30,164 INFO L290 TraceCheckUtils]: 7: Hoare triple {218#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !(~x~0 % 4294967296 > 0); {218#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:03:30,164 INFO L290 TraceCheckUtils]: 8: Hoare triple {218#(and (<= 1 main_~y~0) (<= main_~y~0 1))} ~z~0 := ~y~0; {219#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-28 10:03:30,165 INFO L290 TraceCheckUtils]: 9: Hoare triple {219#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {213#false} is VALID [2022-04-28 10:03:30,165 INFO L290 TraceCheckUtils]: 10: Hoare triple {213#false} assume !(~y~0 % 4294967296 > 0); {213#false} is VALID [2022-04-28 10:03:30,165 INFO L272 TraceCheckUtils]: 11: Hoare triple {213#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {213#false} is VALID [2022-04-28 10:03:30,165 INFO L290 TraceCheckUtils]: 12: Hoare triple {213#false} ~cond := #in~cond; {213#false} is VALID [2022-04-28 10:03:30,165 INFO L290 TraceCheckUtils]: 13: Hoare triple {213#false} assume 0 == ~cond; {213#false} is VALID [2022-04-28 10:03:30,165 INFO L290 TraceCheckUtils]: 14: Hoare triple {213#false} assume !false; {213#false} is VALID [2022-04-28 10:03:30,166 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-28 10:03:30,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:03:30,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372461320] [2022-04-28 10:03:30,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372461320] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:03:30,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1966481037] [2022-04-28 10:03:30,167 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:03:30,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:03:30,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:03:30,168 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-28 10:03:30,170 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-28 10:03:30,216 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:03:30,217 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:03:30,232 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 10:03:30,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:03:30,238 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:03:30,449 INFO L272 TraceCheckUtils]: 0: Hoare triple {212#true} call ULTIMATE.init(); {212#true} is VALID [2022-04-28 10:03:30,449 INFO L290 TraceCheckUtils]: 1: Hoare triple {212#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(10, 2);call #Ultimate.allocInit(12, 3); {212#true} is VALID [2022-04-28 10:03:30,450 INFO L290 TraceCheckUtils]: 2: Hoare triple {212#true} assume true; {212#true} is VALID [2022-04-28 10:03:30,450 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {212#true} {212#true} #61#return; {212#true} is VALID [2022-04-28 10:03:30,450 INFO L272 TraceCheckUtils]: 4: Hoare triple {212#true} call #t~ret11 := main(); {212#true} is VALID [2022-04-28 10:03:30,450 INFO L290 TraceCheckUtils]: 5: Hoare triple {212#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {217#(= main_~y~0 0)} is VALID [2022-04-28 10:03:30,451 INFO L290 TraceCheckUtils]: 6: Hoare triple {217#(= 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; {218#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:03:30,451 INFO L290 TraceCheckUtils]: 7: Hoare triple {218#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !(~x~0 % 4294967296 > 0); {218#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:03:30,452 INFO L290 TraceCheckUtils]: 8: Hoare triple {218#(and (<= 1 main_~y~0) (<= main_~y~0 1))} ~z~0 := ~y~0; {248#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-28 10:03:30,452 INFO L290 TraceCheckUtils]: 9: Hoare triple {248#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {213#false} is VALID [2022-04-28 10:03:30,453 INFO L290 TraceCheckUtils]: 10: Hoare triple {213#false} assume !(~y~0 % 4294967296 > 0); {213#false} is VALID [2022-04-28 10:03:30,453 INFO L272 TraceCheckUtils]: 11: Hoare triple {213#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {213#false} is VALID [2022-04-28 10:03:30,453 INFO L290 TraceCheckUtils]: 12: Hoare triple {213#false} ~cond := #in~cond; {213#false} is VALID [2022-04-28 10:03:30,453 INFO L290 TraceCheckUtils]: 13: Hoare triple {213#false} assume 0 == ~cond; {213#false} is VALID [2022-04-28 10:03:30,453 INFO L290 TraceCheckUtils]: 14: Hoare triple {213#false} assume !false; {213#false} is VALID [2022-04-28 10:03:30,453 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-28 10:03:30,453 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:03:30,524 INFO L290 TraceCheckUtils]: 14: Hoare triple {213#false} assume !false; {213#false} is VALID [2022-04-28 10:03:30,524 INFO L290 TraceCheckUtils]: 13: Hoare triple {213#false} assume 0 == ~cond; {213#false} is VALID [2022-04-28 10:03:30,524 INFO L290 TraceCheckUtils]: 12: Hoare triple {213#false} ~cond := #in~cond; {213#false} is VALID [2022-04-28 10:03:30,524 INFO L272 TraceCheckUtils]: 11: Hoare triple {213#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {213#false} is VALID [2022-04-28 10:03:30,524 INFO L290 TraceCheckUtils]: 10: Hoare triple {213#false} assume !(~y~0 % 4294967296 > 0); {213#false} is VALID [2022-04-28 10:03:30,525 INFO L290 TraceCheckUtils]: 9: Hoare triple {282#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {213#false} is VALID [2022-04-28 10:03:30,526 INFO L290 TraceCheckUtils]: 8: Hoare triple {286#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {282#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:03:30,526 INFO L290 TraceCheckUtils]: 7: Hoare triple {286#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {286#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:03:30,527 INFO L290 TraceCheckUtils]: 6: Hoare triple {293#(< 0 (mod (+ main_~y~0 1) 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; {286#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:03:30,528 INFO L290 TraceCheckUtils]: 5: Hoare triple {212#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {293#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:03:30,528 INFO L272 TraceCheckUtils]: 4: Hoare triple {212#true} call #t~ret11 := main(); {212#true} is VALID [2022-04-28 10:03:30,528 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {212#true} {212#true} #61#return; {212#true} is VALID [2022-04-28 10:03:30,528 INFO L290 TraceCheckUtils]: 2: Hoare triple {212#true} assume true; {212#true} is VALID [2022-04-28 10:03:30,528 INFO L290 TraceCheckUtils]: 1: Hoare triple {212#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(10, 2);call #Ultimate.allocInit(12, 3); {212#true} is VALID [2022-04-28 10:03:30,528 INFO L272 TraceCheckUtils]: 0: Hoare triple {212#true} call ULTIMATE.init(); {212#true} is VALID [2022-04-28 10:03:30,528 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-28 10:03:30,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1966481037] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:03:30,529 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:03:30,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2022-04-28 10:03:30,529 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:03:30,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2006460073] [2022-04-28 10:03:30,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2006460073] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:03:30,530 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:03:30,530 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 10:03:30,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457388052] [2022-04-28 10:03:30,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:03:30,530 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 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 15 [2022-04-28 10:03:30,531 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:03:30,531 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 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-28 10:03:30,541 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:03:30,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 10:03:30,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:03:30,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 10:03:30,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-28 10:03:30,542 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 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-28 10:03:30,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:03:30,692 INFO L93 Difference]: Finished difference Result 29 states and 36 transitions. [2022-04-28 10:03:30,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 10:03:30,692 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 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 15 [2022-04-28 10:03:30,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:03:30,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 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-28 10:03:30,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 36 transitions. [2022-04-28 10:03:30,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 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-28 10:03:30,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 36 transitions. [2022-04-28 10:03:30,695 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 36 transitions. [2022-04-28 10:03:30,724 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:03:30,725 INFO L225 Difference]: With dead ends: 29 [2022-04-28 10:03:30,725 INFO L226 Difference]: Without dead ends: 23 [2022-04-28 10:03:30,725 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2022-04-28 10:03:30,726 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 19 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:03:30,726 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 31 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 10:03:30,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-28 10:03:30,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2022-04-28 10:03:30,737 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:03:30,737 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 22 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 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-28 10:03:30,737 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 22 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 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-28 10:03:30,737 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 22 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 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-28 10:03:30,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:03:30,739 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2022-04-28 10:03:30,739 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-04-28 10:03:30,739 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:03:30,739 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:03:30,739 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 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 23 states. [2022-04-28 10:03:30,739 INFO L87 Difference]: Start difference. First operand has 22 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 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 23 states. [2022-04-28 10:03:30,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:03:30,740 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2022-04-28 10:03:30,741 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-04-28 10:03:30,741 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:03:30,741 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:03:30,741 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:03:30,741 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:03:30,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 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-28 10:03:30,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2022-04-28 10:03:30,742 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 15 [2022-04-28 10:03:30,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:03:30,742 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2022-04-28 10:03:30,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 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-28 10:03:30,743 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 26 transitions. [2022-04-28 10:03:30,763 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:03:30,763 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2022-04-28 10:03:30,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-28 10:03:30,763 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:03:30,763 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:03:30,789 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-28 10:03:30,980 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-28 10:03:30,980 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:03:30,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:03:30,981 INFO L85 PathProgramCache]: Analyzing trace with hash 2132382061, now seen corresponding path program 3 times [2022-04-28 10:03:30,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:03:30,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1886649870] [2022-04-28 10:03:30,985 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:03:30,985 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:03:30,985 INFO L85 PathProgramCache]: Analyzing trace with hash 2132382061, now seen corresponding path program 4 times [2022-04-28 10:03:30,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:03:30,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750976819] [2022-04-28 10:03:30,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:03:30,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:03:31,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:03:31,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:03:31,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:03:31,087 INFO L290 TraceCheckUtils]: 0: Hoare triple {477#(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(10, 2);call #Ultimate.allocInit(12, 3); {468#true} is VALID [2022-04-28 10:03:31,087 INFO L290 TraceCheckUtils]: 1: Hoare triple {468#true} assume true; {468#true} is VALID [2022-04-28 10:03:31,088 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {468#true} {468#true} #61#return; {468#true} is VALID [2022-04-28 10:03:31,088 INFO L272 TraceCheckUtils]: 0: Hoare triple {468#true} call ULTIMATE.init(); {477#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:03:31,088 INFO L290 TraceCheckUtils]: 1: Hoare triple {477#(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(10, 2);call #Ultimate.allocInit(12, 3); {468#true} is VALID [2022-04-28 10:03:31,088 INFO L290 TraceCheckUtils]: 2: Hoare triple {468#true} assume true; {468#true} is VALID [2022-04-28 10:03:31,088 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {468#true} {468#true} #61#return; {468#true} is VALID [2022-04-28 10:03:31,089 INFO L272 TraceCheckUtils]: 4: Hoare triple {468#true} call #t~ret11 := main(); {468#true} is VALID [2022-04-28 10:03:31,089 INFO L290 TraceCheckUtils]: 5: Hoare triple {468#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {473#(= main_~y~0 0)} is VALID [2022-04-28 10:03:31,089 INFO L290 TraceCheckUtils]: 6: Hoare triple {473#(= 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; {474#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:03:31,090 INFO L290 TraceCheckUtils]: 7: Hoare triple {474#(and (<= 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; {475#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:03:31,090 INFO L290 TraceCheckUtils]: 8: Hoare triple {475#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !(~x~0 % 4294967296 > 0); {475#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:03:31,091 INFO L290 TraceCheckUtils]: 9: Hoare triple {475#(and (<= 2 main_~y~0) (<= main_~y~0 2))} ~z~0 := ~y~0; {476#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} is VALID [2022-04-28 10:03:31,091 INFO L290 TraceCheckUtils]: 10: Hoare triple {476#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {469#false} is VALID [2022-04-28 10:03:31,091 INFO L290 TraceCheckUtils]: 11: Hoare triple {469#false} assume !(~y~0 % 4294967296 > 0); {469#false} is VALID [2022-04-28 10:03:31,091 INFO L272 TraceCheckUtils]: 12: Hoare triple {469#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {469#false} is VALID [2022-04-28 10:03:31,091 INFO L290 TraceCheckUtils]: 13: Hoare triple {469#false} ~cond := #in~cond; {469#false} is VALID [2022-04-28 10:03:31,092 INFO L290 TraceCheckUtils]: 14: Hoare triple {469#false} assume 0 == ~cond; {469#false} is VALID [2022-04-28 10:03:31,092 INFO L290 TraceCheckUtils]: 15: Hoare triple {469#false} assume !false; {469#false} is VALID [2022-04-28 10:03:31,092 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:03:31,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:03:31,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750976819] [2022-04-28 10:03:31,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750976819] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:03:31,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [596632724] [2022-04-28 10:03:31,092 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:03:31,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:03:31,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:03:31,093 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-28 10:03:31,094 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-28 10:03:31,120 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:03:31,121 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:03:31,121 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 10:03:31,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:03:31,127 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:03:31,288 INFO L272 TraceCheckUtils]: 0: Hoare triple {468#true} call ULTIMATE.init(); {468#true} is VALID [2022-04-28 10:03:31,289 INFO L290 TraceCheckUtils]: 1: Hoare triple {468#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(10, 2);call #Ultimate.allocInit(12, 3); {468#true} is VALID [2022-04-28 10:03:31,289 INFO L290 TraceCheckUtils]: 2: Hoare triple {468#true} assume true; {468#true} is VALID [2022-04-28 10:03:31,289 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {468#true} {468#true} #61#return; {468#true} is VALID [2022-04-28 10:03:31,289 INFO L272 TraceCheckUtils]: 4: Hoare triple {468#true} call #t~ret11 := main(); {468#true} is VALID [2022-04-28 10:03:31,289 INFO L290 TraceCheckUtils]: 5: Hoare triple {468#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {473#(= main_~y~0 0)} is VALID [2022-04-28 10:03:31,290 INFO L290 TraceCheckUtils]: 6: Hoare triple {473#(= 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; {474#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:03:31,290 INFO L290 TraceCheckUtils]: 7: Hoare triple {474#(and (<= 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; {475#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:03:31,291 INFO L290 TraceCheckUtils]: 8: Hoare triple {475#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !(~x~0 % 4294967296 > 0); {475#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:03:31,291 INFO L290 TraceCheckUtils]: 9: Hoare triple {475#(and (<= 2 main_~y~0) (<= main_~y~0 2))} ~z~0 := ~y~0; {508#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-28 10:03:31,292 INFO L290 TraceCheckUtils]: 10: Hoare triple {508#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {469#false} is VALID [2022-04-28 10:03:31,292 INFO L290 TraceCheckUtils]: 11: Hoare triple {469#false} assume !(~y~0 % 4294967296 > 0); {469#false} is VALID [2022-04-28 10:03:31,292 INFO L272 TraceCheckUtils]: 12: Hoare triple {469#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {469#false} is VALID [2022-04-28 10:03:31,292 INFO L290 TraceCheckUtils]: 13: Hoare triple {469#false} ~cond := #in~cond; {469#false} is VALID [2022-04-28 10:03:31,292 INFO L290 TraceCheckUtils]: 14: Hoare triple {469#false} assume 0 == ~cond; {469#false} is VALID [2022-04-28 10:03:31,292 INFO L290 TraceCheckUtils]: 15: Hoare triple {469#false} assume !false; {469#false} is VALID [2022-04-28 10:03:31,292 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:03:31,292 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:03:31,372 INFO L290 TraceCheckUtils]: 15: Hoare triple {469#false} assume !false; {469#false} is VALID [2022-04-28 10:03:31,372 INFO L290 TraceCheckUtils]: 14: Hoare triple {469#false} assume 0 == ~cond; {469#false} is VALID [2022-04-28 10:03:31,373 INFO L290 TraceCheckUtils]: 13: Hoare triple {469#false} ~cond := #in~cond; {469#false} is VALID [2022-04-28 10:03:31,373 INFO L272 TraceCheckUtils]: 12: Hoare triple {469#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {469#false} is VALID [2022-04-28 10:03:31,373 INFO L290 TraceCheckUtils]: 11: Hoare triple {469#false} assume !(~y~0 % 4294967296 > 0); {469#false} is VALID [2022-04-28 10:03:31,374 INFO L290 TraceCheckUtils]: 10: Hoare triple {542#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {469#false} is VALID [2022-04-28 10:03:31,375 INFO L290 TraceCheckUtils]: 9: Hoare triple {546#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {542#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:03:31,375 INFO L290 TraceCheckUtils]: 8: Hoare triple {546#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {546#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:03:31,376 INFO L290 TraceCheckUtils]: 7: Hoare triple {553#(< 0 (mod (+ main_~y~0 1) 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; {546#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:03:31,376 INFO L290 TraceCheckUtils]: 6: Hoare triple {557#(< 0 (mod (+ main_~y~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; {553#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:03:31,377 INFO L290 TraceCheckUtils]: 5: Hoare triple {468#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {557#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:03:31,377 INFO L272 TraceCheckUtils]: 4: Hoare triple {468#true} call #t~ret11 := main(); {468#true} is VALID [2022-04-28 10:03:31,377 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {468#true} {468#true} #61#return; {468#true} is VALID [2022-04-28 10:03:31,377 INFO L290 TraceCheckUtils]: 2: Hoare triple {468#true} assume true; {468#true} is VALID [2022-04-28 10:03:31,377 INFO L290 TraceCheckUtils]: 1: Hoare triple {468#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(10, 2);call #Ultimate.allocInit(12, 3); {468#true} is VALID [2022-04-28 10:03:31,377 INFO L272 TraceCheckUtils]: 0: Hoare triple {468#true} call ULTIMATE.init(); {468#true} is VALID [2022-04-28 10:03:31,377 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:03:31,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [596632724] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:03:31,378 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:03:31,378 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 12 [2022-04-28 10:03:31,378 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:03:31,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1886649870] [2022-04-28 10:03:31,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1886649870] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:03:31,378 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:03:31,378 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 10:03:31,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976088261] [2022-04-28 10:03:31,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:03:31,379 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 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 16 [2022-04-28 10:03:31,379 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:03:31,379 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 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-28 10:03:31,390 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:03:31,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 10:03:31,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:03:31,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 10:03:31,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-04-28 10:03:31,391 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 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-28 10:03:31,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:03:31,596 INFO L93 Difference]: Finished difference Result 36 states and 46 transitions. [2022-04-28 10:03:31,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 10:03:31,596 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 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 16 [2022-04-28 10:03:31,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:03:31,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 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-28 10:03:31,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 43 transitions. [2022-04-28 10:03:31,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 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-28 10:03:31,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 43 transitions. [2022-04-28 10:03:31,598 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 43 transitions. [2022-04-28 10:03:31,640 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:03:31,641 INFO L225 Difference]: With dead ends: 36 [2022-04-28 10:03:31,641 INFO L226 Difference]: Without dead ends: 30 [2022-04-28 10:03:31,642 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2022-04-28 10:03:31,642 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 28 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:03:31,643 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 37 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 10:03:31,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-28 10:03:31,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2022-04-28 10:03:31,658 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:03:31,658 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 27 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 22 states have internal predecessors, (29), 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-28 10:03:31,658 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 27 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 22 states have internal predecessors, (29), 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-28 10:03:31,658 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 27 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 22 states have internal predecessors, (29), 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-28 10:03:31,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:03:31,659 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2022-04-28 10:03:31,660 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-04-28 10:03:31,660 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:03:31,660 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:03:31,660 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 22 states have internal predecessors, (29), 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 30 states. [2022-04-28 10:03:31,660 INFO L87 Difference]: Start difference. First operand has 27 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 22 states have internal predecessors, (29), 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 30 states. [2022-04-28 10:03:31,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:03:31,661 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2022-04-28 10:03:31,661 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-04-28 10:03:31,661 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:03:31,661 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:03:31,662 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:03:31,662 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:03:31,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 22 states have internal predecessors, (29), 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-28 10:03:31,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2022-04-28 10:03:31,663 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 16 [2022-04-28 10:03:31,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:03:31,663 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2022-04-28 10:03:31,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 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-28 10:03:31,663 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 33 transitions. [2022-04-28 10:03:31,691 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:03:31,691 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2022-04-28 10:03:31,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 10:03:31,692 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:03:31,692 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:03:31,709 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-28 10:03:31,892 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-28 10:03:31,892 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:03:31,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:03:31,893 INFO L85 PathProgramCache]: Analyzing trace with hash -1642511809, now seen corresponding path program 1 times [2022-04-28 10:03:31,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:03:31,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1607311507] [2022-04-28 10:03:31,897 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:03:31,897 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:03:31,897 INFO L85 PathProgramCache]: Analyzing trace with hash -1642511809, now seen corresponding path program 2 times [2022-04-28 10:03:31,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:03:31,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109726632] [2022-04-28 10:03:31,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:03:31,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:03:31,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:03:32,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:03:32,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:03:32,163 INFO L290 TraceCheckUtils]: 0: Hoare triple {785#(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(10, 2);call #Ultimate.allocInit(12, 3); {772#true} is VALID [2022-04-28 10:03:32,163 INFO L290 TraceCheckUtils]: 1: Hoare triple {772#true} assume true; {772#true} is VALID [2022-04-28 10:03:32,163 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {772#true} {772#true} #61#return; {772#true} is VALID [2022-04-28 10:03:32,165 INFO L272 TraceCheckUtils]: 0: Hoare triple {772#true} call ULTIMATE.init(); {785#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:03:32,165 INFO L290 TraceCheckUtils]: 1: Hoare triple {785#(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(10, 2);call #Ultimate.allocInit(12, 3); {772#true} is VALID [2022-04-28 10:03:32,165 INFO L290 TraceCheckUtils]: 2: Hoare triple {772#true} assume true; {772#true} is VALID [2022-04-28 10:03:32,165 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {772#true} {772#true} #61#return; {772#true} is VALID [2022-04-28 10:03:32,165 INFO L272 TraceCheckUtils]: 4: Hoare triple {772#true} call #t~ret11 := main(); {772#true} is VALID [2022-04-28 10:03:32,174 INFO L290 TraceCheckUtils]: 5: Hoare triple {772#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {777#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-28 10:03:32,176 INFO L290 TraceCheckUtils]: 6: Hoare triple {777#(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; {778#(and (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~x~0) (* (- 1) main_~y~0) (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296) main_~y~0) main_~n~0) (<= (+ (* (div main_~n~0 4294967296) 4294967296) 1) (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0)))} is VALID [2022-04-28 10:03:32,177 INFO L290 TraceCheckUtils]: 7: Hoare triple {778#(and (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~x~0) (* (- 1) main_~y~0) (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296) main_~y~0) main_~n~0) (<= (+ (* (div main_~n~0 4294967296) 4294967296) 1) (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0)))} assume !(~x~0 % 4294967296 > 0); {779#(and (<= (+ (* (div main_~n~0 4294967296) 4294967296) 1) (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0)) (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0) main_~n~0))} is VALID [2022-04-28 10:03:32,178 INFO L290 TraceCheckUtils]: 8: Hoare triple {779#(and (<= (+ (* (div main_~n~0 4294967296) 4294967296) 1) (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0)) (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0) main_~n~0))} ~z~0 := ~y~0; {780#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) main_~z~0) main_~n~0) (<= (+ (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~z~0 (* (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296))))} is VALID [2022-04-28 10:03:32,181 INFO L290 TraceCheckUtils]: 9: Hoare triple {780#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) main_~z~0) main_~n~0) (<= (+ (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~z~0 (* (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {781#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) main_~z~0 1) main_~n~0) (<= (* (div main_~n~0 4294967296) 4294967296) (+ main_~z~0 (* (div (+ (- 1) main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296))))} is VALID [2022-04-28 10:03:32,181 INFO L290 TraceCheckUtils]: 10: Hoare triple {781#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) main_~z~0 1) main_~n~0) (<= (* (div main_~n~0 4294967296) 4294967296) (+ main_~z~0 (* (div (+ (- 1) main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {781#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) main_~z~0 1) main_~n~0) (<= (* (div main_~n~0 4294967296) 4294967296) (+ main_~z~0 (* (div (+ (- 1) main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296))))} is VALID [2022-04-28 10:03:32,183 INFO L290 TraceCheckUtils]: 11: Hoare triple {781#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) main_~z~0 1) main_~n~0) (<= (* (div main_~n~0 4294967296) 4294967296) (+ main_~z~0 (* (div (+ (- 1) main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {782#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-28 10:03:32,184 INFO L290 TraceCheckUtils]: 12: Hoare triple {782#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {782#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-28 10:03:32,185 INFO L272 TraceCheckUtils]: 13: Hoare triple {782#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {783#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:03:32,185 INFO L290 TraceCheckUtils]: 14: Hoare triple {783#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {784#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 10:03:32,186 INFO L290 TraceCheckUtils]: 15: Hoare triple {784#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {773#false} is VALID [2022-04-28 10:03:32,186 INFO L290 TraceCheckUtils]: 16: Hoare triple {773#false} assume !false; {773#false} is VALID [2022-04-28 10:03:32,186 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:03:32,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:03:32,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109726632] [2022-04-28 10:03:32,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109726632] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:03:32,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [59365801] [2022-04-28 10:03:32,186 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:03:32,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:03:32,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:03:32,187 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-28 10:03:32,188 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-28 10:03:32,217 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:03:32,218 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:03:32,218 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-28 10:03:32,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:03:32,225 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:03:32,588 INFO L272 TraceCheckUtils]: 0: Hoare triple {772#true} call ULTIMATE.init(); {772#true} is VALID [2022-04-28 10:03:32,588 INFO L290 TraceCheckUtils]: 1: Hoare triple {772#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(10, 2);call #Ultimate.allocInit(12, 3); {772#true} is VALID [2022-04-28 10:03:32,588 INFO L290 TraceCheckUtils]: 2: Hoare triple {772#true} assume true; {772#true} is VALID [2022-04-28 10:03:32,588 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {772#true} {772#true} #61#return; {772#true} is VALID [2022-04-28 10:03:32,588 INFO L272 TraceCheckUtils]: 4: Hoare triple {772#true} call #t~ret11 := main(); {772#true} is VALID [2022-04-28 10:03:32,589 INFO L290 TraceCheckUtils]: 5: Hoare triple {772#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {777#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-28 10:03:32,589 INFO L290 TraceCheckUtils]: 6: Hoare triple {777#(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; {807#(and (= (+ main_~x~0 1) main_~n~0) (= (+ (- 1) main_~y~0) 0) (< 0 (mod main_~n~0 4294967296)))} is VALID [2022-04-28 10:03:32,590 INFO L290 TraceCheckUtils]: 7: Hoare triple {807#(and (= (+ main_~x~0 1) main_~n~0) (= (+ (- 1) main_~y~0) 0) (< 0 (mod main_~n~0 4294967296)))} assume !(~x~0 % 4294967296 > 0); {811#(and (= main_~y~0 1) (<= (mod (+ main_~n~0 4294967295) 4294967296) 0))} is VALID [2022-04-28 10:03:32,590 INFO L290 TraceCheckUtils]: 8: Hoare triple {811#(and (= main_~y~0 1) (<= (mod (+ main_~n~0 4294967295) 4294967296) 0))} ~z~0 := ~y~0; {815#(and (= main_~z~0 1) (<= (mod (+ main_~n~0 4294967295) 4294967296) 0))} is VALID [2022-04-28 10:03:32,591 INFO L290 TraceCheckUtils]: 9: Hoare triple {815#(and (= main_~z~0 1) (<= (mod (+ main_~n~0 4294967295) 4294967296) 0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {819#(and (<= (mod (+ main_~n~0 4294967295) 4294967296) 0) (= (+ main_~z~0 1) 1))} is VALID [2022-04-28 10:03:32,591 INFO L290 TraceCheckUtils]: 10: Hoare triple {819#(and (<= (mod (+ main_~n~0 4294967295) 4294967296) 0) (= (+ main_~z~0 1) 1))} assume !(~z~0 % 4294967296 > 0); {819#(and (<= (mod (+ main_~n~0 4294967295) 4294967296) 0) (= (+ main_~z~0 1) 1))} is VALID [2022-04-28 10:03:32,592 INFO L290 TraceCheckUtils]: 11: Hoare triple {819#(and (<= (mod (+ main_~n~0 4294967295) 4294967296) 0) (= (+ main_~z~0 1) 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {815#(and (= main_~z~0 1) (<= (mod (+ main_~n~0 4294967295) 4294967296) 0))} is VALID [2022-04-28 10:03:32,592 INFO L290 TraceCheckUtils]: 12: Hoare triple {815#(and (= main_~z~0 1) (<= (mod (+ main_~n~0 4294967295) 4294967296) 0))} assume !(~y~0 % 4294967296 > 0); {815#(and (= main_~z~0 1) (<= (mod (+ main_~n~0 4294967295) 4294967296) 0))} is VALID [2022-04-28 10:03:32,605 INFO L272 TraceCheckUtils]: 13: Hoare triple {815#(and (= main_~z~0 1) (<= (mod (+ main_~n~0 4294967295) 4294967296) 0))} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {832#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:03:32,606 INFO L290 TraceCheckUtils]: 14: Hoare triple {832#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {836#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:03:32,606 INFO L290 TraceCheckUtils]: 15: Hoare triple {836#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {773#false} is VALID [2022-04-28 10:03:32,606 INFO L290 TraceCheckUtils]: 16: Hoare triple {773#false} assume !false; {773#false} is VALID [2022-04-28 10:03:32,606 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:03:32,606 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:03:33,120 INFO L290 TraceCheckUtils]: 16: Hoare triple {773#false} assume !false; {773#false} is VALID [2022-04-28 10:03:33,121 INFO L290 TraceCheckUtils]: 15: Hoare triple {836#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {773#false} is VALID [2022-04-28 10:03:33,121 INFO L290 TraceCheckUtils]: 14: Hoare triple {832#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {836#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:03:33,122 INFO L272 TraceCheckUtils]: 13: Hoare triple {782#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {832#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:03:33,123 INFO L290 TraceCheckUtils]: 12: Hoare triple {782#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {782#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-28 10:03:33,124 INFO L290 TraceCheckUtils]: 11: Hoare triple {858#(and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {782#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-28 10:03:33,124 INFO L290 TraceCheckUtils]: 10: Hoare triple {858#(and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {858#(and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-28 10:03:33,125 INFO L290 TraceCheckUtils]: 9: Hoare triple {865#(or (and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)))) (not (< 0 (mod main_~z~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {858#(and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-28 10:03:33,126 INFO L290 TraceCheckUtils]: 8: Hoare triple {869#(or (not (< 0 (mod main_~y~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))))} ~z~0 := ~y~0; {865#(or (and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)))) (not (< 0 (mod main_~z~0 4294967296))))} is VALID [2022-04-28 10:03:33,127 INFO L290 TraceCheckUtils]: 7: Hoare triple {873#(or (not (< 0 (mod main_~y~0 4294967296))) (< 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); {869#(or (not (< 0 (mod main_~y~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-28 10:03:33,128 INFO L290 TraceCheckUtils]: 6: Hoare triple {877#(or (<= (mod (+ main_~y~0 1) 4294967296) 0) (< 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; {873#(or (not (< 0 (mod main_~y~0 4294967296))) (< 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-28 10:03:33,130 INFO L290 TraceCheckUtils]: 5: Hoare triple {772#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {877#(or (<= (mod (+ main_~y~0 1) 4294967296) 0) (< 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-28 10:03:33,130 INFO L272 TraceCheckUtils]: 4: Hoare triple {772#true} call #t~ret11 := main(); {772#true} is VALID [2022-04-28 10:03:33,130 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {772#true} {772#true} #61#return; {772#true} is VALID [2022-04-28 10:03:33,130 INFO L290 TraceCheckUtils]: 2: Hoare triple {772#true} assume true; {772#true} is VALID [2022-04-28 10:03:33,130 INFO L290 TraceCheckUtils]: 1: Hoare triple {772#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(10, 2);call #Ultimate.allocInit(12, 3); {772#true} is VALID [2022-04-28 10:03:33,130 INFO L272 TraceCheckUtils]: 0: Hoare triple {772#true} call ULTIMATE.init(); {772#true} is VALID [2022-04-28 10:03:33,130 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:03:33,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [59365801] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:03:33,130 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:03:33,131 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 10] total 22 [2022-04-28 10:03:33,131 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:03:33,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1607311507] [2022-04-28 10:03:33,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1607311507] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:03:33,133 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:03:33,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 10:03:33,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103860928] [2022-04-28 10:03:33,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:03:33,134 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 9 states have internal predecessors, (13), 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 17 [2022-04-28 10:03:33,135 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:03:33,135 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 9 states have internal predecessors, (13), 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-28 10:03:33,157 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:03:33,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 10:03:33,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:03:33,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 10:03:33,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=394, Unknown=0, NotChecked=0, Total=462 [2022-04-28 10:03:33,158 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand has 11 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 9 states have internal predecessors, (13), 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-28 10:03:33,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:03:33,778 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2022-04-28 10:03:33,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 10:03:33,778 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 9 states have internal predecessors, (13), 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 17 [2022-04-28 10:03:33,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:03:33,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 9 states have internal predecessors, (13), 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-28 10:03:33,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 33 transitions. [2022-04-28 10:03:33,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 9 states have internal predecessors, (13), 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-28 10:03:33,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 33 transitions. [2022-04-28 10:03:33,781 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 33 transitions. [2022-04-28 10:03:33,816 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:03:33,816 INFO L225 Difference]: With dead ends: 36 [2022-04-28 10:03:33,817 INFO L226 Difference]: Without dead ends: 29 [2022-04-28 10:03:33,817 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 22 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=128, Invalid=742, Unknown=0, NotChecked=0, Total=870 [2022-04-28 10:03:33,818 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 28 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 10:03:33,818 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 47 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 10:03:33,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-28 10:03:33,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2022-04-28 10:03:33,841 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:03:33,842 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 28 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 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-28 10:03:33,842 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 28 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 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-28 10:03:33,842 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 28 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 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-28 10:03:33,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:03:33,843 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2022-04-28 10:03:33,843 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-04-28 10:03:33,843 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:03:33,843 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:03:33,843 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 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 29 states. [2022-04-28 10:03:33,843 INFO L87 Difference]: Start difference. First operand has 28 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 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 29 states. [2022-04-28 10:03:33,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:03:33,844 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2022-04-28 10:03:33,844 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-04-28 10:03:33,844 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:03:33,845 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:03:33,845 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:03:33,845 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:03:33,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 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-28 10:03:33,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2022-04-28 10:03:33,845 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 17 [2022-04-28 10:03:33,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:03:33,846 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2022-04-28 10:03:33,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 9 states have internal predecessors, (13), 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-28 10:03:33,846 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 34 transitions. [2022-04-28 10:03:33,878 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:03:33,878 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2022-04-28 10:03:33,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 10:03:33,878 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:03:33,879 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:03:33,898 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-28 10:03:34,079 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-28 10:03:34,079 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:03:34,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:03:34,080 INFO L85 PathProgramCache]: Analyzing trace with hash -1762776946, now seen corresponding path program 5 times [2022-04-28 10:03:34,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:03:34,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1715518496] [2022-04-28 10:03:34,082 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:03:34,082 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:03:34,082 INFO L85 PathProgramCache]: Analyzing trace with hash -1762776946, now seen corresponding path program 6 times [2022-04-28 10:03:34,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:03:34,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125736063] [2022-04-28 10:03:34,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:03:34,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:03:34,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:03:34,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:03:34,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:03:34,168 INFO L290 TraceCheckUtils]: 0: Hoare triple {1110#(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(10, 2);call #Ultimate.allocInit(12, 3); {1100#true} is VALID [2022-04-28 10:03:34,169 INFO L290 TraceCheckUtils]: 1: Hoare triple {1100#true} assume true; {1100#true} is VALID [2022-04-28 10:03:34,169 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1100#true} {1100#true} #61#return; {1100#true} is VALID [2022-04-28 10:03:34,169 INFO L272 TraceCheckUtils]: 0: Hoare triple {1100#true} call ULTIMATE.init(); {1110#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:03:34,169 INFO L290 TraceCheckUtils]: 1: Hoare triple {1110#(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(10, 2);call #Ultimate.allocInit(12, 3); {1100#true} is VALID [2022-04-28 10:03:34,169 INFO L290 TraceCheckUtils]: 2: Hoare triple {1100#true} assume true; {1100#true} is VALID [2022-04-28 10:03:34,169 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1100#true} {1100#true} #61#return; {1100#true} is VALID [2022-04-28 10:03:34,169 INFO L272 TraceCheckUtils]: 4: Hoare triple {1100#true} call #t~ret11 := main(); {1100#true} is VALID [2022-04-28 10:03:34,170 INFO L290 TraceCheckUtils]: 5: Hoare triple {1100#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1105#(= main_~y~0 0)} is VALID [2022-04-28 10:03:34,170 INFO L290 TraceCheckUtils]: 6: Hoare triple {1105#(= 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; {1106#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:03:34,171 INFO L290 TraceCheckUtils]: 7: Hoare triple {1106#(and (<= 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; {1107#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:03:34,171 INFO L290 TraceCheckUtils]: 8: Hoare triple {1107#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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 (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:03:34,171 INFO L290 TraceCheckUtils]: 9: Hoare triple {1108#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {1108#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:03:34,172 INFO L290 TraceCheckUtils]: 10: Hoare triple {1108#(and (<= main_~y~0 3) (<= 3 main_~y~0))} ~z~0 := ~y~0; {1109#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:03:34,172 INFO L290 TraceCheckUtils]: 11: Hoare triple {1109#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {1101#false} is VALID [2022-04-28 10:03:34,172 INFO L290 TraceCheckUtils]: 12: Hoare triple {1101#false} assume !(~y~0 % 4294967296 > 0); {1101#false} is VALID [2022-04-28 10:03:34,172 INFO L272 TraceCheckUtils]: 13: Hoare triple {1101#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1101#false} is VALID [2022-04-28 10:03:34,173 INFO L290 TraceCheckUtils]: 14: Hoare triple {1101#false} ~cond := #in~cond; {1101#false} is VALID [2022-04-28 10:03:34,173 INFO L290 TraceCheckUtils]: 15: Hoare triple {1101#false} assume 0 == ~cond; {1101#false} is VALID [2022-04-28 10:03:34,173 INFO L290 TraceCheckUtils]: 16: Hoare triple {1101#false} assume !false; {1101#false} is VALID [2022-04-28 10:03:34,173 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:03:34,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:03:34,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125736063] [2022-04-28 10:03:34,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125736063] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:03:34,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [779304302] [2022-04-28 10:03:34,173 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:03:34,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:03:34,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:03:34,174 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-28 10:03:34,175 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-28 10:03:34,201 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-28 10:03:34,201 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:03:34,202 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-28 10:03:34,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:03:34,206 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:03:34,362 INFO L272 TraceCheckUtils]: 0: Hoare triple {1100#true} call ULTIMATE.init(); {1100#true} is VALID [2022-04-28 10:03:34,363 INFO L290 TraceCheckUtils]: 1: Hoare triple {1100#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(10, 2);call #Ultimate.allocInit(12, 3); {1100#true} is VALID [2022-04-28 10:03:34,363 INFO L290 TraceCheckUtils]: 2: Hoare triple {1100#true} assume true; {1100#true} is VALID [2022-04-28 10:03:34,363 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1100#true} {1100#true} #61#return; {1100#true} is VALID [2022-04-28 10:03:34,363 INFO L272 TraceCheckUtils]: 4: Hoare triple {1100#true} call #t~ret11 := main(); {1100#true} is VALID [2022-04-28 10:03:34,363 INFO L290 TraceCheckUtils]: 5: Hoare triple {1100#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1105#(= main_~y~0 0)} is VALID [2022-04-28 10:03:34,364 INFO L290 TraceCheckUtils]: 6: Hoare triple {1105#(= 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; {1106#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:03:34,364 INFO L290 TraceCheckUtils]: 7: Hoare triple {1106#(and (<= 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; {1107#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:03:34,365 INFO L290 TraceCheckUtils]: 8: Hoare triple {1107#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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 (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:03:34,365 INFO L290 TraceCheckUtils]: 9: Hoare triple {1108#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {1108#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:03:34,365 INFO L290 TraceCheckUtils]: 10: Hoare triple {1108#(and (<= main_~y~0 3) (<= 3 main_~y~0))} ~z~0 := ~y~0; {1144#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:03:34,368 INFO L290 TraceCheckUtils]: 11: Hoare triple {1144#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {1101#false} is VALID [2022-04-28 10:03:34,368 INFO L290 TraceCheckUtils]: 12: Hoare triple {1101#false} assume !(~y~0 % 4294967296 > 0); {1101#false} is VALID [2022-04-28 10:03:34,368 INFO L272 TraceCheckUtils]: 13: Hoare triple {1101#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1101#false} is VALID [2022-04-28 10:03:34,368 INFO L290 TraceCheckUtils]: 14: Hoare triple {1101#false} ~cond := #in~cond; {1101#false} is VALID [2022-04-28 10:03:34,369 INFO L290 TraceCheckUtils]: 15: Hoare triple {1101#false} assume 0 == ~cond; {1101#false} is VALID [2022-04-28 10:03:34,369 INFO L290 TraceCheckUtils]: 16: Hoare triple {1101#false} assume !false; {1101#false} is VALID [2022-04-28 10:03:34,369 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:03:34,369 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:03:34,476 INFO L290 TraceCheckUtils]: 16: Hoare triple {1101#false} assume !false; {1101#false} is VALID [2022-04-28 10:03:34,476 INFO L290 TraceCheckUtils]: 15: Hoare triple {1101#false} assume 0 == ~cond; {1101#false} is VALID [2022-04-28 10:03:34,476 INFO L290 TraceCheckUtils]: 14: Hoare triple {1101#false} ~cond := #in~cond; {1101#false} is VALID [2022-04-28 10:03:34,476 INFO L272 TraceCheckUtils]: 13: Hoare triple {1101#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1101#false} is VALID [2022-04-28 10:03:34,476 INFO L290 TraceCheckUtils]: 12: Hoare triple {1101#false} assume !(~y~0 % 4294967296 > 0); {1101#false} is VALID [2022-04-28 10:03:34,477 INFO L290 TraceCheckUtils]: 11: Hoare triple {1178#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {1101#false} is VALID [2022-04-28 10:03:34,477 INFO L290 TraceCheckUtils]: 10: Hoare triple {1182#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {1178#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:03:34,477 INFO L290 TraceCheckUtils]: 9: Hoare triple {1182#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {1182#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:03:34,478 INFO L290 TraceCheckUtils]: 8: Hoare triple {1189#(< 0 (mod (+ main_~y~0 1) 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; {1182#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:03:34,478 INFO L290 TraceCheckUtils]: 7: Hoare triple {1193#(< 0 (mod (+ main_~y~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; {1189#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:03:34,479 INFO L290 TraceCheckUtils]: 6: Hoare triple {1197#(< 0 (mod (+ main_~y~0 3) 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; {1193#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:03:34,479 INFO L290 TraceCheckUtils]: 5: Hoare triple {1100#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1197#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:03:34,480 INFO L272 TraceCheckUtils]: 4: Hoare triple {1100#true} call #t~ret11 := main(); {1100#true} is VALID [2022-04-28 10:03:34,480 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1100#true} {1100#true} #61#return; {1100#true} is VALID [2022-04-28 10:03:34,480 INFO L290 TraceCheckUtils]: 2: Hoare triple {1100#true} assume true; {1100#true} is VALID [2022-04-28 10:03:34,480 INFO L290 TraceCheckUtils]: 1: Hoare triple {1100#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(10, 2);call #Ultimate.allocInit(12, 3); {1100#true} is VALID [2022-04-28 10:03:34,480 INFO L272 TraceCheckUtils]: 0: Hoare triple {1100#true} call ULTIMATE.init(); {1100#true} is VALID [2022-04-28 10:03:34,480 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:03:34,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [779304302] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:03:34,480 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:03:34,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2022-04-28 10:03:34,480 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:03:34,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1715518496] [2022-04-28 10:03:34,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1715518496] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:03:34,480 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:03:34,481 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 10:03:34,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585399472] [2022-04-28 10:03:34,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:03:34,481 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 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 17 [2022-04-28 10:03:34,481 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:03:34,481 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 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-28 10:03:34,491 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:03:34,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 10:03:34,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:03:34,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 10:03:34,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2022-04-28 10:03:34,491 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 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-28 10:03:34,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:03:34,772 INFO L93 Difference]: Finished difference Result 43 states and 56 transitions. [2022-04-28 10:03:34,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 10:03:34,772 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 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 17 [2022-04-28 10:03:34,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:03:34,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 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-28 10:03:34,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 50 transitions. [2022-04-28 10:03:34,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 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-28 10:03:34,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 50 transitions. [2022-04-28 10:03:34,774 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 50 transitions. [2022-04-28 10:03:34,822 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:03:34,822 INFO L225 Difference]: With dead ends: 43 [2022-04-28 10:03:34,823 INFO L226 Difference]: Without dead ends: 37 [2022-04-28 10:03:34,823 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2022-04-28 10:03:34,823 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 36 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:03:34,824 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 45 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 10:03:34,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-04-28 10:03:34,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 33. [2022-04-28 10:03:34,852 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:03:34,852 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 33 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 28 states have internal predecessors, (37), 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-28 10:03:34,853 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 33 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 28 states have internal predecessors, (37), 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-28 10:03:34,853 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 33 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 28 states have internal predecessors, (37), 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-28 10:03:34,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:03:34,854 INFO L93 Difference]: Finished difference Result 37 states and 45 transitions. [2022-04-28 10:03:34,854 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2022-04-28 10:03:34,854 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:03:34,854 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:03:34,854 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 28 states have internal predecessors, (37), 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 37 states. [2022-04-28 10:03:34,854 INFO L87 Difference]: Start difference. First operand has 33 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 28 states have internal predecessors, (37), 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 37 states. [2022-04-28 10:03:34,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:03:34,856 INFO L93 Difference]: Finished difference Result 37 states and 45 transitions. [2022-04-28 10:03:34,856 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2022-04-28 10:03:34,856 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:03:34,856 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:03:34,856 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:03:34,856 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:03:34,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 28 states have internal predecessors, (37), 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-28 10:03:34,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 41 transitions. [2022-04-28 10:03:34,857 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 41 transitions. Word has length 17 [2022-04-28 10:03:34,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:03:34,857 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 41 transitions. [2022-04-28 10:03:34,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 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-28 10:03:34,857 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 41 transitions. [2022-04-28 10:03:34,900 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:03:34,900 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 41 transitions. [2022-04-28 10:03:34,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-28 10:03:34,900 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:03:34,900 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:03:34,916 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-28 10:03:35,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:03:35,103 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:03:35,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:03:35,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1194243967, now seen corresponding path program 3 times [2022-04-28 10:03:35,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:03:35,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1118270535] [2022-04-28 10:03:35,110 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:03:35,110 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:03:35,110 INFO L85 PathProgramCache]: Analyzing trace with hash 1194243967, now seen corresponding path program 4 times [2022-04-28 10:03:35,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:03:35,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424121629] [2022-04-28 10:03:35,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:03:35,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:03:35,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:03:35,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:03:35,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:03:35,180 INFO L290 TraceCheckUtils]: 0: Hoare triple {1463#(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(10, 2);call #Ultimate.allocInit(12, 3); {1454#true} is VALID [2022-04-28 10:03:35,180 INFO L290 TraceCheckUtils]: 1: Hoare triple {1454#true} assume true; {1454#true} is VALID [2022-04-28 10:03:35,180 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1454#true} {1454#true} #61#return; {1454#true} is VALID [2022-04-28 10:03:35,181 INFO L272 TraceCheckUtils]: 0: Hoare triple {1454#true} call ULTIMATE.init(); {1463#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:03:35,181 INFO L290 TraceCheckUtils]: 1: Hoare triple {1463#(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(10, 2);call #Ultimate.allocInit(12, 3); {1454#true} is VALID [2022-04-28 10:03:35,181 INFO L290 TraceCheckUtils]: 2: Hoare triple {1454#true} assume true; {1454#true} is VALID [2022-04-28 10:03:35,181 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1454#true} {1454#true} #61#return; {1454#true} is VALID [2022-04-28 10:03:35,181 INFO L272 TraceCheckUtils]: 4: Hoare triple {1454#true} call #t~ret11 := main(); {1454#true} is VALID [2022-04-28 10:03:35,181 INFO L290 TraceCheckUtils]: 5: Hoare triple {1454#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1459#(= main_~y~0 0)} is VALID [2022-04-28 10:03:35,182 INFO L290 TraceCheckUtils]: 6: Hoare triple {1459#(= 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; {1460#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:03:35,182 INFO L290 TraceCheckUtils]: 7: Hoare triple {1460#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !(~x~0 % 4294967296 > 0); {1460#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:03:35,182 INFO L290 TraceCheckUtils]: 8: Hoare triple {1460#(and (<= 1 main_~y~0) (<= main_~y~0 1))} ~z~0 := ~y~0; {1461#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-28 10:03:35,183 INFO L290 TraceCheckUtils]: 9: Hoare triple {1461#(and (<= main_~z~0 1) (<= 1 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1462#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-28 10:03:35,183 INFO L290 TraceCheckUtils]: 10: Hoare triple {1462#(and (<= main_~z~0 0) (<= 0 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1455#false} is VALID [2022-04-28 10:03:35,183 INFO L290 TraceCheckUtils]: 11: Hoare triple {1455#false} assume !(~z~0 % 4294967296 > 0); {1455#false} is VALID [2022-04-28 10:03:35,184 INFO L290 TraceCheckUtils]: 12: Hoare triple {1455#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {1455#false} is VALID [2022-04-28 10:03:35,184 INFO L290 TraceCheckUtils]: 13: Hoare triple {1455#false} assume !(~y~0 % 4294967296 > 0); {1455#false} is VALID [2022-04-28 10:03:35,184 INFO L272 TraceCheckUtils]: 14: Hoare triple {1455#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1455#false} is VALID [2022-04-28 10:03:35,184 INFO L290 TraceCheckUtils]: 15: Hoare triple {1455#false} ~cond := #in~cond; {1455#false} is VALID [2022-04-28 10:03:35,184 INFO L290 TraceCheckUtils]: 16: Hoare triple {1455#false} assume 0 == ~cond; {1455#false} is VALID [2022-04-28 10:03:35,184 INFO L290 TraceCheckUtils]: 17: Hoare triple {1455#false} assume !false; {1455#false} is VALID [2022-04-28 10:03:35,184 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 10:03:35,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:03:35,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424121629] [2022-04-28 10:03:35,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424121629] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:03:35,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [801977098] [2022-04-28 10:03:35,184 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:03:35,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:03:35,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:03:35,185 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:03:35,186 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-28 10:03:35,212 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:03:35,212 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:03:35,213 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-28 10:03:35,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:03:35,219 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:03:35,287 INFO L272 TraceCheckUtils]: 0: Hoare triple {1454#true} call ULTIMATE.init(); {1454#true} is VALID [2022-04-28 10:03:35,287 INFO L290 TraceCheckUtils]: 1: Hoare triple {1454#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(10, 2);call #Ultimate.allocInit(12, 3); {1454#true} is VALID [2022-04-28 10:03:35,287 INFO L290 TraceCheckUtils]: 2: Hoare triple {1454#true} assume true; {1454#true} is VALID [2022-04-28 10:03:35,287 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1454#true} {1454#true} #61#return; {1454#true} is VALID [2022-04-28 10:03:35,287 INFO L272 TraceCheckUtils]: 4: Hoare triple {1454#true} call #t~ret11 := main(); {1454#true} is VALID [2022-04-28 10:03:35,288 INFO L290 TraceCheckUtils]: 5: Hoare triple {1454#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1459#(= main_~y~0 0)} is VALID [2022-04-28 10:03:35,288 INFO L290 TraceCheckUtils]: 6: Hoare triple {1459#(= 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; {1460#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:03:35,289 INFO L290 TraceCheckUtils]: 7: Hoare triple {1460#(and (<= 1 main_~y~0) (<= main_~y~0 1))} assume !(~x~0 % 4294967296 > 0); {1460#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:03:35,289 INFO L290 TraceCheckUtils]: 8: Hoare triple {1460#(and (<= 1 main_~y~0) (<= main_~y~0 1))} ~z~0 := ~y~0; {1491#(and (= main_~z~0 main_~y~0) (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:03:35,289 INFO L290 TraceCheckUtils]: 9: Hoare triple {1491#(and (= main_~z~0 main_~y~0) (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1495#(and (<= 1 main_~y~0) (= main_~y~0 (+ main_~z~0 1)) (<= main_~y~0 1))} is VALID [2022-04-28 10:03:35,290 INFO L290 TraceCheckUtils]: 10: Hoare triple {1495#(and (<= 1 main_~y~0) (= main_~y~0 (+ main_~z~0 1)) (<= main_~y~0 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1455#false} is VALID [2022-04-28 10:03:35,290 INFO L290 TraceCheckUtils]: 11: Hoare triple {1455#false} assume !(~z~0 % 4294967296 > 0); {1455#false} is VALID [2022-04-28 10:03:35,290 INFO L290 TraceCheckUtils]: 12: Hoare triple {1455#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {1455#false} is VALID [2022-04-28 10:03:35,290 INFO L290 TraceCheckUtils]: 13: Hoare triple {1455#false} assume !(~y~0 % 4294967296 > 0); {1455#false} is VALID [2022-04-28 10:03:35,290 INFO L272 TraceCheckUtils]: 14: Hoare triple {1455#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1455#false} is VALID [2022-04-28 10:03:35,290 INFO L290 TraceCheckUtils]: 15: Hoare triple {1455#false} ~cond := #in~cond; {1455#false} is VALID [2022-04-28 10:03:35,290 INFO L290 TraceCheckUtils]: 16: Hoare triple {1455#false} assume 0 == ~cond; {1455#false} is VALID [2022-04-28 10:03:35,291 INFO L290 TraceCheckUtils]: 17: Hoare triple {1455#false} assume !false; {1455#false} is VALID [2022-04-28 10:03:35,291 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 10:03:35,291 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:03:35,391 INFO L290 TraceCheckUtils]: 17: Hoare triple {1455#false} assume !false; {1455#false} is VALID [2022-04-28 10:03:35,391 INFO L290 TraceCheckUtils]: 16: Hoare triple {1455#false} assume 0 == ~cond; {1455#false} is VALID [2022-04-28 10:03:35,391 INFO L290 TraceCheckUtils]: 15: Hoare triple {1455#false} ~cond := #in~cond; {1455#false} is VALID [2022-04-28 10:03:35,392 INFO L272 TraceCheckUtils]: 14: Hoare triple {1455#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1455#false} is VALID [2022-04-28 10:03:35,392 INFO L290 TraceCheckUtils]: 13: Hoare triple {1532#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {1455#false} is VALID [2022-04-28 10:03:35,393 INFO L290 TraceCheckUtils]: 12: Hoare triple {1536#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {1532#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:03:35,393 INFO L290 TraceCheckUtils]: 11: Hoare triple {1536#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~z~0 % 4294967296 > 0); {1536#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:03:35,393 INFO L290 TraceCheckUtils]: 10: Hoare triple {1543#(or (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (not (< 0 (mod main_~z~0 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1536#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:03:35,394 INFO L290 TraceCheckUtils]: 9: Hoare triple {1547#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1543#(or (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (not (< 0 (mod main_~z~0 4294967296))))} is VALID [2022-04-28 10:03:35,395 INFO L290 TraceCheckUtils]: 8: Hoare triple {1454#true} ~z~0 := ~y~0; {1547#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:03:35,395 INFO L290 TraceCheckUtils]: 7: Hoare triple {1454#true} assume !(~x~0 % 4294967296 > 0); {1454#true} is VALID [2022-04-28 10:03:35,395 INFO L290 TraceCheckUtils]: 6: Hoare triple {1454#true} 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; {1454#true} is VALID [2022-04-28 10:03:35,395 INFO L290 TraceCheckUtils]: 5: Hoare triple {1454#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1454#true} is VALID [2022-04-28 10:03:35,395 INFO L272 TraceCheckUtils]: 4: Hoare triple {1454#true} call #t~ret11 := main(); {1454#true} is VALID [2022-04-28 10:03:35,395 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1454#true} {1454#true} #61#return; {1454#true} is VALID [2022-04-28 10:03:35,395 INFO L290 TraceCheckUtils]: 2: Hoare triple {1454#true} assume true; {1454#true} is VALID [2022-04-28 10:03:35,395 INFO L290 TraceCheckUtils]: 1: Hoare triple {1454#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(10, 2);call #Ultimate.allocInit(12, 3); {1454#true} is VALID [2022-04-28 10:03:35,395 INFO L272 TraceCheckUtils]: 0: Hoare triple {1454#true} call ULTIMATE.init(); {1454#true} is VALID [2022-04-28 10:03:35,395 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 10:03:35,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [801977098] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:03:35,396 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:03:35,396 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 13 [2022-04-28 10:03:35,396 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:03:35,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1118270535] [2022-04-28 10:03:35,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1118270535] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:03:35,396 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:03:35,396 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 10:03:35,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893085420] [2022-04-28 10:03:35,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:03:35,396 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 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 18 [2022-04-28 10:03:35,397 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:03:35,397 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 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-28 10:03:35,408 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:03:35,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 10:03:35,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:03:35,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 10:03:35,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2022-04-28 10:03:35,409 INFO L87 Difference]: Start difference. First operand 33 states and 41 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 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-28 10:03:35,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:03:35,564 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2022-04-28 10:03:35,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 10:03:35,564 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 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 18 [2022-04-28 10:03:35,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:03:35,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 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-28 10:03:35,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 31 transitions. [2022-04-28 10:03:35,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 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-28 10:03:35,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 31 transitions. [2022-04-28 10:03:35,566 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 31 transitions. [2022-04-28 10:03:35,591 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:03:35,592 INFO L225 Difference]: With dead ends: 40 [2022-04-28 10:03:35,592 INFO L226 Difference]: Without dead ends: 29 [2022-04-28 10:03:35,592 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272 [2022-04-28 10:03:35,592 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 14 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:03:35,593 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 36 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 10:03:35,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-28 10:03:35,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-04-28 10:03:35,612 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:03:35,612 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 29 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 24 states have internal predecessors, (31), 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-28 10:03:35,612 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 29 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 24 states have internal predecessors, (31), 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-28 10:03:35,612 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 29 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 24 states have internal predecessors, (31), 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-28 10:03:35,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:03:35,613 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2022-04-28 10:03:35,613 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-04-28 10:03:35,613 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:03:35,613 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:03:35,613 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 24 states have internal predecessors, (31), 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 29 states. [2022-04-28 10:03:35,614 INFO L87 Difference]: Start difference. First operand has 29 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 24 states have internal predecessors, (31), 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 29 states. [2022-04-28 10:03:35,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:03:35,614 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2022-04-28 10:03:35,614 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-04-28 10:03:35,614 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:03:35,614 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:03:35,627 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:03:35,627 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:03:35,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 24 states have internal predecessors, (31), 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-28 10:03:35,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2022-04-28 10:03:35,628 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 18 [2022-04-28 10:03:35,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:03:35,629 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2022-04-28 10:03:35,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 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-28 10:03:35,629 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 35 transitions. [2022-04-28 10:03:35,661 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:03:35,662 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-04-28 10:03:35,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-28 10:03:35,662 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:03:35,662 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:03:35,678 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-28 10:03:35,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:03:35,863 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:03:35,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:03:35,863 INFO L85 PathProgramCache]: Analyzing trace with hash 2041345421, now seen corresponding path program 7 times [2022-04-28 10:03:35,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:03:35,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [863287027] [2022-04-28 10:03:35,865 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:03:35,865 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:03:35,865 INFO L85 PathProgramCache]: Analyzing trace with hash 2041345421, now seen corresponding path program 8 times [2022-04-28 10:03:35,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:03:35,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694419999] [2022-04-28 10:03:35,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:03:35,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:03:35,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:03:35,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:03:35,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:03:35,957 INFO L290 TraceCheckUtils]: 0: Hoare triple {1792#(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(10, 2);call #Ultimate.allocInit(12, 3); {1781#true} is VALID [2022-04-28 10:03:35,957 INFO L290 TraceCheckUtils]: 1: Hoare triple {1781#true} assume true; {1781#true} is VALID [2022-04-28 10:03:35,957 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1781#true} {1781#true} #61#return; {1781#true} is VALID [2022-04-28 10:03:35,957 INFO L272 TraceCheckUtils]: 0: Hoare triple {1781#true} call ULTIMATE.init(); {1792#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:03:35,957 INFO L290 TraceCheckUtils]: 1: Hoare triple {1792#(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(10, 2);call #Ultimate.allocInit(12, 3); {1781#true} is VALID [2022-04-28 10:03:35,957 INFO L290 TraceCheckUtils]: 2: Hoare triple {1781#true} assume true; {1781#true} is VALID [2022-04-28 10:03:35,958 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1781#true} {1781#true} #61#return; {1781#true} is VALID [2022-04-28 10:03:35,958 INFO L272 TraceCheckUtils]: 4: Hoare triple {1781#true} call #t~ret11 := main(); {1781#true} is VALID [2022-04-28 10:03:35,958 INFO L290 TraceCheckUtils]: 5: Hoare triple {1781#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1786#(= main_~y~0 0)} is VALID [2022-04-28 10:03:35,958 INFO L290 TraceCheckUtils]: 6: Hoare triple {1786#(= 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; {1787#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:03:35,959 INFO L290 TraceCheckUtils]: 7: Hoare triple {1787#(and (<= 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; {1788#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:03:35,959 INFO L290 TraceCheckUtils]: 8: Hoare triple {1788#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {1789#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:03:35,960 INFO L290 TraceCheckUtils]: 9: Hoare triple {1789#(and (<= main_~y~0 3) (<= 3 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; {1790#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:03:35,960 INFO L290 TraceCheckUtils]: 10: Hoare triple {1790#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {1790#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:03:35,961 INFO L290 TraceCheckUtils]: 11: Hoare triple {1790#(and (<= main_~y~0 4) (<= 4 main_~y~0))} ~z~0 := ~y~0; {1791#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:03:35,961 INFO L290 TraceCheckUtils]: 12: Hoare triple {1791#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {1782#false} is VALID [2022-04-28 10:03:35,961 INFO L290 TraceCheckUtils]: 13: Hoare triple {1782#false} assume !(~y~0 % 4294967296 > 0); {1782#false} is VALID [2022-04-28 10:03:35,961 INFO L272 TraceCheckUtils]: 14: Hoare triple {1782#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1782#false} is VALID [2022-04-28 10:03:35,961 INFO L290 TraceCheckUtils]: 15: Hoare triple {1782#false} ~cond := #in~cond; {1782#false} is VALID [2022-04-28 10:03:35,961 INFO L290 TraceCheckUtils]: 16: Hoare triple {1782#false} assume 0 == ~cond; {1782#false} is VALID [2022-04-28 10:03:35,962 INFO L290 TraceCheckUtils]: 17: Hoare triple {1782#false} assume !false; {1782#false} is VALID [2022-04-28 10:03:35,962 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-28 10:03:35,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:03:35,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694419999] [2022-04-28 10:03:35,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694419999] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:03:35,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [885946707] [2022-04-28 10:03:35,962 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:03:35,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:03:35,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:03:35,963 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:03:35,964 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-28 10:03:35,991 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:03:35,991 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:03:35,992 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-28 10:03:35,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:03:35,996 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:03:36,164 INFO L272 TraceCheckUtils]: 0: Hoare triple {1781#true} call ULTIMATE.init(); {1781#true} is VALID [2022-04-28 10:03:36,165 INFO L290 TraceCheckUtils]: 1: Hoare triple {1781#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(10, 2);call #Ultimate.allocInit(12, 3); {1781#true} is VALID [2022-04-28 10:03:36,165 INFO L290 TraceCheckUtils]: 2: Hoare triple {1781#true} assume true; {1781#true} is VALID [2022-04-28 10:03:36,165 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1781#true} {1781#true} #61#return; {1781#true} is VALID [2022-04-28 10:03:36,165 INFO L272 TraceCheckUtils]: 4: Hoare triple {1781#true} call #t~ret11 := main(); {1781#true} is VALID [2022-04-28 10:03:36,165 INFO L290 TraceCheckUtils]: 5: Hoare triple {1781#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1786#(= main_~y~0 0)} is VALID [2022-04-28 10:03:36,166 INFO L290 TraceCheckUtils]: 6: Hoare triple {1786#(= 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; {1787#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:03:36,166 INFO L290 TraceCheckUtils]: 7: Hoare triple {1787#(and (<= 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; {1788#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:03:36,167 INFO L290 TraceCheckUtils]: 8: Hoare triple {1788#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {1789#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:03:36,167 INFO L290 TraceCheckUtils]: 9: Hoare triple {1789#(and (<= main_~y~0 3) (<= 3 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; {1790#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:03:36,168 INFO L290 TraceCheckUtils]: 10: Hoare triple {1790#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {1790#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:03:36,168 INFO L290 TraceCheckUtils]: 11: Hoare triple {1790#(and (<= main_~y~0 4) (<= 4 main_~y~0))} ~z~0 := ~y~0; {1829#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:03:36,169 INFO L290 TraceCheckUtils]: 12: Hoare triple {1829#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !(~z~0 % 4294967296 > 0); {1782#false} is VALID [2022-04-28 10:03:36,169 INFO L290 TraceCheckUtils]: 13: Hoare triple {1782#false} assume !(~y~0 % 4294967296 > 0); {1782#false} is VALID [2022-04-28 10:03:36,169 INFO L272 TraceCheckUtils]: 14: Hoare triple {1782#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1782#false} is VALID [2022-04-28 10:03:36,169 INFO L290 TraceCheckUtils]: 15: Hoare triple {1782#false} ~cond := #in~cond; {1782#false} is VALID [2022-04-28 10:03:36,169 INFO L290 TraceCheckUtils]: 16: Hoare triple {1782#false} assume 0 == ~cond; {1782#false} is VALID [2022-04-28 10:03:36,169 INFO L290 TraceCheckUtils]: 17: Hoare triple {1782#false} assume !false; {1782#false} is VALID [2022-04-28 10:03:36,169 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-28 10:03:36,169 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:03:36,294 INFO L290 TraceCheckUtils]: 17: Hoare triple {1782#false} assume !false; {1782#false} is VALID [2022-04-28 10:03:36,294 INFO L290 TraceCheckUtils]: 16: Hoare triple {1782#false} assume 0 == ~cond; {1782#false} is VALID [2022-04-28 10:03:36,294 INFO L290 TraceCheckUtils]: 15: Hoare triple {1782#false} ~cond := #in~cond; {1782#false} is VALID [2022-04-28 10:03:36,294 INFO L272 TraceCheckUtils]: 14: Hoare triple {1782#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1782#false} is VALID [2022-04-28 10:03:36,294 INFO L290 TraceCheckUtils]: 13: Hoare triple {1782#false} assume !(~y~0 % 4294967296 > 0); {1782#false} is VALID [2022-04-28 10:03:36,295 INFO L290 TraceCheckUtils]: 12: Hoare triple {1863#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {1782#false} is VALID [2022-04-28 10:03:36,295 INFO L290 TraceCheckUtils]: 11: Hoare triple {1867#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {1863#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:03:36,295 INFO L290 TraceCheckUtils]: 10: Hoare triple {1867#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {1867#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:03:36,296 INFO L290 TraceCheckUtils]: 9: Hoare triple {1874#(< 0 (mod (+ main_~y~0 1) 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; {1867#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:03:36,297 INFO L290 TraceCheckUtils]: 8: Hoare triple {1878#(< 0 (mod (+ main_~y~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; {1874#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:03:36,297 INFO L290 TraceCheckUtils]: 7: Hoare triple {1882#(< 0 (mod (+ main_~y~0 3) 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; {1878#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:03:36,298 INFO L290 TraceCheckUtils]: 6: Hoare triple {1886#(< 0 (mod (+ main_~y~0 4) 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; {1882#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:03:36,298 INFO L290 TraceCheckUtils]: 5: Hoare triple {1781#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1886#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:03:36,298 INFO L272 TraceCheckUtils]: 4: Hoare triple {1781#true} call #t~ret11 := main(); {1781#true} is VALID [2022-04-28 10:03:36,298 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1781#true} {1781#true} #61#return; {1781#true} is VALID [2022-04-28 10:03:36,298 INFO L290 TraceCheckUtils]: 2: Hoare triple {1781#true} assume true; {1781#true} is VALID [2022-04-28 10:03:36,298 INFO L290 TraceCheckUtils]: 1: Hoare triple {1781#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(10, 2);call #Ultimate.allocInit(12, 3); {1781#true} is VALID [2022-04-28 10:03:36,298 INFO L272 TraceCheckUtils]: 0: Hoare triple {1781#true} call ULTIMATE.init(); {1781#true} is VALID [2022-04-28 10:03:36,299 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-28 10:03:36,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [885946707] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:03:36,299 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:03:36,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 16 [2022-04-28 10:03:36,299 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:03:36,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [863287027] [2022-04-28 10:03:36,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [863287027] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:03:36,299 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:03:36,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 10:03:36,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771149764] [2022-04-28 10:03:36,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:03:36,300 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 8 states have internal predecessors, (14), 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 18 [2022-04-28 10:03:36,300 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:03:36,300 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 8 states have internal predecessors, (14), 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-28 10:03:36,311 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:03:36,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 10:03:36,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:03:36,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 10:03:36,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2022-04-28 10:03:36,311 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 8 states have internal predecessors, (14), 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-28 10:03:36,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:03:36,656 INFO L93 Difference]: Finished difference Result 45 states and 59 transitions. [2022-04-28 10:03:36,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 10:03:36,657 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 8 states have internal predecessors, (14), 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 18 [2022-04-28 10:03:36,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:03:36,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 8 states have internal predecessors, (14), 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-28 10:03:36,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 53 transitions. [2022-04-28 10:03:36,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 8 states have internal predecessors, (14), 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-28 10:03:36,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 53 transitions. [2022-04-28 10:03:36,659 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 53 transitions. [2022-04-28 10:03:36,699 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:03:36,699 INFO L225 Difference]: With dead ends: 45 [2022-04-28 10:03:36,700 INFO L226 Difference]: Without dead ends: 39 [2022-04-28 10:03:36,700 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=350, Unknown=0, NotChecked=0, Total=462 [2022-04-28 10:03:36,700 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 36 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:03:36,701 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 50 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 10:03:36,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-28 10:03:36,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 34. [2022-04-28 10:03:36,722 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:03:36,722 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 34 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 29 states have internal predecessors, (38), 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-28 10:03:36,722 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 34 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 29 states have internal predecessors, (38), 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-28 10:03:36,722 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 34 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 29 states have internal predecessors, (38), 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-28 10:03:36,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:03:36,723 INFO L93 Difference]: Finished difference Result 39 states and 47 transitions. [2022-04-28 10:03:36,724 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 47 transitions. [2022-04-28 10:03:36,724 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:03:36,724 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:03:36,724 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 29 states have internal predecessors, (38), 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 39 states. [2022-04-28 10:03:36,724 INFO L87 Difference]: Start difference. First operand has 34 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 29 states have internal predecessors, (38), 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 39 states. [2022-04-28 10:03:36,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:03:36,725 INFO L93 Difference]: Finished difference Result 39 states and 47 transitions. [2022-04-28 10:03:36,725 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 47 transitions. [2022-04-28 10:03:36,725 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:03:36,725 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:03:36,725 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:03:36,725 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:03:36,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 29 states have internal predecessors, (38), 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-28 10:03:36,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2022-04-28 10:03:36,726 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 42 transitions. Word has length 18 [2022-04-28 10:03:36,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:03:36,726 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 42 transitions. [2022-04-28 10:03:36,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 8 states have internal predecessors, (14), 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-28 10:03:36,726 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 42 transitions. [2022-04-28 10:03:36,762 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:03:36,762 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2022-04-28 10:03:36,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-28 10:03:36,763 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:03:36,763 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:03:36,779 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-28 10:03:36,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:03:36,971 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:03:36,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:03:36,972 INFO L85 PathProgramCache]: Analyzing trace with hash -1675054353, now seen corresponding path program 5 times [2022-04-28 10:03:36,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:03:36,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [449803450] [2022-04-28 10:03:36,974 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:03:36,974 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:03:36,974 INFO L85 PathProgramCache]: Analyzing trace with hash -1675054353, now seen corresponding path program 6 times [2022-04-28 10:03:36,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:03:36,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254010380] [2022-04-28 10:03:36,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:03:36,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:03:36,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:03:37,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:03:37,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:03:37,059 INFO L290 TraceCheckUtils]: 0: Hoare triple {2165#(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(10, 2);call #Ultimate.allocInit(12, 3); {2155#true} is VALID [2022-04-28 10:03:37,059 INFO L290 TraceCheckUtils]: 1: Hoare triple {2155#true} assume true; {2155#true} is VALID [2022-04-28 10:03:37,059 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2155#true} {2155#true} #61#return; {2155#true} is VALID [2022-04-28 10:03:37,059 INFO L272 TraceCheckUtils]: 0: Hoare triple {2155#true} call ULTIMATE.init(); {2165#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:03:37,059 INFO L290 TraceCheckUtils]: 1: Hoare triple {2165#(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(10, 2);call #Ultimate.allocInit(12, 3); {2155#true} is VALID [2022-04-28 10:03:37,060 INFO L290 TraceCheckUtils]: 2: Hoare triple {2155#true} assume true; {2155#true} is VALID [2022-04-28 10:03:37,060 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2155#true} {2155#true} #61#return; {2155#true} is VALID [2022-04-28 10:03:37,060 INFO L272 TraceCheckUtils]: 4: Hoare triple {2155#true} call #t~ret11 := main(); {2155#true} is VALID [2022-04-28 10:03:37,060 INFO L290 TraceCheckUtils]: 5: Hoare triple {2155#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2160#(= main_~y~0 0)} is VALID [2022-04-28 10:03:37,060 INFO L290 TraceCheckUtils]: 6: Hoare triple {2160#(= 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; {2161#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:03:37,061 INFO L290 TraceCheckUtils]: 7: Hoare triple {2161#(and (<= 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; {2162#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:03:37,061 INFO L290 TraceCheckUtils]: 8: Hoare triple {2162#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !(~x~0 % 4294967296 > 0); {2162#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:03:37,062 INFO L290 TraceCheckUtils]: 9: Hoare triple {2162#(and (<= 2 main_~y~0) (<= main_~y~0 2))} ~z~0 := ~y~0; {2163#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-28 10:03:37,062 INFO L290 TraceCheckUtils]: 10: Hoare triple {2163#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2164#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-28 10:03:37,063 INFO L290 TraceCheckUtils]: 11: Hoare triple {2164#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {2156#false} is VALID [2022-04-28 10:03:37,063 INFO L290 TraceCheckUtils]: 12: Hoare triple {2156#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2156#false} is VALID [2022-04-28 10:03:37,063 INFO L290 TraceCheckUtils]: 13: Hoare triple {2156#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2156#false} is VALID [2022-04-28 10:03:37,063 INFO L290 TraceCheckUtils]: 14: Hoare triple {2156#false} assume !(~y~0 % 4294967296 > 0); {2156#false} is VALID [2022-04-28 10:03:37,063 INFO L272 TraceCheckUtils]: 15: Hoare triple {2156#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2156#false} is VALID [2022-04-28 10:03:37,063 INFO L290 TraceCheckUtils]: 16: Hoare triple {2156#false} ~cond := #in~cond; {2156#false} is VALID [2022-04-28 10:03:37,063 INFO L290 TraceCheckUtils]: 17: Hoare triple {2156#false} assume 0 == ~cond; {2156#false} is VALID [2022-04-28 10:03:37,063 INFO L290 TraceCheckUtils]: 18: Hoare triple {2156#false} assume !false; {2156#false} is VALID [2022-04-28 10:03:37,063 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 10:03:37,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:03:37,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254010380] [2022-04-28 10:03:37,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254010380] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:03:37,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [460104227] [2022-04-28 10:03:37,063 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:03:37,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:03:37,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:03:37,064 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:03:37,065 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-28 10:03:37,092 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-04-28 10:03:37,093 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:03:37,093 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-28 10:03:37,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:03:37,100 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:03:37,199 INFO L272 TraceCheckUtils]: 0: Hoare triple {2155#true} call ULTIMATE.init(); {2155#true} is VALID [2022-04-28 10:03:37,200 INFO L290 TraceCheckUtils]: 1: Hoare triple {2155#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(10, 2);call #Ultimate.allocInit(12, 3); {2155#true} is VALID [2022-04-28 10:03:37,200 INFO L290 TraceCheckUtils]: 2: Hoare triple {2155#true} assume true; {2155#true} is VALID [2022-04-28 10:03:37,200 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2155#true} {2155#true} #61#return; {2155#true} is VALID [2022-04-28 10:03:37,200 INFO L272 TraceCheckUtils]: 4: Hoare triple {2155#true} call #t~ret11 := main(); {2155#true} is VALID [2022-04-28 10:03:37,200 INFO L290 TraceCheckUtils]: 5: Hoare triple {2155#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2160#(= main_~y~0 0)} is VALID [2022-04-28 10:03:37,200 INFO L290 TraceCheckUtils]: 6: Hoare triple {2160#(= 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; {2161#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:03:37,201 INFO L290 TraceCheckUtils]: 7: Hoare triple {2161#(and (<= 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; {2162#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:03:37,201 INFO L290 TraceCheckUtils]: 8: Hoare triple {2162#(and (<= 2 main_~y~0) (<= main_~y~0 2))} assume !(~x~0 % 4294967296 > 0); {2162#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:03:37,202 INFO L290 TraceCheckUtils]: 9: Hoare triple {2162#(and (<= 2 main_~y~0) (<= main_~y~0 2))} ~z~0 := ~y~0; {2196#(and (= main_~z~0 main_~y~0) (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:03:37,202 INFO L290 TraceCheckUtils]: 10: Hoare triple {2196#(and (= main_~z~0 main_~y~0) (<= 2 main_~y~0) (<= main_~y~0 2))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2200#(and (<= 2 main_~y~0) (<= main_~y~0 2) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-28 10:03:37,203 INFO L290 TraceCheckUtils]: 11: Hoare triple {2200#(and (<= 2 main_~y~0) (<= main_~y~0 2) (= main_~y~0 (+ main_~z~0 1)))} assume !(~z~0 % 4294967296 > 0); {2156#false} is VALID [2022-04-28 10:03:37,203 INFO L290 TraceCheckUtils]: 12: Hoare triple {2156#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2156#false} is VALID [2022-04-28 10:03:37,203 INFO L290 TraceCheckUtils]: 13: Hoare triple {2156#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2156#false} is VALID [2022-04-28 10:03:37,203 INFO L290 TraceCheckUtils]: 14: Hoare triple {2156#false} assume !(~y~0 % 4294967296 > 0); {2156#false} is VALID [2022-04-28 10:03:37,203 INFO L272 TraceCheckUtils]: 15: Hoare triple {2156#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2156#false} is VALID [2022-04-28 10:03:37,203 INFO L290 TraceCheckUtils]: 16: Hoare triple {2156#false} ~cond := #in~cond; {2156#false} is VALID [2022-04-28 10:03:37,203 INFO L290 TraceCheckUtils]: 17: Hoare triple {2156#false} assume 0 == ~cond; {2156#false} is VALID [2022-04-28 10:03:37,203 INFO L290 TraceCheckUtils]: 18: Hoare triple {2156#false} assume !false; {2156#false} is VALID [2022-04-28 10:03:37,203 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 10:03:37,203 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:03:37,302 INFO L290 TraceCheckUtils]: 18: Hoare triple {2156#false} assume !false; {2156#false} is VALID [2022-04-28 10:03:37,302 INFO L290 TraceCheckUtils]: 17: Hoare triple {2156#false} assume 0 == ~cond; {2156#false} is VALID [2022-04-28 10:03:37,302 INFO L290 TraceCheckUtils]: 16: Hoare triple {2156#false} ~cond := #in~cond; {2156#false} is VALID [2022-04-28 10:03:37,302 INFO L272 TraceCheckUtils]: 15: Hoare triple {2156#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2156#false} is VALID [2022-04-28 10:03:37,302 INFO L290 TraceCheckUtils]: 14: Hoare triple {2156#false} assume !(~y~0 % 4294967296 > 0); {2156#false} is VALID [2022-04-28 10:03:37,303 INFO L290 TraceCheckUtils]: 13: Hoare triple {2240#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2156#false} is VALID [2022-04-28 10:03:37,304 INFO L290 TraceCheckUtils]: 12: Hoare triple {2244#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2240#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:03:37,304 INFO L290 TraceCheckUtils]: 11: Hoare triple {2248#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {2244#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:03:37,305 INFO L290 TraceCheckUtils]: 10: Hoare triple {2252#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2248#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-28 10:03:37,305 INFO L290 TraceCheckUtils]: 9: Hoare triple {2155#true} ~z~0 := ~y~0; {2252#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-28 10:03:37,305 INFO L290 TraceCheckUtils]: 8: Hoare triple {2155#true} assume !(~x~0 % 4294967296 > 0); {2155#true} is VALID [2022-04-28 10:03:37,305 INFO L290 TraceCheckUtils]: 7: Hoare triple {2155#true} 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; {2155#true} is VALID [2022-04-28 10:03:37,305 INFO L290 TraceCheckUtils]: 6: Hoare triple {2155#true} 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; {2155#true} is VALID [2022-04-28 10:03:37,305 INFO L290 TraceCheckUtils]: 5: Hoare triple {2155#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2155#true} is VALID [2022-04-28 10:03:37,305 INFO L272 TraceCheckUtils]: 4: Hoare triple {2155#true} call #t~ret11 := main(); {2155#true} is VALID [2022-04-28 10:03:37,306 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2155#true} {2155#true} #61#return; {2155#true} is VALID [2022-04-28 10:03:37,306 INFO L290 TraceCheckUtils]: 2: Hoare triple {2155#true} assume true; {2155#true} is VALID [2022-04-28 10:03:37,306 INFO L290 TraceCheckUtils]: 1: Hoare triple {2155#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(10, 2);call #Ultimate.allocInit(12, 3); {2155#true} is VALID [2022-04-28 10:03:37,306 INFO L272 TraceCheckUtils]: 0: Hoare triple {2155#true} call ULTIMATE.init(); {2155#true} is VALID [2022-04-28 10:03:37,306 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 10:03:37,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [460104227] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:03:37,306 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:03:37,306 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 6] total 14 [2022-04-28 10:03:37,306 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:03:37,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [449803450] [2022-04-28 10:03:37,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [449803450] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:03:37,306 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:03:37,306 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 10:03:37,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593644582] [2022-04-28 10:03:37,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:03:37,307 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 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 19 [2022-04-28 10:03:37,307 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:03:37,307 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 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-28 10:03:37,318 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:03:37,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 10:03:37,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:03:37,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 10:03:37,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2022-04-28 10:03:37,318 INFO L87 Difference]: Start difference. First operand 34 states and 42 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 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-28 10:03:37,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:03:37,534 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2022-04-28 10:03:37,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 10:03:37,534 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 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 19 [2022-04-28 10:03:37,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:03:37,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 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-28 10:03:37,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 37 transitions. [2022-04-28 10:03:37,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 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-28 10:03:37,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 37 transitions. [2022-04-28 10:03:37,536 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 37 transitions. [2022-04-28 10:03:37,573 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:03:37,573 INFO L225 Difference]: With dead ends: 47 [2022-04-28 10:03:37,574 INFO L226 Difference]: Without dead ends: 39 [2022-04-28 10:03:37,574 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2022-04-28 10:03:37,574 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 18 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:03:37,574 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 36 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 10:03:37,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-28 10:03:37,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 35. [2022-04-28 10:03:37,598 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:03:37,598 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 35 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 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-28 10:03:37,598 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 35 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 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-28 10:03:37,599 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 35 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 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-28 10:03:37,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:03:37,600 INFO L93 Difference]: Finished difference Result 39 states and 47 transitions. [2022-04-28 10:03:37,600 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 47 transitions. [2022-04-28 10:03:37,600 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:03:37,600 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:03:37,600 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 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 39 states. [2022-04-28 10:03:37,600 INFO L87 Difference]: Start difference. First operand has 35 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 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 39 states. [2022-04-28 10:03:37,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:03:37,601 INFO L93 Difference]: Finished difference Result 39 states and 47 transitions. [2022-04-28 10:03:37,601 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 47 transitions. [2022-04-28 10:03:37,601 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:03:37,601 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:03:37,601 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:03:37,601 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:03:37,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 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-28 10:03:37,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 43 transitions. [2022-04-28 10:03:37,602 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 43 transitions. Word has length 19 [2022-04-28 10:03:37,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:03:37,602 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 43 transitions. [2022-04-28 10:03:37,602 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 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-28 10:03:37,602 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 43 transitions. [2022-04-28 10:03:37,636 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:03:37,637 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions. [2022-04-28 10:03:37,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-28 10:03:37,637 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:03:37,637 INFO L195 NwaCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:03:37,653 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-28 10:03:37,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:03:37,853 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:03:37,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:03:37,854 INFO L85 PathProgramCache]: Analyzing trace with hash -289945490, now seen corresponding path program 9 times [2022-04-28 10:03:37,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:03:37,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1796737074] [2022-04-28 10:03:37,856 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:03:37,856 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:03:37,856 INFO L85 PathProgramCache]: Analyzing trace with hash -289945490, now seen corresponding path program 10 times [2022-04-28 10:03:37,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:03:37,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85717320] [2022-04-28 10:03:37,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:03:37,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:03:37,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:03:37,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:03:37,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:03:37,955 INFO L290 TraceCheckUtils]: 0: Hoare triple {2549#(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(10, 2);call #Ultimate.allocInit(12, 3); {2537#true} is VALID [2022-04-28 10:03:37,955 INFO L290 TraceCheckUtils]: 1: Hoare triple {2537#true} assume true; {2537#true} is VALID [2022-04-28 10:03:37,955 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2537#true} {2537#true} #61#return; {2537#true} is VALID [2022-04-28 10:03:37,956 INFO L272 TraceCheckUtils]: 0: Hoare triple {2537#true} call ULTIMATE.init(); {2549#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:03:37,956 INFO L290 TraceCheckUtils]: 1: Hoare triple {2549#(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(10, 2);call #Ultimate.allocInit(12, 3); {2537#true} is VALID [2022-04-28 10:03:37,956 INFO L290 TraceCheckUtils]: 2: Hoare triple {2537#true} assume true; {2537#true} is VALID [2022-04-28 10:03:37,956 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2537#true} {2537#true} #61#return; {2537#true} is VALID [2022-04-28 10:03:37,956 INFO L272 TraceCheckUtils]: 4: Hoare triple {2537#true} call #t~ret11 := main(); {2537#true} is VALID [2022-04-28 10:03:37,957 INFO L290 TraceCheckUtils]: 5: Hoare triple {2537#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2542#(= main_~y~0 0)} is VALID [2022-04-28 10:03:37,957 INFO L290 TraceCheckUtils]: 6: Hoare triple {2542#(= 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; {2543#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:03:37,958 INFO L290 TraceCheckUtils]: 7: Hoare triple {2543#(and (<= 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; {2544#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:03:37,958 INFO L290 TraceCheckUtils]: 8: Hoare triple {2544#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {2545#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:03:37,959 INFO L290 TraceCheckUtils]: 9: Hoare triple {2545#(and (<= main_~y~0 3) (<= 3 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; {2546#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:03:37,959 INFO L290 TraceCheckUtils]: 10: Hoare triple {2546#(and (<= main_~y~0 4) (<= 4 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; {2547#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:03:37,959 INFO L290 TraceCheckUtils]: 11: Hoare triple {2547#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {2547#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:03:37,960 INFO L290 TraceCheckUtils]: 12: Hoare triple {2547#(and (<= 5 main_~y~0) (<= main_~y~0 5))} ~z~0 := ~y~0; {2548#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:03:37,960 INFO L290 TraceCheckUtils]: 13: Hoare triple {2548#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {2538#false} is VALID [2022-04-28 10:03:37,960 INFO L290 TraceCheckUtils]: 14: Hoare triple {2538#false} assume !(~y~0 % 4294967296 > 0); {2538#false} is VALID [2022-04-28 10:03:37,960 INFO L272 TraceCheckUtils]: 15: Hoare triple {2538#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2538#false} is VALID [2022-04-28 10:03:37,960 INFO L290 TraceCheckUtils]: 16: Hoare triple {2538#false} ~cond := #in~cond; {2538#false} is VALID [2022-04-28 10:03:37,961 INFO L290 TraceCheckUtils]: 17: Hoare triple {2538#false} assume 0 == ~cond; {2538#false} is VALID [2022-04-28 10:03:37,961 INFO L290 TraceCheckUtils]: 18: Hoare triple {2538#false} assume !false; {2538#false} is VALID [2022-04-28 10:03:37,961 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:03:37,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:03:37,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85717320] [2022-04-28 10:03:37,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85717320] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:03:37,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [430477245] [2022-04-28 10:03:37,961 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:03:37,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:03:37,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:03:37,962 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:03:37,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-28 10:03:37,990 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:03:37,990 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:03:37,991 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-28 10:03:37,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:03:37,996 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:03:38,151 INFO L272 TraceCheckUtils]: 0: Hoare triple {2537#true} call ULTIMATE.init(); {2537#true} is VALID [2022-04-28 10:03:38,152 INFO L290 TraceCheckUtils]: 1: Hoare triple {2537#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(10, 2);call #Ultimate.allocInit(12, 3); {2537#true} is VALID [2022-04-28 10:03:38,152 INFO L290 TraceCheckUtils]: 2: Hoare triple {2537#true} assume true; {2537#true} is VALID [2022-04-28 10:03:38,152 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2537#true} {2537#true} #61#return; {2537#true} is VALID [2022-04-28 10:03:38,152 INFO L272 TraceCheckUtils]: 4: Hoare triple {2537#true} call #t~ret11 := main(); {2537#true} is VALID [2022-04-28 10:03:38,152 INFO L290 TraceCheckUtils]: 5: Hoare triple {2537#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2542#(= main_~y~0 0)} is VALID [2022-04-28 10:03:38,153 INFO L290 TraceCheckUtils]: 6: Hoare triple {2542#(= 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; {2543#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:03:38,153 INFO L290 TraceCheckUtils]: 7: Hoare triple {2543#(and (<= 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; {2544#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:03:38,154 INFO L290 TraceCheckUtils]: 8: Hoare triple {2544#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {2545#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:03:38,154 INFO L290 TraceCheckUtils]: 9: Hoare triple {2545#(and (<= main_~y~0 3) (<= 3 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; {2546#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:03:38,155 INFO L290 TraceCheckUtils]: 10: Hoare triple {2546#(and (<= main_~y~0 4) (<= 4 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; {2547#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:03:38,155 INFO L290 TraceCheckUtils]: 11: Hoare triple {2547#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {2547#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:03:38,155 INFO L290 TraceCheckUtils]: 12: Hoare triple {2547#(and (<= 5 main_~y~0) (<= main_~y~0 5))} ~z~0 := ~y~0; {2589#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:03:38,156 INFO L290 TraceCheckUtils]: 13: Hoare triple {2589#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {2538#false} is VALID [2022-04-28 10:03:38,156 INFO L290 TraceCheckUtils]: 14: Hoare triple {2538#false} assume !(~y~0 % 4294967296 > 0); {2538#false} is VALID [2022-04-28 10:03:38,156 INFO L272 TraceCheckUtils]: 15: Hoare triple {2538#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2538#false} is VALID [2022-04-28 10:03:38,156 INFO L290 TraceCheckUtils]: 16: Hoare triple {2538#false} ~cond := #in~cond; {2538#false} is VALID [2022-04-28 10:03:38,156 INFO L290 TraceCheckUtils]: 17: Hoare triple {2538#false} assume 0 == ~cond; {2538#false} is VALID [2022-04-28 10:03:38,156 INFO L290 TraceCheckUtils]: 18: Hoare triple {2538#false} assume !false; {2538#false} is VALID [2022-04-28 10:03:38,156 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:03:38,156 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:03:38,318 INFO L290 TraceCheckUtils]: 18: Hoare triple {2538#false} assume !false; {2538#false} is VALID [2022-04-28 10:03:38,318 INFO L290 TraceCheckUtils]: 17: Hoare triple {2538#false} assume 0 == ~cond; {2538#false} is VALID [2022-04-28 10:03:38,318 INFO L290 TraceCheckUtils]: 16: Hoare triple {2538#false} ~cond := #in~cond; {2538#false} is VALID [2022-04-28 10:03:38,318 INFO L272 TraceCheckUtils]: 15: Hoare triple {2538#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2538#false} is VALID [2022-04-28 10:03:38,318 INFO L290 TraceCheckUtils]: 14: Hoare triple {2538#false} assume !(~y~0 % 4294967296 > 0); {2538#false} is VALID [2022-04-28 10:03:38,319 INFO L290 TraceCheckUtils]: 13: Hoare triple {2623#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {2538#false} is VALID [2022-04-28 10:03:38,319 INFO L290 TraceCheckUtils]: 12: Hoare triple {2627#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {2623#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:03:38,319 INFO L290 TraceCheckUtils]: 11: Hoare triple {2627#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {2627#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:03:38,320 INFO L290 TraceCheckUtils]: 10: Hoare triple {2634#(< 0 (mod (+ main_~y~0 1) 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; {2627#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:03:38,321 INFO L290 TraceCheckUtils]: 9: Hoare triple {2638#(< 0 (mod (+ main_~y~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; {2634#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:03:38,321 INFO L290 TraceCheckUtils]: 8: Hoare triple {2642#(< 0 (mod (+ main_~y~0 3) 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; {2638#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:03:38,322 INFO L290 TraceCheckUtils]: 7: Hoare triple {2646#(< 0 (mod (+ main_~y~0 4) 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; {2642#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:03:38,322 INFO L290 TraceCheckUtils]: 6: Hoare triple {2650#(< 0 (mod (+ 5 main_~y~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; {2646#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:03:38,323 INFO L290 TraceCheckUtils]: 5: Hoare triple {2537#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2650#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:03:38,323 INFO L272 TraceCheckUtils]: 4: Hoare triple {2537#true} call #t~ret11 := main(); {2537#true} is VALID [2022-04-28 10:03:38,323 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2537#true} {2537#true} #61#return; {2537#true} is VALID [2022-04-28 10:03:38,323 INFO L290 TraceCheckUtils]: 2: Hoare triple {2537#true} assume true; {2537#true} is VALID [2022-04-28 10:03:38,323 INFO L290 TraceCheckUtils]: 1: Hoare triple {2537#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(10, 2);call #Ultimate.allocInit(12, 3); {2537#true} is VALID [2022-04-28 10:03:38,323 INFO L272 TraceCheckUtils]: 0: Hoare triple {2537#true} call ULTIMATE.init(); {2537#true} is VALID [2022-04-28 10:03:38,323 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:03:38,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [430477245] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:03:38,323 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:03:38,324 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 18 [2022-04-28 10:03:38,324 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:03:38,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1796737074] [2022-04-28 10:03:38,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1796737074] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:03:38,324 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:03:38,324 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 10:03:38,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836724095] [2022-04-28 10:03:38,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:03:38,324 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.5) internal successors, (15), 9 states have internal predecessors, (15), 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 19 [2022-04-28 10:03:38,324 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:03:38,324 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 1.5) internal successors, (15), 9 states have internal predecessors, (15), 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-28 10:03:38,337 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:03:38,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 10:03:38,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:03:38,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 10:03:38,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2022-04-28 10:03:38,338 INFO L87 Difference]: Start difference. First operand 35 states and 43 transitions. Second operand has 10 states, 10 states have (on average 1.5) internal successors, (15), 9 states have internal predecessors, (15), 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-28 10:03:38,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:03:38,790 INFO L93 Difference]: Finished difference Result 52 states and 69 transitions. [2022-04-28 10:03:38,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 10:03:38,790 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.5) internal successors, (15), 9 states have internal predecessors, (15), 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 19 [2022-04-28 10:03:38,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:03:38,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.5) internal successors, (15), 9 states have internal predecessors, (15), 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-28 10:03:38,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 60 transitions. [2022-04-28 10:03:38,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.5) internal successors, (15), 9 states have internal predecessors, (15), 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-28 10:03:38,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 60 transitions. [2022-04-28 10:03:38,792 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 60 transitions. [2022-04-28 10:03:38,837 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:03:38,838 INFO L225 Difference]: With dead ends: 52 [2022-04-28 10:03:38,838 INFO L226 Difference]: Without dead ends: 46 [2022-04-28 10:03:38,839 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=143, Invalid=457, Unknown=0, NotChecked=0, Total=600 [2022-04-28 10:03:38,847 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 44 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 10:03:38,848 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 58 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 10:03:38,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-04-28 10:03:38,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 40. [2022-04-28 10:03:38,881 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:03:38,881 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand has 40 states, 35 states have (on average 1.3142857142857143) internal successors, (46), 35 states have internal predecessors, (46), 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-28 10:03:38,881 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand has 40 states, 35 states have (on average 1.3142857142857143) internal successors, (46), 35 states have internal predecessors, (46), 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-28 10:03:38,882 INFO L87 Difference]: Start difference. First operand 46 states. Second operand has 40 states, 35 states have (on average 1.3142857142857143) internal successors, (46), 35 states have internal predecessors, (46), 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-28 10:03:38,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:03:38,883 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2022-04-28 10:03:38,883 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 56 transitions. [2022-04-28 10:03:38,883 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:03:38,883 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:03:38,883 INFO L74 IsIncluded]: Start isIncluded. First operand has 40 states, 35 states have (on average 1.3142857142857143) internal successors, (46), 35 states have internal predecessors, (46), 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 46 states. [2022-04-28 10:03:38,883 INFO L87 Difference]: Start difference. First operand has 40 states, 35 states have (on average 1.3142857142857143) internal successors, (46), 35 states have internal predecessors, (46), 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 46 states. [2022-04-28 10:03:38,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:03:38,884 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2022-04-28 10:03:38,884 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 56 transitions. [2022-04-28 10:03:38,884 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:03:38,884 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:03:38,884 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:03:38,884 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:03:38,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 35 states have (on average 1.3142857142857143) internal successors, (46), 35 states have internal predecessors, (46), 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-28 10:03:38,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 50 transitions. [2022-04-28 10:03:38,885 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 50 transitions. Word has length 19 [2022-04-28 10:03:38,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:03:38,885 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 50 transitions. [2022-04-28 10:03:38,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.5) internal successors, (15), 9 states have internal predecessors, (15), 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-28 10:03:38,885 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 50 transitions. [2022-04-28 10:03:38,925 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:03:38,926 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 50 transitions. [2022-04-28 10:03:38,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-28 10:03:38,926 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:03:38,926 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:03:38,942 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-28 10:03:39,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-04-28 10:03:39,134 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:03:39,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:03:39,134 INFO L85 PathProgramCache]: Analyzing trace with hash -854221811, now seen corresponding path program 7 times [2022-04-28 10:03:39,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:03:39,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1751247404] [2022-04-28 10:03:39,137 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:03:39,137 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:03:39,137 INFO L85 PathProgramCache]: Analyzing trace with hash -854221811, now seen corresponding path program 8 times [2022-04-28 10:03:39,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:03:39,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255302452] [2022-04-28 10:03:39,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:03:39,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:03:39,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:03:39,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:03:39,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:03:39,435 INFO L290 TraceCheckUtils]: 0: Hoare triple {2976#(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(10, 2);call #Ultimate.allocInit(12, 3); {2961#true} is VALID [2022-04-28 10:03:39,435 INFO L290 TraceCheckUtils]: 1: Hoare triple {2961#true} assume true; {2961#true} is VALID [2022-04-28 10:03:39,436 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2961#true} {2961#true} #61#return; {2961#true} is VALID [2022-04-28 10:03:39,436 INFO L272 TraceCheckUtils]: 0: Hoare triple {2961#true} call ULTIMATE.init(); {2976#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:03:39,436 INFO L290 TraceCheckUtils]: 1: Hoare triple {2976#(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(10, 2);call #Ultimate.allocInit(12, 3); {2961#true} is VALID [2022-04-28 10:03:39,436 INFO L290 TraceCheckUtils]: 2: Hoare triple {2961#true} assume true; {2961#true} is VALID [2022-04-28 10:03:39,436 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2961#true} {2961#true} #61#return; {2961#true} is VALID [2022-04-28 10:03:39,436 INFO L272 TraceCheckUtils]: 4: Hoare triple {2961#true} call #t~ret11 := main(); {2961#true} is VALID [2022-04-28 10:03:39,437 INFO L290 TraceCheckUtils]: 5: Hoare triple {2961#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2966#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-28 10:03:39,440 INFO L290 TraceCheckUtils]: 6: Hoare triple {2966#(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; {2967#(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-28 10:03:39,496 INFO L290 TraceCheckUtils]: 7: Hoare triple {2967#(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; {2968#(and (<= 2 main_~y~0) (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~x~0) (* (- 1) main_~y~0) (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296) 2) main_~n~0) (<= main_~y~0 2) (<= main_~n~0 (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) 4294967295)))} is VALID [2022-04-28 10:03:39,497 INFO L290 TraceCheckUtils]: 8: Hoare triple {2968#(and (<= 2 main_~y~0) (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~x~0) (* (- 1) main_~y~0) (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296) 2) main_~n~0) (<= main_~y~0 2) (<= main_~n~0 (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) 4294967295)))} assume !(~x~0 % 4294967296 > 0); {2969#(and (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) 2) main_~n~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:03:39,498 INFO L290 TraceCheckUtils]: 9: Hoare triple {2969#(and (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) 2) main_~n~0) (<= main_~y~0 2))} ~z~0 := ~y~0; {2970#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 2) main_~n~0) (<= main_~z~0 2))} is VALID [2022-04-28 10:03:39,499 INFO L290 TraceCheckUtils]: 10: Hoare triple {2970#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 2) main_~n~0) (<= main_~z~0 2))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2971#(and (<= main_~z~0 1) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 2) main_~n~0))} is VALID [2022-04-28 10:03:39,500 INFO L290 TraceCheckUtils]: 11: Hoare triple {2971#(and (<= main_~z~0 1) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 2) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2972#(and (<= main_~z~0 0) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 2) main_~n~0))} is VALID [2022-04-28 10:03:39,500 INFO L290 TraceCheckUtils]: 12: Hoare triple {2972#(and (<= main_~z~0 0) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 2) main_~n~0))} assume !(~z~0 % 4294967296 > 0); {2972#(and (<= main_~z~0 0) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 2) main_~n~0))} is VALID [2022-04-28 10:03:39,501 INFO L290 TraceCheckUtils]: 13: Hoare triple {2972#(and (<= main_~z~0 0) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 2) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2971#(and (<= main_~z~0 1) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 2) main_~n~0))} is VALID [2022-04-28 10:03:39,502 INFO L290 TraceCheckUtils]: 14: Hoare triple {2971#(and (<= main_~z~0 1) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 2) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2973#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-28 10:03:39,503 INFO L290 TraceCheckUtils]: 15: Hoare triple {2973#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {2973#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-28 10:03:39,504 INFO L272 TraceCheckUtils]: 16: Hoare triple {2973#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2974#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:03:39,504 INFO L290 TraceCheckUtils]: 17: Hoare triple {2974#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {2975#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 10:03:39,504 INFO L290 TraceCheckUtils]: 18: Hoare triple {2975#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {2962#false} is VALID [2022-04-28 10:03:39,504 INFO L290 TraceCheckUtils]: 19: Hoare triple {2962#false} assume !false; {2962#false} is VALID [2022-04-28 10:03:39,505 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:03:39,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:03:39,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255302452] [2022-04-28 10:03:39,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255302452] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:03:39,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [910272157] [2022-04-28 10:03:39,505 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:03:39,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:03:39,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:03:39,506 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:03:39,506 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-28 10:03:39,548 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:03:39,548 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:03:39,549 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-28 10:03:39,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:03:39,558 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:04:03,429 INFO L272 TraceCheckUtils]: 0: Hoare triple {2961#true} call ULTIMATE.init(); {2961#true} is VALID [2022-04-28 10:04:03,430 INFO L290 TraceCheckUtils]: 1: Hoare triple {2961#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(10, 2);call #Ultimate.allocInit(12, 3); {2961#true} is VALID [2022-04-28 10:04:03,430 INFO L290 TraceCheckUtils]: 2: Hoare triple {2961#true} assume true; {2961#true} is VALID [2022-04-28 10:04:03,430 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2961#true} {2961#true} #61#return; {2961#true} is VALID [2022-04-28 10:04:03,430 INFO L272 TraceCheckUtils]: 4: Hoare triple {2961#true} call #t~ret11 := main(); {2961#true} is VALID [2022-04-28 10:04:03,430 INFO L290 TraceCheckUtils]: 5: Hoare triple {2961#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2966#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-28 10:04:03,431 INFO L290 TraceCheckUtils]: 6: Hoare triple {2966#(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; {2998#(and (= (+ main_~x~0 1) main_~n~0) (= main_~y~0 1))} is VALID [2022-04-28 10:04:03,432 INFO L290 TraceCheckUtils]: 7: Hoare triple {2998#(and (= (+ main_~x~0 1) main_~n~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; {3002#(and (= main_~y~0 2) (< 0 (mod (+ main_~n~0 4294967295) 4294967296)) (= (+ main_~x~0 1) (+ (- 1) main_~n~0)))} is VALID [2022-04-28 10:04:03,432 INFO L290 TraceCheckUtils]: 8: Hoare triple {3002#(and (= main_~y~0 2) (< 0 (mod (+ main_~n~0 4294967295) 4294967296)) (= (+ main_~x~0 1) (+ (- 1) main_~n~0)))} assume !(~x~0 % 4294967296 > 0); {2969#(and (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) 2) main_~n~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:04:03,455 INFO L290 TraceCheckUtils]: 9: Hoare triple {2969#(and (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) 2) main_~n~0) (<= main_~y~0 2))} ~z~0 := ~y~0; {2970#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 2) main_~n~0) (<= main_~z~0 2))} is VALID [2022-04-28 10:04:03,457 INFO L290 TraceCheckUtils]: 10: Hoare triple {2970#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 2) main_~n~0) (<= main_~z~0 2))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2971#(and (<= main_~z~0 1) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 2) main_~n~0))} is VALID [2022-04-28 10:04:03,458 INFO L290 TraceCheckUtils]: 11: Hoare triple {2971#(and (<= main_~z~0 1) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 2) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2972#(and (<= main_~z~0 0) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 2) main_~n~0))} is VALID [2022-04-28 10:04:03,461 INFO L290 TraceCheckUtils]: 12: Hoare triple {2972#(and (<= main_~z~0 0) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 2) main_~n~0))} assume !(~z~0 % 4294967296 > 0); {2972#(and (<= main_~z~0 0) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 2) main_~n~0))} is VALID [2022-04-28 10:04:03,462 INFO L290 TraceCheckUtils]: 13: Hoare triple {2972#(and (<= main_~z~0 0) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 2) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2971#(and (<= main_~z~0 1) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 2) main_~n~0))} is VALID [2022-04-28 10:04:03,463 INFO L290 TraceCheckUtils]: 14: Hoare triple {2971#(and (<= main_~z~0 1) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 2) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2970#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 2) main_~n~0) (<= main_~z~0 2))} is VALID [2022-04-28 10:04:03,463 INFO L290 TraceCheckUtils]: 15: Hoare triple {2970#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 2) main_~n~0) (<= main_~z~0 2))} assume !(~y~0 % 4294967296 > 0); {2970#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 2) main_~n~0) (<= main_~z~0 2))} is VALID [2022-04-28 10:04:03,465 INFO L272 TraceCheckUtils]: 16: Hoare triple {2970#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 2) main_~n~0) (<= main_~z~0 2))} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {3030#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:04:03,465 INFO L290 TraceCheckUtils]: 17: Hoare triple {3030#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3034#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:04:03,465 INFO L290 TraceCheckUtils]: 18: Hoare triple {3034#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2962#false} is VALID [2022-04-28 10:04:03,465 INFO L290 TraceCheckUtils]: 19: Hoare triple {2962#false} assume !false; {2962#false} is VALID [2022-04-28 10:04:03,466 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:04:03,466 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:04:03,972 INFO L290 TraceCheckUtils]: 19: Hoare triple {2962#false} assume !false; {2962#false} is VALID [2022-04-28 10:04:03,973 INFO L290 TraceCheckUtils]: 18: Hoare triple {3034#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2962#false} is VALID [2022-04-28 10:04:03,973 INFO L290 TraceCheckUtils]: 17: Hoare triple {3030#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3034#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:04:03,974 INFO L272 TraceCheckUtils]: 16: Hoare triple {2973#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {3030#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:04:03,977 INFO L290 TraceCheckUtils]: 15: Hoare triple {2973#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {2973#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-28 10:04:03,978 INFO L290 TraceCheckUtils]: 14: Hoare triple {3056#(and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2973#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-28 10:04:03,979 INFO L290 TraceCheckUtils]: 13: Hoare triple {3060#(and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {3056#(and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-28 10:04:03,979 INFO L290 TraceCheckUtils]: 12: Hoare triple {3060#(and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0)))} assume !(~z~0 % 4294967296 > 0); {3060#(and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-28 10:04:03,980 INFO L290 TraceCheckUtils]: 11: Hoare triple {3056#(and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3060#(and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-28 10:04:03,981 INFO L290 TraceCheckUtils]: 10: Hoare triple {2973#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3056#(and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-28 10:04:03,981 INFO L290 TraceCheckUtils]: 9: Hoare triple {3073#(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)))} ~z~0 := ~y~0; {2973#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-28 10:04:03,982 INFO L290 TraceCheckUtils]: 8: Hoare triple {3077#(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); {3073#(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-28 10:04:03,984 INFO L290 TraceCheckUtils]: 7: Hoare triple {3081#(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; {3077#(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-28 10:04:03,985 INFO L290 TraceCheckUtils]: 6: Hoare triple {3085#(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; {3081#(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-28 10:04:03,986 INFO L290 TraceCheckUtils]: 5: Hoare triple {2961#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3085#(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-28 10:04:03,986 INFO L272 TraceCheckUtils]: 4: Hoare triple {2961#true} call #t~ret11 := main(); {2961#true} is VALID [2022-04-28 10:04:03,986 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2961#true} {2961#true} #61#return; {2961#true} is VALID [2022-04-28 10:04:03,986 INFO L290 TraceCheckUtils]: 2: Hoare triple {2961#true} assume true; {2961#true} is VALID [2022-04-28 10:04:03,986 INFO L290 TraceCheckUtils]: 1: Hoare triple {2961#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(10, 2);call #Ultimate.allocInit(12, 3); {2961#true} is VALID [2022-04-28 10:04:03,986 INFO L272 TraceCheckUtils]: 0: Hoare triple {2961#true} call ULTIMATE.init(); {2961#true} is VALID [2022-04-28 10:04:03,986 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:04:03,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [910272157] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:04:03,986 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:04:03,986 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 23 [2022-04-28 10:04:03,987 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:04:03,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1751247404] [2022-04-28 10:04:03,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1751247404] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:04:03,987 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:04:03,987 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 10:04:03,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558858089] [2022-04-28 10:04:03,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:04:03,988 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 11 states have internal predecessors, (16), 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 20 [2022-04-28 10:04:03,988 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:04:03,988 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 11 states have internal predecessors, (16), 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-28 10:04:04,014 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:04:04,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 10:04:04,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:04:04,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 10:04:04,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=440, Unknown=0, NotChecked=0, Total=506 [2022-04-28 10:04:04,014 INFO L87 Difference]: Start difference. First operand 40 states and 50 transitions. Second operand has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 11 states have internal predecessors, (16), 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-28 10:04:04,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:04,720 INFO L93 Difference]: Finished difference Result 55 states and 65 transitions. [2022-04-28 10:04:04,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-28 10:04:04,720 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 11 states have internal predecessors, (16), 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 20 [2022-04-28 10:04:04,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:04:04,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 11 states have internal predecessors, (16), 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-28 10:04:04,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 40 transitions. [2022-04-28 10:04:04,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 11 states have internal predecessors, (16), 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-28 10:04:04,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 40 transitions. [2022-04-28 10:04:04,722 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 40 transitions. [2022-04-28 10:04:04,774 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:04:04,775 INFO L225 Difference]: With dead ends: 55 [2022-04-28 10:04:04,775 INFO L226 Difference]: Without dead ends: 36 [2022-04-28 10:04:04,775 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 29 SyntacticMatches, 4 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=149, Invalid=973, Unknown=0, NotChecked=0, Total=1122 [2022-04-28 10:04:04,776 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 21 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 10:04:04,777 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 57 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 10:04:04,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-28 10:04:04,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-04-28 10:04:04,803 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:04:04,803 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 36 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 31 states have internal predecessors, (40), 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-28 10:04:04,804 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 36 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 31 states have internal predecessors, (40), 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-28 10:04:04,804 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 36 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 31 states have internal predecessors, (40), 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-28 10:04:04,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:04,806 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2022-04-28 10:04:04,806 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions. [2022-04-28 10:04:04,806 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:04:04,806 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:04:04,806 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 31 states have internal predecessors, (40), 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 36 states. [2022-04-28 10:04:04,806 INFO L87 Difference]: Start difference. First operand has 36 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 31 states have internal predecessors, (40), 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 36 states. [2022-04-28 10:04:04,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:04,807 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2022-04-28 10:04:04,807 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions. [2022-04-28 10:04:04,807 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:04:04,807 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:04:04,807 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:04:04,807 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:04:04,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 31 states have internal predecessors, (40), 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-28 10:04:04,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2022-04-28 10:04:04,808 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 44 transitions. Word has length 20 [2022-04-28 10:04:04,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:04:04,808 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 44 transitions. [2022-04-28 10:04:04,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 11 states have internal predecessors, (16), 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-28 10:04:04,808 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 44 transitions. [2022-04-28 10:04:05,114 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-28 10:04:05,114 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions. [2022-04-28 10:04:05,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-28 10:04:05,114 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:04:05,114 INFO L195 NwaCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:04:05,130 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-28 10:04:05,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-28 10:04:05,315 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:04:05,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:04:05,316 INFO L85 PathProgramCache]: Analyzing trace with hash 454480301, now seen corresponding path program 11 times [2022-04-28 10:04:05,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:04:05,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1128803399] [2022-04-28 10:04:05,318 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:04:05,318 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:04:05,318 INFO L85 PathProgramCache]: Analyzing trace with hash 454480301, now seen corresponding path program 12 times [2022-04-28 10:04:05,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:04:05,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166964003] [2022-04-28 10:04:05,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:04:05,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:04:05,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:05,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:04:05,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:05,429 INFO L290 TraceCheckUtils]: 0: Hoare triple {3395#(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(10, 2);call #Ultimate.allocInit(12, 3); {3382#true} is VALID [2022-04-28 10:04:05,429 INFO L290 TraceCheckUtils]: 1: Hoare triple {3382#true} assume true; {3382#true} is VALID [2022-04-28 10:04:05,429 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3382#true} {3382#true} #61#return; {3382#true} is VALID [2022-04-28 10:04:05,430 INFO L272 TraceCheckUtils]: 0: Hoare triple {3382#true} call ULTIMATE.init(); {3395#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:04:05,430 INFO L290 TraceCheckUtils]: 1: Hoare triple {3395#(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(10, 2);call #Ultimate.allocInit(12, 3); {3382#true} is VALID [2022-04-28 10:04:05,430 INFO L290 TraceCheckUtils]: 2: Hoare triple {3382#true} assume true; {3382#true} is VALID [2022-04-28 10:04:05,430 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3382#true} {3382#true} #61#return; {3382#true} is VALID [2022-04-28 10:04:05,430 INFO L272 TraceCheckUtils]: 4: Hoare triple {3382#true} call #t~ret11 := main(); {3382#true} is VALID [2022-04-28 10:04:05,430 INFO L290 TraceCheckUtils]: 5: Hoare triple {3382#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3387#(= main_~y~0 0)} is VALID [2022-04-28 10:04:05,431 INFO L290 TraceCheckUtils]: 6: Hoare triple {3387#(= 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; {3388#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:04:05,431 INFO L290 TraceCheckUtils]: 7: Hoare triple {3388#(and (<= 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; {3389#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:04:05,432 INFO L290 TraceCheckUtils]: 8: Hoare triple {3389#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {3390#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:04:05,432 INFO L290 TraceCheckUtils]: 9: Hoare triple {3390#(and (<= main_~y~0 3) (<= 3 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; {3391#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:04:05,433 INFO L290 TraceCheckUtils]: 10: Hoare triple {3391#(and (<= main_~y~0 4) (<= 4 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; {3392#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:04:05,433 INFO L290 TraceCheckUtils]: 11: Hoare triple {3392#(and (<= 5 main_~y~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; {3393#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:04:05,434 INFO L290 TraceCheckUtils]: 12: Hoare triple {3393#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {3393#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:04:05,434 INFO L290 TraceCheckUtils]: 13: Hoare triple {3393#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {3394#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} is VALID [2022-04-28 10:04:05,435 INFO L290 TraceCheckUtils]: 14: Hoare triple {3394#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {3383#false} is VALID [2022-04-28 10:04:05,435 INFO L290 TraceCheckUtils]: 15: Hoare triple {3383#false} assume !(~y~0 % 4294967296 > 0); {3383#false} is VALID [2022-04-28 10:04:05,435 INFO L272 TraceCheckUtils]: 16: Hoare triple {3383#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {3383#false} is VALID [2022-04-28 10:04:05,435 INFO L290 TraceCheckUtils]: 17: Hoare triple {3383#false} ~cond := #in~cond; {3383#false} is VALID [2022-04-28 10:04:05,435 INFO L290 TraceCheckUtils]: 18: Hoare triple {3383#false} assume 0 == ~cond; {3383#false} is VALID [2022-04-28 10:04:05,435 INFO L290 TraceCheckUtils]: 19: Hoare triple {3383#false} assume !false; {3383#false} is VALID [2022-04-28 10:04:05,435 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:04:05,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:04:05,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166964003] [2022-04-28 10:04:05,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166964003] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:04:05,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1591287010] [2022-04-28 10:04:05,435 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:04:05,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:04:05,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:04:05,436 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:04:05,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-28 10:04:05,473 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-28 10:04:05,473 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:04:05,474 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-28 10:04:05,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:05,479 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:04:05,654 INFO L272 TraceCheckUtils]: 0: Hoare triple {3382#true} call ULTIMATE.init(); {3382#true} is VALID [2022-04-28 10:04:05,655 INFO L290 TraceCheckUtils]: 1: Hoare triple {3382#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(10, 2);call #Ultimate.allocInit(12, 3); {3382#true} is VALID [2022-04-28 10:04:05,655 INFO L290 TraceCheckUtils]: 2: Hoare triple {3382#true} assume true; {3382#true} is VALID [2022-04-28 10:04:05,655 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3382#true} {3382#true} #61#return; {3382#true} is VALID [2022-04-28 10:04:05,655 INFO L272 TraceCheckUtils]: 4: Hoare triple {3382#true} call #t~ret11 := main(); {3382#true} is VALID [2022-04-28 10:04:05,655 INFO L290 TraceCheckUtils]: 5: Hoare triple {3382#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3387#(= main_~y~0 0)} is VALID [2022-04-28 10:04:05,655 INFO L290 TraceCheckUtils]: 6: Hoare triple {3387#(= 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; {3388#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:04:05,680 INFO L290 TraceCheckUtils]: 7: Hoare triple {3388#(and (<= 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; {3389#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:04:05,681 INFO L290 TraceCheckUtils]: 8: Hoare triple {3389#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {3390#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:04:05,681 INFO L290 TraceCheckUtils]: 9: Hoare triple {3390#(and (<= main_~y~0 3) (<= 3 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; {3391#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:04:05,682 INFO L290 TraceCheckUtils]: 10: Hoare triple {3391#(and (<= main_~y~0 4) (<= 4 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; {3392#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:04:05,682 INFO L290 TraceCheckUtils]: 11: Hoare triple {3392#(and (<= 5 main_~y~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; {3393#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:04:05,683 INFO L290 TraceCheckUtils]: 12: Hoare triple {3393#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {3393#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:04:05,683 INFO L290 TraceCheckUtils]: 13: Hoare triple {3393#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {3438#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:04:05,684 INFO L290 TraceCheckUtils]: 14: Hoare triple {3438#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {3383#false} is VALID [2022-04-28 10:04:05,684 INFO L290 TraceCheckUtils]: 15: Hoare triple {3383#false} assume !(~y~0 % 4294967296 > 0); {3383#false} is VALID [2022-04-28 10:04:05,684 INFO L272 TraceCheckUtils]: 16: Hoare triple {3383#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {3383#false} is VALID [2022-04-28 10:04:05,684 INFO L290 TraceCheckUtils]: 17: Hoare triple {3383#false} ~cond := #in~cond; {3383#false} is VALID [2022-04-28 10:04:05,684 INFO L290 TraceCheckUtils]: 18: Hoare triple {3383#false} assume 0 == ~cond; {3383#false} is VALID [2022-04-28 10:04:05,684 INFO L290 TraceCheckUtils]: 19: Hoare triple {3383#false} assume !false; {3383#false} is VALID [2022-04-28 10:04:05,684 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:04:05,684 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:04:05,845 INFO L290 TraceCheckUtils]: 19: Hoare triple {3383#false} assume !false; {3383#false} is VALID [2022-04-28 10:04:05,845 INFO L290 TraceCheckUtils]: 18: Hoare triple {3383#false} assume 0 == ~cond; {3383#false} is VALID [2022-04-28 10:04:05,845 INFO L290 TraceCheckUtils]: 17: Hoare triple {3383#false} ~cond := #in~cond; {3383#false} is VALID [2022-04-28 10:04:05,845 INFO L272 TraceCheckUtils]: 16: Hoare triple {3383#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {3383#false} is VALID [2022-04-28 10:04:05,845 INFO L290 TraceCheckUtils]: 15: Hoare triple {3383#false} assume !(~y~0 % 4294967296 > 0); {3383#false} is VALID [2022-04-28 10:04:05,852 INFO L290 TraceCheckUtils]: 14: Hoare triple {3472#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {3383#false} is VALID [2022-04-28 10:04:05,852 INFO L290 TraceCheckUtils]: 13: Hoare triple {3476#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {3472#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:04:05,852 INFO L290 TraceCheckUtils]: 12: Hoare triple {3476#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {3476#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:04:05,853 INFO L290 TraceCheckUtils]: 11: Hoare triple {3483#(< 0 (mod (+ main_~y~0 1) 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; {3476#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:04:05,854 INFO L290 TraceCheckUtils]: 10: Hoare triple {3487#(< 0 (mod (+ main_~y~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; {3483#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:04:05,854 INFO L290 TraceCheckUtils]: 9: Hoare triple {3491#(< 0 (mod (+ main_~y~0 3) 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; {3487#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:04:05,855 INFO L290 TraceCheckUtils]: 8: Hoare triple {3495#(< 0 (mod (+ main_~y~0 4) 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; {3491#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:04:05,856 INFO L290 TraceCheckUtils]: 7: Hoare triple {3499#(< 0 (mod (+ 5 main_~y~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; {3495#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:04:05,856 INFO L290 TraceCheckUtils]: 6: Hoare triple {3503#(< 0 (mod (+ main_~y~0 6) 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; {3499#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:04:05,857 INFO L290 TraceCheckUtils]: 5: Hoare triple {3382#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3503#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:04:05,857 INFO L272 TraceCheckUtils]: 4: Hoare triple {3382#true} call #t~ret11 := main(); {3382#true} is VALID [2022-04-28 10:04:05,857 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3382#true} {3382#true} #61#return; {3382#true} is VALID [2022-04-28 10:04:05,857 INFO L290 TraceCheckUtils]: 2: Hoare triple {3382#true} assume true; {3382#true} is VALID [2022-04-28 10:04:05,857 INFO L290 TraceCheckUtils]: 1: Hoare triple {3382#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(10, 2);call #Ultimate.allocInit(12, 3); {3382#true} is VALID [2022-04-28 10:04:05,857 INFO L272 TraceCheckUtils]: 0: Hoare triple {3382#true} call ULTIMATE.init(); {3382#true} is VALID [2022-04-28 10:04:05,857 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:04:05,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1591287010] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:04:05,857 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:04:05,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 20 [2022-04-28 10:04:05,857 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:04:05,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1128803399] [2022-04-28 10:04:05,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1128803399] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:04:05,858 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:04:05,858 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 10:04:05,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432564052] [2022-04-28 10:04:05,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:04:05,858 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 10 states have internal predecessors, (16), 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 20 [2022-04-28 10:04:05,858 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:04:05,858 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 10 states have internal predecessors, (16), 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-28 10:04:05,870 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:04:05,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 10:04:05,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:04:05,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 10:04:05,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2022-04-28 10:04:05,871 INFO L87 Difference]: Start difference. First operand 36 states and 44 transitions. Second operand has 11 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 10 states have internal predecessors, (16), 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-28 10:04:06,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:06,394 INFO L93 Difference]: Finished difference Result 54 states and 72 transitions. [2022-04-28 10:04:06,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 10:04:06,394 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 10 states have internal predecessors, (16), 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 20 [2022-04-28 10:04:06,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:04:06,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 10 states have internal predecessors, (16), 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-28 10:04:06,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 63 transitions. [2022-04-28 10:04:06,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 10 states have internal predecessors, (16), 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-28 10:04:06,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 63 transitions. [2022-04-28 10:04:06,396 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 63 transitions. [2022-04-28 10:04:06,453 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:04:06,454 INFO L225 Difference]: With dead ends: 54 [2022-04-28 10:04:06,454 INFO L226 Difference]: Without dead ends: 48 [2022-04-28 10:04:06,455 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=178, Invalid=578, Unknown=0, NotChecked=0, Total=756 [2022-04-28 10:04:06,455 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 44 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 10:04:06,455 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 63 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 10:04:06,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-04-28 10:04:06,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 41. [2022-04-28 10:04:06,488 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:04:06,488 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand has 41 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 36 states have internal predecessors, (47), 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-28 10:04:06,488 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand has 41 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 36 states have internal predecessors, (47), 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-28 10:04:06,488 INFO L87 Difference]: Start difference. First operand 48 states. Second operand has 41 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 36 states have internal predecessors, (47), 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-28 10:04:06,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:06,489 INFO L93 Difference]: Finished difference Result 48 states and 58 transitions. [2022-04-28 10:04:06,489 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 58 transitions. [2022-04-28 10:04:06,489 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:04:06,489 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:04:06,490 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 36 states have internal predecessors, (47), 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 48 states. [2022-04-28 10:04:06,490 INFO L87 Difference]: Start difference. First operand has 41 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 36 states have internal predecessors, (47), 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 48 states. [2022-04-28 10:04:06,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:06,491 INFO L93 Difference]: Finished difference Result 48 states and 58 transitions. [2022-04-28 10:04:06,491 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 58 transitions. [2022-04-28 10:04:06,491 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:04:06,491 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:04:06,491 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:04:06,491 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:04:06,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 36 states have internal predecessors, (47), 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-28 10:04:06,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 51 transitions. [2022-04-28 10:04:06,492 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 51 transitions. Word has length 20 [2022-04-28 10:04:06,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:04:06,492 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 51 transitions. [2022-04-28 10:04:06,492 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 10 states have internal predecessors, (16), 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-28 10:04:06,492 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 51 transitions. [2022-04-28 10:04:06,551 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:04:06,552 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 51 transitions. [2022-04-28 10:04:06,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-28 10:04:06,552 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:04:06,552 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:04:06,568 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-28 10:04:06,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-04-28 10:04:06,752 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:04:06,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:04:06,753 INFO L85 PathProgramCache]: Analyzing trace with hash 1249780735, now seen corresponding path program 9 times [2022-04-28 10:04:06,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:04:06,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [849828074] [2022-04-28 10:04:06,755 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:04:06,755 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:04:06,755 INFO L85 PathProgramCache]: Analyzing trace with hash 1249780735, now seen corresponding path program 10 times [2022-04-28 10:04:06,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:04:06,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897140899] [2022-04-28 10:04:06,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:04:06,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:04:06,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:06,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:04:06,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:06,855 INFO L290 TraceCheckUtils]: 0: Hoare triple {3837#(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(10, 2);call #Ultimate.allocInit(12, 3); {3826#true} is VALID [2022-04-28 10:04:06,855 INFO L290 TraceCheckUtils]: 1: Hoare triple {3826#true} assume true; {3826#true} is VALID [2022-04-28 10:04:06,856 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3826#true} {3826#true} #61#return; {3826#true} is VALID [2022-04-28 10:04:06,856 INFO L272 TraceCheckUtils]: 0: Hoare triple {3826#true} call ULTIMATE.init(); {3837#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:04:06,856 INFO L290 TraceCheckUtils]: 1: Hoare triple {3837#(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(10, 2);call #Ultimate.allocInit(12, 3); {3826#true} is VALID [2022-04-28 10:04:06,856 INFO L290 TraceCheckUtils]: 2: Hoare triple {3826#true} assume true; {3826#true} is VALID [2022-04-28 10:04:06,856 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3826#true} {3826#true} #61#return; {3826#true} is VALID [2022-04-28 10:04:06,856 INFO L272 TraceCheckUtils]: 4: Hoare triple {3826#true} call #t~ret11 := main(); {3826#true} is VALID [2022-04-28 10:04:06,856 INFO L290 TraceCheckUtils]: 5: Hoare triple {3826#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3831#(= main_~y~0 0)} is VALID [2022-04-28 10:04:06,857 INFO L290 TraceCheckUtils]: 6: Hoare triple {3831#(= 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; {3832#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:04:06,857 INFO L290 TraceCheckUtils]: 7: Hoare triple {3832#(and (<= 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; {3833#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:04:06,858 INFO L290 TraceCheckUtils]: 8: Hoare triple {3833#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {3834#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:04:06,858 INFO L290 TraceCheckUtils]: 9: Hoare triple {3834#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {3834#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:04:06,859 INFO L290 TraceCheckUtils]: 10: Hoare triple {3834#(and (<= main_~y~0 3) (<= 3 main_~y~0))} ~z~0 := ~y~0; {3835#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:04:06,859 INFO L290 TraceCheckUtils]: 11: Hoare triple {3835#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3836#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} is VALID [2022-04-28 10:04:06,860 INFO L290 TraceCheckUtils]: 12: Hoare triple {3836#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {3827#false} is VALID [2022-04-28 10:04:06,860 INFO L290 TraceCheckUtils]: 13: Hoare triple {3827#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {3827#false} is VALID [2022-04-28 10:04:06,860 INFO L290 TraceCheckUtils]: 14: Hoare triple {3827#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {3827#false} is VALID [2022-04-28 10:04:06,860 INFO L290 TraceCheckUtils]: 15: Hoare triple {3827#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {3827#false} is VALID [2022-04-28 10:04:06,860 INFO L290 TraceCheckUtils]: 16: Hoare triple {3827#false} assume !(~y~0 % 4294967296 > 0); {3827#false} is VALID [2022-04-28 10:04:06,860 INFO L272 TraceCheckUtils]: 17: Hoare triple {3827#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {3827#false} is VALID [2022-04-28 10:04:06,860 INFO L290 TraceCheckUtils]: 18: Hoare triple {3827#false} ~cond := #in~cond; {3827#false} is VALID [2022-04-28 10:04:06,860 INFO L290 TraceCheckUtils]: 19: Hoare triple {3827#false} assume 0 == ~cond; {3827#false} is VALID [2022-04-28 10:04:06,860 INFO L290 TraceCheckUtils]: 20: Hoare triple {3827#false} assume !false; {3827#false} is VALID [2022-04-28 10:04:06,860 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-28 10:04:06,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:04:06,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897140899] [2022-04-28 10:04:06,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897140899] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:04:06,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1787779996] [2022-04-28 10:04:06,861 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:04:06,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:04:06,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:04:06,861 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:04:06,862 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-04-28 10:04:06,890 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:04:06,891 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:04:06,891 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-28 10:04:06,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:06,902 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:04:06,997 INFO L272 TraceCheckUtils]: 0: Hoare triple {3826#true} call ULTIMATE.init(); {3826#true} is VALID [2022-04-28 10:04:06,997 INFO L290 TraceCheckUtils]: 1: Hoare triple {3826#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(10, 2);call #Ultimate.allocInit(12, 3); {3826#true} is VALID [2022-04-28 10:04:06,997 INFO L290 TraceCheckUtils]: 2: Hoare triple {3826#true} assume true; {3826#true} is VALID [2022-04-28 10:04:06,997 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3826#true} {3826#true} #61#return; {3826#true} is VALID [2022-04-28 10:04:06,997 INFO L272 TraceCheckUtils]: 4: Hoare triple {3826#true} call #t~ret11 := main(); {3826#true} is VALID [2022-04-28 10:04:06,997 INFO L290 TraceCheckUtils]: 5: Hoare triple {3826#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3831#(= main_~y~0 0)} is VALID [2022-04-28 10:04:06,997 INFO L290 TraceCheckUtils]: 6: Hoare triple {3831#(= 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; {3832#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:04:06,998 INFO L290 TraceCheckUtils]: 7: Hoare triple {3832#(and (<= 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; {3833#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:04:06,999 INFO L290 TraceCheckUtils]: 8: Hoare triple {3833#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {3834#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:04:06,999 INFO L290 TraceCheckUtils]: 9: Hoare triple {3834#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {3834#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:04:06,999 INFO L290 TraceCheckUtils]: 10: Hoare triple {3834#(and (<= main_~y~0 3) (<= 3 main_~y~0))} ~z~0 := ~y~0; {3871#(and (= main_~z~0 main_~y~0) (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:04:07,000 INFO L290 TraceCheckUtils]: 11: Hoare triple {3871#(and (= main_~z~0 main_~y~0) (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3875#(and (<= main_~y~0 3) (<= 3 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-28 10:04:07,000 INFO L290 TraceCheckUtils]: 12: Hoare triple {3875#(and (<= main_~y~0 3) (<= 3 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} assume !(~z~0 % 4294967296 > 0); {3827#false} is VALID [2022-04-28 10:04:07,000 INFO L290 TraceCheckUtils]: 13: Hoare triple {3827#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {3827#false} is VALID [2022-04-28 10:04:07,000 INFO L290 TraceCheckUtils]: 14: Hoare triple {3827#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {3827#false} is VALID [2022-04-28 10:04:07,000 INFO L290 TraceCheckUtils]: 15: Hoare triple {3827#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {3827#false} is VALID [2022-04-28 10:04:07,000 INFO L290 TraceCheckUtils]: 16: Hoare triple {3827#false} assume !(~y~0 % 4294967296 > 0); {3827#false} is VALID [2022-04-28 10:04:07,000 INFO L272 TraceCheckUtils]: 17: Hoare triple {3827#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {3827#false} is VALID [2022-04-28 10:04:07,000 INFO L290 TraceCheckUtils]: 18: Hoare triple {3827#false} ~cond := #in~cond; {3827#false} is VALID [2022-04-28 10:04:07,000 INFO L290 TraceCheckUtils]: 19: Hoare triple {3827#false} assume 0 == ~cond; {3827#false} is VALID [2022-04-28 10:04:07,000 INFO L290 TraceCheckUtils]: 20: Hoare triple {3827#false} assume !false; {3827#false} is VALID [2022-04-28 10:04:07,001 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-28 10:04:07,001 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:04:07,104 INFO L290 TraceCheckUtils]: 20: Hoare triple {3827#false} assume !false; {3827#false} is VALID [2022-04-28 10:04:07,104 INFO L290 TraceCheckUtils]: 19: Hoare triple {3827#false} assume 0 == ~cond; {3827#false} is VALID [2022-04-28 10:04:07,104 INFO L290 TraceCheckUtils]: 18: Hoare triple {3827#false} ~cond := #in~cond; {3827#false} is VALID [2022-04-28 10:04:07,104 INFO L272 TraceCheckUtils]: 17: Hoare triple {3827#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {3827#false} is VALID [2022-04-28 10:04:07,104 INFO L290 TraceCheckUtils]: 16: Hoare triple {3827#false} assume !(~y~0 % 4294967296 > 0); {3827#false} is VALID [2022-04-28 10:04:07,104 INFO L290 TraceCheckUtils]: 15: Hoare triple {3827#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {3827#false} is VALID [2022-04-28 10:04:07,104 INFO L290 TraceCheckUtils]: 14: Hoare triple {3921#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {3827#false} is VALID [2022-04-28 10:04:07,105 INFO L290 TraceCheckUtils]: 13: Hoare triple {3925#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {3921#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:04:07,106 INFO L290 TraceCheckUtils]: 12: Hoare triple {3929#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {3925#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:04:07,107 INFO L290 TraceCheckUtils]: 11: Hoare triple {3933#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3929#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-28 10:04:07,107 INFO L290 TraceCheckUtils]: 10: Hoare triple {3826#true} ~z~0 := ~y~0; {3933#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-28 10:04:07,107 INFO L290 TraceCheckUtils]: 9: Hoare triple {3826#true} assume !(~x~0 % 4294967296 > 0); {3826#true} is VALID [2022-04-28 10:04:07,107 INFO L290 TraceCheckUtils]: 8: Hoare triple {3826#true} 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; {3826#true} is VALID [2022-04-28 10:04:07,107 INFO L290 TraceCheckUtils]: 7: Hoare triple {3826#true} 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; {3826#true} is VALID [2022-04-28 10:04:07,107 INFO L290 TraceCheckUtils]: 6: Hoare triple {3826#true} 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; {3826#true} is VALID [2022-04-28 10:04:07,107 INFO L290 TraceCheckUtils]: 5: Hoare triple {3826#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3826#true} is VALID [2022-04-28 10:04:07,107 INFO L272 TraceCheckUtils]: 4: Hoare triple {3826#true} call #t~ret11 := main(); {3826#true} is VALID [2022-04-28 10:04:07,107 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3826#true} {3826#true} #61#return; {3826#true} is VALID [2022-04-28 10:04:07,107 INFO L290 TraceCheckUtils]: 2: Hoare triple {3826#true} assume true; {3826#true} is VALID [2022-04-28 10:04:07,107 INFO L290 TraceCheckUtils]: 1: Hoare triple {3826#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(10, 2);call #Ultimate.allocInit(12, 3); {3826#true} is VALID [2022-04-28 10:04:07,108 INFO L272 TraceCheckUtils]: 0: Hoare triple {3826#true} call ULTIMATE.init(); {3826#true} is VALID [2022-04-28 10:04:07,108 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-28 10:04:07,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1787779996] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:04:07,108 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:04:07,108 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 6] total 15 [2022-04-28 10:04:07,108 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:04:07,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [849828074] [2022-04-28 10:04:07,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [849828074] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:04:07,108 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:04:07,108 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 10:04:07,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513423411] [2022-04-28 10:04:07,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:04:07,109 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 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 21 [2022-04-28 10:04:07,109 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:04:07,109 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 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-28 10:04:07,120 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:04:07,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 10:04:07,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:04:07,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 10:04:07,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2022-04-28 10:04:07,121 INFO L87 Difference]: Start difference. First operand 41 states and 51 transitions. Second operand has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 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-28 10:04:07,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:07,405 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions. [2022-04-28 10:04:07,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 10:04:07,405 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 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 21 [2022-04-28 10:04:07,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:04:07,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 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-28 10:04:07,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 39 transitions. [2022-04-28 10:04:07,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 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-28 10:04:07,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 39 transitions. [2022-04-28 10:04:07,406 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 39 transitions. [2022-04-28 10:04:07,435 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:04:07,441 INFO L225 Difference]: With dead ends: 56 [2022-04-28 10:04:07,441 INFO L226 Difference]: Without dead ends: 47 [2022-04-28 10:04:07,441 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=334, Unknown=0, NotChecked=0, Total=420 [2022-04-28 10:04:07,442 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 18 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:04:07,442 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 46 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 10:04:07,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-28 10:04:07,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 42. [2022-04-28 10:04:07,476 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:04:07,477 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 42 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 37 states have internal predecessors, (48), 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-28 10:04:07,477 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 42 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 37 states have internal predecessors, (48), 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-28 10:04:07,477 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 42 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 37 states have internal predecessors, (48), 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-28 10:04:07,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:07,478 INFO L93 Difference]: Finished difference Result 47 states and 57 transitions. [2022-04-28 10:04:07,478 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 57 transitions. [2022-04-28 10:04:07,478 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:04:07,478 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:04:07,478 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 37 states have internal predecessors, (48), 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 47 states. [2022-04-28 10:04:07,479 INFO L87 Difference]: Start difference. First operand has 42 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 37 states have internal predecessors, (48), 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 47 states. [2022-04-28 10:04:07,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:07,482 INFO L93 Difference]: Finished difference Result 47 states and 57 transitions. [2022-04-28 10:04:07,495 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 57 transitions. [2022-04-28 10:04:07,495 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:04:07,495 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:04:07,495 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:04:07,495 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:04:07,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 37 states have internal predecessors, (48), 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-28 10:04:07,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 52 transitions. [2022-04-28 10:04:07,496 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 52 transitions. Word has length 21 [2022-04-28 10:04:07,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:04:07,496 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 52 transitions. [2022-04-28 10:04:07,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 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-28 10:04:07,496 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 52 transitions. [2022-04-28 10:04:07,550 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:04:07,555 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 52 transitions. [2022-04-28 10:04:07,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-28 10:04:07,556 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:04:07,556 INFO L195 NwaCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:04:07,573 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-04-28 10:04:07,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-04-28 10:04:07,756 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:04:07,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:04:07,757 INFO L85 PathProgramCache]: Analyzing trace with hash 2056843342, now seen corresponding path program 13 times [2022-04-28 10:04:07,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:04:07,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1926037628] [2022-04-28 10:04:07,759 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:04:07,759 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:04:07,759 INFO L85 PathProgramCache]: Analyzing trace with hash 2056843342, now seen corresponding path program 14 times [2022-04-28 10:04:07,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:04:07,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704789528] [2022-04-28 10:04:07,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:04:07,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:04:07,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:07,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:04:07,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:07,877 INFO L290 TraceCheckUtils]: 0: Hoare triple {4285#(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(10, 2);call #Ultimate.allocInit(12, 3); {4271#true} is VALID [2022-04-28 10:04:07,877 INFO L290 TraceCheckUtils]: 1: Hoare triple {4271#true} assume true; {4271#true} is VALID [2022-04-28 10:04:07,877 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4271#true} {4271#true} #61#return; {4271#true} is VALID [2022-04-28 10:04:07,877 INFO L272 TraceCheckUtils]: 0: Hoare triple {4271#true} call ULTIMATE.init(); {4285#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:04:07,877 INFO L290 TraceCheckUtils]: 1: Hoare triple {4285#(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(10, 2);call #Ultimate.allocInit(12, 3); {4271#true} is VALID [2022-04-28 10:04:07,877 INFO L290 TraceCheckUtils]: 2: Hoare triple {4271#true} assume true; {4271#true} is VALID [2022-04-28 10:04:07,877 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4271#true} {4271#true} #61#return; {4271#true} is VALID [2022-04-28 10:04:07,877 INFO L272 TraceCheckUtils]: 4: Hoare triple {4271#true} call #t~ret11 := main(); {4271#true} is VALID [2022-04-28 10:04:07,881 INFO L290 TraceCheckUtils]: 5: Hoare triple {4271#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4276#(= main_~y~0 0)} is VALID [2022-04-28 10:04:07,882 INFO L290 TraceCheckUtils]: 6: Hoare triple {4276#(= 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; {4277#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:04:07,882 INFO L290 TraceCheckUtils]: 7: Hoare triple {4277#(and (<= 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; {4278#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:04:07,883 INFO L290 TraceCheckUtils]: 8: Hoare triple {4278#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {4279#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:04:07,883 INFO L290 TraceCheckUtils]: 9: Hoare triple {4279#(and (<= main_~y~0 3) (<= 3 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; {4280#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:04:07,884 INFO L290 TraceCheckUtils]: 10: Hoare triple {4280#(and (<= main_~y~0 4) (<= 4 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; {4281#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:04:07,885 INFO L290 TraceCheckUtils]: 11: Hoare triple {4281#(and (<= 5 main_~y~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; {4282#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:04:07,885 INFO L290 TraceCheckUtils]: 12: Hoare triple {4282#(and (<= main_~y~0 6) (<= 6 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; {4283#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:04:07,886 INFO L290 TraceCheckUtils]: 13: Hoare triple {4283#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {4283#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:04:07,886 INFO L290 TraceCheckUtils]: 14: Hoare triple {4283#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {4284#(and (<= 7 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:04:07,888 INFO L290 TraceCheckUtils]: 15: Hoare triple {4284#(and (<= 7 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {4272#false} is VALID [2022-04-28 10:04:07,888 INFO L290 TraceCheckUtils]: 16: Hoare triple {4272#false} assume !(~y~0 % 4294967296 > 0); {4272#false} is VALID [2022-04-28 10:04:07,888 INFO L272 TraceCheckUtils]: 17: Hoare triple {4272#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {4272#false} is VALID [2022-04-28 10:04:07,889 INFO L290 TraceCheckUtils]: 18: Hoare triple {4272#false} ~cond := #in~cond; {4272#false} is VALID [2022-04-28 10:04:07,889 INFO L290 TraceCheckUtils]: 19: Hoare triple {4272#false} assume 0 == ~cond; {4272#false} is VALID [2022-04-28 10:04:07,889 INFO L290 TraceCheckUtils]: 20: Hoare triple {4272#false} assume !false; {4272#false} is VALID [2022-04-28 10:04:07,889 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:04:07,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:04:07,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704789528] [2022-04-28 10:04:07,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704789528] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:04:07,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1962534836] [2022-04-28 10:04:07,889 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:04:07,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:04:07,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:04:07,890 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:04:07,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-04-28 10:04:07,918 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:04:07,918 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:04:07,919 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-28 10:04:07,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:07,924 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:04:08,103 INFO L272 TraceCheckUtils]: 0: Hoare triple {4271#true} call ULTIMATE.init(); {4271#true} is VALID [2022-04-28 10:04:08,103 INFO L290 TraceCheckUtils]: 1: Hoare triple {4271#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(10, 2);call #Ultimate.allocInit(12, 3); {4271#true} is VALID [2022-04-28 10:04:08,103 INFO L290 TraceCheckUtils]: 2: Hoare triple {4271#true} assume true; {4271#true} is VALID [2022-04-28 10:04:08,103 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4271#true} {4271#true} #61#return; {4271#true} is VALID [2022-04-28 10:04:08,103 INFO L272 TraceCheckUtils]: 4: Hoare triple {4271#true} call #t~ret11 := main(); {4271#true} is VALID [2022-04-28 10:04:08,104 INFO L290 TraceCheckUtils]: 5: Hoare triple {4271#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4276#(= main_~y~0 0)} is VALID [2022-04-28 10:04:08,104 INFO L290 TraceCheckUtils]: 6: Hoare triple {4276#(= 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; {4277#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:04:08,104 INFO L290 TraceCheckUtils]: 7: Hoare triple {4277#(and (<= 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; {4278#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:04:08,105 INFO L290 TraceCheckUtils]: 8: Hoare triple {4278#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {4279#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:04:08,105 INFO L290 TraceCheckUtils]: 9: Hoare triple {4279#(and (<= main_~y~0 3) (<= 3 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; {4280#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:04:08,106 INFO L290 TraceCheckUtils]: 10: Hoare triple {4280#(and (<= main_~y~0 4) (<= 4 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; {4281#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:04:08,106 INFO L290 TraceCheckUtils]: 11: Hoare triple {4281#(and (<= 5 main_~y~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; {4282#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:04:08,107 INFO L290 TraceCheckUtils]: 12: Hoare triple {4282#(and (<= main_~y~0 6) (<= 6 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; {4283#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:04:08,107 INFO L290 TraceCheckUtils]: 13: Hoare triple {4283#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {4283#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:04:08,108 INFO L290 TraceCheckUtils]: 14: Hoare triple {4283#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {4331#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:04:08,108 INFO L290 TraceCheckUtils]: 15: Hoare triple {4331#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {4272#false} is VALID [2022-04-28 10:04:08,108 INFO L290 TraceCheckUtils]: 16: Hoare triple {4272#false} assume !(~y~0 % 4294967296 > 0); {4272#false} is VALID [2022-04-28 10:04:08,108 INFO L272 TraceCheckUtils]: 17: Hoare triple {4272#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {4272#false} is VALID [2022-04-28 10:04:08,108 INFO L290 TraceCheckUtils]: 18: Hoare triple {4272#false} ~cond := #in~cond; {4272#false} is VALID [2022-04-28 10:04:08,108 INFO L290 TraceCheckUtils]: 19: Hoare triple {4272#false} assume 0 == ~cond; {4272#false} is VALID [2022-04-28 10:04:08,108 INFO L290 TraceCheckUtils]: 20: Hoare triple {4272#false} assume !false; {4272#false} is VALID [2022-04-28 10:04:08,108 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:04:08,108 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:04:08,287 INFO L290 TraceCheckUtils]: 20: Hoare triple {4272#false} assume !false; {4272#false} is VALID [2022-04-28 10:04:08,287 INFO L290 TraceCheckUtils]: 19: Hoare triple {4272#false} assume 0 == ~cond; {4272#false} is VALID [2022-04-28 10:04:08,287 INFO L290 TraceCheckUtils]: 18: Hoare triple {4272#false} ~cond := #in~cond; {4272#false} is VALID [2022-04-28 10:04:08,287 INFO L272 TraceCheckUtils]: 17: Hoare triple {4272#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {4272#false} is VALID [2022-04-28 10:04:08,287 INFO L290 TraceCheckUtils]: 16: Hoare triple {4272#false} assume !(~y~0 % 4294967296 > 0); {4272#false} is VALID [2022-04-28 10:04:08,287 INFO L290 TraceCheckUtils]: 15: Hoare triple {4365#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {4272#false} is VALID [2022-04-28 10:04:08,288 INFO L290 TraceCheckUtils]: 14: Hoare triple {4369#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {4365#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:04:08,288 INFO L290 TraceCheckUtils]: 13: Hoare triple {4369#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {4369#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:04:08,288 INFO L290 TraceCheckUtils]: 12: Hoare triple {4376#(< 0 (mod (+ main_~y~0 1) 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; {4369#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:04:08,289 INFO L290 TraceCheckUtils]: 11: Hoare triple {4380#(< 0 (mod (+ main_~y~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; {4376#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:04:08,290 INFO L290 TraceCheckUtils]: 10: Hoare triple {4384#(< 0 (mod (+ main_~y~0 3) 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; {4380#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:04:08,290 INFO L290 TraceCheckUtils]: 9: Hoare triple {4388#(< 0 (mod (+ main_~y~0 4) 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; {4384#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:04:08,291 INFO L290 TraceCheckUtils]: 8: Hoare triple {4392#(< 0 (mod (+ 5 main_~y~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; {4388#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:04:08,292 INFO L290 TraceCheckUtils]: 7: Hoare triple {4396#(< 0 (mod (+ main_~y~0 6) 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; {4392#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:04:08,292 INFO L290 TraceCheckUtils]: 6: Hoare triple {4400#(< 0 (mod (+ 7 main_~y~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; {4396#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:04:08,293 INFO L290 TraceCheckUtils]: 5: Hoare triple {4271#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4400#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:04:08,293 INFO L272 TraceCheckUtils]: 4: Hoare triple {4271#true} call #t~ret11 := main(); {4271#true} is VALID [2022-04-28 10:04:08,293 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4271#true} {4271#true} #61#return; {4271#true} is VALID [2022-04-28 10:04:08,293 INFO L290 TraceCheckUtils]: 2: Hoare triple {4271#true} assume true; {4271#true} is VALID [2022-04-28 10:04:08,293 INFO L290 TraceCheckUtils]: 1: Hoare triple {4271#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(10, 2);call #Ultimate.allocInit(12, 3); {4271#true} is VALID [2022-04-28 10:04:08,293 INFO L272 TraceCheckUtils]: 0: Hoare triple {4271#true} call ULTIMATE.init(); {4271#true} is VALID [2022-04-28 10:04:08,293 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:04:08,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1962534836] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:04:08,293 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:04:08,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 22 [2022-04-28 10:04:08,293 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:04:08,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1926037628] [2022-04-28 10:04:08,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1926037628] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:04:08,294 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:04:08,294 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 10:04:08,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179335047] [2022-04-28 10:04:08,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:04:08,294 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 11 states have internal predecessors, (17), 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 21 [2022-04-28 10:04:08,294 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:04:08,294 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 11 states have internal predecessors, (17), 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-28 10:04:08,307 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:04:08,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 10:04:08,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:04:08,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 10:04:08,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=355, Unknown=0, NotChecked=0, Total=462 [2022-04-28 10:04:08,308 INFO L87 Difference]: Start difference. First operand 42 states and 52 transitions. Second operand has 12 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 11 states have internal predecessors, (17), 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-28 10:04:08,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:08,959 INFO L93 Difference]: Finished difference Result 61 states and 82 transitions. [2022-04-28 10:04:08,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 10:04:08,959 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 11 states have internal predecessors, (17), 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 21 [2022-04-28 10:04:08,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:04:08,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 11 states have internal predecessors, (17), 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-28 10:04:08,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 70 transitions. [2022-04-28 10:04:08,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 11 states have internal predecessors, (17), 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-28 10:04:08,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 70 transitions. [2022-04-28 10:04:08,961 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 70 transitions. [2022-04-28 10:04:09,014 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:04:09,015 INFO L225 Difference]: With dead ends: 61 [2022-04-28 10:04:09,015 INFO L226 Difference]: Without dead ends: 55 [2022-04-28 10:04:09,015 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=217, Invalid=713, Unknown=0, NotChecked=0, Total=930 [2022-04-28 10:04:09,016 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 52 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 10:04:09,016 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 71 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 10:04:09,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-04-28 10:04:09,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 47. [2022-04-28 10:04:09,054 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:04:09,054 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand has 47 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 42 states have internal predecessors, (55), 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-28 10:04:09,054 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand has 47 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 42 states have internal predecessors, (55), 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-28 10:04:09,054 INFO L87 Difference]: Start difference. First operand 55 states. Second operand has 47 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 42 states have internal predecessors, (55), 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-28 10:04:09,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:09,055 INFO L93 Difference]: Finished difference Result 55 states and 67 transitions. [2022-04-28 10:04:09,055 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 67 transitions. [2022-04-28 10:04:09,055 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:04:09,055 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:04:09,056 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 42 states have internal predecessors, (55), 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 55 states. [2022-04-28 10:04:09,056 INFO L87 Difference]: Start difference. First operand has 47 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 42 states have internal predecessors, (55), 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 55 states. [2022-04-28 10:04:09,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:09,057 INFO L93 Difference]: Finished difference Result 55 states and 67 transitions. [2022-04-28 10:04:09,057 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 67 transitions. [2022-04-28 10:04:09,057 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:04:09,057 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:04:09,057 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:04:09,057 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:04:09,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 42 states have internal predecessors, (55), 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-28 10:04:09,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 59 transitions. [2022-04-28 10:04:09,058 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 59 transitions. Word has length 21 [2022-04-28 10:04:09,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:04:09,058 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 59 transitions. [2022-04-28 10:04:09,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 11 states have internal predecessors, (17), 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-28 10:04:09,058 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 59 transitions. [2022-04-28 10:04:09,122 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:04:09,122 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 59 transitions. [2022-04-28 10:04:09,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 10:04:09,122 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:04:09,122 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:04:09,138 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-04-28 10:04:09,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-28 10:04:09,331 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:04:09,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:04:09,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1752036735, now seen corresponding path program 11 times [2022-04-28 10:04:09,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:04:09,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [505289173] [2022-04-28 10:04:09,335 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:04:09,335 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:04:09,335 INFO L85 PathProgramCache]: Analyzing trace with hash 1752036735, now seen corresponding path program 12 times [2022-04-28 10:04:09,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:04:09,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361244209] [2022-04-28 10:04:09,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:04:09,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:04:09,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:09,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:04:09,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:09,440 INFO L290 TraceCheckUtils]: 0: Hoare triple {4777#(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(10, 2);call #Ultimate.allocInit(12, 3); {4765#true} is VALID [2022-04-28 10:04:09,440 INFO L290 TraceCheckUtils]: 1: Hoare triple {4765#true} assume true; {4765#true} is VALID [2022-04-28 10:04:09,440 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4765#true} {4765#true} #61#return; {4765#true} is VALID [2022-04-28 10:04:09,440 INFO L272 TraceCheckUtils]: 0: Hoare triple {4765#true} call ULTIMATE.init(); {4777#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:04:09,441 INFO L290 TraceCheckUtils]: 1: Hoare triple {4777#(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(10, 2);call #Ultimate.allocInit(12, 3); {4765#true} is VALID [2022-04-28 10:04:09,441 INFO L290 TraceCheckUtils]: 2: Hoare triple {4765#true} assume true; {4765#true} is VALID [2022-04-28 10:04:09,441 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4765#true} {4765#true} #61#return; {4765#true} is VALID [2022-04-28 10:04:09,441 INFO L272 TraceCheckUtils]: 4: Hoare triple {4765#true} call #t~ret11 := main(); {4765#true} is VALID [2022-04-28 10:04:09,441 INFO L290 TraceCheckUtils]: 5: Hoare triple {4765#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4770#(= main_~y~0 0)} is VALID [2022-04-28 10:04:09,441 INFO L290 TraceCheckUtils]: 6: Hoare triple {4770#(= 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; {4771#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:04:09,442 INFO L290 TraceCheckUtils]: 7: Hoare triple {4771#(and (<= 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; {4772#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:04:09,442 INFO L290 TraceCheckUtils]: 8: Hoare triple {4772#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {4773#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:04:09,443 INFO L290 TraceCheckUtils]: 9: Hoare triple {4773#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {4773#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:04:09,443 INFO L290 TraceCheckUtils]: 10: Hoare triple {4773#(and (<= main_~y~0 3) (<= 3 main_~y~0))} ~z~0 := ~y~0; {4774#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:04:09,444 INFO L290 TraceCheckUtils]: 11: Hoare triple {4774#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4775#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-28 10:04:09,444 INFO L290 TraceCheckUtils]: 12: Hoare triple {4775#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4776#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-28 10:04:09,445 INFO L290 TraceCheckUtils]: 13: Hoare triple {4776#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {4766#false} is VALID [2022-04-28 10:04:09,445 INFO L290 TraceCheckUtils]: 14: Hoare triple {4766#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4766#false} is VALID [2022-04-28 10:04:09,445 INFO L290 TraceCheckUtils]: 15: Hoare triple {4766#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4766#false} is VALID [2022-04-28 10:04:09,445 INFO L290 TraceCheckUtils]: 16: Hoare triple {4766#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4766#false} is VALID [2022-04-28 10:04:09,445 INFO L290 TraceCheckUtils]: 17: Hoare triple {4766#false} assume !(~y~0 % 4294967296 > 0); {4766#false} is VALID [2022-04-28 10:04:09,445 INFO L272 TraceCheckUtils]: 18: Hoare triple {4766#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {4766#false} is VALID [2022-04-28 10:04:09,445 INFO L290 TraceCheckUtils]: 19: Hoare triple {4766#false} ~cond := #in~cond; {4766#false} is VALID [2022-04-28 10:04:09,445 INFO L290 TraceCheckUtils]: 20: Hoare triple {4766#false} assume 0 == ~cond; {4766#false} is VALID [2022-04-28 10:04:09,445 INFO L290 TraceCheckUtils]: 21: Hoare triple {4766#false} assume !false; {4766#false} is VALID [2022-04-28 10:04:09,445 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-28 10:04:09,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:04:09,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361244209] [2022-04-28 10:04:09,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361244209] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:04:09,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [903945383] [2022-04-28 10:04:09,445 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:04:09,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:04:09,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:04:09,446 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:04:09,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-04-28 10:04:09,486 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-28 10:04:09,487 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:04:09,487 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-28 10:04:09,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:09,492 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:04:09,603 INFO L272 TraceCheckUtils]: 0: Hoare triple {4765#true} call ULTIMATE.init(); {4765#true} is VALID [2022-04-28 10:04:09,604 INFO L290 TraceCheckUtils]: 1: Hoare triple {4765#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(10, 2);call #Ultimate.allocInit(12, 3); {4765#true} is VALID [2022-04-28 10:04:09,604 INFO L290 TraceCheckUtils]: 2: Hoare triple {4765#true} assume true; {4765#true} is VALID [2022-04-28 10:04:09,604 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4765#true} {4765#true} #61#return; {4765#true} is VALID [2022-04-28 10:04:09,604 INFO L272 TraceCheckUtils]: 4: Hoare triple {4765#true} call #t~ret11 := main(); {4765#true} is VALID [2022-04-28 10:04:09,604 INFO L290 TraceCheckUtils]: 5: Hoare triple {4765#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4770#(= main_~y~0 0)} is VALID [2022-04-28 10:04:09,604 INFO L290 TraceCheckUtils]: 6: Hoare triple {4770#(= 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; {4771#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:04:09,605 INFO L290 TraceCheckUtils]: 7: Hoare triple {4771#(and (<= 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; {4772#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:04:09,605 INFO L290 TraceCheckUtils]: 8: Hoare triple {4772#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {4773#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:04:09,606 INFO L290 TraceCheckUtils]: 9: Hoare triple {4773#(and (<= main_~y~0 3) (<= 3 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {4773#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:04:09,606 INFO L290 TraceCheckUtils]: 10: Hoare triple {4773#(and (<= main_~y~0 3) (<= 3 main_~y~0))} ~z~0 := ~y~0; {4811#(and (= main_~z~0 main_~y~0) (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:04:09,606 INFO L290 TraceCheckUtils]: 11: Hoare triple {4811#(and (= main_~z~0 main_~y~0) (<= main_~y~0 3) (<= 3 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4815#(and (<= main_~y~0 3) (<= 3 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-28 10:04:09,607 INFO L290 TraceCheckUtils]: 12: Hoare triple {4815#(and (<= main_~y~0 3) (<= 3 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4819#(and (= main_~y~0 (+ main_~z~0 2)) (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:04:09,607 INFO L290 TraceCheckUtils]: 13: Hoare triple {4819#(and (= main_~y~0 (+ main_~z~0 2)) (<= main_~y~0 3) (<= 3 main_~y~0))} assume !(~z~0 % 4294967296 > 0); {4766#false} is VALID [2022-04-28 10:04:09,607 INFO L290 TraceCheckUtils]: 14: Hoare triple {4766#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4766#false} is VALID [2022-04-28 10:04:09,608 INFO L290 TraceCheckUtils]: 15: Hoare triple {4766#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4766#false} is VALID [2022-04-28 10:04:09,608 INFO L290 TraceCheckUtils]: 16: Hoare triple {4766#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4766#false} is VALID [2022-04-28 10:04:09,608 INFO L290 TraceCheckUtils]: 17: Hoare triple {4766#false} assume !(~y~0 % 4294967296 > 0); {4766#false} is VALID [2022-04-28 10:04:09,608 INFO L272 TraceCheckUtils]: 18: Hoare triple {4766#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {4766#false} is VALID [2022-04-28 10:04:09,608 INFO L290 TraceCheckUtils]: 19: Hoare triple {4766#false} ~cond := #in~cond; {4766#false} is VALID [2022-04-28 10:04:09,608 INFO L290 TraceCheckUtils]: 20: Hoare triple {4766#false} assume 0 == ~cond; {4766#false} is VALID [2022-04-28 10:04:09,608 INFO L290 TraceCheckUtils]: 21: Hoare triple {4766#false} assume !false; {4766#false} is VALID [2022-04-28 10:04:09,608 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-28 10:04:09,608 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:04:09,758 INFO L290 TraceCheckUtils]: 21: Hoare triple {4766#false} assume !false; {4766#false} is VALID [2022-04-28 10:04:09,759 INFO L290 TraceCheckUtils]: 20: Hoare triple {4766#false} assume 0 == ~cond; {4766#false} is VALID [2022-04-28 10:04:09,759 INFO L290 TraceCheckUtils]: 19: Hoare triple {4766#false} ~cond := #in~cond; {4766#false} is VALID [2022-04-28 10:04:09,759 INFO L272 TraceCheckUtils]: 18: Hoare triple {4766#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {4766#false} is VALID [2022-04-28 10:04:09,759 INFO L290 TraceCheckUtils]: 17: Hoare triple {4766#false} assume !(~y~0 % 4294967296 > 0); {4766#false} is VALID [2022-04-28 10:04:09,759 INFO L290 TraceCheckUtils]: 16: Hoare triple {4862#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4766#false} is VALID [2022-04-28 10:04:09,760 INFO L290 TraceCheckUtils]: 15: Hoare triple {4866#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4862#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:04:09,761 INFO L290 TraceCheckUtils]: 14: Hoare triple {4870#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4866#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:04:09,761 INFO L290 TraceCheckUtils]: 13: Hoare triple {4874#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {4870#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-28 10:04:09,762 INFO L290 TraceCheckUtils]: 12: Hoare triple {4878#(or (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4874#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))))} is VALID [2022-04-28 10:04:09,763 INFO L290 TraceCheckUtils]: 11: Hoare triple {4882#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4878#(or (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:04:09,763 INFO L290 TraceCheckUtils]: 10: Hoare triple {4765#true} ~z~0 := ~y~0; {4882#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))))} is VALID [2022-04-28 10:04:09,763 INFO L290 TraceCheckUtils]: 9: Hoare triple {4765#true} assume !(~x~0 % 4294967296 > 0); {4765#true} is VALID [2022-04-28 10:04:09,763 INFO L290 TraceCheckUtils]: 8: Hoare triple {4765#true} 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; {4765#true} is VALID [2022-04-28 10:04:09,763 INFO L290 TraceCheckUtils]: 7: Hoare triple {4765#true} 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; {4765#true} is VALID [2022-04-28 10:04:09,763 INFO L290 TraceCheckUtils]: 6: Hoare triple {4765#true} 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; {4765#true} is VALID [2022-04-28 10:04:09,763 INFO L290 TraceCheckUtils]: 5: Hoare triple {4765#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4765#true} is VALID [2022-04-28 10:04:09,763 INFO L272 TraceCheckUtils]: 4: Hoare triple {4765#true} call #t~ret11 := main(); {4765#true} is VALID [2022-04-28 10:04:09,763 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4765#true} {4765#true} #61#return; {4765#true} is VALID [2022-04-28 10:04:09,763 INFO L290 TraceCheckUtils]: 2: Hoare triple {4765#true} assume true; {4765#true} is VALID [2022-04-28 10:04:09,764 INFO L290 TraceCheckUtils]: 1: Hoare triple {4765#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(10, 2);call #Ultimate.allocInit(12, 3); {4765#true} is VALID [2022-04-28 10:04:09,764 INFO L272 TraceCheckUtils]: 0: Hoare triple {4765#true} call ULTIMATE.init(); {4765#true} is VALID [2022-04-28 10:04:09,764 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-28 10:04:09,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [903945383] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:04:09,764 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:04:09,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 8] total 19 [2022-04-28 10:04:09,764 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:04:09,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [505289173] [2022-04-28 10:04:09,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [505289173] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:04:09,764 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:04:09,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 10:04:09,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501604722] [2022-04-28 10:04:09,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:04:09,765 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.6) internal successors, (16), 9 states have internal predecessors, (16), 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 22 [2022-04-28 10:04:09,765 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:04:09,765 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 1.6) internal successors, (16), 9 states have internal predecessors, (16), 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-28 10:04:09,778 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:04:09,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 10:04:09,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:04:09,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 10:04:09,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2022-04-28 10:04:09,779 INFO L87 Difference]: Start difference. First operand 47 states and 59 transitions. Second operand has 10 states, 10 states have (on average 1.6) internal successors, (16), 9 states have internal predecessors, (16), 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-28 10:04:10,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:10,146 INFO L93 Difference]: Finished difference Result 62 states and 74 transitions. [2022-04-28 10:04:10,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 10:04:10,147 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.6) internal successors, (16), 9 states have internal predecessors, (16), 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 22 [2022-04-28 10:04:10,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:04:10,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.6) internal successors, (16), 9 states have internal predecessors, (16), 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-28 10:04:10,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 40 transitions. [2022-04-28 10:04:10,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.6) internal successors, (16), 9 states have internal predecessors, (16), 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-28 10:04:10,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 40 transitions. [2022-04-28 10:04:10,148 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 40 transitions. [2022-04-28 10:04:10,178 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:04:10,178 INFO L225 Difference]: With dead ends: 62 [2022-04-28 10:04:10,178 INFO L226 Difference]: Without dead ends: 53 [2022-04-28 10:04:10,178 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=531, Unknown=0, NotChecked=0, Total=650 [2022-04-28 10:04:10,179 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 17 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:04:10,179 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 53 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 10:04:10,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-04-28 10:04:10,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 48. [2022-04-28 10:04:10,215 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:04:10,215 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand has 48 states, 43 states have (on average 1.302325581395349) internal successors, (56), 43 states have internal predecessors, (56), 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-28 10:04:10,215 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand has 48 states, 43 states have (on average 1.302325581395349) internal successors, (56), 43 states have internal predecessors, (56), 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-28 10:04:10,215 INFO L87 Difference]: Start difference. First operand 53 states. Second operand has 48 states, 43 states have (on average 1.302325581395349) internal successors, (56), 43 states have internal predecessors, (56), 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-28 10:04:10,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:10,216 INFO L93 Difference]: Finished difference Result 53 states and 65 transitions. [2022-04-28 10:04:10,216 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 65 transitions. [2022-04-28 10:04:10,216 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:04:10,216 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:04:10,216 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 43 states have (on average 1.302325581395349) internal successors, (56), 43 states have internal predecessors, (56), 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 53 states. [2022-04-28 10:04:10,216 INFO L87 Difference]: Start difference. First operand has 48 states, 43 states have (on average 1.302325581395349) internal successors, (56), 43 states have internal predecessors, (56), 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 53 states. [2022-04-28 10:04:10,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:10,217 INFO L93 Difference]: Finished difference Result 53 states and 65 transitions. [2022-04-28 10:04:10,217 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 65 transitions. [2022-04-28 10:04:10,217 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:04:10,217 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:04:10,217 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:04:10,217 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:04:10,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 43 states have (on average 1.302325581395349) internal successors, (56), 43 states have internal predecessors, (56), 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-28 10:04:10,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 60 transitions. [2022-04-28 10:04:10,218 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 60 transitions. Word has length 22 [2022-04-28 10:04:10,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:04:10,218 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 60 transitions. [2022-04-28 10:04:10,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.6) internal successors, (16), 9 states have internal predecessors, (16), 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-28 10:04:10,218 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 48 states and 60 transitions. [2022-04-28 10:04:10,335 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:04:10,336 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 60 transitions. [2022-04-28 10:04:10,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 10:04:10,336 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:04:10,336 INFO L195 NwaCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:04:10,353 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-04-28 10:04:10,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-04-28 10:04:10,536 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:04:10,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:04:10,537 INFO L85 PathProgramCache]: Analyzing trace with hash 190490061, now seen corresponding path program 15 times [2022-04-28 10:04:10,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:04:10,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [367161126] [2022-04-28 10:04:10,540 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:04:10,540 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:04:10,540 INFO L85 PathProgramCache]: Analyzing trace with hash 190490061, now seen corresponding path program 16 times [2022-04-28 10:04:10,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:04:10,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61352536] [2022-04-28 10:04:10,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:04:10,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:04:10,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:10,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:04:10,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:10,669 INFO L290 TraceCheckUtils]: 0: Hoare triple {5273#(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(10, 2);call #Ultimate.allocInit(12, 3); {5258#true} is VALID [2022-04-28 10:04:10,669 INFO L290 TraceCheckUtils]: 1: Hoare triple {5258#true} assume true; {5258#true} is VALID [2022-04-28 10:04:10,669 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5258#true} {5258#true} #61#return; {5258#true} is VALID [2022-04-28 10:04:10,669 INFO L272 TraceCheckUtils]: 0: Hoare triple {5258#true} call ULTIMATE.init(); {5273#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:04:10,669 INFO L290 TraceCheckUtils]: 1: Hoare triple {5273#(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(10, 2);call #Ultimate.allocInit(12, 3); {5258#true} is VALID [2022-04-28 10:04:10,670 INFO L290 TraceCheckUtils]: 2: Hoare triple {5258#true} assume true; {5258#true} is VALID [2022-04-28 10:04:10,670 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5258#true} {5258#true} #61#return; {5258#true} is VALID [2022-04-28 10:04:10,670 INFO L272 TraceCheckUtils]: 4: Hoare triple {5258#true} call #t~ret11 := main(); {5258#true} is VALID [2022-04-28 10:04:10,670 INFO L290 TraceCheckUtils]: 5: Hoare triple {5258#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5263#(= main_~y~0 0)} is VALID [2022-04-28 10:04:10,670 INFO L290 TraceCheckUtils]: 6: Hoare triple {5263#(= 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; {5264#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:04:10,671 INFO L290 TraceCheckUtils]: 7: Hoare triple {5264#(and (<= 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; {5265#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:04:10,671 INFO L290 TraceCheckUtils]: 8: Hoare triple {5265#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {5266#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:04:10,672 INFO L290 TraceCheckUtils]: 9: Hoare triple {5266#(and (<= main_~y~0 3) (<= 3 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; {5267#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:04:10,672 INFO L290 TraceCheckUtils]: 10: Hoare triple {5267#(and (<= main_~y~0 4) (<= 4 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; {5268#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:04:10,673 INFO L290 TraceCheckUtils]: 11: Hoare triple {5268#(and (<= 5 main_~y~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; {5269#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:04:10,673 INFO L290 TraceCheckUtils]: 12: Hoare triple {5269#(and (<= main_~y~0 6) (<= 6 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; {5270#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:04:10,674 INFO L290 TraceCheckUtils]: 13: Hoare triple {5270#(and (<= 7 main_~y~0) (<= main_~y~0 7))} 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; {5271#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:04:10,674 INFO L290 TraceCheckUtils]: 14: Hoare triple {5271#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {5271#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:04:10,675 INFO L290 TraceCheckUtils]: 15: Hoare triple {5271#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {5272#(and (<= 8 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:04:10,675 INFO L290 TraceCheckUtils]: 16: Hoare triple {5272#(and (<= 8 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {5259#false} is VALID [2022-04-28 10:04:10,675 INFO L290 TraceCheckUtils]: 17: Hoare triple {5259#false} assume !(~y~0 % 4294967296 > 0); {5259#false} is VALID [2022-04-28 10:04:10,675 INFO L272 TraceCheckUtils]: 18: Hoare triple {5259#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {5259#false} is VALID [2022-04-28 10:04:10,675 INFO L290 TraceCheckUtils]: 19: Hoare triple {5259#false} ~cond := #in~cond; {5259#false} is VALID [2022-04-28 10:04:10,675 INFO L290 TraceCheckUtils]: 20: Hoare triple {5259#false} assume 0 == ~cond; {5259#false} is VALID [2022-04-28 10:04:10,675 INFO L290 TraceCheckUtils]: 21: Hoare triple {5259#false} assume !false; {5259#false} is VALID [2022-04-28 10:04:10,675 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:04:10,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:04:10,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61352536] [2022-04-28 10:04:10,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61352536] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:04:10,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [61925366] [2022-04-28 10:04:10,676 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:04:10,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:04:10,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:04:10,677 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:04:10,678 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-04-28 10:04:10,710 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:04:10,711 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:04:10,711 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-28 10:04:10,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:10,716 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:04:10,924 INFO L272 TraceCheckUtils]: 0: Hoare triple {5258#true} call ULTIMATE.init(); {5258#true} is VALID [2022-04-28 10:04:10,924 INFO L290 TraceCheckUtils]: 1: Hoare triple {5258#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(10, 2);call #Ultimate.allocInit(12, 3); {5258#true} is VALID [2022-04-28 10:04:10,924 INFO L290 TraceCheckUtils]: 2: Hoare triple {5258#true} assume true; {5258#true} is VALID [2022-04-28 10:04:10,924 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5258#true} {5258#true} #61#return; {5258#true} is VALID [2022-04-28 10:04:10,924 INFO L272 TraceCheckUtils]: 4: Hoare triple {5258#true} call #t~ret11 := main(); {5258#true} is VALID [2022-04-28 10:04:10,924 INFO L290 TraceCheckUtils]: 5: Hoare triple {5258#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5263#(= main_~y~0 0)} is VALID [2022-04-28 10:04:10,925 INFO L290 TraceCheckUtils]: 6: Hoare triple {5263#(= 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; {5264#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:04:10,925 INFO L290 TraceCheckUtils]: 7: Hoare triple {5264#(and (<= 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; {5265#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:04:10,926 INFO L290 TraceCheckUtils]: 8: Hoare triple {5265#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {5266#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:04:10,926 INFO L290 TraceCheckUtils]: 9: Hoare triple {5266#(and (<= main_~y~0 3) (<= 3 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; {5267#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:04:10,927 INFO L290 TraceCheckUtils]: 10: Hoare triple {5267#(and (<= main_~y~0 4) (<= 4 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; {5268#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:04:10,927 INFO L290 TraceCheckUtils]: 11: Hoare triple {5268#(and (<= 5 main_~y~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; {5269#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:04:10,928 INFO L290 TraceCheckUtils]: 12: Hoare triple {5269#(and (<= main_~y~0 6) (<= 6 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; {5270#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:04:10,928 INFO L290 TraceCheckUtils]: 13: Hoare triple {5270#(and (<= 7 main_~y~0) (<= main_~y~0 7))} 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; {5271#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:04:10,928 INFO L290 TraceCheckUtils]: 14: Hoare triple {5271#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {5271#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:04:10,929 INFO L290 TraceCheckUtils]: 15: Hoare triple {5271#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {5322#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:04:10,929 INFO L290 TraceCheckUtils]: 16: Hoare triple {5322#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !(~z~0 % 4294967296 > 0); {5259#false} is VALID [2022-04-28 10:04:10,929 INFO L290 TraceCheckUtils]: 17: Hoare triple {5259#false} assume !(~y~0 % 4294967296 > 0); {5259#false} is VALID [2022-04-28 10:04:10,929 INFO L272 TraceCheckUtils]: 18: Hoare triple {5259#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {5259#false} is VALID [2022-04-28 10:04:10,929 INFO L290 TraceCheckUtils]: 19: Hoare triple {5259#false} ~cond := #in~cond; {5259#false} is VALID [2022-04-28 10:04:10,929 INFO L290 TraceCheckUtils]: 20: Hoare triple {5259#false} assume 0 == ~cond; {5259#false} is VALID [2022-04-28 10:04:10,930 INFO L290 TraceCheckUtils]: 21: Hoare triple {5259#false} assume !false; {5259#false} is VALID [2022-04-28 10:04:10,930 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:04:10,930 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:04:11,141 INFO L290 TraceCheckUtils]: 21: Hoare triple {5259#false} assume !false; {5259#false} is VALID [2022-04-28 10:04:11,141 INFO L290 TraceCheckUtils]: 20: Hoare triple {5259#false} assume 0 == ~cond; {5259#false} is VALID [2022-04-28 10:04:11,141 INFO L290 TraceCheckUtils]: 19: Hoare triple {5259#false} ~cond := #in~cond; {5259#false} is VALID [2022-04-28 10:04:11,141 INFO L272 TraceCheckUtils]: 18: Hoare triple {5259#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {5259#false} is VALID [2022-04-28 10:04:11,142 INFO L290 TraceCheckUtils]: 17: Hoare triple {5259#false} assume !(~y~0 % 4294967296 > 0); {5259#false} is VALID [2022-04-28 10:04:11,155 INFO L290 TraceCheckUtils]: 16: Hoare triple {5356#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {5259#false} is VALID [2022-04-28 10:04:11,155 INFO L290 TraceCheckUtils]: 15: Hoare triple {5360#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {5356#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:04:11,156 INFO L290 TraceCheckUtils]: 14: Hoare triple {5360#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {5360#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:04:11,156 INFO L290 TraceCheckUtils]: 13: Hoare triple {5367#(< 0 (mod (+ main_~y~0 1) 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; {5360#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:04:11,157 INFO L290 TraceCheckUtils]: 12: Hoare triple {5371#(< 0 (mod (+ main_~y~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; {5367#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:04:11,158 INFO L290 TraceCheckUtils]: 11: Hoare triple {5375#(< 0 (mod (+ main_~y~0 3) 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; {5371#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:04:11,158 INFO L290 TraceCheckUtils]: 10: Hoare triple {5379#(< 0 (mod (+ main_~y~0 4) 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; {5375#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:04:11,159 INFO L290 TraceCheckUtils]: 9: Hoare triple {5383#(< 0 (mod (+ 5 main_~y~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; {5379#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:04:11,160 INFO L290 TraceCheckUtils]: 8: Hoare triple {5387#(< 0 (mod (+ main_~y~0 6) 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; {5383#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:04:11,160 INFO L290 TraceCheckUtils]: 7: Hoare triple {5391#(< 0 (mod (+ 7 main_~y~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; {5387#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:04:11,161 INFO L290 TraceCheckUtils]: 6: Hoare triple {5395#(< 0 (mod (+ main_~y~0 8) 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; {5391#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:04:11,161 INFO L290 TraceCheckUtils]: 5: Hoare triple {5258#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5395#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:04:11,161 INFO L272 TraceCheckUtils]: 4: Hoare triple {5258#true} call #t~ret11 := main(); {5258#true} is VALID [2022-04-28 10:04:11,162 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5258#true} {5258#true} #61#return; {5258#true} is VALID [2022-04-28 10:04:11,162 INFO L290 TraceCheckUtils]: 2: Hoare triple {5258#true} assume true; {5258#true} is VALID [2022-04-28 10:04:11,162 INFO L290 TraceCheckUtils]: 1: Hoare triple {5258#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(10, 2);call #Ultimate.allocInit(12, 3); {5258#true} is VALID [2022-04-28 10:04:11,162 INFO L272 TraceCheckUtils]: 0: Hoare triple {5258#true} call ULTIMATE.init(); {5258#true} is VALID [2022-04-28 10:04:11,162 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:04:11,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [61925366] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:04:11,162 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:04:11,162 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 24 [2022-04-28 10:04:11,162 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:04:11,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [367161126] [2022-04-28 10:04:11,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [367161126] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:04:11,162 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:04:11,162 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 10:04:11,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800905129] [2022-04-28 10:04:11,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:04:11,163 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 states have internal predecessors, (18), 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 22 [2022-04-28 10:04:11,163 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:04:11,163 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 states have internal predecessors, (18), 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-28 10:04:11,176 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:04:11,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 10:04:11,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:04:11,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 10:04:11,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=424, Unknown=0, NotChecked=0, Total=552 [2022-04-28 10:04:11,177 INFO L87 Difference]: Start difference. First operand 48 states and 60 transitions. Second operand has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 states have internal predecessors, (18), 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-28 10:04:12,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:12,011 INFO L93 Difference]: Finished difference Result 68 states and 92 transitions. [2022-04-28 10:04:12,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 10:04:12,011 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 states have internal predecessors, (18), 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 22 [2022-04-28 10:04:12,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:04:12,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 states have internal predecessors, (18), 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-28 10:04:12,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 77 transitions. [2022-04-28 10:04:12,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 states have internal predecessors, (18), 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-28 10:04:12,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 77 transitions. [2022-04-28 10:04:12,013 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 77 transitions. [2022-04-28 10:04:12,078 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:04:12,079 INFO L225 Difference]: With dead ends: 68 [2022-04-28 10:04:12,079 INFO L226 Difference]: Without dead ends: 62 [2022-04-28 10:04:12,079 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=260, Invalid=862, Unknown=0, NotChecked=0, Total=1122 [2022-04-28 10:04:12,079 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 60 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 454 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 10:04:12,080 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 79 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 454 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 10:04:12,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-04-28 10:04:12,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 53. [2022-04-28 10:04:12,127 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:04:12,127 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand has 53 states, 48 states have (on average 1.3125) internal successors, (63), 48 states have internal predecessors, (63), 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-28 10:04:12,127 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand has 53 states, 48 states have (on average 1.3125) internal successors, (63), 48 states have internal predecessors, (63), 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-28 10:04:12,127 INFO L87 Difference]: Start difference. First operand 62 states. Second operand has 53 states, 48 states have (on average 1.3125) internal successors, (63), 48 states have internal predecessors, (63), 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-28 10:04:12,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:12,128 INFO L93 Difference]: Finished difference Result 62 states and 76 transitions. [2022-04-28 10:04:12,128 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 76 transitions. [2022-04-28 10:04:12,128 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:04:12,128 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:04:12,128 INFO L74 IsIncluded]: Start isIncluded. First operand has 53 states, 48 states have (on average 1.3125) internal successors, (63), 48 states have internal predecessors, (63), 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 62 states. [2022-04-28 10:04:12,129 INFO L87 Difference]: Start difference. First operand has 53 states, 48 states have (on average 1.3125) internal successors, (63), 48 states have internal predecessors, (63), 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 62 states. [2022-04-28 10:04:12,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:12,129 INFO L93 Difference]: Finished difference Result 62 states and 76 transitions. [2022-04-28 10:04:12,129 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 76 transitions. [2022-04-28 10:04:12,129 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:04:12,129 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:04:12,129 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:04:12,130 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:04:12,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 48 states have (on average 1.3125) internal successors, (63), 48 states have internal predecessors, (63), 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-28 10:04:12,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 67 transitions. [2022-04-28 10:04:12,130 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 67 transitions. Word has length 22 [2022-04-28 10:04:12,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:04:12,130 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 67 transitions. [2022-04-28 10:04:12,130 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 states have internal predecessors, (18), 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-28 10:04:12,131 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 53 states and 67 transitions. [2022-04-28 10:04:12,332 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:04:12,333 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 67 transitions. [2022-04-28 10:04:12,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 10:04:12,333 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:04:12,333 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:04:12,350 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-04-28 10:04:12,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:04:12,543 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:04:12,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:04:12,543 INFO L85 PathProgramCache]: Analyzing trace with hash 142103551, now seen corresponding path program 13 times [2022-04-28 10:04:12,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:04:12,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [352698445] [2022-04-28 10:04:12,545 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:04:12,545 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:04:12,545 INFO L85 PathProgramCache]: Analyzing trace with hash 142103551, now seen corresponding path program 14 times [2022-04-28 10:04:12,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:04:12,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699090128] [2022-04-28 10:04:12,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:04:12,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:04:12,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:12,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:04:12,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:12,932 INFO L290 TraceCheckUtils]: 0: Hoare triple {5819#(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(10, 2);call #Ultimate.allocInit(12, 3); {5802#true} is VALID [2022-04-28 10:04:12,932 INFO L290 TraceCheckUtils]: 1: Hoare triple {5802#true} assume true; {5802#true} is VALID [2022-04-28 10:04:12,932 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5802#true} {5802#true} #61#return; {5802#true} is VALID [2022-04-28 10:04:12,933 INFO L272 TraceCheckUtils]: 0: Hoare triple {5802#true} call ULTIMATE.init(); {5819#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:04:12,933 INFO L290 TraceCheckUtils]: 1: Hoare triple {5819#(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(10, 2);call #Ultimate.allocInit(12, 3); {5802#true} is VALID [2022-04-28 10:04:12,933 INFO L290 TraceCheckUtils]: 2: Hoare triple {5802#true} assume true; {5802#true} is VALID [2022-04-28 10:04:12,933 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5802#true} {5802#true} #61#return; {5802#true} is VALID [2022-04-28 10:04:12,933 INFO L272 TraceCheckUtils]: 4: Hoare triple {5802#true} call #t~ret11 := main(); {5802#true} is VALID [2022-04-28 10:04:12,933 INFO L290 TraceCheckUtils]: 5: Hoare triple {5802#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5807#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-28 10:04:12,936 INFO L290 TraceCheckUtils]: 6: Hoare triple {5807#(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; {5808#(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-28 10:04:12,953 INFO L290 TraceCheckUtils]: 7: Hoare triple {5808#(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; {5809#(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-28 10:04:12,982 INFO L290 TraceCheckUtils]: 8: Hoare triple {5809#(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; {5810#(and (<= main_~y~0 3) (<= 3 main_~y~0) (<= main_~n~0 (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) 4294967295)) (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~x~0) (* (- 1) main_~y~0) (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296) 3) main_~n~0))} is VALID [2022-04-28 10:04:12,984 INFO L290 TraceCheckUtils]: 9: Hoare triple {5810#(and (<= main_~y~0 3) (<= 3 main_~y~0) (<= main_~n~0 (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) 4294967295)) (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~x~0) (* (- 1) main_~y~0) (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296) 3) main_~n~0))} assume !(~x~0 % 4294967296 > 0); {5811#(and (<= main_~y~0 3) (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) 3) main_~n~0))} is VALID [2022-04-28 10:04:12,984 INFO L290 TraceCheckUtils]: 10: Hoare triple {5811#(and (<= main_~y~0 3) (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) 3) main_~n~0))} ~z~0 := ~y~0; {5812#(and (<= main_~z~0 3) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 3) main_~n~0))} is VALID [2022-04-28 10:04:12,985 INFO L290 TraceCheckUtils]: 11: Hoare triple {5812#(and (<= main_~z~0 3) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 3) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5813#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 3) main_~n~0) (<= main_~z~0 2))} is VALID [2022-04-28 10:04:12,986 INFO L290 TraceCheckUtils]: 12: Hoare triple {5813#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 3) main_~n~0) (<= main_~z~0 2))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5814#(and (<= main_~z~0 1) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 3) main_~n~0))} is VALID [2022-04-28 10:04:12,987 INFO L290 TraceCheckUtils]: 13: Hoare triple {5814#(and (<= main_~z~0 1) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 3) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5815#(and (<= main_~z~0 0) (<= (+ 3 (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} is VALID [2022-04-28 10:04:12,988 INFO L290 TraceCheckUtils]: 14: Hoare triple {5815#(and (<= main_~z~0 0) (<= (+ 3 (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} assume !(~z~0 % 4294967296 > 0); {5815#(and (<= main_~z~0 0) (<= (+ 3 (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} is VALID [2022-04-28 10:04:12,988 INFO L290 TraceCheckUtils]: 15: Hoare triple {5815#(and (<= main_~z~0 0) (<= (+ 3 (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5814#(and (<= main_~z~0 1) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 3) main_~n~0))} is VALID [2022-04-28 10:04:12,989 INFO L290 TraceCheckUtils]: 16: Hoare triple {5814#(and (<= main_~z~0 1) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 3) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5813#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 3) main_~n~0) (<= main_~z~0 2))} is VALID [2022-04-28 10:04:12,991 INFO L290 TraceCheckUtils]: 17: Hoare triple {5813#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 3) main_~n~0) (<= main_~z~0 2))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5816#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-28 10:04:12,991 INFO L290 TraceCheckUtils]: 18: Hoare triple {5816#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {5816#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-28 10:04:12,992 INFO L272 TraceCheckUtils]: 19: Hoare triple {5816#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {5817#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:04:12,992 INFO L290 TraceCheckUtils]: 20: Hoare triple {5817#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {5818#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 10:04:12,993 INFO L290 TraceCheckUtils]: 21: Hoare triple {5818#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {5803#false} is VALID [2022-04-28 10:04:12,993 INFO L290 TraceCheckUtils]: 22: Hoare triple {5803#false} assume !false; {5803#false} is VALID [2022-04-28 10:04:12,993 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:04:12,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:04:12,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699090128] [2022-04-28 10:04:12,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699090128] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:04:12,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [691424526] [2022-04-28 10:04:12,993 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:04:12,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:04:12,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:04:12,994 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:04:12,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-04-28 10:04:13,048 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:04:13,048 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:04:13,049 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 41 conjunts are in the unsatisfiable core [2022-04-28 10:04:13,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:13,058 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:04:35,828 INFO L272 TraceCheckUtils]: 0: Hoare triple {5802#true} call ULTIMATE.init(); {5802#true} is VALID [2022-04-28 10:04:35,829 INFO L290 TraceCheckUtils]: 1: Hoare triple {5802#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(10, 2);call #Ultimate.allocInit(12, 3); {5802#true} is VALID [2022-04-28 10:04:35,829 INFO L290 TraceCheckUtils]: 2: Hoare triple {5802#true} assume true; {5802#true} is VALID [2022-04-28 10:04:35,829 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5802#true} {5802#true} #61#return; {5802#true} is VALID [2022-04-28 10:04:35,829 INFO L272 TraceCheckUtils]: 4: Hoare triple {5802#true} call #t~ret11 := main(); {5802#true} is VALID [2022-04-28 10:04:35,829 INFO L290 TraceCheckUtils]: 5: Hoare triple {5802#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5807#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-28 10:04:35,830 INFO L290 TraceCheckUtils]: 6: Hoare triple {5807#(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; {5841#(and (= (+ main_~x~0 1) main_~n~0) (= main_~y~0 1))} is VALID [2022-04-28 10:04:35,830 INFO L290 TraceCheckUtils]: 7: Hoare triple {5841#(and (= (+ main_~x~0 1) main_~n~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; {5845#(and (= main_~y~0 2) (= (+ main_~x~0 1) (+ (- 1) main_~n~0)))} is VALID [2022-04-28 10:04:35,831 INFO L290 TraceCheckUtils]: 8: Hoare triple {5845#(and (= main_~y~0 2) (= (+ main_~x~0 1) (+ (- 1) 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; {5849#(and (= (+ (- 2) main_~n~0) (+ main_~x~0 1)) (= main_~y~0 3))} is VALID [2022-04-28 10:04:35,831 INFO L290 TraceCheckUtils]: 9: Hoare triple {5849#(and (= (+ (- 2) main_~n~0) (+ main_~x~0 1)) (= main_~y~0 3))} assume !(~x~0 % 4294967296 > 0); {5853#(and (= (+ (- 2) main_~n~0) (+ main_~x~0 1)) (= main_~y~0 3) (not (< 0 (mod main_~x~0 4294967296))))} is VALID [2022-04-28 10:04:35,832 INFO L290 TraceCheckUtils]: 10: Hoare triple {5853#(and (= (+ (- 2) main_~n~0) (+ main_~x~0 1)) (= main_~y~0 3) (not (< 0 (mod main_~x~0 4294967296))))} ~z~0 := ~y~0; {5857#(and (= (+ (- 2) main_~n~0) (+ main_~x~0 1)) (not (< 0 (mod main_~x~0 4294967296))) (= main_~z~0 3))} is VALID [2022-04-28 10:04:35,832 INFO L290 TraceCheckUtils]: 11: Hoare triple {5857#(and (= (+ (- 2) main_~n~0) (+ main_~x~0 1)) (not (< 0 (mod main_~x~0 4294967296))) (= main_~z~0 3))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5861#(and (= 3 (+ main_~z~0 1)) (not (< 0 (mod (+ main_~x~0 4294967295) 4294967296))) (= (+ (- 2) main_~n~0) main_~x~0))} is VALID [2022-04-28 10:04:35,833 INFO L290 TraceCheckUtils]: 12: Hoare triple {5861#(and (= 3 (+ main_~z~0 1)) (not (< 0 (mod (+ main_~x~0 4294967295) 4294967296))) (= (+ (- 2) main_~n~0) main_~x~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5865#(and (= main_~x~0 (+ (- 1) main_~n~0)) (= 3 (+ main_~z~0 2)) (not (< 0 (mod (+ main_~n~0 4294967293) 4294967296))))} is VALID [2022-04-28 10:04:35,834 INFO L290 TraceCheckUtils]: 13: Hoare triple {5865#(and (= main_~x~0 (+ (- 1) main_~n~0)) (= 3 (+ main_~z~0 2)) (not (< 0 (mod (+ main_~n~0 4294967293) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5815#(and (<= main_~z~0 0) (<= (+ 3 (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} is VALID [2022-04-28 10:04:35,834 INFO L290 TraceCheckUtils]: 14: Hoare triple {5815#(and (<= main_~z~0 0) (<= (+ 3 (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} assume !(~z~0 % 4294967296 > 0); {5815#(and (<= main_~z~0 0) (<= (+ 3 (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} is VALID [2022-04-28 10:04:35,835 INFO L290 TraceCheckUtils]: 15: Hoare triple {5815#(and (<= main_~z~0 0) (<= (+ 3 (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5814#(and (<= main_~z~0 1) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 3) main_~n~0))} is VALID [2022-04-28 10:04:35,836 INFO L290 TraceCheckUtils]: 16: Hoare triple {5814#(and (<= main_~z~0 1) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 3) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5813#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 3) main_~n~0) (<= main_~z~0 2))} is VALID [2022-04-28 10:04:35,837 INFO L290 TraceCheckUtils]: 17: Hoare triple {5813#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 3) main_~n~0) (<= main_~z~0 2))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5812#(and (<= main_~z~0 3) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 3) main_~n~0))} is VALID [2022-04-28 10:04:35,837 INFO L290 TraceCheckUtils]: 18: Hoare triple {5812#(and (<= main_~z~0 3) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 3) main_~n~0))} assume !(~y~0 % 4294967296 > 0); {5812#(and (<= main_~z~0 3) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 3) main_~n~0))} is VALID [2022-04-28 10:04:35,839 INFO L272 TraceCheckUtils]: 19: Hoare triple {5812#(and (<= main_~z~0 3) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 3) main_~n~0))} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {5887#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:04:35,840 INFO L290 TraceCheckUtils]: 20: Hoare triple {5887#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5891#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:04:35,840 INFO L290 TraceCheckUtils]: 21: Hoare triple {5891#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5803#false} is VALID [2022-04-28 10:04:35,840 INFO L290 TraceCheckUtils]: 22: Hoare triple {5803#false} assume !false; {5803#false} is VALID [2022-04-28 10:04:35,840 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:04:35,840 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:04:36,876 INFO L290 TraceCheckUtils]: 22: Hoare triple {5803#false} assume !false; {5803#false} is VALID [2022-04-28 10:04:36,877 INFO L290 TraceCheckUtils]: 21: Hoare triple {5891#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5803#false} is VALID [2022-04-28 10:04:36,877 INFO L290 TraceCheckUtils]: 20: Hoare triple {5887#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5891#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:04:36,878 INFO L272 TraceCheckUtils]: 19: Hoare triple {5816#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {5887#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:04:36,879 INFO L290 TraceCheckUtils]: 18: Hoare triple {5816#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {5816#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-28 10:04:36,879 INFO L290 TraceCheckUtils]: 17: Hoare triple {5913#(and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5816#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-28 10:04:36,881 INFO L290 TraceCheckUtils]: 16: Hoare triple {5917#(and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5913#(and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-28 10:04:36,882 INFO L290 TraceCheckUtils]: 15: Hoare triple {5921#(and (< (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5917#(and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-28 10:04:36,882 INFO L290 TraceCheckUtils]: 14: Hoare triple {5921#(and (< (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {5921#(and (< (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296))))} is VALID [2022-04-28 10:04:36,883 INFO L290 TraceCheckUtils]: 13: Hoare triple {5917#(and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5921#(and (< (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296))))} is VALID [2022-04-28 10:04:36,884 INFO L290 TraceCheckUtils]: 12: Hoare triple {5913#(and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5917#(and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-28 10:04:36,885 INFO L290 TraceCheckUtils]: 11: Hoare triple {5934#(or (and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)))) (<= (mod main_~z~0 4294967296) 0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5913#(and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-28 10:04:36,885 INFO L290 TraceCheckUtils]: 10: Hoare triple {5938#(or (<= (mod main_~y~0 4294967296) 0) (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))))} ~z~0 := ~y~0; {5934#(or (and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)))) (<= (mod main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:04:36,886 INFO L290 TraceCheckUtils]: 9: Hoare triple {5942#(or (<= (mod main_~y~0 4294967296) 0) (< 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); {5938#(or (<= (mod main_~y~0 4294967296) 0) (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-28 10:04:36,888 INFO L290 TraceCheckUtils]: 8: Hoare triple {5946#(or (<= (mod (+ main_~y~0 1) 4294967296) 0) (< 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; {5942#(or (<= (mod main_~y~0 4294967296) 0) (< 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-28 10:04:36,890 INFO L290 TraceCheckUtils]: 7: Hoare triple {5950#(or (<= (mod (+ main_~y~0 2) 4294967296) 0) (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; {5946#(or (<= (mod (+ main_~y~0 1) 4294967296) 0) (< 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-28 10:04:36,891 INFO L290 TraceCheckUtils]: 6: Hoare triple {5954#(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)) (<= (mod (+ main_~y~0 3) 4294967296) 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; {5950#(or (<= (mod (+ main_~y~0 2) 4294967296) 0) (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-28 10:04:36,892 INFO L290 TraceCheckUtils]: 5: Hoare triple {5802#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5954#(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)) (<= (mod (+ main_~y~0 3) 4294967296) 0))} is VALID [2022-04-28 10:04:36,892 INFO L272 TraceCheckUtils]: 4: Hoare triple {5802#true} call #t~ret11 := main(); {5802#true} is VALID [2022-04-28 10:04:36,906 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5802#true} {5802#true} #61#return; {5802#true} is VALID [2022-04-28 10:04:36,906 INFO L290 TraceCheckUtils]: 2: Hoare triple {5802#true} assume true; {5802#true} is VALID [2022-04-28 10:04:36,906 INFO L290 TraceCheckUtils]: 1: Hoare triple {5802#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(10, 2);call #Ultimate.allocInit(12, 3); {5802#true} is VALID [2022-04-28 10:04:36,906 INFO L272 TraceCheckUtils]: 0: Hoare triple {5802#true} call ULTIMATE.init(); {5802#true} is VALID [2022-04-28 10:04:36,907 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:04:36,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [691424526] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:04:36,907 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:04:36,907 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 14] total 33 [2022-04-28 10:04:36,907 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:04:36,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [352698445] [2022-04-28 10:04:36,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [352698445] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:04:36,907 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:04:36,907 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-28 10:04:36,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892348314] [2022-04-28 10:04:36,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:04:36,908 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 13 states have internal predecessors, (19), 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 23 [2022-04-28 10:04:36,908 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:04:36,908 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 13 states have internal predecessors, (19), 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-28 10:04:36,949 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-28 10:04:36,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-28 10:04:36,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:04:36,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-28 10:04:36,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=928, Unknown=0, NotChecked=0, Total=1056 [2022-04-28 10:04:36,950 INFO L87 Difference]: Start difference. First operand 53 states and 67 transitions. Second operand has 15 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 13 states have internal predecessors, (19), 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-28 10:04:38,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:38,009 INFO L93 Difference]: Finished difference Result 70 states and 84 transitions. [2022-04-28 10:04:38,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-28 10:04:38,009 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 13 states have internal predecessors, (19), 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 23 [2022-04-28 10:04:38,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:04:38,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 13 states have internal predecessors, (19), 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-28 10:04:38,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 43 transitions. [2022-04-28 10:04:38,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 13 states have internal predecessors, (19), 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-28 10:04:38,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 43 transitions. [2022-04-28 10:04:38,011 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 43 transitions. [2022-04-28 10:04:38,082 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:04:38,083 INFO L225 Difference]: With dead ends: 70 [2022-04-28 10:04:38,083 INFO L226 Difference]: Without dead ends: 48 [2022-04-28 10:04:38,084 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 28 SyntacticMatches, 4 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 370 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=243, Invalid=1919, Unknown=0, NotChecked=0, Total=2162 [2022-04-28 10:04:38,084 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 22 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 10:04:38,084 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 69 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 10:04:38,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-04-28 10:04:38,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2022-04-28 10:04:38,122 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:04:38,122 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand has 48 states, 43 states have (on average 1.302325581395349) internal successors, (56), 43 states have internal predecessors, (56), 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-28 10:04:38,122 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand has 48 states, 43 states have (on average 1.302325581395349) internal successors, (56), 43 states have internal predecessors, (56), 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-28 10:04:38,122 INFO L87 Difference]: Start difference. First operand 48 states. Second operand has 48 states, 43 states have (on average 1.302325581395349) internal successors, (56), 43 states have internal predecessors, (56), 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-28 10:04:38,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:38,123 INFO L93 Difference]: Finished difference Result 48 states and 60 transitions. [2022-04-28 10:04:38,123 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 60 transitions. [2022-04-28 10:04:38,123 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:04:38,123 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:04:38,123 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 43 states have (on average 1.302325581395349) internal successors, (56), 43 states have internal predecessors, (56), 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 48 states. [2022-04-28 10:04:38,123 INFO L87 Difference]: Start difference. First operand has 48 states, 43 states have (on average 1.302325581395349) internal successors, (56), 43 states have internal predecessors, (56), 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 48 states. [2022-04-28 10:04:38,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:38,124 INFO L93 Difference]: Finished difference Result 48 states and 60 transitions. [2022-04-28 10:04:38,124 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 60 transitions. [2022-04-28 10:04:38,124 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:04:38,124 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:04:38,124 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:04:38,124 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:04:38,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 43 states have (on average 1.302325581395349) internal successors, (56), 43 states have internal predecessors, (56), 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-28 10:04:38,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 60 transitions. [2022-04-28 10:04:38,125 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 60 transitions. Word has length 23 [2022-04-28 10:04:38,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:04:38,125 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 60 transitions. [2022-04-28 10:04:38,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 13 states have internal predecessors, (19), 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-28 10:04:38,125 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 48 states and 60 transitions. [2022-04-28 10:04:38,411 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:04:38,411 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 60 transitions. [2022-04-28 10:04:38,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 10:04:38,411 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:04:38,411 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:04:38,427 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-04-28 10:04:38,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-04-28 10:04:38,613 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:04:38,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:04:38,613 INFO L85 PathProgramCache]: Analyzing trace with hash -1899384657, now seen corresponding path program 15 times [2022-04-28 10:04:38,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:04:38,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [995397687] [2022-04-28 10:04:38,615 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:04:38,615 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:04:38,615 INFO L85 PathProgramCache]: Analyzing trace with hash -1899384657, now seen corresponding path program 16 times [2022-04-28 10:04:38,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:04:38,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975147798] [2022-04-28 10:04:38,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:04:38,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:04:38,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:38,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:04:38,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:38,721 INFO L290 TraceCheckUtils]: 0: Hoare triple {6347#(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(10, 2);call #Ultimate.allocInit(12, 3); {6335#true} is VALID [2022-04-28 10:04:38,721 INFO L290 TraceCheckUtils]: 1: Hoare triple {6335#true} assume true; {6335#true} is VALID [2022-04-28 10:04:38,721 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6335#true} {6335#true} #61#return; {6335#true} is VALID [2022-04-28 10:04:38,722 INFO L272 TraceCheckUtils]: 0: Hoare triple {6335#true} call ULTIMATE.init(); {6347#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:04:38,722 INFO L290 TraceCheckUtils]: 1: Hoare triple {6347#(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(10, 2);call #Ultimate.allocInit(12, 3); {6335#true} is VALID [2022-04-28 10:04:38,722 INFO L290 TraceCheckUtils]: 2: Hoare triple {6335#true} assume true; {6335#true} is VALID [2022-04-28 10:04:38,722 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6335#true} {6335#true} #61#return; {6335#true} is VALID [2022-04-28 10:04:38,722 INFO L272 TraceCheckUtils]: 4: Hoare triple {6335#true} call #t~ret11 := main(); {6335#true} is VALID [2022-04-28 10:04:38,722 INFO L290 TraceCheckUtils]: 5: Hoare triple {6335#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {6340#(= main_~y~0 0)} is VALID [2022-04-28 10:04:38,722 INFO L290 TraceCheckUtils]: 6: Hoare triple {6340#(= 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; {6341#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:04:38,723 INFO L290 TraceCheckUtils]: 7: Hoare triple {6341#(and (<= 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; {6342#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:04:38,724 INFO L290 TraceCheckUtils]: 8: Hoare triple {6342#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {6343#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:04:38,724 INFO L290 TraceCheckUtils]: 9: Hoare triple {6343#(and (<= main_~y~0 3) (<= 3 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; {6344#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:04:38,724 INFO L290 TraceCheckUtils]: 10: Hoare triple {6344#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {6344#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:04:38,725 INFO L290 TraceCheckUtils]: 11: Hoare triple {6344#(and (<= main_~y~0 4) (<= 4 main_~y~0))} ~z~0 := ~y~0; {6345#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:04:38,725 INFO L290 TraceCheckUtils]: 12: Hoare triple {6345#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6346#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:04:38,726 INFO L290 TraceCheckUtils]: 13: Hoare triple {6346#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {6336#false} is VALID [2022-04-28 10:04:38,726 INFO L290 TraceCheckUtils]: 14: Hoare triple {6336#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {6336#false} is VALID [2022-04-28 10:04:38,726 INFO L290 TraceCheckUtils]: 15: Hoare triple {6336#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {6336#false} is VALID [2022-04-28 10:04:38,726 INFO L290 TraceCheckUtils]: 16: Hoare triple {6336#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {6336#false} is VALID [2022-04-28 10:04:38,726 INFO L290 TraceCheckUtils]: 17: Hoare triple {6336#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {6336#false} is VALID [2022-04-28 10:04:38,726 INFO L290 TraceCheckUtils]: 18: Hoare triple {6336#false} assume !(~y~0 % 4294967296 > 0); {6336#false} is VALID [2022-04-28 10:04:38,726 INFO L272 TraceCheckUtils]: 19: Hoare triple {6336#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {6336#false} is VALID [2022-04-28 10:04:38,726 INFO L290 TraceCheckUtils]: 20: Hoare triple {6336#false} ~cond := #in~cond; {6336#false} is VALID [2022-04-28 10:04:38,726 INFO L290 TraceCheckUtils]: 21: Hoare triple {6336#false} assume 0 == ~cond; {6336#false} is VALID [2022-04-28 10:04:38,726 INFO L290 TraceCheckUtils]: 22: Hoare triple {6336#false} assume !false; {6336#false} is VALID [2022-04-28 10:04:38,726 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 10:04:38,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:04:38,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975147798] [2022-04-28 10:04:38,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975147798] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:04:38,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1489561764] [2022-04-28 10:04:38,727 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:04:38,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:04:38,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:04:38,728 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:04:38,728 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-04-28 10:04:38,767 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:04:38,767 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:04:38,767 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-28 10:04:38,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:38,773 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:04:38,889 INFO L272 TraceCheckUtils]: 0: Hoare triple {6335#true} call ULTIMATE.init(); {6335#true} is VALID [2022-04-28 10:04:38,889 INFO L290 TraceCheckUtils]: 1: Hoare triple {6335#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(10, 2);call #Ultimate.allocInit(12, 3); {6335#true} is VALID [2022-04-28 10:04:38,889 INFO L290 TraceCheckUtils]: 2: Hoare triple {6335#true} assume true; {6335#true} is VALID [2022-04-28 10:04:38,889 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6335#true} {6335#true} #61#return; {6335#true} is VALID [2022-04-28 10:04:38,889 INFO L272 TraceCheckUtils]: 4: Hoare triple {6335#true} call #t~ret11 := main(); {6335#true} is VALID [2022-04-28 10:04:38,889 INFO L290 TraceCheckUtils]: 5: Hoare triple {6335#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {6340#(= main_~y~0 0)} is VALID [2022-04-28 10:04:38,890 INFO L290 TraceCheckUtils]: 6: Hoare triple {6340#(= 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; {6341#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:04:38,890 INFO L290 TraceCheckUtils]: 7: Hoare triple {6341#(and (<= 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; {6342#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:04:38,891 INFO L290 TraceCheckUtils]: 8: Hoare triple {6342#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {6343#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:04:38,891 INFO L290 TraceCheckUtils]: 9: Hoare triple {6343#(and (<= main_~y~0 3) (<= 3 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; {6344#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:04:38,892 INFO L290 TraceCheckUtils]: 10: Hoare triple {6344#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {6344#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:04:38,892 INFO L290 TraceCheckUtils]: 11: Hoare triple {6344#(and (<= main_~y~0 4) (<= 4 main_~y~0))} ~z~0 := ~y~0; {6384#(and (= main_~z~0 main_~y~0) (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:04:38,893 INFO L290 TraceCheckUtils]: 12: Hoare triple {6384#(and (= main_~z~0 main_~y~0) (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6388#(and (<= main_~y~0 4) (<= 4 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-28 10:04:38,893 INFO L290 TraceCheckUtils]: 13: Hoare triple {6388#(and (<= main_~y~0 4) (<= 4 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} assume !(~z~0 % 4294967296 > 0); {6336#false} is VALID [2022-04-28 10:04:38,893 INFO L290 TraceCheckUtils]: 14: Hoare triple {6336#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {6336#false} is VALID [2022-04-28 10:04:38,893 INFO L290 TraceCheckUtils]: 15: Hoare triple {6336#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {6336#false} is VALID [2022-04-28 10:04:38,893 INFO L290 TraceCheckUtils]: 16: Hoare triple {6336#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {6336#false} is VALID [2022-04-28 10:04:38,893 INFO L290 TraceCheckUtils]: 17: Hoare triple {6336#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {6336#false} is VALID [2022-04-28 10:04:38,893 INFO L290 TraceCheckUtils]: 18: Hoare triple {6336#false} assume !(~y~0 % 4294967296 > 0); {6336#false} is VALID [2022-04-28 10:04:38,893 INFO L272 TraceCheckUtils]: 19: Hoare triple {6336#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {6336#false} is VALID [2022-04-28 10:04:38,893 INFO L290 TraceCheckUtils]: 20: Hoare triple {6336#false} ~cond := #in~cond; {6336#false} is VALID [2022-04-28 10:04:38,893 INFO L290 TraceCheckUtils]: 21: Hoare triple {6336#false} assume 0 == ~cond; {6336#false} is VALID [2022-04-28 10:04:38,894 INFO L290 TraceCheckUtils]: 22: Hoare triple {6336#false} assume !false; {6336#false} is VALID [2022-04-28 10:04:38,894 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 10:04:38,894 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:04:38,998 INFO L290 TraceCheckUtils]: 22: Hoare triple {6336#false} assume !false; {6336#false} is VALID [2022-04-28 10:04:38,998 INFO L290 TraceCheckUtils]: 21: Hoare triple {6336#false} assume 0 == ~cond; {6336#false} is VALID [2022-04-28 10:04:38,998 INFO L290 TraceCheckUtils]: 20: Hoare triple {6336#false} ~cond := #in~cond; {6336#false} is VALID [2022-04-28 10:04:38,998 INFO L272 TraceCheckUtils]: 19: Hoare triple {6336#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {6336#false} is VALID [2022-04-28 10:04:38,998 INFO L290 TraceCheckUtils]: 18: Hoare triple {6336#false} assume !(~y~0 % 4294967296 > 0); {6336#false} is VALID [2022-04-28 10:04:38,998 INFO L290 TraceCheckUtils]: 17: Hoare triple {6336#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {6336#false} is VALID [2022-04-28 10:04:38,998 INFO L290 TraceCheckUtils]: 16: Hoare triple {6336#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {6336#false} is VALID [2022-04-28 10:04:38,999 INFO L290 TraceCheckUtils]: 15: Hoare triple {6440#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {6336#false} is VALID [2022-04-28 10:04:38,999 INFO L290 TraceCheckUtils]: 14: Hoare triple {6444#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {6440#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:04:39,000 INFO L290 TraceCheckUtils]: 13: Hoare triple {6448#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {6444#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:04:39,001 INFO L290 TraceCheckUtils]: 12: Hoare triple {6452#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6448#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-28 10:04:39,001 INFO L290 TraceCheckUtils]: 11: Hoare triple {6335#true} ~z~0 := ~y~0; {6452#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-28 10:04:39,001 INFO L290 TraceCheckUtils]: 10: Hoare triple {6335#true} assume !(~x~0 % 4294967296 > 0); {6335#true} is VALID [2022-04-28 10:04:39,001 INFO L290 TraceCheckUtils]: 9: Hoare triple {6335#true} 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; {6335#true} is VALID [2022-04-28 10:04:39,001 INFO L290 TraceCheckUtils]: 8: Hoare triple {6335#true} 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; {6335#true} is VALID [2022-04-28 10:04:39,001 INFO L290 TraceCheckUtils]: 7: Hoare triple {6335#true} 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; {6335#true} is VALID [2022-04-28 10:04:39,001 INFO L290 TraceCheckUtils]: 6: Hoare triple {6335#true} 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; {6335#true} is VALID [2022-04-28 10:04:39,001 INFO L290 TraceCheckUtils]: 5: Hoare triple {6335#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {6335#true} is VALID [2022-04-28 10:04:39,001 INFO L272 TraceCheckUtils]: 4: Hoare triple {6335#true} call #t~ret11 := main(); {6335#true} is VALID [2022-04-28 10:04:39,002 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6335#true} {6335#true} #61#return; {6335#true} is VALID [2022-04-28 10:04:39,002 INFO L290 TraceCheckUtils]: 2: Hoare triple {6335#true} assume true; {6335#true} is VALID [2022-04-28 10:04:39,002 INFO L290 TraceCheckUtils]: 1: Hoare triple {6335#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(10, 2);call #Ultimate.allocInit(12, 3); {6335#true} is VALID [2022-04-28 10:04:39,002 INFO L272 TraceCheckUtils]: 0: Hoare triple {6335#true} call ULTIMATE.init(); {6335#true} is VALID [2022-04-28 10:04:39,002 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-04-28 10:04:39,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1489561764] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:04:39,002 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:04:39,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 6] total 16 [2022-04-28 10:04:39,002 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:04:39,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [995397687] [2022-04-28 10:04:39,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [995397687] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:04:39,002 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:04:39,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 10:04:39,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061214395] [2022-04-28 10:04:39,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:04:39,003 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.6) internal successors, (16), 9 states have internal predecessors, (16), 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 23 [2022-04-28 10:04:39,003 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:04:39,003 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 1.6) internal successors, (16), 9 states have internal predecessors, (16), 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-28 10:04:39,015 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:04:39,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 10:04:39,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:04:39,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 10:04:39,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2022-04-28 10:04:39,016 INFO L87 Difference]: Start difference. First operand 48 states and 60 transitions. Second operand has 10 states, 10 states have (on average 1.6) internal successors, (16), 9 states have internal predecessors, (16), 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-28 10:04:39,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:39,396 INFO L93 Difference]: Finished difference Result 65 states and 77 transitions. [2022-04-28 10:04:39,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 10:04:39,396 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.6) internal successors, (16), 9 states have internal predecessors, (16), 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 23 [2022-04-28 10:04:39,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:04:39,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.6) internal successors, (16), 9 states have internal predecessors, (16), 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-28 10:04:39,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 41 transitions. [2022-04-28 10:04:39,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.6) internal successors, (16), 9 states have internal predecessors, (16), 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-28 10:04:39,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 41 transitions. [2022-04-28 10:04:39,398 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 41 transitions. [2022-04-28 10:04:39,437 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:04:39,437 INFO L225 Difference]: With dead ends: 65 [2022-04-28 10:04:39,437 INFO L226 Difference]: Without dead ends: 55 [2022-04-28 10:04:39,438 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=414, Unknown=0, NotChecked=0, Total=506 [2022-04-28 10:04:39,438 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 18 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:04:39,438 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 46 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 10:04:39,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-04-28 10:04:39,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 49. [2022-04-28 10:04:39,477 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:04:39,477 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand has 49 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 44 states have internal predecessors, (57), 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-28 10:04:39,477 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand has 49 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 44 states have internal predecessors, (57), 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-28 10:04:39,477 INFO L87 Difference]: Start difference. First operand 55 states. Second operand has 49 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 44 states have internal predecessors, (57), 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-28 10:04:39,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:39,478 INFO L93 Difference]: Finished difference Result 55 states and 67 transitions. [2022-04-28 10:04:39,478 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 67 transitions. [2022-04-28 10:04:39,478 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:04:39,478 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:04:39,479 INFO L74 IsIncluded]: Start isIncluded. First operand has 49 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 44 states have internal predecessors, (57), 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 55 states. [2022-04-28 10:04:39,479 INFO L87 Difference]: Start difference. First operand has 49 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 44 states have internal predecessors, (57), 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 55 states. [2022-04-28 10:04:39,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:39,479 INFO L93 Difference]: Finished difference Result 55 states and 67 transitions. [2022-04-28 10:04:39,479 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 67 transitions. [2022-04-28 10:04:39,480 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:04:39,480 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:04:39,480 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:04:39,480 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:04:39,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 44 states have internal predecessors, (57), 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-28 10:04:39,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 61 transitions. [2022-04-28 10:04:39,480 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 61 transitions. Word has length 23 [2022-04-28 10:04:39,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:04:39,480 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 61 transitions. [2022-04-28 10:04:39,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.6) internal successors, (16), 9 states have internal predecessors, (16), 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-28 10:04:39,481 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 49 states and 61 transitions. [2022-04-28 10:04:41,638 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 60 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 10:04:41,638 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 61 transitions. [2022-04-28 10:04:41,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 10:04:41,638 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:04:41,638 INFO L195 NwaCegarLoop]: trace histogram [9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:04:41,654 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-04-28 10:04:41,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-04-28 10:04:41,839 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:04:41,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:04:41,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1831886802, now seen corresponding path program 17 times [2022-04-28 10:04:41,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:04:41,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [601888542] [2022-04-28 10:04:41,842 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:04:41,843 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:04:41,843 INFO L85 PathProgramCache]: Analyzing trace with hash -1831886802, now seen corresponding path program 18 times [2022-04-28 10:04:41,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:04:41,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412856857] [2022-04-28 10:04:41,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:04:41,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:04:41,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:42,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:04:42,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:42,076 INFO L290 TraceCheckUtils]: 0: Hoare triple {6859#(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(10, 2);call #Ultimate.allocInit(12, 3); {6843#true} is VALID [2022-04-28 10:04:42,076 INFO L290 TraceCheckUtils]: 1: Hoare triple {6843#true} assume true; {6843#true} is VALID [2022-04-28 10:04:42,076 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6843#true} {6843#true} #61#return; {6843#true} is VALID [2022-04-28 10:04:42,077 INFO L272 TraceCheckUtils]: 0: Hoare triple {6843#true} call ULTIMATE.init(); {6859#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:04:42,077 INFO L290 TraceCheckUtils]: 1: Hoare triple {6859#(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(10, 2);call #Ultimate.allocInit(12, 3); {6843#true} is VALID [2022-04-28 10:04:42,077 INFO L290 TraceCheckUtils]: 2: Hoare triple {6843#true} assume true; {6843#true} is VALID [2022-04-28 10:04:42,077 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6843#true} {6843#true} #61#return; {6843#true} is VALID [2022-04-28 10:04:42,077 INFO L272 TraceCheckUtils]: 4: Hoare triple {6843#true} call #t~ret11 := main(); {6843#true} is VALID [2022-04-28 10:04:42,077 INFO L290 TraceCheckUtils]: 5: Hoare triple {6843#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {6848#(= main_~y~0 0)} is VALID [2022-04-28 10:04:42,078 INFO L290 TraceCheckUtils]: 6: Hoare triple {6848#(= 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; {6849#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:04:42,078 INFO L290 TraceCheckUtils]: 7: Hoare triple {6849#(and (<= 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; {6850#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:04:42,079 INFO L290 TraceCheckUtils]: 8: Hoare triple {6850#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {6851#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:04:42,079 INFO L290 TraceCheckUtils]: 9: Hoare triple {6851#(and (<= main_~y~0 3) (<= 3 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; {6852#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:04:42,080 INFO L290 TraceCheckUtils]: 10: Hoare triple {6852#(and (<= main_~y~0 4) (<= 4 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; {6853#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:04:42,080 INFO L290 TraceCheckUtils]: 11: Hoare triple {6853#(and (<= 5 main_~y~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; {6854#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:04:42,081 INFO L290 TraceCheckUtils]: 12: Hoare triple {6854#(and (<= main_~y~0 6) (<= 6 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; {6855#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:04:42,082 INFO L290 TraceCheckUtils]: 13: Hoare triple {6855#(and (<= 7 main_~y~0) (<= main_~y~0 7))} 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; {6856#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:04:42,082 INFO L290 TraceCheckUtils]: 14: Hoare triple {6856#(and (<= main_~y~0 8) (<= 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; {6857#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:04:42,082 INFO L290 TraceCheckUtils]: 15: Hoare triple {6857#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {6857#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:04:42,083 INFO L290 TraceCheckUtils]: 16: Hoare triple {6857#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {6858#(and (<= 9 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:04:42,083 INFO L290 TraceCheckUtils]: 17: Hoare triple {6858#(and (<= 9 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {6844#false} is VALID [2022-04-28 10:04:42,083 INFO L290 TraceCheckUtils]: 18: Hoare triple {6844#false} assume !(~y~0 % 4294967296 > 0); {6844#false} is VALID [2022-04-28 10:04:42,083 INFO L272 TraceCheckUtils]: 19: Hoare triple {6844#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {6844#false} is VALID [2022-04-28 10:04:42,084 INFO L290 TraceCheckUtils]: 20: Hoare triple {6844#false} ~cond := #in~cond; {6844#false} is VALID [2022-04-28 10:04:42,084 INFO L290 TraceCheckUtils]: 21: Hoare triple {6844#false} assume 0 == ~cond; {6844#false} is VALID [2022-04-28 10:04:42,084 INFO L290 TraceCheckUtils]: 22: Hoare triple {6844#false} assume !false; {6844#false} is VALID [2022-04-28 10:04:42,084 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:04:42,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:04:42,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412856857] [2022-04-28 10:04:42,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412856857] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:04:42,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1877818178] [2022-04-28 10:04:42,084 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:04:42,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:04:42,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:04:42,085 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:04:42,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-04-28 10:04:42,125 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-04-28 10:04:42,126 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:04:42,126 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-28 10:04:42,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:42,131 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:04:42,335 INFO L272 TraceCheckUtils]: 0: Hoare triple {6843#true} call ULTIMATE.init(); {6843#true} is VALID [2022-04-28 10:04:42,335 INFO L290 TraceCheckUtils]: 1: Hoare triple {6843#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(10, 2);call #Ultimate.allocInit(12, 3); {6843#true} is VALID [2022-04-28 10:04:42,335 INFO L290 TraceCheckUtils]: 2: Hoare triple {6843#true} assume true; {6843#true} is VALID [2022-04-28 10:04:42,335 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6843#true} {6843#true} #61#return; {6843#true} is VALID [2022-04-28 10:04:42,335 INFO L272 TraceCheckUtils]: 4: Hoare triple {6843#true} call #t~ret11 := main(); {6843#true} is VALID [2022-04-28 10:04:42,336 INFO L290 TraceCheckUtils]: 5: Hoare triple {6843#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {6848#(= main_~y~0 0)} is VALID [2022-04-28 10:04:42,336 INFO L290 TraceCheckUtils]: 6: Hoare triple {6848#(= 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; {6849#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:04:42,337 INFO L290 TraceCheckUtils]: 7: Hoare triple {6849#(and (<= 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; {6850#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:04:42,337 INFO L290 TraceCheckUtils]: 8: Hoare triple {6850#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {6851#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:04:42,338 INFO L290 TraceCheckUtils]: 9: Hoare triple {6851#(and (<= main_~y~0 3) (<= 3 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; {6852#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:04:42,338 INFO L290 TraceCheckUtils]: 10: Hoare triple {6852#(and (<= main_~y~0 4) (<= 4 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; {6853#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:04:42,339 INFO L290 TraceCheckUtils]: 11: Hoare triple {6853#(and (<= 5 main_~y~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; {6854#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:04:42,339 INFO L290 TraceCheckUtils]: 12: Hoare triple {6854#(and (<= main_~y~0 6) (<= 6 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; {6855#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:04:42,340 INFO L290 TraceCheckUtils]: 13: Hoare triple {6855#(and (<= 7 main_~y~0) (<= main_~y~0 7))} 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; {6856#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:04:42,340 INFO L290 TraceCheckUtils]: 14: Hoare triple {6856#(and (<= main_~y~0 8) (<= 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; {6857#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:04:42,341 INFO L290 TraceCheckUtils]: 15: Hoare triple {6857#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {6857#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:04:42,341 INFO L290 TraceCheckUtils]: 16: Hoare triple {6857#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {6911#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:04:42,341 INFO L290 TraceCheckUtils]: 17: Hoare triple {6911#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !(~z~0 % 4294967296 > 0); {6844#false} is VALID [2022-04-28 10:04:42,342 INFO L290 TraceCheckUtils]: 18: Hoare triple {6844#false} assume !(~y~0 % 4294967296 > 0); {6844#false} is VALID [2022-04-28 10:04:42,342 INFO L272 TraceCheckUtils]: 19: Hoare triple {6844#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {6844#false} is VALID [2022-04-28 10:04:42,342 INFO L290 TraceCheckUtils]: 20: Hoare triple {6844#false} ~cond := #in~cond; {6844#false} is VALID [2022-04-28 10:04:42,342 INFO L290 TraceCheckUtils]: 21: Hoare triple {6844#false} assume 0 == ~cond; {6844#false} is VALID [2022-04-28 10:04:42,342 INFO L290 TraceCheckUtils]: 22: Hoare triple {6844#false} assume !false; {6844#false} is VALID [2022-04-28 10:04:42,342 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:04:42,342 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:04:42,612 INFO L290 TraceCheckUtils]: 22: Hoare triple {6844#false} assume !false; {6844#false} is VALID [2022-04-28 10:04:42,612 INFO L290 TraceCheckUtils]: 21: Hoare triple {6844#false} assume 0 == ~cond; {6844#false} is VALID [2022-04-28 10:04:42,612 INFO L290 TraceCheckUtils]: 20: Hoare triple {6844#false} ~cond := #in~cond; {6844#false} is VALID [2022-04-28 10:04:42,613 INFO L272 TraceCheckUtils]: 19: Hoare triple {6844#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {6844#false} is VALID [2022-04-28 10:04:42,613 INFO L290 TraceCheckUtils]: 18: Hoare triple {6844#false} assume !(~y~0 % 4294967296 > 0); {6844#false} is VALID [2022-04-28 10:04:42,613 INFO L290 TraceCheckUtils]: 17: Hoare triple {6945#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {6844#false} is VALID [2022-04-28 10:04:42,613 INFO L290 TraceCheckUtils]: 16: Hoare triple {6949#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {6945#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:04:42,613 INFO L290 TraceCheckUtils]: 15: Hoare triple {6949#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {6949#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:04:42,614 INFO L290 TraceCheckUtils]: 14: Hoare triple {6956#(< 0 (mod (+ main_~y~0 1) 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; {6949#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:04:42,615 INFO L290 TraceCheckUtils]: 13: Hoare triple {6960#(< 0 (mod (+ main_~y~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; {6956#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:04:42,615 INFO L290 TraceCheckUtils]: 12: Hoare triple {6964#(< 0 (mod (+ main_~y~0 3) 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; {6960#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:04:42,616 INFO L290 TraceCheckUtils]: 11: Hoare triple {6968#(< 0 (mod (+ main_~y~0 4) 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; {6964#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:04:42,617 INFO L290 TraceCheckUtils]: 10: Hoare triple {6972#(< 0 (mod (+ 5 main_~y~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; {6968#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:04:42,617 INFO L290 TraceCheckUtils]: 9: Hoare triple {6976#(< 0 (mod (+ main_~y~0 6) 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; {6972#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:04:42,618 INFO L290 TraceCheckUtils]: 8: Hoare triple {6980#(< 0 (mod (+ 7 main_~y~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; {6976#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:04:42,619 INFO L290 TraceCheckUtils]: 7: Hoare triple {6984#(< 0 (mod (+ main_~y~0 8) 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; {6980#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:04:42,619 INFO L290 TraceCheckUtils]: 6: Hoare triple {6988#(< 0 (mod (+ main_~y~0 9) 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; {6984#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:04:42,620 INFO L290 TraceCheckUtils]: 5: Hoare triple {6843#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {6988#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:04:42,620 INFO L272 TraceCheckUtils]: 4: Hoare triple {6843#true} call #t~ret11 := main(); {6843#true} is VALID [2022-04-28 10:04:42,620 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6843#true} {6843#true} #61#return; {6843#true} is VALID [2022-04-28 10:04:42,620 INFO L290 TraceCheckUtils]: 2: Hoare triple {6843#true} assume true; {6843#true} is VALID [2022-04-28 10:04:42,620 INFO L290 TraceCheckUtils]: 1: Hoare triple {6843#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(10, 2);call #Ultimate.allocInit(12, 3); {6843#true} is VALID [2022-04-28 10:04:42,620 INFO L272 TraceCheckUtils]: 0: Hoare triple {6843#true} call ULTIMATE.init(); {6843#true} is VALID [2022-04-28 10:04:42,620 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:04:42,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1877818178] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:04:42,620 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:04:42,620 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 26 [2022-04-28 10:04:42,620 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:04:42,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [601888542] [2022-04-28 10:04:42,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [601888542] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:04:42,621 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:04:42,621 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 10:04:42,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60030760] [2022-04-28 10:04:42,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:04:42,621 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 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 23 [2022-04-28 10:04:42,621 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:04:42,621 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 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-28 10:04:42,635 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-28 10:04:42,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 10:04:42,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:04:42,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 10:04:42,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=499, Unknown=0, NotChecked=0, Total=650 [2022-04-28 10:04:42,635 INFO L87 Difference]: Start difference. First operand 49 states and 61 transitions. Second operand has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 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-28 10:04:43,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:43,646 INFO L93 Difference]: Finished difference Result 70 states and 95 transitions. [2022-04-28 10:04:43,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-28 10:04:43,646 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 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 23 [2022-04-28 10:04:43,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:04:43,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 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-28 10:04:43,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 80 transitions. [2022-04-28 10:04:43,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 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-28 10:04:43,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 80 transitions. [2022-04-28 10:04:43,648 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 80 transitions. [2022-04-28 10:04:43,721 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:04:43,721 INFO L225 Difference]: With dead ends: 70 [2022-04-28 10:04:43,721 INFO L226 Difference]: Without dead ends: 64 [2022-04-28 10:04:43,722 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=307, Invalid=1025, Unknown=0, NotChecked=0, Total=1332 [2022-04-28 10:04:43,722 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 60 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 10:04:43,722 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 84 Invalid, 566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 10:04:43,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-04-28 10:04:43,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 54. [2022-04-28 10:04:43,770 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:04:43,770 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand has 54 states, 49 states have (on average 1.3061224489795917) internal successors, (64), 49 states have internal predecessors, (64), 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-28 10:04:43,770 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand has 54 states, 49 states have (on average 1.3061224489795917) internal successors, (64), 49 states have internal predecessors, (64), 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-28 10:04:43,770 INFO L87 Difference]: Start difference. First operand 64 states. Second operand has 54 states, 49 states have (on average 1.3061224489795917) internal successors, (64), 49 states have internal predecessors, (64), 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-28 10:04:43,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:43,771 INFO L93 Difference]: Finished difference Result 64 states and 78 transitions. [2022-04-28 10:04:43,771 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 78 transitions. [2022-04-28 10:04:43,771 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:04:43,772 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:04:43,772 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 49 states have (on average 1.3061224489795917) internal successors, (64), 49 states have internal predecessors, (64), 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 64 states. [2022-04-28 10:04:43,772 INFO L87 Difference]: Start difference. First operand has 54 states, 49 states have (on average 1.3061224489795917) internal successors, (64), 49 states have internal predecessors, (64), 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 64 states. [2022-04-28 10:04:43,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:43,772 INFO L93 Difference]: Finished difference Result 64 states and 78 transitions. [2022-04-28 10:04:43,772 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 78 transitions. [2022-04-28 10:04:43,773 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:04:43,773 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:04:43,773 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:04:43,773 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:04:43,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 49 states have (on average 1.3061224489795917) internal successors, (64), 49 states have internal predecessors, (64), 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-28 10:04:43,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 68 transitions. [2022-04-28 10:04:43,773 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 68 transitions. Word has length 23 [2022-04-28 10:04:43,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:04:43,774 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 68 transitions. [2022-04-28 10:04:43,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 13 states have internal predecessors, (19), 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-28 10:04:43,774 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 54 states and 68 transitions. [2022-04-28 10:04:44,239 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:04:44,239 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 68 transitions. [2022-04-28 10:04:44,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-28 10:04:44,240 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:04:44,240 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:04:44,255 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-04-28 10:04:44,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-04-28 10:04:44,440 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:04:44,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:04:44,441 INFO L85 PathProgramCache]: Analyzing trace with hash 243885709, now seen corresponding path program 17 times [2022-04-28 10:04:44,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:04:44,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [346682757] [2022-04-28 10:04:44,443 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:04:44,443 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:04:44,443 INFO L85 PathProgramCache]: Analyzing trace with hash 243885709, now seen corresponding path program 18 times [2022-04-28 10:04:44,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:04:44,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538640613] [2022-04-28 10:04:44,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:04:44,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:04:44,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:44,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:04:44,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:44,570 INFO L290 TraceCheckUtils]: 0: Hoare triple {7420#(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(10, 2);call #Ultimate.allocInit(12, 3); {7407#true} is VALID [2022-04-28 10:04:44,570 INFO L290 TraceCheckUtils]: 1: Hoare triple {7407#true} assume true; {7407#true} is VALID [2022-04-28 10:04:44,570 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7407#true} {7407#true} #61#return; {7407#true} is VALID [2022-04-28 10:04:44,571 INFO L272 TraceCheckUtils]: 0: Hoare triple {7407#true} call ULTIMATE.init(); {7420#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:04:44,571 INFO L290 TraceCheckUtils]: 1: Hoare triple {7420#(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(10, 2);call #Ultimate.allocInit(12, 3); {7407#true} is VALID [2022-04-28 10:04:44,571 INFO L290 TraceCheckUtils]: 2: Hoare triple {7407#true} assume true; {7407#true} is VALID [2022-04-28 10:04:44,571 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7407#true} {7407#true} #61#return; {7407#true} is VALID [2022-04-28 10:04:44,571 INFO L272 TraceCheckUtils]: 4: Hoare triple {7407#true} call #t~ret11 := main(); {7407#true} is VALID [2022-04-28 10:04:44,571 INFO L290 TraceCheckUtils]: 5: Hoare triple {7407#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {7412#(= main_~y~0 0)} is VALID [2022-04-28 10:04:44,571 INFO L290 TraceCheckUtils]: 6: Hoare triple {7412#(= 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; {7413#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:04:44,572 INFO L290 TraceCheckUtils]: 7: Hoare triple {7413#(and (<= 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; {7414#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:04:44,572 INFO L290 TraceCheckUtils]: 8: Hoare triple {7414#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {7415#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:04:44,573 INFO L290 TraceCheckUtils]: 9: Hoare triple {7415#(and (<= main_~y~0 3) (<= 3 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; {7416#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:04:44,573 INFO L290 TraceCheckUtils]: 10: Hoare triple {7416#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {7416#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:04:44,574 INFO L290 TraceCheckUtils]: 11: Hoare triple {7416#(and (<= main_~y~0 4) (<= 4 main_~y~0))} ~z~0 := ~y~0; {7417#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:04:44,574 INFO L290 TraceCheckUtils]: 12: Hoare triple {7417#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7418#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:04:44,575 INFO L290 TraceCheckUtils]: 13: Hoare triple {7418#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7419#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} is VALID [2022-04-28 10:04:44,575 INFO L290 TraceCheckUtils]: 14: Hoare triple {7419#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {7408#false} is VALID [2022-04-28 10:04:44,575 INFO L290 TraceCheckUtils]: 15: Hoare triple {7408#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {7408#false} is VALID [2022-04-28 10:04:44,575 INFO L290 TraceCheckUtils]: 16: Hoare triple {7408#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {7408#false} is VALID [2022-04-28 10:04:44,575 INFO L290 TraceCheckUtils]: 17: Hoare triple {7408#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {7408#false} is VALID [2022-04-28 10:04:44,575 INFO L290 TraceCheckUtils]: 18: Hoare triple {7408#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {7408#false} is VALID [2022-04-28 10:04:44,575 INFO L290 TraceCheckUtils]: 19: Hoare triple {7408#false} assume !(~y~0 % 4294967296 > 0); {7408#false} is VALID [2022-04-28 10:04:44,576 INFO L272 TraceCheckUtils]: 20: Hoare triple {7408#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {7408#false} is VALID [2022-04-28 10:04:44,576 INFO L290 TraceCheckUtils]: 21: Hoare triple {7408#false} ~cond := #in~cond; {7408#false} is VALID [2022-04-28 10:04:44,576 INFO L290 TraceCheckUtils]: 22: Hoare triple {7408#false} assume 0 == ~cond; {7408#false} is VALID [2022-04-28 10:04:44,576 INFO L290 TraceCheckUtils]: 23: Hoare triple {7408#false} assume !false; {7408#false} is VALID [2022-04-28 10:04:44,576 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 10:04:44,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:04:44,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538640613] [2022-04-28 10:04:44,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538640613] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:04:44,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1695546062] [2022-04-28 10:04:44,576 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:04:44,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:04:44,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:04:44,577 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:04:44,578 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-04-28 10:04:44,617 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-28 10:04:44,617 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:04:44,617 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-28 10:04:44,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:44,625 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:04:44,751 INFO L272 TraceCheckUtils]: 0: Hoare triple {7407#true} call ULTIMATE.init(); {7407#true} is VALID [2022-04-28 10:04:44,751 INFO L290 TraceCheckUtils]: 1: Hoare triple {7407#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(10, 2);call #Ultimate.allocInit(12, 3); {7407#true} is VALID [2022-04-28 10:04:44,752 INFO L290 TraceCheckUtils]: 2: Hoare triple {7407#true} assume true; {7407#true} is VALID [2022-04-28 10:04:44,752 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7407#true} {7407#true} #61#return; {7407#true} is VALID [2022-04-28 10:04:44,752 INFO L272 TraceCheckUtils]: 4: Hoare triple {7407#true} call #t~ret11 := main(); {7407#true} is VALID [2022-04-28 10:04:44,752 INFO L290 TraceCheckUtils]: 5: Hoare triple {7407#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {7412#(= main_~y~0 0)} is VALID [2022-04-28 10:04:44,752 INFO L290 TraceCheckUtils]: 6: Hoare triple {7412#(= 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; {7413#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:04:44,753 INFO L290 TraceCheckUtils]: 7: Hoare triple {7413#(and (<= 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; {7414#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:04:44,753 INFO L290 TraceCheckUtils]: 8: Hoare triple {7414#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {7415#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:04:44,754 INFO L290 TraceCheckUtils]: 9: Hoare triple {7415#(and (<= main_~y~0 3) (<= 3 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; {7416#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:04:44,754 INFO L290 TraceCheckUtils]: 10: Hoare triple {7416#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {7416#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:04:44,754 INFO L290 TraceCheckUtils]: 11: Hoare triple {7416#(and (<= main_~y~0 4) (<= 4 main_~y~0))} ~z~0 := ~y~0; {7457#(and (= main_~z~0 main_~y~0) (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:04:44,755 INFO L290 TraceCheckUtils]: 12: Hoare triple {7457#(and (= main_~z~0 main_~y~0) (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7461#(and (<= main_~y~0 4) (<= 4 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-28 10:04:44,755 INFO L290 TraceCheckUtils]: 13: Hoare triple {7461#(and (<= main_~y~0 4) (<= 4 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7465#(and (<= main_~y~0 4) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)) (<= 4 main_~y~0))} is VALID [2022-04-28 10:04:44,756 INFO L290 TraceCheckUtils]: 14: Hoare triple {7465#(and (<= main_~y~0 4) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)) (<= 4 main_~y~0))} assume !(~z~0 % 4294967296 > 0); {7408#false} is VALID [2022-04-28 10:04:44,756 INFO L290 TraceCheckUtils]: 15: Hoare triple {7408#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {7408#false} is VALID [2022-04-28 10:04:44,756 INFO L290 TraceCheckUtils]: 16: Hoare triple {7408#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {7408#false} is VALID [2022-04-28 10:04:44,756 INFO L290 TraceCheckUtils]: 17: Hoare triple {7408#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {7408#false} is VALID [2022-04-28 10:04:44,756 INFO L290 TraceCheckUtils]: 18: Hoare triple {7408#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {7408#false} is VALID [2022-04-28 10:04:44,756 INFO L290 TraceCheckUtils]: 19: Hoare triple {7408#false} assume !(~y~0 % 4294967296 > 0); {7408#false} is VALID [2022-04-28 10:04:44,756 INFO L272 TraceCheckUtils]: 20: Hoare triple {7408#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {7408#false} is VALID [2022-04-28 10:04:44,756 INFO L290 TraceCheckUtils]: 21: Hoare triple {7408#false} ~cond := #in~cond; {7408#false} is VALID [2022-04-28 10:04:44,756 INFO L290 TraceCheckUtils]: 22: Hoare triple {7408#false} assume 0 == ~cond; {7408#false} is VALID [2022-04-28 10:04:44,756 INFO L290 TraceCheckUtils]: 23: Hoare triple {7408#false} assume !false; {7408#false} is VALID [2022-04-28 10:04:44,757 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 10:04:44,757 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:04:44,917 INFO L290 TraceCheckUtils]: 23: Hoare triple {7408#false} assume !false; {7408#false} is VALID [2022-04-28 10:04:44,917 INFO L290 TraceCheckUtils]: 22: Hoare triple {7408#false} assume 0 == ~cond; {7408#false} is VALID [2022-04-28 10:04:44,917 INFO L290 TraceCheckUtils]: 21: Hoare triple {7408#false} ~cond := #in~cond; {7408#false} is VALID [2022-04-28 10:04:44,917 INFO L272 TraceCheckUtils]: 20: Hoare triple {7408#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {7408#false} is VALID [2022-04-28 10:04:44,917 INFO L290 TraceCheckUtils]: 19: Hoare triple {7408#false} assume !(~y~0 % 4294967296 > 0); {7408#false} is VALID [2022-04-28 10:04:44,917 INFO L290 TraceCheckUtils]: 18: Hoare triple {7408#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {7408#false} is VALID [2022-04-28 10:04:44,917 INFO L290 TraceCheckUtils]: 17: Hoare triple {7514#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {7408#false} is VALID [2022-04-28 10:04:44,918 INFO L290 TraceCheckUtils]: 16: Hoare triple {7518#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {7514#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:04:44,919 INFO L290 TraceCheckUtils]: 15: Hoare triple {7522#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {7518#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:04:44,919 INFO L290 TraceCheckUtils]: 14: Hoare triple {7526#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {7522#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-28 10:04:44,920 INFO L290 TraceCheckUtils]: 13: Hoare triple {7530#(or (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7526#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))))} is VALID [2022-04-28 10:04:44,921 INFO L290 TraceCheckUtils]: 12: Hoare triple {7534#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7530#(or (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:04:44,921 INFO L290 TraceCheckUtils]: 11: Hoare triple {7407#true} ~z~0 := ~y~0; {7534#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))))} is VALID [2022-04-28 10:04:44,922 INFO L290 TraceCheckUtils]: 10: Hoare triple {7407#true} assume !(~x~0 % 4294967296 > 0); {7407#true} is VALID [2022-04-28 10:04:44,922 INFO L290 TraceCheckUtils]: 9: Hoare triple {7407#true} 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; {7407#true} is VALID [2022-04-28 10:04:44,922 INFO L290 TraceCheckUtils]: 8: Hoare triple {7407#true} 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; {7407#true} is VALID [2022-04-28 10:04:44,922 INFO L290 TraceCheckUtils]: 7: Hoare triple {7407#true} 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; {7407#true} is VALID [2022-04-28 10:04:44,922 INFO L290 TraceCheckUtils]: 6: Hoare triple {7407#true} 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; {7407#true} is VALID [2022-04-28 10:04:44,922 INFO L290 TraceCheckUtils]: 5: Hoare triple {7407#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {7407#true} is VALID [2022-04-28 10:04:44,922 INFO L272 TraceCheckUtils]: 4: Hoare triple {7407#true} call #t~ret11 := main(); {7407#true} is VALID [2022-04-28 10:04:44,922 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7407#true} {7407#true} #61#return; {7407#true} is VALID [2022-04-28 10:04:44,922 INFO L290 TraceCheckUtils]: 2: Hoare triple {7407#true} assume true; {7407#true} is VALID [2022-04-28 10:04:44,922 INFO L290 TraceCheckUtils]: 1: Hoare triple {7407#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(10, 2);call #Ultimate.allocInit(12, 3); {7407#true} is VALID [2022-04-28 10:04:44,922 INFO L272 TraceCheckUtils]: 0: Hoare triple {7407#true} call ULTIMATE.init(); {7407#true} is VALID [2022-04-28 10:04:44,922 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-28 10:04:44,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1695546062] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:04:44,922 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:04:44,923 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 8] total 20 [2022-04-28 10:04:44,923 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:04:44,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [346682757] [2022-04-28 10:04:44,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [346682757] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:04:44,923 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:04:44,923 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 10:04:44,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889584108] [2022-04-28 10:04:44,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:04:44,923 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 10 states have internal predecessors, (17), 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 24 [2022-04-28 10:04:44,923 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:04:44,923 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 10 states have internal predecessors, (17), 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-28 10:04:44,936 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:04:44,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 10:04:44,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:04:44,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 10:04:44,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2022-04-28 10:04:44,937 INFO L87 Difference]: Start difference. First operand 54 states and 68 transitions. Second operand has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 10 states have internal predecessors, (17), 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-28 10:04:45,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:45,388 INFO L93 Difference]: Finished difference Result 71 states and 85 transitions. [2022-04-28 10:04:45,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 10:04:45,388 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 10 states have internal predecessors, (17), 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 24 [2022-04-28 10:04:45,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:04:45,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 10 states have internal predecessors, (17), 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-28 10:04:45,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 42 transitions. [2022-04-28 10:04:45,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 10 states have internal predecessors, (17), 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-28 10:04:45,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 42 transitions. [2022-04-28 10:04:45,390 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 42 transitions. [2022-04-28 10:04:45,421 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:04:45,421 INFO L225 Difference]: With dead ends: 71 [2022-04-28 10:04:45,422 INFO L226 Difference]: Without dead ends: 61 [2022-04-28 10:04:45,422 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=130, Invalid=626, Unknown=0, NotChecked=0, Total=756 [2022-04-28 10:04:45,422 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 17 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:04:45,422 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 53 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 10:04:45,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-04-28 10:04:45,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 55. [2022-04-28 10:04:45,469 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:04:45,469 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand has 55 states, 50 states have (on average 1.3) internal successors, (65), 50 states have internal predecessors, (65), 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-28 10:04:45,469 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand has 55 states, 50 states have (on average 1.3) internal successors, (65), 50 states have internal predecessors, (65), 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-28 10:04:45,469 INFO L87 Difference]: Start difference. First operand 61 states. Second operand has 55 states, 50 states have (on average 1.3) internal successors, (65), 50 states have internal predecessors, (65), 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-28 10:04:45,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:45,470 INFO L93 Difference]: Finished difference Result 61 states and 75 transitions. [2022-04-28 10:04:45,470 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 75 transitions. [2022-04-28 10:04:45,470 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:04:45,470 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:04:45,470 INFO L74 IsIncluded]: Start isIncluded. First operand has 55 states, 50 states have (on average 1.3) internal successors, (65), 50 states have internal predecessors, (65), 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 61 states. [2022-04-28 10:04:45,470 INFO L87 Difference]: Start difference. First operand has 55 states, 50 states have (on average 1.3) internal successors, (65), 50 states have internal predecessors, (65), 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 61 states. [2022-04-28 10:04:45,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:45,471 INFO L93 Difference]: Finished difference Result 61 states and 75 transitions. [2022-04-28 10:04:45,471 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 75 transitions. [2022-04-28 10:04:45,471 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:04:45,471 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:04:45,471 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:04:45,471 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:04:45,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 50 states have (on average 1.3) internal successors, (65), 50 states have internal predecessors, (65), 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-28 10:04:45,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 69 transitions. [2022-04-28 10:04:45,472 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 69 transitions. Word has length 24 [2022-04-28 10:04:45,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:04:45,472 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 69 transitions. [2022-04-28 10:04:45,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 10 states have internal predecessors, (17), 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-28 10:04:45,472 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 55 states and 69 transitions. [2022-04-28 10:04:45,602 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:04:45,602 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 69 transitions. [2022-04-28 10:04:45,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-28 10:04:45,603 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:04:45,603 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:04:45,619 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-04-28 10:04:45,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:04:45,807 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:04:45,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:04:45,808 INFO L85 PathProgramCache]: Analyzing trace with hash -101060115, now seen corresponding path program 19 times [2022-04-28 10:04:45,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:04:45,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1931160870] [2022-04-28 10:04:45,810 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:04:45,810 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:04:45,810 INFO L85 PathProgramCache]: Analyzing trace with hash -101060115, now seen corresponding path program 20 times [2022-04-28 10:04:45,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:04:45,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200404688] [2022-04-28 10:04:45,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:04:45,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:04:45,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:45,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:04:45,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:45,989 INFO L290 TraceCheckUtils]: 0: Hoare triple {7980#(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(10, 2);call #Ultimate.allocInit(12, 3); {7963#true} is VALID [2022-04-28 10:04:45,989 INFO L290 TraceCheckUtils]: 1: Hoare triple {7963#true} assume true; {7963#true} is VALID [2022-04-28 10:04:45,989 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7963#true} {7963#true} #61#return; {7963#true} is VALID [2022-04-28 10:04:45,990 INFO L272 TraceCheckUtils]: 0: Hoare triple {7963#true} call ULTIMATE.init(); {7980#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:04:45,990 INFO L290 TraceCheckUtils]: 1: Hoare triple {7980#(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(10, 2);call #Ultimate.allocInit(12, 3); {7963#true} is VALID [2022-04-28 10:04:45,990 INFO L290 TraceCheckUtils]: 2: Hoare triple {7963#true} assume true; {7963#true} is VALID [2022-04-28 10:04:45,990 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7963#true} {7963#true} #61#return; {7963#true} is VALID [2022-04-28 10:04:45,990 INFO L272 TraceCheckUtils]: 4: Hoare triple {7963#true} call #t~ret11 := main(); {7963#true} is VALID [2022-04-28 10:04:45,990 INFO L290 TraceCheckUtils]: 5: Hoare triple {7963#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {7968#(= main_~y~0 0)} is VALID [2022-04-28 10:04:45,991 INFO L290 TraceCheckUtils]: 6: Hoare triple {7968#(= 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; {7969#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:04:45,992 INFO L290 TraceCheckUtils]: 7: Hoare triple {7969#(and (<= 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; {7970#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:04:45,992 INFO L290 TraceCheckUtils]: 8: Hoare triple {7970#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {7971#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:04:45,993 INFO L290 TraceCheckUtils]: 9: Hoare triple {7971#(and (<= main_~y~0 3) (<= 3 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; {7972#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:04:45,993 INFO L290 TraceCheckUtils]: 10: Hoare triple {7972#(and (<= main_~y~0 4) (<= 4 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; {7973#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:04:45,994 INFO L290 TraceCheckUtils]: 11: Hoare triple {7973#(and (<= 5 main_~y~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; {7974#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:04:45,995 INFO L290 TraceCheckUtils]: 12: Hoare triple {7974#(and (<= main_~y~0 6) (<= 6 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; {7975#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:04:45,995 INFO L290 TraceCheckUtils]: 13: Hoare triple {7975#(and (<= 7 main_~y~0) (<= main_~y~0 7))} 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; {7976#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:04:45,996 INFO L290 TraceCheckUtils]: 14: Hoare triple {7976#(and (<= main_~y~0 8) (<= 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; {7977#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:04:45,996 INFO L290 TraceCheckUtils]: 15: Hoare triple {7977#(and (<= 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; {7978#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:04:45,997 INFO L290 TraceCheckUtils]: 16: Hoare triple {7978#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {7978#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:04:45,997 INFO L290 TraceCheckUtils]: 17: Hoare triple {7978#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {7979#(and (<= 10 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:04:45,998 INFO L290 TraceCheckUtils]: 18: Hoare triple {7979#(and (<= 10 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {7964#false} is VALID [2022-04-28 10:04:45,998 INFO L290 TraceCheckUtils]: 19: Hoare triple {7964#false} assume !(~y~0 % 4294967296 > 0); {7964#false} is VALID [2022-04-28 10:04:45,998 INFO L272 TraceCheckUtils]: 20: Hoare triple {7964#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {7964#false} is VALID [2022-04-28 10:04:45,998 INFO L290 TraceCheckUtils]: 21: Hoare triple {7964#false} ~cond := #in~cond; {7964#false} is VALID [2022-04-28 10:04:45,998 INFO L290 TraceCheckUtils]: 22: Hoare triple {7964#false} assume 0 == ~cond; {7964#false} is VALID [2022-04-28 10:04:45,998 INFO L290 TraceCheckUtils]: 23: Hoare triple {7964#false} assume !false; {7964#false} is VALID [2022-04-28 10:04:45,998 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-28 10:04:45,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:04:45,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200404688] [2022-04-28 10:04:45,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200404688] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:04:45,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2097416775] [2022-04-28 10:04:45,998 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:04:45,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:04:45,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:04:45,999 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:04:46,011 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-04-28 10:04:46,034 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:04:46,034 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:04:46,035 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-28 10:04:46,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:46,041 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:04:46,238 INFO L272 TraceCheckUtils]: 0: Hoare triple {7963#true} call ULTIMATE.init(); {7963#true} is VALID [2022-04-28 10:04:46,238 INFO L290 TraceCheckUtils]: 1: Hoare triple {7963#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(10, 2);call #Ultimate.allocInit(12, 3); {7963#true} is VALID [2022-04-28 10:04:46,238 INFO L290 TraceCheckUtils]: 2: Hoare triple {7963#true} assume true; {7963#true} is VALID [2022-04-28 10:04:46,238 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7963#true} {7963#true} #61#return; {7963#true} is VALID [2022-04-28 10:04:46,239 INFO L272 TraceCheckUtils]: 4: Hoare triple {7963#true} call #t~ret11 := main(); {7963#true} is VALID [2022-04-28 10:04:46,239 INFO L290 TraceCheckUtils]: 5: Hoare triple {7963#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {7968#(= main_~y~0 0)} is VALID [2022-04-28 10:04:46,239 INFO L290 TraceCheckUtils]: 6: Hoare triple {7968#(= 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; {7969#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:04:46,240 INFO L290 TraceCheckUtils]: 7: Hoare triple {7969#(and (<= 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; {7970#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:04:46,240 INFO L290 TraceCheckUtils]: 8: Hoare triple {7970#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {7971#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:04:46,241 INFO L290 TraceCheckUtils]: 9: Hoare triple {7971#(and (<= main_~y~0 3) (<= 3 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; {7972#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:04:46,241 INFO L290 TraceCheckUtils]: 10: Hoare triple {7972#(and (<= main_~y~0 4) (<= 4 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; {7973#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:04:46,242 INFO L290 TraceCheckUtils]: 11: Hoare triple {7973#(and (<= 5 main_~y~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; {7974#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:04:46,242 INFO L290 TraceCheckUtils]: 12: Hoare triple {7974#(and (<= main_~y~0 6) (<= 6 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; {7975#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:04:46,243 INFO L290 TraceCheckUtils]: 13: Hoare triple {7975#(and (<= 7 main_~y~0) (<= main_~y~0 7))} 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; {7976#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:04:46,243 INFO L290 TraceCheckUtils]: 14: Hoare triple {7976#(and (<= main_~y~0 8) (<= 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; {7977#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:04:46,244 INFO L290 TraceCheckUtils]: 15: Hoare triple {7977#(and (<= 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; {7978#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:04:46,244 INFO L290 TraceCheckUtils]: 16: Hoare triple {7978#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {7978#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:04:46,244 INFO L290 TraceCheckUtils]: 17: Hoare triple {7978#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {8035#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:04:46,245 INFO L290 TraceCheckUtils]: 18: Hoare triple {8035#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {7964#false} is VALID [2022-04-28 10:04:46,245 INFO L290 TraceCheckUtils]: 19: Hoare triple {7964#false} assume !(~y~0 % 4294967296 > 0); {7964#false} is VALID [2022-04-28 10:04:46,245 INFO L272 TraceCheckUtils]: 20: Hoare triple {7964#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {7964#false} is VALID [2022-04-28 10:04:46,245 INFO L290 TraceCheckUtils]: 21: Hoare triple {7964#false} ~cond := #in~cond; {7964#false} is VALID [2022-04-28 10:04:46,245 INFO L290 TraceCheckUtils]: 22: Hoare triple {7964#false} assume 0 == ~cond; {7964#false} is VALID [2022-04-28 10:04:46,245 INFO L290 TraceCheckUtils]: 23: Hoare triple {7964#false} assume !false; {7964#false} is VALID [2022-04-28 10:04:46,245 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-28 10:04:46,245 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:04:46,526 INFO L290 TraceCheckUtils]: 23: Hoare triple {7964#false} assume !false; {7964#false} is VALID [2022-04-28 10:04:46,527 INFO L290 TraceCheckUtils]: 22: Hoare triple {7964#false} assume 0 == ~cond; {7964#false} is VALID [2022-04-28 10:04:46,527 INFO L290 TraceCheckUtils]: 21: Hoare triple {7964#false} ~cond := #in~cond; {7964#false} is VALID [2022-04-28 10:04:46,527 INFO L272 TraceCheckUtils]: 20: Hoare triple {7964#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {7964#false} is VALID [2022-04-28 10:04:46,527 INFO L290 TraceCheckUtils]: 19: Hoare triple {7964#false} assume !(~y~0 % 4294967296 > 0); {7964#false} is VALID [2022-04-28 10:04:46,527 INFO L290 TraceCheckUtils]: 18: Hoare triple {8069#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {7964#false} is VALID [2022-04-28 10:04:46,527 INFO L290 TraceCheckUtils]: 17: Hoare triple {8073#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {8069#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:04:46,528 INFO L290 TraceCheckUtils]: 16: Hoare triple {8073#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {8073#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:04:46,528 INFO L290 TraceCheckUtils]: 15: Hoare triple {8080#(< 0 (mod (+ main_~y~0 1) 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; {8073#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:04:46,529 INFO L290 TraceCheckUtils]: 14: Hoare triple {8084#(< 0 (mod (+ main_~y~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; {8080#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:04:46,530 INFO L290 TraceCheckUtils]: 13: Hoare triple {8088#(< 0 (mod (+ main_~y~0 3) 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; {8084#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:04:46,531 INFO L290 TraceCheckUtils]: 12: Hoare triple {8092#(< 0 (mod (+ main_~y~0 4) 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; {8088#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:04:46,531 INFO L290 TraceCheckUtils]: 11: Hoare triple {8096#(< 0 (mod (+ 5 main_~y~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; {8092#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:04:46,532 INFO L290 TraceCheckUtils]: 10: Hoare triple {8100#(< 0 (mod (+ main_~y~0 6) 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; {8096#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:04:46,533 INFO L290 TraceCheckUtils]: 9: Hoare triple {8104#(< 0 (mod (+ 7 main_~y~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; {8100#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:04:46,533 INFO L290 TraceCheckUtils]: 8: Hoare triple {8108#(< 0 (mod (+ main_~y~0 8) 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; {8104#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:04:46,534 INFO L290 TraceCheckUtils]: 7: Hoare triple {8112#(< 0 (mod (+ main_~y~0 9) 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; {8108#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:04:46,535 INFO L290 TraceCheckUtils]: 6: Hoare triple {8116#(< 0 (mod (+ main_~y~0 10) 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; {8112#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:04:46,535 INFO L290 TraceCheckUtils]: 5: Hoare triple {7963#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {8116#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-28 10:04:46,535 INFO L272 TraceCheckUtils]: 4: Hoare triple {7963#true} call #t~ret11 := main(); {7963#true} is VALID [2022-04-28 10:04:46,535 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7963#true} {7963#true} #61#return; {7963#true} is VALID [2022-04-28 10:04:46,535 INFO L290 TraceCheckUtils]: 2: Hoare triple {7963#true} assume true; {7963#true} is VALID [2022-04-28 10:04:46,535 INFO L290 TraceCheckUtils]: 1: Hoare triple {7963#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(10, 2);call #Ultimate.allocInit(12, 3); {7963#true} is VALID [2022-04-28 10:04:46,535 INFO L272 TraceCheckUtils]: 0: Hoare triple {7963#true} call ULTIMATE.init(); {7963#true} is VALID [2022-04-28 10:04:46,535 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-28 10:04:46,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2097416775] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:04:46,536 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:04:46,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 28 [2022-04-28 10:04:46,536 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:04:46,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1931160870] [2022-04-28 10:04:46,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1931160870] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:04:46,536 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:04:46,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-28 10:04:46,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876462321] [2022-04-28 10:04:46,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:04:46,536 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 14 states have internal predecessors, (20), 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 24 [2022-04-28 10:04:46,537 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:04:46,537 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 14 states have internal predecessors, (20), 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-28 10:04:46,552 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-28 10:04:46,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-28 10:04:46,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:04:46,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-28 10:04:46,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=580, Unknown=0, NotChecked=0, Total=756 [2022-04-28 10:04:46,553 INFO L87 Difference]: Start difference. First operand 55 states and 69 transitions. Second operand has 15 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 14 states have internal predecessors, (20), 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-28 10:04:47,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:47,702 INFO L93 Difference]: Finished difference Result 77 states and 105 transitions. [2022-04-28 10:04:47,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-28 10:04:47,703 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 14 states have internal predecessors, (20), 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 24 [2022-04-28 10:04:47,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:04:47,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 14 states have internal predecessors, (20), 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-28 10:04:47,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 87 transitions. [2022-04-28 10:04:47,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 14 states have internal predecessors, (20), 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-28 10:04:47,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 87 transitions. [2022-04-28 10:04:47,704 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 87 transitions. [2022-04-28 10:04:47,772 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:04:47,773 INFO L225 Difference]: With dead ends: 77 [2022-04-28 10:04:47,773 INFO L226 Difference]: Without dead ends: 71 [2022-04-28 10:04:47,773 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=358, Invalid=1202, Unknown=0, NotChecked=0, Total=1560 [2022-04-28 10:04:47,773 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 68 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 641 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 641 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 10:04:47,774 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 92 Invalid, 688 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 641 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 10:04:47,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-04-28 10:04:47,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 60. [2022-04-28 10:04:47,822 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:04:47,822 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand has 60 states, 55 states have (on average 1.309090909090909) internal successors, (72), 55 states have internal predecessors, (72), 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-28 10:04:47,822 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand has 60 states, 55 states have (on average 1.309090909090909) internal successors, (72), 55 states have internal predecessors, (72), 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-28 10:04:47,822 INFO L87 Difference]: Start difference. First operand 71 states. Second operand has 60 states, 55 states have (on average 1.309090909090909) internal successors, (72), 55 states have internal predecessors, (72), 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-28 10:04:47,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:47,823 INFO L93 Difference]: Finished difference Result 71 states and 87 transitions. [2022-04-28 10:04:47,823 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 87 transitions. [2022-04-28 10:04:47,823 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:04:47,823 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:04:47,824 INFO L74 IsIncluded]: Start isIncluded. First operand has 60 states, 55 states have (on average 1.309090909090909) internal successors, (72), 55 states have internal predecessors, (72), 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 71 states. [2022-04-28 10:04:47,824 INFO L87 Difference]: Start difference. First operand has 60 states, 55 states have (on average 1.309090909090909) internal successors, (72), 55 states have internal predecessors, (72), 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 71 states. [2022-04-28 10:04:47,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:47,824 INFO L93 Difference]: Finished difference Result 71 states and 87 transitions. [2022-04-28 10:04:47,824 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 87 transitions. [2022-04-28 10:04:47,825 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:04:47,825 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:04:47,825 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:04:47,825 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:04:47,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 55 states have (on average 1.309090909090909) internal successors, (72), 55 states have internal predecessors, (72), 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-28 10:04:47,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 76 transitions. [2022-04-28 10:04:47,825 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 76 transitions. Word has length 24 [2022-04-28 10:04:47,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:04:47,826 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 76 transitions. [2022-04-28 10:04:47,826 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 14 states have internal predecessors, (20), 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-28 10:04:47,826 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 60 states and 76 transitions. [2022-04-28 10:04:49,920 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 75 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 10:04:49,921 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 76 transitions. [2022-04-28 10:04:49,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-28 10:04:49,921 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:04:49,921 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:04:49,937 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-04-28 10:04:50,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:04:50,121 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:04:50,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:04:50,122 INFO L85 PathProgramCache]: Analyzing trace with hash -2034209681, now seen corresponding path program 19 times [2022-04-28 10:04:50,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:04:50,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1878363196] [2022-04-28 10:04:50,124 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:04:50,124 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:04:50,124 INFO L85 PathProgramCache]: Analyzing trace with hash -2034209681, now seen corresponding path program 20 times [2022-04-28 10:04:50,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:04:50,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483883458] [2022-04-28 10:04:50,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:04:50,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:04:50,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:50,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:04:50,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:50,265 INFO L290 TraceCheckUtils]: 0: Hoare triple {8591#(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(10, 2);call #Ultimate.allocInit(12, 3); {8577#true} is VALID [2022-04-28 10:04:50,265 INFO L290 TraceCheckUtils]: 1: Hoare triple {8577#true} assume true; {8577#true} is VALID [2022-04-28 10:04:50,265 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8577#true} {8577#true} #61#return; {8577#true} is VALID [2022-04-28 10:04:50,266 INFO L272 TraceCheckUtils]: 0: Hoare triple {8577#true} call ULTIMATE.init(); {8591#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:04:50,266 INFO L290 TraceCheckUtils]: 1: Hoare triple {8591#(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(10, 2);call #Ultimate.allocInit(12, 3); {8577#true} is VALID [2022-04-28 10:04:50,266 INFO L290 TraceCheckUtils]: 2: Hoare triple {8577#true} assume true; {8577#true} is VALID [2022-04-28 10:04:50,266 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8577#true} {8577#true} #61#return; {8577#true} is VALID [2022-04-28 10:04:50,266 INFO L272 TraceCheckUtils]: 4: Hoare triple {8577#true} call #t~ret11 := main(); {8577#true} is VALID [2022-04-28 10:04:50,266 INFO L290 TraceCheckUtils]: 5: Hoare triple {8577#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {8582#(= main_~y~0 0)} is VALID [2022-04-28 10:04:50,267 INFO L290 TraceCheckUtils]: 6: Hoare triple {8582#(= 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; {8583#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:04:50,267 INFO L290 TraceCheckUtils]: 7: Hoare triple {8583#(and (<= 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; {8584#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:04:50,268 INFO L290 TraceCheckUtils]: 8: Hoare triple {8584#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {8585#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:04:50,268 INFO L290 TraceCheckUtils]: 9: Hoare triple {8585#(and (<= main_~y~0 3) (<= 3 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; {8586#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:04:50,269 INFO L290 TraceCheckUtils]: 10: Hoare triple {8586#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {8586#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:04:50,269 INFO L290 TraceCheckUtils]: 11: Hoare triple {8586#(and (<= main_~y~0 4) (<= 4 main_~y~0))} ~z~0 := ~y~0; {8587#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:04:50,270 INFO L290 TraceCheckUtils]: 12: Hoare triple {8587#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8588#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:04:50,270 INFO L290 TraceCheckUtils]: 13: Hoare triple {8588#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8589#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-28 10:04:50,271 INFO L290 TraceCheckUtils]: 14: Hoare triple {8589#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8590#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-28 10:04:50,271 INFO L290 TraceCheckUtils]: 15: Hoare triple {8590#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {8578#false} is VALID [2022-04-28 10:04:50,271 INFO L290 TraceCheckUtils]: 16: Hoare triple {8578#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {8578#false} is VALID [2022-04-28 10:04:50,271 INFO L290 TraceCheckUtils]: 17: Hoare triple {8578#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {8578#false} is VALID [2022-04-28 10:04:50,271 INFO L290 TraceCheckUtils]: 18: Hoare triple {8578#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {8578#false} is VALID [2022-04-28 10:04:50,271 INFO L290 TraceCheckUtils]: 19: Hoare triple {8578#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {8578#false} is VALID [2022-04-28 10:04:50,271 INFO L290 TraceCheckUtils]: 20: Hoare triple {8578#false} assume !(~y~0 % 4294967296 > 0); {8578#false} is VALID [2022-04-28 10:04:50,272 INFO L272 TraceCheckUtils]: 21: Hoare triple {8578#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {8578#false} is VALID [2022-04-28 10:04:50,272 INFO L290 TraceCheckUtils]: 22: Hoare triple {8578#false} ~cond := #in~cond; {8578#false} is VALID [2022-04-28 10:04:50,272 INFO L290 TraceCheckUtils]: 23: Hoare triple {8578#false} assume 0 == ~cond; {8578#false} is VALID [2022-04-28 10:04:50,272 INFO L290 TraceCheckUtils]: 24: Hoare triple {8578#false} assume !false; {8578#false} is VALID [2022-04-28 10:04:50,272 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 10:04:50,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:04:50,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483883458] [2022-04-28 10:04:50,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483883458] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:04:50,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [943600321] [2022-04-28 10:04:50,272 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:04:50,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:04:50,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:04:50,273 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:04:50,274 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-04-28 10:04:50,304 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:04:50,304 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:04:50,305 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-28 10:04:50,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:50,310 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:04:50,482 INFO L272 TraceCheckUtils]: 0: Hoare triple {8577#true} call ULTIMATE.init(); {8577#true} is VALID [2022-04-28 10:04:50,483 INFO L290 TraceCheckUtils]: 1: Hoare triple {8577#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(10, 2);call #Ultimate.allocInit(12, 3); {8577#true} is VALID [2022-04-28 10:04:50,483 INFO L290 TraceCheckUtils]: 2: Hoare triple {8577#true} assume true; {8577#true} is VALID [2022-04-28 10:04:50,483 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8577#true} {8577#true} #61#return; {8577#true} is VALID [2022-04-28 10:04:50,483 INFO L272 TraceCheckUtils]: 4: Hoare triple {8577#true} call #t~ret11 := main(); {8577#true} is VALID [2022-04-28 10:04:50,483 INFO L290 TraceCheckUtils]: 5: Hoare triple {8577#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {8582#(= main_~y~0 0)} is VALID [2022-04-28 10:04:50,483 INFO L290 TraceCheckUtils]: 6: Hoare triple {8582#(= 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; {8583#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:04:50,484 INFO L290 TraceCheckUtils]: 7: Hoare triple {8583#(and (<= 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; {8584#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:04:50,484 INFO L290 TraceCheckUtils]: 8: Hoare triple {8584#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {8585#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:04:50,485 INFO L290 TraceCheckUtils]: 9: Hoare triple {8585#(and (<= main_~y~0 3) (<= 3 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; {8586#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:04:50,485 INFO L290 TraceCheckUtils]: 10: Hoare triple {8586#(and (<= main_~y~0 4) (<= 4 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {8586#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:04:50,485 INFO L290 TraceCheckUtils]: 11: Hoare triple {8586#(and (<= main_~y~0 4) (<= 4 main_~y~0))} ~z~0 := ~y~0; {8628#(and (= main_~z~0 main_~y~0) (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:04:50,486 INFO L290 TraceCheckUtils]: 12: Hoare triple {8628#(and (= main_~z~0 main_~y~0) (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8632#(and (<= main_~y~0 4) (<= 4 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-28 10:04:50,486 INFO L290 TraceCheckUtils]: 13: Hoare triple {8632#(and (<= main_~y~0 4) (<= 4 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8636#(and (= main_~y~0 (+ main_~z~0 2)) (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:04:50,487 INFO L290 TraceCheckUtils]: 14: Hoare triple {8636#(and (= main_~y~0 (+ main_~z~0 2)) (<= main_~y~0 4) (<= 4 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8640#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:04:50,487 INFO L290 TraceCheckUtils]: 15: Hoare triple {8640#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= main_~y~0 4) (<= 4 main_~y~0))} assume !(~z~0 % 4294967296 > 0); {8578#false} is VALID [2022-04-28 10:04:50,488 INFO L290 TraceCheckUtils]: 16: Hoare triple {8578#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {8578#false} is VALID [2022-04-28 10:04:50,488 INFO L290 TraceCheckUtils]: 17: Hoare triple {8578#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {8578#false} is VALID [2022-04-28 10:04:50,488 INFO L290 TraceCheckUtils]: 18: Hoare triple {8578#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {8578#false} is VALID [2022-04-28 10:04:50,488 INFO L290 TraceCheckUtils]: 19: Hoare triple {8578#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {8578#false} is VALID [2022-04-28 10:04:50,488 INFO L290 TraceCheckUtils]: 20: Hoare triple {8578#false} assume !(~y~0 % 4294967296 > 0); {8578#false} is VALID [2022-04-28 10:04:50,488 INFO L272 TraceCheckUtils]: 21: Hoare triple {8578#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {8578#false} is VALID [2022-04-28 10:04:50,488 INFO L290 TraceCheckUtils]: 22: Hoare triple {8578#false} ~cond := #in~cond; {8578#false} is VALID [2022-04-28 10:04:50,488 INFO L290 TraceCheckUtils]: 23: Hoare triple {8578#false} assume 0 == ~cond; {8578#false} is VALID [2022-04-28 10:04:50,488 INFO L290 TraceCheckUtils]: 24: Hoare triple {8578#false} assume !false; {8578#false} is VALID [2022-04-28 10:04:50,488 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 10:04:50,488 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:04:50,691 INFO L290 TraceCheckUtils]: 24: Hoare triple {8578#false} assume !false; {8578#false} is VALID [2022-04-28 10:04:50,691 INFO L290 TraceCheckUtils]: 23: Hoare triple {8578#false} assume 0 == ~cond; {8578#false} is VALID [2022-04-28 10:04:50,691 INFO L290 TraceCheckUtils]: 22: Hoare triple {8578#false} ~cond := #in~cond; {8578#false} is VALID [2022-04-28 10:04:50,691 INFO L272 TraceCheckUtils]: 21: Hoare triple {8578#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {8578#false} is VALID [2022-04-28 10:04:50,691 INFO L290 TraceCheckUtils]: 20: Hoare triple {8578#false} assume !(~y~0 % 4294967296 > 0); {8578#false} is VALID [2022-04-28 10:04:50,691 INFO L290 TraceCheckUtils]: 19: Hoare triple {8686#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {8578#false} is VALID [2022-04-28 10:04:50,692 INFO L290 TraceCheckUtils]: 18: Hoare triple {8690#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {8686#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:04:50,693 INFO L290 TraceCheckUtils]: 17: Hoare triple {8694#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {8690#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:04:50,694 INFO L290 TraceCheckUtils]: 16: Hoare triple {8698#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {8694#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-28 10:04:50,694 INFO L290 TraceCheckUtils]: 15: Hoare triple {8702#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {8698#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-28 10:04:50,695 INFO L290 TraceCheckUtils]: 14: Hoare triple {8706#(or (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8702#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))))} is VALID [2022-04-28 10:04:50,696 INFO L290 TraceCheckUtils]: 13: Hoare triple {8710#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8706#(or (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:04:50,696 INFO L290 TraceCheckUtils]: 12: Hoare triple {8714#(or (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8710#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))))} is VALID [2022-04-28 10:04:50,697 INFO L290 TraceCheckUtils]: 11: Hoare triple {8577#true} ~z~0 := ~y~0; {8714#(or (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} is VALID [2022-04-28 10:04:50,697 INFO L290 TraceCheckUtils]: 10: Hoare triple {8577#true} assume !(~x~0 % 4294967296 > 0); {8577#true} is VALID [2022-04-28 10:04:50,697 INFO L290 TraceCheckUtils]: 9: Hoare triple {8577#true} 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; {8577#true} is VALID [2022-04-28 10:04:50,697 INFO L290 TraceCheckUtils]: 8: Hoare triple {8577#true} 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; {8577#true} is VALID [2022-04-28 10:04:50,697 INFO L290 TraceCheckUtils]: 7: Hoare triple {8577#true} 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; {8577#true} is VALID [2022-04-28 10:04:50,697 INFO L290 TraceCheckUtils]: 6: Hoare triple {8577#true} 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; {8577#true} is VALID [2022-04-28 10:04:50,697 INFO L290 TraceCheckUtils]: 5: Hoare triple {8577#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {8577#true} is VALID [2022-04-28 10:04:50,697 INFO L272 TraceCheckUtils]: 4: Hoare triple {8577#true} call #t~ret11 := main(); {8577#true} is VALID [2022-04-28 10:04:50,697 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8577#true} {8577#true} #61#return; {8577#true} is VALID [2022-04-28 10:04:50,697 INFO L290 TraceCheckUtils]: 2: Hoare triple {8577#true} assume true; {8577#true} is VALID [2022-04-28 10:04:50,697 INFO L290 TraceCheckUtils]: 1: Hoare triple {8577#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(10, 2);call #Ultimate.allocInit(12, 3); {8577#true} is VALID [2022-04-28 10:04:50,697 INFO L272 TraceCheckUtils]: 0: Hoare triple {8577#true} call ULTIMATE.init(); {8577#true} is VALID [2022-04-28 10:04:50,698 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 10:04:50,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [943600321] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:04:50,698 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:04:50,698 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 10] total 24 [2022-04-28 10:04:50,698 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:04:50,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1878363196] [2022-04-28 10:04:50,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1878363196] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:04:50,698 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:04:50,698 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 10:04:50,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913777550] [2022-04-28 10:04:50,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:04:50,699 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.5) internal successors, (18), 11 states have internal predecessors, (18), 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 25 [2022-04-28 10:04:50,699 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:04:50,699 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 1.5) internal successors, (18), 11 states have internal predecessors, (18), 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-28 10:04:50,712 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:04:50,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 10:04:50,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:04:50,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 10:04:50,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=457, Unknown=0, NotChecked=0, Total=552 [2022-04-28 10:04:50,713 INFO L87 Difference]: Start difference. First operand 60 states and 76 transitions. Second operand has 12 states, 12 states have (on average 1.5) internal successors, (18), 11 states have internal predecessors, (18), 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-28 10:04:51,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:51,205 INFO L93 Difference]: Finished difference Result 77 states and 93 transitions. [2022-04-28 10:04:51,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 10:04:51,205 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.5) internal successors, (18), 11 states have internal predecessors, (18), 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 25 [2022-04-28 10:04:51,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:04:51,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.5) internal successors, (18), 11 states have internal predecessors, (18), 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-28 10:04:51,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 43 transitions. [2022-04-28 10:04:51,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.5) internal successors, (18), 11 states have internal predecessors, (18), 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-28 10:04:51,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 43 transitions. [2022-04-28 10:04:51,206 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 43 transitions. [2022-04-28 10:04:51,239 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:04:51,240 INFO L225 Difference]: With dead ends: 77 [2022-04-28 10:04:51,240 INFO L226 Difference]: Without dead ends: 67 [2022-04-28 10:04:51,240 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=167, Invalid=889, Unknown=0, NotChecked=0, Total=1056 [2022-04-28 10:04:51,241 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 17 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 10:04:51,241 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 58 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 10:04:51,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-04-28 10:04:51,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 61. [2022-04-28 10:04:51,298 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:04:51,298 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand has 61 states, 56 states have (on average 1.3035714285714286) internal successors, (73), 56 states have internal predecessors, (73), 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-28 10:04:51,298 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand has 61 states, 56 states have (on average 1.3035714285714286) internal successors, (73), 56 states have internal predecessors, (73), 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-28 10:04:51,298 INFO L87 Difference]: Start difference. First operand 67 states. Second operand has 61 states, 56 states have (on average 1.3035714285714286) internal successors, (73), 56 states have internal predecessors, (73), 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-28 10:04:51,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:51,299 INFO L93 Difference]: Finished difference Result 67 states and 83 transitions. [2022-04-28 10:04:51,299 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 83 transitions. [2022-04-28 10:04:51,299 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:04:51,299 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:04:51,299 INFO L74 IsIncluded]: Start isIncluded. First operand has 61 states, 56 states have (on average 1.3035714285714286) internal successors, (73), 56 states have internal predecessors, (73), 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 67 states. [2022-04-28 10:04:51,299 INFO L87 Difference]: Start difference. First operand has 61 states, 56 states have (on average 1.3035714285714286) internal successors, (73), 56 states have internal predecessors, (73), 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 67 states. [2022-04-28 10:04:51,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:51,300 INFO L93 Difference]: Finished difference Result 67 states and 83 transitions. [2022-04-28 10:04:51,300 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 83 transitions. [2022-04-28 10:04:51,300 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:04:51,300 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:04:51,300 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:04:51,300 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:04:51,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 56 states have (on average 1.3035714285714286) internal successors, (73), 56 states have internal predecessors, (73), 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-28 10:04:51,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 77 transitions. [2022-04-28 10:04:51,301 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 77 transitions. Word has length 25 [2022-04-28 10:04:51,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:04:51,301 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 77 transitions. [2022-04-28 10:04:51,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.5) internal successors, (18), 11 states have internal predecessors, (18), 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-28 10:04:51,301 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 61 states and 77 transitions. [2022-04-28 10:04:51,524 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:04:51,524 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 77 transitions. [2022-04-28 10:04:51,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-28 10:04:51,524 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:04:51,525 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:04:51,540 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-04-28 10:04:51,725 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-04-28 10:04:51,725 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:04:51,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:04:51,726 INFO L85 PathProgramCache]: Analyzing trace with hash -895834689, now seen corresponding path program 21 times [2022-04-28 10:04:51,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:04:51,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [437696733] [2022-04-28 10:04:51,728 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:04:51,728 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:04:51,728 INFO L85 PathProgramCache]: Analyzing trace with hash -895834689, now seen corresponding path program 22 times [2022-04-28 10:04:51,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:04:51,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765653436] [2022-04-28 10:04:51,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:04:51,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:04:51,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:51,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:04:51,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:51,837 INFO L290 TraceCheckUtils]: 0: Hoare triple {9194#(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(10, 2);call #Ultimate.allocInit(12, 3); {9181#true} is VALID [2022-04-28 10:04:51,837 INFO L290 TraceCheckUtils]: 1: Hoare triple {9181#true} assume true; {9181#true} is VALID [2022-04-28 10:04:51,837 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9181#true} {9181#true} #61#return; {9181#true} is VALID [2022-04-28 10:04:51,837 INFO L272 TraceCheckUtils]: 0: Hoare triple {9181#true} call ULTIMATE.init(); {9194#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:04:51,837 INFO L290 TraceCheckUtils]: 1: Hoare triple {9194#(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(10, 2);call #Ultimate.allocInit(12, 3); {9181#true} is VALID [2022-04-28 10:04:51,837 INFO L290 TraceCheckUtils]: 2: Hoare triple {9181#true} assume true; {9181#true} is VALID [2022-04-28 10:04:51,837 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9181#true} {9181#true} #61#return; {9181#true} is VALID [2022-04-28 10:04:51,837 INFO L272 TraceCheckUtils]: 4: Hoare triple {9181#true} call #t~ret11 := main(); {9181#true} is VALID [2022-04-28 10:04:51,838 INFO L290 TraceCheckUtils]: 5: Hoare triple {9181#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {9186#(= main_~y~0 0)} is VALID [2022-04-28 10:04:51,838 INFO L290 TraceCheckUtils]: 6: Hoare triple {9186#(= 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; {9187#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:04:51,839 INFO L290 TraceCheckUtils]: 7: Hoare triple {9187#(and (<= 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; {9188#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:04:51,839 INFO L290 TraceCheckUtils]: 8: Hoare triple {9188#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {9189#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:04:51,840 INFO L290 TraceCheckUtils]: 9: Hoare triple {9189#(and (<= main_~y~0 3) (<= 3 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; {9190#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:04:51,840 INFO L290 TraceCheckUtils]: 10: Hoare triple {9190#(and (<= main_~y~0 4) (<= 4 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; {9191#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:04:51,840 INFO L290 TraceCheckUtils]: 11: Hoare triple {9191#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {9191#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:04:51,841 INFO L290 TraceCheckUtils]: 12: Hoare triple {9191#(and (<= 5 main_~y~0) (<= main_~y~0 5))} ~z~0 := ~y~0; {9192#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:04:51,841 INFO L290 TraceCheckUtils]: 13: Hoare triple {9192#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9193#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:04:51,842 INFO L290 TraceCheckUtils]: 14: Hoare triple {9193#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {9182#false} is VALID [2022-04-28 10:04:51,842 INFO L290 TraceCheckUtils]: 15: Hoare triple {9182#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {9182#false} is VALID [2022-04-28 10:04:51,842 INFO L290 TraceCheckUtils]: 16: Hoare triple {9182#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {9182#false} is VALID [2022-04-28 10:04:51,842 INFO L290 TraceCheckUtils]: 17: Hoare triple {9182#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {9182#false} is VALID [2022-04-28 10:04:51,842 INFO L290 TraceCheckUtils]: 18: Hoare triple {9182#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {9182#false} is VALID [2022-04-28 10:04:51,842 INFO L290 TraceCheckUtils]: 19: Hoare triple {9182#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {9182#false} is VALID [2022-04-28 10:04:51,842 INFO L290 TraceCheckUtils]: 20: Hoare triple {9182#false} assume !(~y~0 % 4294967296 > 0); {9182#false} is VALID [2022-04-28 10:04:51,842 INFO L272 TraceCheckUtils]: 21: Hoare triple {9182#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {9182#false} is VALID [2022-04-28 10:04:51,842 INFO L290 TraceCheckUtils]: 22: Hoare triple {9182#false} ~cond := #in~cond; {9182#false} is VALID [2022-04-28 10:04:51,842 INFO L290 TraceCheckUtils]: 23: Hoare triple {9182#false} assume 0 == ~cond; {9182#false} is VALID [2022-04-28 10:04:51,842 INFO L290 TraceCheckUtils]: 24: Hoare triple {9182#false} assume !false; {9182#false} is VALID [2022-04-28 10:04:51,842 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-28 10:04:51,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:04:51,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765653436] [2022-04-28 10:04:51,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765653436] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:04:51,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [113436181] [2022-04-28 10:04:51,843 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:04:51,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:04:51,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:04:51,844 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:04:51,844 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-04-28 10:04:51,873 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:04:51,873 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:04:51,874 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-28 10:04:51,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:51,879 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:04:52,052 INFO L272 TraceCheckUtils]: 0: Hoare triple {9181#true} call ULTIMATE.init(); {9181#true} is VALID [2022-04-28 10:04:52,052 INFO L290 TraceCheckUtils]: 1: Hoare triple {9181#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(10, 2);call #Ultimate.allocInit(12, 3); {9181#true} is VALID [2022-04-28 10:04:52,053 INFO L290 TraceCheckUtils]: 2: Hoare triple {9181#true} assume true; {9181#true} is VALID [2022-04-28 10:04:52,053 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9181#true} {9181#true} #61#return; {9181#true} is VALID [2022-04-28 10:04:52,053 INFO L272 TraceCheckUtils]: 4: Hoare triple {9181#true} call #t~ret11 := main(); {9181#true} is VALID [2022-04-28 10:04:52,053 INFO L290 TraceCheckUtils]: 5: Hoare triple {9181#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {9186#(= main_~y~0 0)} is VALID [2022-04-28 10:04:52,053 INFO L290 TraceCheckUtils]: 6: Hoare triple {9186#(= 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; {9187#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:04:52,054 INFO L290 TraceCheckUtils]: 7: Hoare triple {9187#(and (<= 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; {9188#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:04:52,054 INFO L290 TraceCheckUtils]: 8: Hoare triple {9188#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {9189#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:04:52,055 INFO L290 TraceCheckUtils]: 9: Hoare triple {9189#(and (<= main_~y~0 3) (<= 3 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; {9190#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:04:52,055 INFO L290 TraceCheckUtils]: 10: Hoare triple {9190#(and (<= main_~y~0 4) (<= 4 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; {9191#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:04:52,056 INFO L290 TraceCheckUtils]: 11: Hoare triple {9191#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {9191#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:04:52,056 INFO L290 TraceCheckUtils]: 12: Hoare triple {9191#(and (<= 5 main_~y~0) (<= main_~y~0 5))} ~z~0 := ~y~0; {9192#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:04:52,056 INFO L290 TraceCheckUtils]: 13: Hoare triple {9192#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9237#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:04:52,057 INFO L290 TraceCheckUtils]: 14: Hoare triple {9237#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !(~z~0 % 4294967296 > 0); {9182#false} is VALID [2022-04-28 10:04:52,057 INFO L290 TraceCheckUtils]: 15: Hoare triple {9182#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {9182#false} is VALID [2022-04-28 10:04:52,057 INFO L290 TraceCheckUtils]: 16: Hoare triple {9182#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {9182#false} is VALID [2022-04-28 10:04:52,057 INFO L290 TraceCheckUtils]: 17: Hoare triple {9182#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {9182#false} is VALID [2022-04-28 10:04:52,057 INFO L290 TraceCheckUtils]: 18: Hoare triple {9182#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {9182#false} is VALID [2022-04-28 10:04:52,057 INFO L290 TraceCheckUtils]: 19: Hoare triple {9182#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {9182#false} is VALID [2022-04-28 10:04:52,057 INFO L290 TraceCheckUtils]: 20: Hoare triple {9182#false} assume !(~y~0 % 4294967296 > 0); {9182#false} is VALID [2022-04-28 10:04:52,057 INFO L272 TraceCheckUtils]: 21: Hoare triple {9182#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {9182#false} is VALID [2022-04-28 10:04:52,057 INFO L290 TraceCheckUtils]: 22: Hoare triple {9182#false} ~cond := #in~cond; {9182#false} is VALID [2022-04-28 10:04:52,057 INFO L290 TraceCheckUtils]: 23: Hoare triple {9182#false} assume 0 == ~cond; {9182#false} is VALID [2022-04-28 10:04:52,057 INFO L290 TraceCheckUtils]: 24: Hoare triple {9182#false} assume !false; {9182#false} is VALID [2022-04-28 10:04:52,058 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-28 10:04:52,058 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:04:52,221 INFO L290 TraceCheckUtils]: 24: Hoare triple {9182#false} assume !false; {9182#false} is VALID [2022-04-28 10:04:52,222 INFO L290 TraceCheckUtils]: 23: Hoare triple {9182#false} assume 0 == ~cond; {9182#false} is VALID [2022-04-28 10:04:52,222 INFO L290 TraceCheckUtils]: 22: Hoare triple {9182#false} ~cond := #in~cond; {9182#false} is VALID [2022-04-28 10:04:52,222 INFO L272 TraceCheckUtils]: 21: Hoare triple {9182#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {9182#false} is VALID [2022-04-28 10:04:52,222 INFO L290 TraceCheckUtils]: 20: Hoare triple {9182#false} assume !(~y~0 % 4294967296 > 0); {9182#false} is VALID [2022-04-28 10:04:52,222 INFO L290 TraceCheckUtils]: 19: Hoare triple {9182#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {9182#false} is VALID [2022-04-28 10:04:52,222 INFO L290 TraceCheckUtils]: 18: Hoare triple {9182#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {9182#false} is VALID [2022-04-28 10:04:52,222 INFO L290 TraceCheckUtils]: 17: Hoare triple {9182#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {9182#false} is VALID [2022-04-28 10:04:52,222 INFO L290 TraceCheckUtils]: 16: Hoare triple {9182#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {9182#false} is VALID [2022-04-28 10:04:52,222 INFO L290 TraceCheckUtils]: 15: Hoare triple {9182#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {9182#false} is VALID [2022-04-28 10:04:52,222 INFO L290 TraceCheckUtils]: 14: Hoare triple {9301#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {9182#false} is VALID [2022-04-28 10:04:52,223 INFO L290 TraceCheckUtils]: 13: Hoare triple {9305#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9301#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:04:52,224 INFO L290 TraceCheckUtils]: 12: Hoare triple {9309#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} ~z~0 := ~y~0; {9305#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:04:52,224 INFO L290 TraceCheckUtils]: 11: Hoare triple {9309#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {9309#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:04:52,225 INFO L290 TraceCheckUtils]: 10: Hoare triple {9316#(< 0 (mod main_~y~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; {9309#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:04:52,225 INFO L290 TraceCheckUtils]: 9: Hoare triple {9320#(< 0 (mod (+ main_~y~0 1) 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; {9316#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:04:52,226 INFO L290 TraceCheckUtils]: 8: Hoare triple {9324#(< 0 (mod (+ main_~y~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; {9320#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:04:52,227 INFO L290 TraceCheckUtils]: 7: Hoare triple {9328#(< 0 (mod (+ main_~y~0 3) 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; {9324#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:04:52,227 INFO L290 TraceCheckUtils]: 6: Hoare triple {9332#(< 0 (mod (+ main_~y~0 4) 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; {9328#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:04:52,228 INFO L290 TraceCheckUtils]: 5: Hoare triple {9181#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {9332#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:04:52,228 INFO L272 TraceCheckUtils]: 4: Hoare triple {9181#true} call #t~ret11 := main(); {9181#true} is VALID [2022-04-28 10:04:52,228 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9181#true} {9181#true} #61#return; {9181#true} is VALID [2022-04-28 10:04:52,228 INFO L290 TraceCheckUtils]: 2: Hoare triple {9181#true} assume true; {9181#true} is VALID [2022-04-28 10:04:52,228 INFO L290 TraceCheckUtils]: 1: Hoare triple {9181#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(10, 2);call #Ultimate.allocInit(12, 3); {9181#true} is VALID [2022-04-28 10:04:52,228 INFO L272 TraceCheckUtils]: 0: Hoare triple {9181#true} call ULTIMATE.init(); {9181#true} is VALID [2022-04-28 10:04:52,228 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-28 10:04:52,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [113436181] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:04:52,228 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:04:52,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 20 [2022-04-28 10:04:52,228 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:04:52,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [437696733] [2022-04-28 10:04:52,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [437696733] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:04:52,229 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:04:52,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 10:04:52,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500622161] [2022-04-28 10:04:52,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:04:52,229 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 10 states have internal predecessors, (17), 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 25 [2022-04-28 10:04:52,229 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:04:52,229 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 10 states have internal predecessors, (17), 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-28 10:04:52,247 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:04:52,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 10:04:52,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:04:52,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 10:04:52,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2022-04-28 10:04:52,247 INFO L87 Difference]: Start difference. First operand 61 states and 77 transitions. Second operand has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 10 states have internal predecessors, (17), 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-28 10:04:52,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:52,723 INFO L93 Difference]: Finished difference Result 80 states and 96 transitions. [2022-04-28 10:04:52,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 10:04:52,724 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 10 states have internal predecessors, (17), 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 25 [2022-04-28 10:04:52,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:04:52,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 10 states have internal predecessors, (17), 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-28 10:04:52,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 48 transitions. [2022-04-28 10:04:52,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 10 states have internal predecessors, (17), 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-28 10:04:52,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 48 transitions. [2022-04-28 10:04:52,725 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 48 transitions. [2022-04-28 10:04:52,775 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:04:52,775 INFO L225 Difference]: With dead ends: 80 [2022-04-28 10:04:52,775 INFO L226 Difference]: Without dead ends: 69 [2022-04-28 10:04:52,776 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=181, Invalid=631, Unknown=0, NotChecked=0, Total=812 [2022-04-28 10:04:52,776 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 25 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 10:04:52,776 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 58 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 10:04:52,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-04-28 10:04:52,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 62. [2022-04-28 10:04:52,836 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:04:52,836 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand has 62 states, 57 states have (on average 1.2982456140350878) internal successors, (74), 57 states have internal predecessors, (74), 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-28 10:04:52,836 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand has 62 states, 57 states have (on average 1.2982456140350878) internal successors, (74), 57 states have internal predecessors, (74), 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-28 10:04:52,836 INFO L87 Difference]: Start difference. First operand 69 states. Second operand has 62 states, 57 states have (on average 1.2982456140350878) internal successors, (74), 57 states have internal predecessors, (74), 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-28 10:04:52,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:52,837 INFO L93 Difference]: Finished difference Result 69 states and 85 transitions. [2022-04-28 10:04:52,837 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 85 transitions. [2022-04-28 10:04:52,837 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:04:52,837 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:04:52,837 INFO L74 IsIncluded]: Start isIncluded. First operand has 62 states, 57 states have (on average 1.2982456140350878) internal successors, (74), 57 states have internal predecessors, (74), 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 69 states. [2022-04-28 10:04:52,837 INFO L87 Difference]: Start difference. First operand has 62 states, 57 states have (on average 1.2982456140350878) internal successors, (74), 57 states have internal predecessors, (74), 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 69 states. [2022-04-28 10:04:52,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:52,838 INFO L93 Difference]: Finished difference Result 69 states and 85 transitions. [2022-04-28 10:04:52,838 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 85 transitions. [2022-04-28 10:04:52,838 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:04:52,838 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:04:52,838 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:04:52,838 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:04:52,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 57 states have (on average 1.2982456140350878) internal successors, (74), 57 states have internal predecessors, (74), 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-28 10:04:52,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 78 transitions. [2022-04-28 10:04:52,839 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 78 transitions. Word has length 25 [2022-04-28 10:04:52,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:04:52,839 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 78 transitions. [2022-04-28 10:04:52,839 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 10 states have internal predecessors, (17), 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-28 10:04:52,839 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 62 states and 78 transitions. [2022-04-28 10:04:53,011 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:04:53,011 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 78 transitions. [2022-04-28 10:04:53,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-28 10:04:53,011 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:04:53,011 INFO L195 NwaCegarLoop]: trace histogram [11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:04:53,027 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-04-28 10:04:53,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-04-28 10:04:53,212 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:04:53,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:04:53,212 INFO L85 PathProgramCache]: Analyzing trace with hash 2014959630, now seen corresponding path program 21 times [2022-04-28 10:04:53,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:04:53,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [942178748] [2022-04-28 10:04:53,214 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:04:53,214 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:04:53,214 INFO L85 PathProgramCache]: Analyzing trace with hash 2014959630, now seen corresponding path program 22 times [2022-04-28 10:04:53,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:04:53,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204344885] [2022-04-28 10:04:53,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:04:53,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:04:53,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:53,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:04:53,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:53,403 INFO L290 TraceCheckUtils]: 0: Hoare triple {9811#(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(10, 2);call #Ultimate.allocInit(12, 3); {9793#true} is VALID [2022-04-28 10:04:53,403 INFO L290 TraceCheckUtils]: 1: Hoare triple {9793#true} assume true; {9793#true} is VALID [2022-04-28 10:04:53,403 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9793#true} {9793#true} #61#return; {9793#true} is VALID [2022-04-28 10:04:53,403 INFO L272 TraceCheckUtils]: 0: Hoare triple {9793#true} call ULTIMATE.init(); {9811#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:04:53,403 INFO L290 TraceCheckUtils]: 1: Hoare triple {9811#(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(10, 2);call #Ultimate.allocInit(12, 3); {9793#true} is VALID [2022-04-28 10:04:53,403 INFO L290 TraceCheckUtils]: 2: Hoare triple {9793#true} assume true; {9793#true} is VALID [2022-04-28 10:04:53,403 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9793#true} {9793#true} #61#return; {9793#true} is VALID [2022-04-28 10:04:53,403 INFO L272 TraceCheckUtils]: 4: Hoare triple {9793#true} call #t~ret11 := main(); {9793#true} is VALID [2022-04-28 10:04:53,404 INFO L290 TraceCheckUtils]: 5: Hoare triple {9793#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {9798#(= main_~y~0 0)} is VALID [2022-04-28 10:04:53,404 INFO L290 TraceCheckUtils]: 6: Hoare triple {9798#(= 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; {9799#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:04:53,405 INFO L290 TraceCheckUtils]: 7: Hoare triple {9799#(and (<= 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; {9800#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:04:53,405 INFO L290 TraceCheckUtils]: 8: Hoare triple {9800#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {9801#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:04:53,406 INFO L290 TraceCheckUtils]: 9: Hoare triple {9801#(and (<= main_~y~0 3) (<= 3 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; {9802#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:04:53,406 INFO L290 TraceCheckUtils]: 10: Hoare triple {9802#(and (<= main_~y~0 4) (<= 4 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; {9803#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:04:53,407 INFO L290 TraceCheckUtils]: 11: Hoare triple {9803#(and (<= 5 main_~y~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; {9804#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:04:53,407 INFO L290 TraceCheckUtils]: 12: Hoare triple {9804#(and (<= main_~y~0 6) (<= 6 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; {9805#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:04:53,408 INFO L290 TraceCheckUtils]: 13: Hoare triple {9805#(and (<= 7 main_~y~0) (<= main_~y~0 7))} 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; {9806#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:04:53,408 INFO L290 TraceCheckUtils]: 14: Hoare triple {9806#(and (<= main_~y~0 8) (<= 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; {9807#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:04:53,409 INFO L290 TraceCheckUtils]: 15: Hoare triple {9807#(and (<= 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; {9808#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:04:53,409 INFO L290 TraceCheckUtils]: 16: Hoare triple {9808#(and (<= main_~y~0 10) (<= 10 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; {9809#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:04:53,409 INFO L290 TraceCheckUtils]: 17: Hoare triple {9809#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {9809#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:04:53,410 INFO L290 TraceCheckUtils]: 18: Hoare triple {9809#(and (<= main_~y~0 11) (<= 11 main_~y~0))} ~z~0 := ~y~0; {9810#(and (<= (div main_~z~0 4294967296) 0) (<= 11 main_~z~0))} is VALID [2022-04-28 10:04:53,410 INFO L290 TraceCheckUtils]: 19: Hoare triple {9810#(and (<= (div main_~z~0 4294967296) 0) (<= 11 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {9794#false} is VALID [2022-04-28 10:04:53,410 INFO L290 TraceCheckUtils]: 20: Hoare triple {9794#false} assume !(~y~0 % 4294967296 > 0); {9794#false} is VALID [2022-04-28 10:04:53,410 INFO L272 TraceCheckUtils]: 21: Hoare triple {9794#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {9794#false} is VALID [2022-04-28 10:04:53,410 INFO L290 TraceCheckUtils]: 22: Hoare triple {9794#false} ~cond := #in~cond; {9794#false} is VALID [2022-04-28 10:04:53,410 INFO L290 TraceCheckUtils]: 23: Hoare triple {9794#false} assume 0 == ~cond; {9794#false} is VALID [2022-04-28 10:04:53,410 INFO L290 TraceCheckUtils]: 24: Hoare triple {9794#false} assume !false; {9794#false} is VALID [2022-04-28 10:04:53,411 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:04:53,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:04:53,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204344885] [2022-04-28 10:04:53,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204344885] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:04:53,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1074285935] [2022-04-28 10:04:53,411 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:04:53,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:04:53,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:04:53,412 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:04:53,413 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-04-28 10:04:53,447 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:04:53,448 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:04:53,448 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-28 10:04:53,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:53,454 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:04:53,670 INFO L272 TraceCheckUtils]: 0: Hoare triple {9793#true} call ULTIMATE.init(); {9793#true} is VALID [2022-04-28 10:04:53,670 INFO L290 TraceCheckUtils]: 1: Hoare triple {9793#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(10, 2);call #Ultimate.allocInit(12, 3); {9793#true} is VALID [2022-04-28 10:04:53,670 INFO L290 TraceCheckUtils]: 2: Hoare triple {9793#true} assume true; {9793#true} is VALID [2022-04-28 10:04:53,670 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9793#true} {9793#true} #61#return; {9793#true} is VALID [2022-04-28 10:04:53,670 INFO L272 TraceCheckUtils]: 4: Hoare triple {9793#true} call #t~ret11 := main(); {9793#true} is VALID [2022-04-28 10:04:53,670 INFO L290 TraceCheckUtils]: 5: Hoare triple {9793#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {9798#(= main_~y~0 0)} is VALID [2022-04-28 10:04:53,671 INFO L290 TraceCheckUtils]: 6: Hoare triple {9798#(= 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; {9799#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:04:53,671 INFO L290 TraceCheckUtils]: 7: Hoare triple {9799#(and (<= 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; {9800#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:04:53,672 INFO L290 TraceCheckUtils]: 8: Hoare triple {9800#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {9801#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:04:53,672 INFO L290 TraceCheckUtils]: 9: Hoare triple {9801#(and (<= main_~y~0 3) (<= 3 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; {9802#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:04:53,673 INFO L290 TraceCheckUtils]: 10: Hoare triple {9802#(and (<= main_~y~0 4) (<= 4 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; {9803#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:04:53,673 INFO L290 TraceCheckUtils]: 11: Hoare triple {9803#(and (<= 5 main_~y~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; {9804#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:04:53,674 INFO L290 TraceCheckUtils]: 12: Hoare triple {9804#(and (<= main_~y~0 6) (<= 6 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; {9805#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:04:53,683 INFO L290 TraceCheckUtils]: 13: Hoare triple {9805#(and (<= 7 main_~y~0) (<= main_~y~0 7))} 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; {9806#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:04:53,684 INFO L290 TraceCheckUtils]: 14: Hoare triple {9806#(and (<= main_~y~0 8) (<= 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; {9807#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:04:53,684 INFO L290 TraceCheckUtils]: 15: Hoare triple {9807#(and (<= 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; {9808#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:04:53,685 INFO L290 TraceCheckUtils]: 16: Hoare triple {9808#(and (<= main_~y~0 10) (<= 10 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; {9809#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:04:53,685 INFO L290 TraceCheckUtils]: 17: Hoare triple {9809#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {9809#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:04:53,686 INFO L290 TraceCheckUtils]: 18: Hoare triple {9809#(and (<= main_~y~0 11) (<= 11 main_~y~0))} ~z~0 := ~y~0; {9869#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-28 10:04:53,686 INFO L290 TraceCheckUtils]: 19: Hoare triple {9869#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {9794#false} is VALID [2022-04-28 10:04:53,686 INFO L290 TraceCheckUtils]: 20: Hoare triple {9794#false} assume !(~y~0 % 4294967296 > 0); {9794#false} is VALID [2022-04-28 10:04:53,686 INFO L272 TraceCheckUtils]: 21: Hoare triple {9794#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {9794#false} is VALID [2022-04-28 10:04:53,686 INFO L290 TraceCheckUtils]: 22: Hoare triple {9794#false} ~cond := #in~cond; {9794#false} is VALID [2022-04-28 10:04:53,686 INFO L290 TraceCheckUtils]: 23: Hoare triple {9794#false} assume 0 == ~cond; {9794#false} is VALID [2022-04-28 10:04:53,686 INFO L290 TraceCheckUtils]: 24: Hoare triple {9794#false} assume !false; {9794#false} is VALID [2022-04-28 10:04:53,686 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:04:53,686 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:04:54,003 INFO L290 TraceCheckUtils]: 24: Hoare triple {9794#false} assume !false; {9794#false} is VALID [2022-04-28 10:04:54,004 INFO L290 TraceCheckUtils]: 23: Hoare triple {9794#false} assume 0 == ~cond; {9794#false} is VALID [2022-04-28 10:04:54,004 INFO L290 TraceCheckUtils]: 22: Hoare triple {9794#false} ~cond := #in~cond; {9794#false} is VALID [2022-04-28 10:04:54,004 INFO L272 TraceCheckUtils]: 21: Hoare triple {9794#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {9794#false} is VALID [2022-04-28 10:04:54,004 INFO L290 TraceCheckUtils]: 20: Hoare triple {9794#false} assume !(~y~0 % 4294967296 > 0); {9794#false} is VALID [2022-04-28 10:04:54,004 INFO L290 TraceCheckUtils]: 19: Hoare triple {9903#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {9794#false} is VALID [2022-04-28 10:04:54,005 INFO L290 TraceCheckUtils]: 18: Hoare triple {9907#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {9903#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:04:54,005 INFO L290 TraceCheckUtils]: 17: Hoare triple {9907#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {9907#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:04:54,006 INFO L290 TraceCheckUtils]: 16: Hoare triple {9914#(< 0 (mod (+ main_~y~0 1) 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; {9907#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:04:54,006 INFO L290 TraceCheckUtils]: 15: Hoare triple {9918#(< 0 (mod (+ main_~y~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; {9914#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:04:54,007 INFO L290 TraceCheckUtils]: 14: Hoare triple {9922#(< 0 (mod (+ main_~y~0 3) 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; {9918#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:04:54,008 INFO L290 TraceCheckUtils]: 13: Hoare triple {9926#(< 0 (mod (+ main_~y~0 4) 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; {9922#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:04:54,008 INFO L290 TraceCheckUtils]: 12: Hoare triple {9930#(< 0 (mod (+ 5 main_~y~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; {9926#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:04:54,009 INFO L290 TraceCheckUtils]: 11: Hoare triple {9934#(< 0 (mod (+ main_~y~0 6) 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; {9930#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:04:54,009 INFO L290 TraceCheckUtils]: 10: Hoare triple {9938#(< 0 (mod (+ 7 main_~y~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; {9934#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:04:54,010 INFO L290 TraceCheckUtils]: 9: Hoare triple {9942#(< 0 (mod (+ main_~y~0 8) 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; {9938#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:04:54,011 INFO L290 TraceCheckUtils]: 8: Hoare triple {9946#(< 0 (mod (+ main_~y~0 9) 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; {9942#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:04:54,011 INFO L290 TraceCheckUtils]: 7: Hoare triple {9950#(< 0 (mod (+ main_~y~0 10) 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; {9946#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:04:54,012 INFO L290 TraceCheckUtils]: 6: Hoare triple {9954#(< 0 (mod (+ main_~y~0 11) 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; {9950#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-28 10:04:54,012 INFO L290 TraceCheckUtils]: 5: Hoare triple {9793#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {9954#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-28 10:04:54,012 INFO L272 TraceCheckUtils]: 4: Hoare triple {9793#true} call #t~ret11 := main(); {9793#true} is VALID [2022-04-28 10:04:54,012 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9793#true} {9793#true} #61#return; {9793#true} is VALID [2022-04-28 10:04:54,012 INFO L290 TraceCheckUtils]: 2: Hoare triple {9793#true} assume true; {9793#true} is VALID [2022-04-28 10:04:54,012 INFO L290 TraceCheckUtils]: 1: Hoare triple {9793#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(10, 2);call #Ultimate.allocInit(12, 3); {9793#true} is VALID [2022-04-28 10:04:54,013 INFO L272 TraceCheckUtils]: 0: Hoare triple {9793#true} call ULTIMATE.init(); {9793#true} is VALID [2022-04-28 10:04:54,013 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:04:54,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1074285935] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:04:54,013 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:04:54,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 30 [2022-04-28 10:04:54,013 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:04:54,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [942178748] [2022-04-28 10:04:54,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [942178748] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:04:54,013 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:04:54,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-28 10:04:54,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717636671] [2022-04-28 10:04:54,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:04:54,014 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.3125) internal successors, (21), 15 states have internal predecessors, (21), 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 25 [2022-04-28 10:04:54,014 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:04:54,014 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 1.3125) internal successors, (21), 15 states have internal predecessors, (21), 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-28 10:04:54,028 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:04:54,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-28 10:04:54,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:04:54,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-28 10:04:54,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=667, Unknown=0, NotChecked=0, Total=870 [2022-04-28 10:04:54,029 INFO L87 Difference]: Start difference. First operand 62 states and 78 transitions. Second operand has 16 states, 16 states have (on average 1.3125) internal successors, (21), 15 states have internal predecessors, (21), 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-28 10:04:55,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:55,368 INFO L93 Difference]: Finished difference Result 85 states and 116 transitions. [2022-04-28 10:04:55,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-28 10:04:55,368 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.3125) internal successors, (21), 15 states have internal predecessors, (21), 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 25 [2022-04-28 10:04:55,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:04:55,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.3125) internal successors, (21), 15 states have internal predecessors, (21), 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-28 10:04:55,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 94 transitions. [2022-04-28 10:04:55,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.3125) internal successors, (21), 15 states have internal predecessors, (21), 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-28 10:04:55,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 94 transitions. [2022-04-28 10:04:55,370 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 94 transitions. [2022-04-28 10:04:55,472 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:04:55,472 INFO L225 Difference]: With dead ends: 85 [2022-04-28 10:04:55,473 INFO L226 Difference]: Without dead ends: 79 [2022-04-28 10:04:55,473 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=413, Invalid=1393, Unknown=0, NotChecked=0, Total=1806 [2022-04-28 10:04:55,473 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 76 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 771 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 822 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 771 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-28 10:04:55,474 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 100 Invalid, 822 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 771 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-28 10:04:55,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-04-28 10:04:55,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 67. [2022-04-28 10:04:55,536 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:04:55,536 INFO L82 GeneralOperation]: Start isEquivalent. First operand 79 states. Second operand has 67 states, 62 states have (on average 1.3064516129032258) internal successors, (81), 62 states have internal predecessors, (81), 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-28 10:04:55,536 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand has 67 states, 62 states have (on average 1.3064516129032258) internal successors, (81), 62 states have internal predecessors, (81), 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-28 10:04:55,536 INFO L87 Difference]: Start difference. First operand 79 states. Second operand has 67 states, 62 states have (on average 1.3064516129032258) internal successors, (81), 62 states have internal predecessors, (81), 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-28 10:04:55,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:55,537 INFO L93 Difference]: Finished difference Result 79 states and 97 transitions. [2022-04-28 10:04:55,537 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 97 transitions. [2022-04-28 10:04:55,538 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:04:55,538 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:04:55,538 INFO L74 IsIncluded]: Start isIncluded. First operand has 67 states, 62 states have (on average 1.3064516129032258) internal successors, (81), 62 states have internal predecessors, (81), 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 79 states. [2022-04-28 10:04:55,538 INFO L87 Difference]: Start difference. First operand has 67 states, 62 states have (on average 1.3064516129032258) internal successors, (81), 62 states have internal predecessors, (81), 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 79 states. [2022-04-28 10:04:55,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:04:55,539 INFO L93 Difference]: Finished difference Result 79 states and 97 transitions. [2022-04-28 10:04:55,539 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 97 transitions. [2022-04-28 10:04:55,539 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:04:55,539 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:04:55,539 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:04:55,539 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:04:55,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 62 states have (on average 1.3064516129032258) internal successors, (81), 62 states have internal predecessors, (81), 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-28 10:04:55,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 85 transitions. [2022-04-28 10:04:55,540 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 85 transitions. Word has length 25 [2022-04-28 10:04:55,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:04:55,540 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 85 transitions. [2022-04-28 10:04:55,540 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.3125) internal successors, (21), 15 states have internal predecessors, (21), 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-28 10:04:55,540 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 67 states and 85 transitions. [2022-04-28 10:04:55,937 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:04:55,937 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 85 transitions. [2022-04-28 10:04:55,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-28 10:04:55,937 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:04:55,937 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:04:55,953 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-04-28 10:04:56,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:04:56,147 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:04:56,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:04:56,148 INFO L85 PathProgramCache]: Analyzing trace with hash 359277261, now seen corresponding path program 23 times [2022-04-28 10:04:56,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:04:56,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2087291659] [2022-04-28 10:04:56,150 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:04:56,150 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:04:56,150 INFO L85 PathProgramCache]: Analyzing trace with hash 359277261, now seen corresponding path program 24 times [2022-04-28 10:04:56,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:04:56,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547265502] [2022-04-28 10:04:56,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:04:56,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:04:56,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:56,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:04:56,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:56,592 INFO L290 TraceCheckUtils]: 0: Hoare triple {10482#(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(10, 2);call #Ultimate.allocInit(12, 3); {10463#true} is VALID [2022-04-28 10:04:56,592 INFO L290 TraceCheckUtils]: 1: Hoare triple {10463#true} assume true; {10463#true} is VALID [2022-04-28 10:04:56,593 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10463#true} {10463#true} #61#return; {10463#true} is VALID [2022-04-28 10:04:56,593 INFO L272 TraceCheckUtils]: 0: Hoare triple {10463#true} call ULTIMATE.init(); {10482#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:04:56,593 INFO L290 TraceCheckUtils]: 1: Hoare triple {10482#(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(10, 2);call #Ultimate.allocInit(12, 3); {10463#true} is VALID [2022-04-28 10:04:56,593 INFO L290 TraceCheckUtils]: 2: Hoare triple {10463#true} assume true; {10463#true} is VALID [2022-04-28 10:04:56,593 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10463#true} {10463#true} #61#return; {10463#true} is VALID [2022-04-28 10:04:56,593 INFO L272 TraceCheckUtils]: 4: Hoare triple {10463#true} call #t~ret11 := main(); {10463#true} is VALID [2022-04-28 10:04:56,593 INFO L290 TraceCheckUtils]: 5: Hoare triple {10463#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {10468#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-28 10:04:56,595 INFO L290 TraceCheckUtils]: 6: Hoare triple {10468#(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; {10469#(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-28 10:04:56,603 INFO L290 TraceCheckUtils]: 7: Hoare triple {10469#(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; {10470#(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-28 10:04:56,609 INFO L290 TraceCheckUtils]: 8: Hoare triple {10470#(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; {10471#(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-28 10:04:56,619 INFO L290 TraceCheckUtils]: 9: Hoare triple {10471#(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; {10472#(and (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~x~0) (* (- 1) main_~y~0) (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296) 4) main_~n~0) (<= main_~y~0 4) (<= main_~n~0 (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) 4294967295)) (<= 4 main_~y~0))} is VALID [2022-04-28 10:04:56,620 INFO L290 TraceCheckUtils]: 10: Hoare triple {10472#(and (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~x~0) (* (- 1) main_~y~0) (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296) 4) main_~n~0) (<= main_~y~0 4) (<= main_~n~0 (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) 4294967295)) (<= 4 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {10473#(and (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) 4) main_~n~0) (<= main_~y~0 4))} is VALID [2022-04-28 10:04:56,621 INFO L290 TraceCheckUtils]: 11: Hoare triple {10473#(and (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) 4) main_~n~0) (<= main_~y~0 4))} ~z~0 := ~y~0; {10474#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 4) main_~n~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:04:56,622 INFO L290 TraceCheckUtils]: 12: Hoare triple {10474#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 4) main_~n~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10475#(and (<= main_~z~0 3) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 4) main_~n~0))} is VALID [2022-04-28 10:04:56,623 INFO L290 TraceCheckUtils]: 13: Hoare triple {10475#(and (<= main_~z~0 3) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 4) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10476#(and (<= main_~z~0 2) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 4) main_~n~0))} is VALID [2022-04-28 10:04:56,624 INFO L290 TraceCheckUtils]: 14: Hoare triple {10476#(and (<= main_~z~0 2) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 4) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10477#(and (<= main_~z~0 1) (<= (+ (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 4) main_~n~0))} is VALID [2022-04-28 10:04:56,625 INFO L290 TraceCheckUtils]: 15: Hoare triple {10477#(and (<= main_~z~0 1) (<= (+ (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 4) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10478#(and (<= main_~z~0 0) (<= (+ (* (div (+ 4294967291 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 4) main_~n~0))} is VALID [2022-04-28 10:04:56,625 INFO L290 TraceCheckUtils]: 16: Hoare triple {10478#(and (<= main_~z~0 0) (<= (+ (* (div (+ 4294967291 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 4) main_~n~0))} assume !(~z~0 % 4294967296 > 0); {10478#(and (<= main_~z~0 0) (<= (+ (* (div (+ 4294967291 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 4) main_~n~0))} is VALID [2022-04-28 10:04:56,626 INFO L290 TraceCheckUtils]: 17: Hoare triple {10478#(and (<= main_~z~0 0) (<= (+ (* (div (+ 4294967291 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 4) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10477#(and (<= main_~z~0 1) (<= (+ (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 4) main_~n~0))} is VALID [2022-04-28 10:04:56,627 INFO L290 TraceCheckUtils]: 18: Hoare triple {10477#(and (<= main_~z~0 1) (<= (+ (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 4) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10476#(and (<= main_~z~0 2) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 4) main_~n~0))} is VALID [2022-04-28 10:04:56,628 INFO L290 TraceCheckUtils]: 19: Hoare triple {10476#(and (<= main_~z~0 2) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 4) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10475#(and (<= main_~z~0 3) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 4) main_~n~0))} is VALID [2022-04-28 10:04:56,629 INFO L290 TraceCheckUtils]: 20: Hoare triple {10475#(and (<= main_~z~0 3) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 4) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10479#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-28 10:04:56,630 INFO L290 TraceCheckUtils]: 21: Hoare triple {10479#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {10479#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-28 10:04:56,630 INFO L272 TraceCheckUtils]: 22: Hoare triple {10479#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {10480#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:04:56,631 INFO L290 TraceCheckUtils]: 23: Hoare triple {10480#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {10481#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 10:04:56,631 INFO L290 TraceCheckUtils]: 24: Hoare triple {10481#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {10464#false} is VALID [2022-04-28 10:04:56,631 INFO L290 TraceCheckUtils]: 25: Hoare triple {10464#false} assume !false; {10464#false} is VALID [2022-04-28 10:04:56,631 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:04:56,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:04:56,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547265502] [2022-04-28 10:04:56,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547265502] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:04:56,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1301896371] [2022-04-28 10:04:56,632 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:04:56,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:04:56,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:04:56,633 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:04:56,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-04-28 10:04:56,721 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-28 10:04:56,721 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:04:56,722 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 43 conjunts are in the unsatisfiable core [2022-04-28 10:04:56,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:04:56,730 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:05:15,457 INFO L272 TraceCheckUtils]: 0: Hoare triple {10463#true} call ULTIMATE.init(); {10463#true} is VALID [2022-04-28 10:05:15,457 INFO L290 TraceCheckUtils]: 1: Hoare triple {10463#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(10, 2);call #Ultimate.allocInit(12, 3); {10463#true} is VALID [2022-04-28 10:05:15,457 INFO L290 TraceCheckUtils]: 2: Hoare triple {10463#true} assume true; {10463#true} is VALID [2022-04-28 10:05:15,457 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10463#true} {10463#true} #61#return; {10463#true} is VALID [2022-04-28 10:05:15,457 INFO L272 TraceCheckUtils]: 4: Hoare triple {10463#true} call #t~ret11 := main(); {10463#true} is VALID [2022-04-28 10:05:15,458 INFO L290 TraceCheckUtils]: 5: Hoare triple {10463#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {10468#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-28 10:05:15,458 INFO L290 TraceCheckUtils]: 6: Hoare triple {10468#(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; {10504#(and (= (+ main_~x~0 (* (- 1) main_~n~0) 1) 0) (= main_~y~0 1))} is VALID [2022-04-28 10:05:15,459 INFO L290 TraceCheckUtils]: 7: Hoare triple {10504#(and (= (+ main_~x~0 (* (- 1) main_~n~0) 1) 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; {10508#(and (= (+ main_~x~0 2 (* (- 1) main_~n~0)) 0) (= (+ (- 1) main_~y~0) 1))} is VALID [2022-04-28 10:05:15,459 INFO L290 TraceCheckUtils]: 8: Hoare triple {10508#(and (= (+ main_~x~0 2 (* (- 1) main_~n~0)) 0) (= (+ (- 1) 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; {10512#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 2) main_~n~0) (+ main_~x~0 1)))} is VALID [2022-04-28 10:05:15,460 INFO L290 TraceCheckUtils]: 9: Hoare triple {10512#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 2) main_~n~0) (+ main_~x~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; {10516#(and (= (+ main_~y~0 (- 3)) 1) (= (+ main_~n~0 (- 3)) (+ main_~x~0 1)) (< 0 (mod (+ main_~n~0 4294967293) 4294967296)))} is VALID [2022-04-28 10:05:15,461 INFO L290 TraceCheckUtils]: 10: Hoare triple {10516#(and (= (+ main_~y~0 (- 3)) 1) (= (+ main_~n~0 (- 3)) (+ main_~x~0 1)) (< 0 (mod (+ main_~n~0 4294967293) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {10473#(and (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) 4) main_~n~0) (<= main_~y~0 4))} is VALID [2022-04-28 10:05:15,461 INFO L290 TraceCheckUtils]: 11: Hoare triple {10473#(and (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) 4) main_~n~0) (<= main_~y~0 4))} ~z~0 := ~y~0; {10474#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 4) main_~n~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:05:15,462 INFO L290 TraceCheckUtils]: 12: Hoare triple {10474#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 4) main_~n~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10475#(and (<= main_~z~0 3) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 4) main_~n~0))} is VALID [2022-04-28 10:05:15,463 INFO L290 TraceCheckUtils]: 13: Hoare triple {10475#(and (<= main_~z~0 3) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 4) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10476#(and (<= main_~z~0 2) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 4) main_~n~0))} is VALID [2022-04-28 10:05:15,464 INFO L290 TraceCheckUtils]: 14: Hoare triple {10476#(and (<= main_~z~0 2) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 4) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10477#(and (<= main_~z~0 1) (<= (+ (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 4) main_~n~0))} is VALID [2022-04-28 10:05:15,465 INFO L290 TraceCheckUtils]: 15: Hoare triple {10477#(and (<= main_~z~0 1) (<= (+ (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 4) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10478#(and (<= main_~z~0 0) (<= (+ (* (div (+ 4294967291 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 4) main_~n~0))} is VALID [2022-04-28 10:05:15,466 INFO L290 TraceCheckUtils]: 16: Hoare triple {10478#(and (<= main_~z~0 0) (<= (+ (* (div (+ 4294967291 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 4) main_~n~0))} assume !(~z~0 % 4294967296 > 0); {10478#(and (<= main_~z~0 0) (<= (+ (* (div (+ 4294967291 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 4) main_~n~0))} is VALID [2022-04-28 10:05:15,466 INFO L290 TraceCheckUtils]: 17: Hoare triple {10478#(and (<= main_~z~0 0) (<= (+ (* (div (+ 4294967291 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 4) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10477#(and (<= main_~z~0 1) (<= (+ (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 4) main_~n~0))} is VALID [2022-04-28 10:05:15,467 INFO L290 TraceCheckUtils]: 18: Hoare triple {10477#(and (<= main_~z~0 1) (<= (+ (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 4) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10476#(and (<= main_~z~0 2) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 4) main_~n~0))} is VALID [2022-04-28 10:05:15,468 INFO L290 TraceCheckUtils]: 19: Hoare triple {10476#(and (<= main_~z~0 2) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 4) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10475#(and (<= main_~z~0 3) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 4) main_~n~0))} is VALID [2022-04-28 10:05:15,469 INFO L290 TraceCheckUtils]: 20: Hoare triple {10475#(and (<= main_~z~0 3) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 4) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10474#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 4) main_~n~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:05:15,469 INFO L290 TraceCheckUtils]: 21: Hoare triple {10474#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 4) main_~n~0) (<= main_~z~0 4))} assume !(~y~0 % 4294967296 > 0); {10474#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 4) main_~n~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:05:15,471 INFO L272 TraceCheckUtils]: 22: Hoare triple {10474#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 4) main_~n~0) (<= main_~z~0 4))} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {10556#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:05:15,471 INFO L290 TraceCheckUtils]: 23: Hoare triple {10556#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10560#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:05:15,472 INFO L290 TraceCheckUtils]: 24: Hoare triple {10560#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10464#false} is VALID [2022-04-28 10:05:15,472 INFO L290 TraceCheckUtils]: 25: Hoare triple {10464#false} assume !false; {10464#false} is VALID [2022-04-28 10:05:15,472 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:05:15,472 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:05:16,536 INFO L290 TraceCheckUtils]: 25: Hoare triple {10464#false} assume !false; {10464#false} is VALID [2022-04-28 10:05:16,537 INFO L290 TraceCheckUtils]: 24: Hoare triple {10560#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10464#false} is VALID [2022-04-28 10:05:16,537 INFO L290 TraceCheckUtils]: 23: Hoare triple {10556#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10560#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:05:16,538 INFO L272 TraceCheckUtils]: 22: Hoare triple {10479#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {10556#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:05:16,538 INFO L290 TraceCheckUtils]: 21: Hoare triple {10479#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {10479#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-28 10:05:16,539 INFO L290 TraceCheckUtils]: 20: Hoare triple {10582#(and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10479#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-28 10:05:16,540 INFO L290 TraceCheckUtils]: 19: Hoare triple {10586#(and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10582#(and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-28 10:05:16,541 INFO L290 TraceCheckUtils]: 18: Hoare triple {10590#(and (< (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10586#(and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-28 10:05:16,542 INFO L290 TraceCheckUtils]: 17: Hoare triple {10594#(and (< (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) main_~n~0) (+ 5 main_~z~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) main_~n~0)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10590#(and (< (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296))))} is VALID [2022-04-28 10:05:16,542 INFO L290 TraceCheckUtils]: 16: Hoare triple {10594#(and (< (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) main_~n~0) (+ 5 main_~z~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) main_~n~0)))} assume !(~z~0 % 4294967296 > 0); {10594#(and (< (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) main_~n~0) (+ 5 main_~z~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-28 10:05:16,543 INFO L290 TraceCheckUtils]: 15: Hoare triple {10590#(and (< (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10594#(and (< (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) main_~n~0) (+ 5 main_~z~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-28 10:05:16,544 INFO L290 TraceCheckUtils]: 14: Hoare triple {10586#(and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10590#(and (< (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296))))} is VALID [2022-04-28 10:05:16,545 INFO L290 TraceCheckUtils]: 13: Hoare triple {10582#(and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10586#(and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-28 10:05:16,545 INFO L290 TraceCheckUtils]: 12: Hoare triple {10479#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10582#(and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-28 10:05:16,546 INFO L290 TraceCheckUtils]: 11: Hoare triple {10613#(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)))} ~z~0 := ~y~0; {10479#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-28 10:05:16,547 INFO L290 TraceCheckUtils]: 10: Hoare triple {10617#(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); {10613#(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-28 10:05:16,548 INFO L290 TraceCheckUtils]: 9: Hoare triple {10621#(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; {10617#(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-28 10:05:16,549 INFO L290 TraceCheckUtils]: 8: Hoare triple {10625#(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; {10621#(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-28 10:05:16,551 INFO L290 TraceCheckUtils]: 7: Hoare triple {10629#(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; {10625#(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-28 10:05:16,552 INFO L290 TraceCheckUtils]: 6: Hoare triple {10633#(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; {10629#(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-28 10:05:16,553 INFO L290 TraceCheckUtils]: 5: Hoare triple {10463#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {10633#(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-28 10:05:16,553 INFO L272 TraceCheckUtils]: 4: Hoare triple {10463#true} call #t~ret11 := main(); {10463#true} is VALID [2022-04-28 10:05:16,553 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10463#true} {10463#true} #61#return; {10463#true} is VALID [2022-04-28 10:05:16,553 INFO L290 TraceCheckUtils]: 2: Hoare triple {10463#true} assume true; {10463#true} is VALID [2022-04-28 10:05:16,553 INFO L290 TraceCheckUtils]: 1: Hoare triple {10463#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(10, 2);call #Ultimate.allocInit(12, 3); {10463#true} is VALID [2022-04-28 10:05:16,553 INFO L272 TraceCheckUtils]: 0: Hoare triple {10463#true} call ULTIMATE.init(); {10463#true} is VALID [2022-04-28 10:05:16,553 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:05:16,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1301896371] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:05:16,553 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:05:16,553 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 15] total 33 [2022-04-28 10:05:16,554 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:05:16,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2087291659] [2022-04-28 10:05:16,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2087291659] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:05:16,554 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:05:16,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-28 10:05:16,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280711483] [2022-04-28 10:05:16,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:05:16,554 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 15 states have internal predecessors, (22), 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 26 [2022-04-28 10:05:16,554 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:05:16,554 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 15 states have internal predecessors, (22), 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-28 10:05:16,627 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:05:16,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-28 10:05:16,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:05:16,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-28 10:05:16,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=938, Unknown=0, NotChecked=0, Total=1056 [2022-04-28 10:05:16,628 INFO L87 Difference]: Start difference. First operand 67 states and 85 transitions. Second operand has 17 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 15 states have internal predecessors, (22), 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-28 10:05:18,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:05:18,007 INFO L93 Difference]: Finished difference Result 86 states and 104 transitions. [2022-04-28 10:05:18,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-28 10:05:18,007 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 15 states have internal predecessors, (22), 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 26 [2022-04-28 10:05:18,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:05:18,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 15 states have internal predecessors, (22), 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-28 10:05:18,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 46 transitions. [2022-04-28 10:05:18,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 15 states have internal predecessors, (22), 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-28 10:05:18,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 46 transitions. [2022-04-28 10:05:18,009 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 46 transitions. [2022-04-28 10:05:18,122 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:05:18,123 INFO L225 Difference]: With dead ends: 86 [2022-04-28 10:05:18,123 INFO L226 Difference]: Without dead ends: 61 [2022-04-28 10:05:18,124 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 37 SyntacticMatches, 4 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 309 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=259, Invalid=2191, Unknown=0, NotChecked=0, Total=2450 [2022-04-28 10:05:18,124 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 22 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 10:05:18,124 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 74 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 10:05:18,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-04-28 10:05:18,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2022-04-28 10:05:18,176 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:05:18,176 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand has 61 states, 56 states have (on average 1.3035714285714286) internal successors, (73), 56 states have internal predecessors, (73), 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-28 10:05:18,176 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand has 61 states, 56 states have (on average 1.3035714285714286) internal successors, (73), 56 states have internal predecessors, (73), 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-28 10:05:18,177 INFO L87 Difference]: Start difference. First operand 61 states. Second operand has 61 states, 56 states have (on average 1.3035714285714286) internal successors, (73), 56 states have internal predecessors, (73), 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-28 10:05:18,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:05:18,177 INFO L93 Difference]: Finished difference Result 61 states and 77 transitions. [2022-04-28 10:05:18,177 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 77 transitions. [2022-04-28 10:05:18,177 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:05:18,177 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:05:18,178 INFO L74 IsIncluded]: Start isIncluded. First operand has 61 states, 56 states have (on average 1.3035714285714286) internal successors, (73), 56 states have internal predecessors, (73), 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 61 states. [2022-04-28 10:05:18,178 INFO L87 Difference]: Start difference. First operand has 61 states, 56 states have (on average 1.3035714285714286) internal successors, (73), 56 states have internal predecessors, (73), 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 61 states. [2022-04-28 10:05:18,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:05:18,178 INFO L93 Difference]: Finished difference Result 61 states and 77 transitions. [2022-04-28 10:05:18,178 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 77 transitions. [2022-04-28 10:05:18,178 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:05:18,178 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:05:18,179 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:05:18,179 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:05:18,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 56 states have (on average 1.3035714285714286) internal successors, (73), 56 states have internal predecessors, (73), 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-28 10:05:18,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 77 transitions. [2022-04-28 10:05:18,179 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 77 transitions. Word has length 26 [2022-04-28 10:05:18,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:05:18,179 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 77 transitions. [2022-04-28 10:05:18,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 15 states have internal predecessors, (22), 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-28 10:05:18,180 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 61 states and 77 transitions. [2022-04-28 10:05:20,626 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 76 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 10:05:20,627 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 77 transitions. [2022-04-28 10:05:20,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-28 10:05:20,627 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:05:20,627 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:05:20,645 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2022-04-28 10:05:20,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:05:20,841 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:05:20,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:05:20,841 INFO L85 PathProgramCache]: Analyzing trace with hash 177120127, now seen corresponding path program 25 times [2022-04-28 10:05:20,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:05:20,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1257960398] [2022-04-28 10:05:20,843 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:05:20,843 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:05:20,843 INFO L85 PathProgramCache]: Analyzing trace with hash 177120127, now seen corresponding path program 26 times [2022-04-28 10:05:20,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:05:20,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126184823] [2022-04-28 10:05:20,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:05:20,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:05:20,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:05:20,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:05:20,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:05:20,980 INFO L290 TraceCheckUtils]: 0: Hoare triple {11118#(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(10, 2);call #Ultimate.allocInit(12, 3); {11104#true} is VALID [2022-04-28 10:05:20,980 INFO L290 TraceCheckUtils]: 1: Hoare triple {11104#true} assume true; {11104#true} is VALID [2022-04-28 10:05:20,980 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11104#true} {11104#true} #61#return; {11104#true} is VALID [2022-04-28 10:05:20,981 INFO L272 TraceCheckUtils]: 0: Hoare triple {11104#true} call ULTIMATE.init(); {11118#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:05:20,981 INFO L290 TraceCheckUtils]: 1: Hoare triple {11118#(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(10, 2);call #Ultimate.allocInit(12, 3); {11104#true} is VALID [2022-04-28 10:05:20,981 INFO L290 TraceCheckUtils]: 2: Hoare triple {11104#true} assume true; {11104#true} is VALID [2022-04-28 10:05:20,981 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11104#true} {11104#true} #61#return; {11104#true} is VALID [2022-04-28 10:05:20,981 INFO L272 TraceCheckUtils]: 4: Hoare triple {11104#true} call #t~ret11 := main(); {11104#true} is VALID [2022-04-28 10:05:20,981 INFO L290 TraceCheckUtils]: 5: Hoare triple {11104#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {11109#(= main_~y~0 0)} is VALID [2022-04-28 10:05:20,981 INFO L290 TraceCheckUtils]: 6: Hoare triple {11109#(= 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; {11110#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:05:20,982 INFO L290 TraceCheckUtils]: 7: Hoare triple {11110#(and (<= 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; {11111#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:05:20,983 INFO L290 TraceCheckUtils]: 8: Hoare triple {11111#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {11112#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:05:20,983 INFO L290 TraceCheckUtils]: 9: Hoare triple {11112#(and (<= main_~y~0 3) (<= 3 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; {11113#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:05:20,984 INFO L290 TraceCheckUtils]: 10: Hoare triple {11113#(and (<= main_~y~0 4) (<= 4 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; {11114#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:05:20,984 INFO L290 TraceCheckUtils]: 11: Hoare triple {11114#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {11114#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:05:20,984 INFO L290 TraceCheckUtils]: 12: Hoare triple {11114#(and (<= 5 main_~y~0) (<= main_~y~0 5))} ~z~0 := ~y~0; {11115#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:05:20,985 INFO L290 TraceCheckUtils]: 13: Hoare triple {11115#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11116#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:05:20,985 INFO L290 TraceCheckUtils]: 14: Hoare triple {11116#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11117#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:05:20,986 INFO L290 TraceCheckUtils]: 15: Hoare triple {11117#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {11105#false} is VALID [2022-04-28 10:05:20,986 INFO L290 TraceCheckUtils]: 16: Hoare triple {11105#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {11105#false} is VALID [2022-04-28 10:05:20,986 INFO L290 TraceCheckUtils]: 17: Hoare triple {11105#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {11105#false} is VALID [2022-04-28 10:05:20,986 INFO L290 TraceCheckUtils]: 18: Hoare triple {11105#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {11105#false} is VALID [2022-04-28 10:05:20,986 INFO L290 TraceCheckUtils]: 19: Hoare triple {11105#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {11105#false} is VALID [2022-04-28 10:05:20,986 INFO L290 TraceCheckUtils]: 20: Hoare triple {11105#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {11105#false} is VALID [2022-04-28 10:05:20,986 INFO L290 TraceCheckUtils]: 21: Hoare triple {11105#false} assume !(~y~0 % 4294967296 > 0); {11105#false} is VALID [2022-04-28 10:05:20,986 INFO L272 TraceCheckUtils]: 22: Hoare triple {11105#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {11105#false} is VALID [2022-04-28 10:05:20,986 INFO L290 TraceCheckUtils]: 23: Hoare triple {11105#false} ~cond := #in~cond; {11105#false} is VALID [2022-04-28 10:05:20,986 INFO L290 TraceCheckUtils]: 24: Hoare triple {11105#false} assume 0 == ~cond; {11105#false} is VALID [2022-04-28 10:05:20,986 INFO L290 TraceCheckUtils]: 25: Hoare triple {11105#false} assume !false; {11105#false} is VALID [2022-04-28 10:05:20,987 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-28 10:05:20,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:05:20,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126184823] [2022-04-28 10:05:20,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126184823] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:05:20,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2115901891] [2022-04-28 10:05:20,987 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:05:20,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:05:20,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:05:20,988 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:05:20,989 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-04-28 10:05:21,024 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:05:21,024 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:05:21,025 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-28 10:05:21,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:05:21,031 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:05:21,209 INFO L272 TraceCheckUtils]: 0: Hoare triple {11104#true} call ULTIMATE.init(); {11104#true} is VALID [2022-04-28 10:05:21,209 INFO L290 TraceCheckUtils]: 1: Hoare triple {11104#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(10, 2);call #Ultimate.allocInit(12, 3); {11104#true} is VALID [2022-04-28 10:05:21,209 INFO L290 TraceCheckUtils]: 2: Hoare triple {11104#true} assume true; {11104#true} is VALID [2022-04-28 10:05:21,209 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11104#true} {11104#true} #61#return; {11104#true} is VALID [2022-04-28 10:05:21,209 INFO L272 TraceCheckUtils]: 4: Hoare triple {11104#true} call #t~ret11 := main(); {11104#true} is VALID [2022-04-28 10:05:21,209 INFO L290 TraceCheckUtils]: 5: Hoare triple {11104#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {11109#(= main_~y~0 0)} is VALID [2022-04-28 10:05:21,210 INFO L290 TraceCheckUtils]: 6: Hoare triple {11109#(= 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; {11110#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:05:21,210 INFO L290 TraceCheckUtils]: 7: Hoare triple {11110#(and (<= 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; {11111#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:05:21,211 INFO L290 TraceCheckUtils]: 8: Hoare triple {11111#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {11112#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:05:21,211 INFO L290 TraceCheckUtils]: 9: Hoare triple {11112#(and (<= main_~y~0 3) (<= 3 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; {11113#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:05:21,212 INFO L290 TraceCheckUtils]: 10: Hoare triple {11113#(and (<= main_~y~0 4) (<= 4 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; {11114#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:05:21,212 INFO L290 TraceCheckUtils]: 11: Hoare triple {11114#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {11114#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:05:21,212 INFO L290 TraceCheckUtils]: 12: Hoare triple {11114#(and (<= 5 main_~y~0) (<= main_~y~0 5))} ~z~0 := ~y~0; {11158#(and (= main_~z~0 main_~y~0) (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:05:21,213 INFO L290 TraceCheckUtils]: 13: Hoare triple {11158#(and (= main_~z~0 main_~y~0) (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11162#(and (<= 5 main_~y~0) (<= main_~y~0 5) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-28 10:05:21,213 INFO L290 TraceCheckUtils]: 14: Hoare triple {11162#(and (<= 5 main_~y~0) (<= main_~y~0 5) (= main_~y~0 (+ main_~z~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11166#(and (= main_~y~0 (+ main_~z~0 2)) (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:05:21,214 INFO L290 TraceCheckUtils]: 15: Hoare triple {11166#(and (= main_~y~0 (+ main_~z~0 2)) (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~z~0 % 4294967296 > 0); {11105#false} is VALID [2022-04-28 10:05:21,214 INFO L290 TraceCheckUtils]: 16: Hoare triple {11105#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {11105#false} is VALID [2022-04-28 10:05:21,214 INFO L290 TraceCheckUtils]: 17: Hoare triple {11105#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {11105#false} is VALID [2022-04-28 10:05:21,214 INFO L290 TraceCheckUtils]: 18: Hoare triple {11105#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {11105#false} is VALID [2022-04-28 10:05:21,214 INFO L290 TraceCheckUtils]: 19: Hoare triple {11105#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {11105#false} is VALID [2022-04-28 10:05:21,214 INFO L290 TraceCheckUtils]: 20: Hoare triple {11105#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {11105#false} is VALID [2022-04-28 10:05:21,214 INFO L290 TraceCheckUtils]: 21: Hoare triple {11105#false} assume !(~y~0 % 4294967296 > 0); {11105#false} is VALID [2022-04-28 10:05:21,214 INFO L272 TraceCheckUtils]: 22: Hoare triple {11105#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {11105#false} is VALID [2022-04-28 10:05:21,214 INFO L290 TraceCheckUtils]: 23: Hoare triple {11105#false} ~cond := #in~cond; {11105#false} is VALID [2022-04-28 10:05:21,214 INFO L290 TraceCheckUtils]: 24: Hoare triple {11105#false} assume 0 == ~cond; {11105#false} is VALID [2022-04-28 10:05:21,214 INFO L290 TraceCheckUtils]: 25: Hoare triple {11105#false} assume !false; {11105#false} is VALID [2022-04-28 10:05:21,215 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-28 10:05:21,215 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:05:21,376 INFO L290 TraceCheckUtils]: 25: Hoare triple {11105#false} assume !false; {11105#false} is VALID [2022-04-28 10:05:21,376 INFO L290 TraceCheckUtils]: 24: Hoare triple {11105#false} assume 0 == ~cond; {11105#false} is VALID [2022-04-28 10:05:21,376 INFO L290 TraceCheckUtils]: 23: Hoare triple {11105#false} ~cond := #in~cond; {11105#false} is VALID [2022-04-28 10:05:21,376 INFO L272 TraceCheckUtils]: 22: Hoare triple {11105#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {11105#false} is VALID [2022-04-28 10:05:21,376 INFO L290 TraceCheckUtils]: 21: Hoare triple {11105#false} assume !(~y~0 % 4294967296 > 0); {11105#false} is VALID [2022-04-28 10:05:21,376 INFO L290 TraceCheckUtils]: 20: Hoare triple {11105#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {11105#false} is VALID [2022-04-28 10:05:21,376 INFO L290 TraceCheckUtils]: 19: Hoare triple {11105#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {11105#false} is VALID [2022-04-28 10:05:21,377 INFO L290 TraceCheckUtils]: 18: Hoare triple {11221#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {11105#false} is VALID [2022-04-28 10:05:21,378 INFO L290 TraceCheckUtils]: 17: Hoare triple {11225#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {11221#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:05:21,378 INFO L290 TraceCheckUtils]: 16: Hoare triple {11229#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {11225#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:05:21,379 INFO L290 TraceCheckUtils]: 15: Hoare triple {11233#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {11229#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-28 10:05:21,380 INFO L290 TraceCheckUtils]: 14: Hoare triple {11237#(or (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11233#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))))} is VALID [2022-04-28 10:05:21,380 INFO L290 TraceCheckUtils]: 13: Hoare triple {11241#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {11237#(or (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:05:21,381 INFO L290 TraceCheckUtils]: 12: Hoare triple {11104#true} ~z~0 := ~y~0; {11241#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967294) 4294967296))))} is VALID [2022-04-28 10:05:21,381 INFO L290 TraceCheckUtils]: 11: Hoare triple {11104#true} assume !(~x~0 % 4294967296 > 0); {11104#true} is VALID [2022-04-28 10:05:21,381 INFO L290 TraceCheckUtils]: 10: Hoare triple {11104#true} 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; {11104#true} is VALID [2022-04-28 10:05:21,381 INFO L290 TraceCheckUtils]: 9: Hoare triple {11104#true} 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; {11104#true} is VALID [2022-04-28 10:05:21,381 INFO L290 TraceCheckUtils]: 8: Hoare triple {11104#true} 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; {11104#true} is VALID [2022-04-28 10:05:21,381 INFO L290 TraceCheckUtils]: 7: Hoare triple {11104#true} 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; {11104#true} is VALID [2022-04-28 10:05:21,381 INFO L290 TraceCheckUtils]: 6: Hoare triple {11104#true} 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; {11104#true} is VALID [2022-04-28 10:05:21,381 INFO L290 TraceCheckUtils]: 5: Hoare triple {11104#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {11104#true} is VALID [2022-04-28 10:05:21,381 INFO L272 TraceCheckUtils]: 4: Hoare triple {11104#true} call #t~ret11 := main(); {11104#true} is VALID [2022-04-28 10:05:21,381 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11104#true} {11104#true} #61#return; {11104#true} is VALID [2022-04-28 10:05:21,381 INFO L290 TraceCheckUtils]: 2: Hoare triple {11104#true} assume true; {11104#true} is VALID [2022-04-28 10:05:21,381 INFO L290 TraceCheckUtils]: 1: Hoare triple {11104#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(10, 2);call #Ultimate.allocInit(12, 3); {11104#true} is VALID [2022-04-28 10:05:21,381 INFO L272 TraceCheckUtils]: 0: Hoare triple {11104#true} call ULTIMATE.init(); {11104#true} is VALID [2022-04-28 10:05:21,381 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-04-28 10:05:21,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2115901891] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:05:21,382 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:05:21,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 8] total 21 [2022-04-28 10:05:21,382 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:05:21,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1257960398] [2022-04-28 10:05:21,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1257960398] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:05:21,382 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:05:21,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 10:05:21,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191850798] [2022-04-28 10:05:21,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:05:21,382 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.5) internal successors, (18), 11 states have internal predecessors, (18), 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 26 [2022-04-28 10:05:21,382 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:05:21,383 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 1.5) internal successors, (18), 11 states have internal predecessors, (18), 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-28 10:05:21,396 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:05:21,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 10:05:21,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:05:21,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 10:05:21,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2022-04-28 10:05:21,396 INFO L87 Difference]: Start difference. First operand 61 states and 77 transitions. Second operand has 12 states, 12 states have (on average 1.5) internal successors, (18), 11 states have internal predecessors, (18), 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-28 10:05:21,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:05:21,926 INFO L93 Difference]: Finished difference Result 80 states and 96 transitions. [2022-04-28 10:05:21,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 10:05:21,926 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.5) internal successors, (18), 11 states have internal predecessors, (18), 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 26 [2022-04-28 10:05:21,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:05:21,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.5) internal successors, (18), 11 states have internal predecessors, (18), 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-28 10:05:21,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 44 transitions. [2022-04-28 10:05:21,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.5) internal successors, (18), 11 states have internal predecessors, (18), 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-28 10:05:21,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 44 transitions. [2022-04-28 10:05:21,928 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 44 transitions. [2022-04-28 10:05:21,972 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-28 10:05:21,973 INFO L225 Difference]: With dead ends: 80 [2022-04-28 10:05:21,974 INFO L226 Difference]: Without dead ends: 69 [2022-04-28 10:05:21,974 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=139, Invalid=731, Unknown=0, NotChecked=0, Total=870 [2022-04-28 10:05:21,975 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 17 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 10:05:21,976 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 63 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 10:05:21,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-04-28 10:05:22,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 62. [2022-04-28 10:05:22,033 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:05:22,033 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand has 62 states, 57 states have (on average 1.2982456140350878) internal successors, (74), 57 states have internal predecessors, (74), 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-28 10:05:22,033 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand has 62 states, 57 states have (on average 1.2982456140350878) internal successors, (74), 57 states have internal predecessors, (74), 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-28 10:05:22,033 INFO L87 Difference]: Start difference. First operand 69 states. Second operand has 62 states, 57 states have (on average 1.2982456140350878) internal successors, (74), 57 states have internal predecessors, (74), 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-28 10:05:22,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:05:22,034 INFO L93 Difference]: Finished difference Result 69 states and 85 transitions. [2022-04-28 10:05:22,034 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 85 transitions. [2022-04-28 10:05:22,034 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:05:22,034 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:05:22,035 INFO L74 IsIncluded]: Start isIncluded. First operand has 62 states, 57 states have (on average 1.2982456140350878) internal successors, (74), 57 states have internal predecessors, (74), 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 69 states. [2022-04-28 10:05:22,035 INFO L87 Difference]: Start difference. First operand has 62 states, 57 states have (on average 1.2982456140350878) internal successors, (74), 57 states have internal predecessors, (74), 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 69 states. [2022-04-28 10:05:22,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:05:22,035 INFO L93 Difference]: Finished difference Result 69 states and 85 transitions. [2022-04-28 10:05:22,035 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 85 transitions. [2022-04-28 10:05:22,035 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:05:22,036 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:05:22,036 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:05:22,036 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:05:22,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 57 states have (on average 1.2982456140350878) internal successors, (74), 57 states have internal predecessors, (74), 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-28 10:05:22,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 78 transitions. [2022-04-28 10:05:22,036 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 78 transitions. Word has length 26 [2022-04-28 10:05:22,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:05:22,036 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 78 transitions. [2022-04-28 10:05:22,037 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.5) internal successors, (18), 11 states have internal predecessors, (18), 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-28 10:05:22,037 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 62 states and 78 transitions. [2022-04-28 10:05:24,257 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 77 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 10:05:24,257 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 78 transitions. [2022-04-28 10:05:24,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-28 10:05:24,258 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:05:24,258 INFO L195 NwaCegarLoop]: trace histogram [12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:05:24,275 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-04-28 10:05:24,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-04-28 10:05:24,458 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:05:24,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:05:24,458 INFO L85 PathProgramCache]: Analyzing trace with hash -1107905011, now seen corresponding path program 23 times [2022-04-28 10:05:24,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:05:24,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [847012667] [2022-04-28 10:05:24,461 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:05:24,461 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:05:24,461 INFO L85 PathProgramCache]: Analyzing trace with hash -1107905011, now seen corresponding path program 24 times [2022-04-28 10:05:24,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:05:24,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325921862] [2022-04-28 10:05:24,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:05:24,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:05:24,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:05:24,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:05:24,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:05:24,692 INFO L290 TraceCheckUtils]: 0: Hoare triple {11742#(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(10, 2);call #Ultimate.allocInit(12, 3); {11723#true} is VALID [2022-04-28 10:05:24,692 INFO L290 TraceCheckUtils]: 1: Hoare triple {11723#true} assume true; {11723#true} is VALID [2022-04-28 10:05:24,693 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11723#true} {11723#true} #61#return; {11723#true} is VALID [2022-04-28 10:05:24,693 INFO L272 TraceCheckUtils]: 0: Hoare triple {11723#true} call ULTIMATE.init(); {11742#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:05:24,693 INFO L290 TraceCheckUtils]: 1: Hoare triple {11742#(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(10, 2);call #Ultimate.allocInit(12, 3); {11723#true} is VALID [2022-04-28 10:05:24,693 INFO L290 TraceCheckUtils]: 2: Hoare triple {11723#true} assume true; {11723#true} is VALID [2022-04-28 10:05:24,693 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11723#true} {11723#true} #61#return; {11723#true} is VALID [2022-04-28 10:05:24,693 INFO L272 TraceCheckUtils]: 4: Hoare triple {11723#true} call #t~ret11 := main(); {11723#true} is VALID [2022-04-28 10:05:24,693 INFO L290 TraceCheckUtils]: 5: Hoare triple {11723#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {11728#(= main_~y~0 0)} is VALID [2022-04-28 10:05:24,694 INFO L290 TraceCheckUtils]: 6: Hoare triple {11728#(= 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; {11729#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:05:24,694 INFO L290 TraceCheckUtils]: 7: Hoare triple {11729#(and (<= 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; {11730#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:05:24,695 INFO L290 TraceCheckUtils]: 8: Hoare triple {11730#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {11731#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:05:24,695 INFO L290 TraceCheckUtils]: 9: Hoare triple {11731#(and (<= main_~y~0 3) (<= 3 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; {11732#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:05:24,696 INFO L290 TraceCheckUtils]: 10: Hoare triple {11732#(and (<= main_~y~0 4) (<= 4 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; {11733#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:05:24,697 INFO L290 TraceCheckUtils]: 11: Hoare triple {11733#(and (<= 5 main_~y~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; {11734#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:05:24,697 INFO L290 TraceCheckUtils]: 12: Hoare triple {11734#(and (<= main_~y~0 6) (<= 6 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; {11735#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:05:24,698 INFO L290 TraceCheckUtils]: 13: Hoare triple {11735#(and (<= 7 main_~y~0) (<= main_~y~0 7))} 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; {11736#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:05:24,698 INFO L290 TraceCheckUtils]: 14: Hoare triple {11736#(and (<= main_~y~0 8) (<= 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; {11737#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:05:24,699 INFO L290 TraceCheckUtils]: 15: Hoare triple {11737#(and (<= 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; {11738#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:05:24,699 INFO L290 TraceCheckUtils]: 16: Hoare triple {11738#(and (<= main_~y~0 10) (<= 10 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; {11739#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:05:24,700 INFO L290 TraceCheckUtils]: 17: Hoare triple {11739#(and (<= main_~y~0 11) (<= 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; {11740#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:05:24,700 INFO L290 TraceCheckUtils]: 18: Hoare triple {11740#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !(~x~0 % 4294967296 > 0); {11740#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:05:24,700 INFO L290 TraceCheckUtils]: 19: Hoare triple {11740#(and (<= 12 main_~y~0) (<= main_~y~0 12))} ~z~0 := ~y~0; {11741#(and (<= (div main_~z~0 4294967296) 0) (<= 12 main_~z~0))} is VALID [2022-04-28 10:05:24,701 INFO L290 TraceCheckUtils]: 20: Hoare triple {11741#(and (<= (div main_~z~0 4294967296) 0) (<= 12 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {11724#false} is VALID [2022-04-28 10:05:24,701 INFO L290 TraceCheckUtils]: 21: Hoare triple {11724#false} assume !(~y~0 % 4294967296 > 0); {11724#false} is VALID [2022-04-28 10:05:24,701 INFO L272 TraceCheckUtils]: 22: Hoare triple {11724#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {11724#false} is VALID [2022-04-28 10:05:24,701 INFO L290 TraceCheckUtils]: 23: Hoare triple {11724#false} ~cond := #in~cond; {11724#false} is VALID [2022-04-28 10:05:24,701 INFO L290 TraceCheckUtils]: 24: Hoare triple {11724#false} assume 0 == ~cond; {11724#false} is VALID [2022-04-28 10:05:24,701 INFO L290 TraceCheckUtils]: 25: Hoare triple {11724#false} assume !false; {11724#false} is VALID [2022-04-28 10:05:24,701 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:05:24,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:05:24,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325921862] [2022-04-28 10:05:24,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325921862] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:05:24,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1795655586] [2022-04-28 10:05:24,702 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:05:24,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:05:24,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:05:24,703 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:05:24,704 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-04-28 10:05:24,782 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-28 10:05:24,782 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:05:24,783 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-28 10:05:24,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:05:24,790 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:05:25,019 INFO L272 TraceCheckUtils]: 0: Hoare triple {11723#true} call ULTIMATE.init(); {11723#true} is VALID [2022-04-28 10:05:25,020 INFO L290 TraceCheckUtils]: 1: Hoare triple {11723#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(10, 2);call #Ultimate.allocInit(12, 3); {11723#true} is VALID [2022-04-28 10:05:25,020 INFO L290 TraceCheckUtils]: 2: Hoare triple {11723#true} assume true; {11723#true} is VALID [2022-04-28 10:05:25,020 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11723#true} {11723#true} #61#return; {11723#true} is VALID [2022-04-28 10:05:25,020 INFO L272 TraceCheckUtils]: 4: Hoare triple {11723#true} call #t~ret11 := main(); {11723#true} is VALID [2022-04-28 10:05:25,020 INFO L290 TraceCheckUtils]: 5: Hoare triple {11723#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {11728#(= main_~y~0 0)} is VALID [2022-04-28 10:05:25,020 INFO L290 TraceCheckUtils]: 6: Hoare triple {11728#(= 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; {11729#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:05:25,021 INFO L290 TraceCheckUtils]: 7: Hoare triple {11729#(and (<= 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; {11730#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:05:25,021 INFO L290 TraceCheckUtils]: 8: Hoare triple {11730#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {11731#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:05:25,022 INFO L290 TraceCheckUtils]: 9: Hoare triple {11731#(and (<= main_~y~0 3) (<= 3 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; {11732#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:05:25,022 INFO L290 TraceCheckUtils]: 10: Hoare triple {11732#(and (<= main_~y~0 4) (<= 4 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; {11733#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:05:25,023 INFO L290 TraceCheckUtils]: 11: Hoare triple {11733#(and (<= 5 main_~y~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; {11734#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:05:25,023 INFO L290 TraceCheckUtils]: 12: Hoare triple {11734#(and (<= main_~y~0 6) (<= 6 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; {11735#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:05:25,024 INFO L290 TraceCheckUtils]: 13: Hoare triple {11735#(and (<= 7 main_~y~0) (<= main_~y~0 7))} 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; {11736#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:05:25,024 INFO L290 TraceCheckUtils]: 14: Hoare triple {11736#(and (<= main_~y~0 8) (<= 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; {11737#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:05:25,025 INFO L290 TraceCheckUtils]: 15: Hoare triple {11737#(and (<= 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; {11738#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:05:25,025 INFO L290 TraceCheckUtils]: 16: Hoare triple {11738#(and (<= main_~y~0 10) (<= 10 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; {11739#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:05:25,026 INFO L290 TraceCheckUtils]: 17: Hoare triple {11739#(and (<= main_~y~0 11) (<= 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; {11740#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:05:25,026 INFO L290 TraceCheckUtils]: 18: Hoare triple {11740#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !(~x~0 % 4294967296 > 0); {11740#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:05:25,026 INFO L290 TraceCheckUtils]: 19: Hoare triple {11740#(and (<= 12 main_~y~0) (<= main_~y~0 12))} ~z~0 := ~y~0; {11803#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-28 10:05:25,027 INFO L290 TraceCheckUtils]: 20: Hoare triple {11803#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {11724#false} is VALID [2022-04-28 10:05:25,027 INFO L290 TraceCheckUtils]: 21: Hoare triple {11724#false} assume !(~y~0 % 4294967296 > 0); {11724#false} is VALID [2022-04-28 10:05:25,027 INFO L272 TraceCheckUtils]: 22: Hoare triple {11724#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {11724#false} is VALID [2022-04-28 10:05:25,027 INFO L290 TraceCheckUtils]: 23: Hoare triple {11724#false} ~cond := #in~cond; {11724#false} is VALID [2022-04-28 10:05:25,027 INFO L290 TraceCheckUtils]: 24: Hoare triple {11724#false} assume 0 == ~cond; {11724#false} is VALID [2022-04-28 10:05:25,027 INFO L290 TraceCheckUtils]: 25: Hoare triple {11724#false} assume !false; {11724#false} is VALID [2022-04-28 10:05:25,027 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:05:25,027 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:05:25,397 INFO L290 TraceCheckUtils]: 25: Hoare triple {11724#false} assume !false; {11724#false} is VALID [2022-04-28 10:05:25,397 INFO L290 TraceCheckUtils]: 24: Hoare triple {11724#false} assume 0 == ~cond; {11724#false} is VALID [2022-04-28 10:05:25,397 INFO L290 TraceCheckUtils]: 23: Hoare triple {11724#false} ~cond := #in~cond; {11724#false} is VALID [2022-04-28 10:05:25,397 INFO L272 TraceCheckUtils]: 22: Hoare triple {11724#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {11724#false} is VALID [2022-04-28 10:05:25,397 INFO L290 TraceCheckUtils]: 21: Hoare triple {11724#false} assume !(~y~0 % 4294967296 > 0); {11724#false} is VALID [2022-04-28 10:05:25,397 INFO L290 TraceCheckUtils]: 20: Hoare triple {11837#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {11724#false} is VALID [2022-04-28 10:05:25,398 INFO L290 TraceCheckUtils]: 19: Hoare triple {11841#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {11837#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:05:25,398 INFO L290 TraceCheckUtils]: 18: Hoare triple {11841#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {11841#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:05:25,399 INFO L290 TraceCheckUtils]: 17: Hoare triple {11848#(< 0 (mod (+ main_~y~0 1) 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; {11841#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:05:25,399 INFO L290 TraceCheckUtils]: 16: Hoare triple {11852#(< 0 (mod (+ main_~y~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; {11848#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:05:25,400 INFO L290 TraceCheckUtils]: 15: Hoare triple {11856#(< 0 (mod (+ main_~y~0 3) 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; {11852#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:05:25,400 INFO L290 TraceCheckUtils]: 14: Hoare triple {11860#(< 0 (mod (+ main_~y~0 4) 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; {11856#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:05:25,401 INFO L290 TraceCheckUtils]: 13: Hoare triple {11864#(< 0 (mod (+ 5 main_~y~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; {11860#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:05:25,402 INFO L290 TraceCheckUtils]: 12: Hoare triple {11868#(< 0 (mod (+ main_~y~0 6) 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; {11864#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:05:25,402 INFO L290 TraceCheckUtils]: 11: Hoare triple {11872#(< 0 (mod (+ 7 main_~y~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; {11868#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:05:25,403 INFO L290 TraceCheckUtils]: 10: Hoare triple {11876#(< 0 (mod (+ main_~y~0 8) 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; {11872#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:05:25,404 INFO L290 TraceCheckUtils]: 9: Hoare triple {11880#(< 0 (mod (+ main_~y~0 9) 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; {11876#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:05:25,404 INFO L290 TraceCheckUtils]: 8: Hoare triple {11884#(< 0 (mod (+ main_~y~0 10) 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; {11880#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:05:25,405 INFO L290 TraceCheckUtils]: 7: Hoare triple {11888#(< 0 (mod (+ main_~y~0 11) 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; {11884#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-28 10:05:25,405 INFO L290 TraceCheckUtils]: 6: Hoare triple {11892#(< 0 (mod (+ main_~y~0 12) 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; {11888#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-28 10:05:25,406 INFO L290 TraceCheckUtils]: 5: Hoare triple {11723#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {11892#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-28 10:05:25,406 INFO L272 TraceCheckUtils]: 4: Hoare triple {11723#true} call #t~ret11 := main(); {11723#true} is VALID [2022-04-28 10:05:25,406 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11723#true} {11723#true} #61#return; {11723#true} is VALID [2022-04-28 10:05:25,406 INFO L290 TraceCheckUtils]: 2: Hoare triple {11723#true} assume true; {11723#true} is VALID [2022-04-28 10:05:25,406 INFO L290 TraceCheckUtils]: 1: Hoare triple {11723#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(10, 2);call #Ultimate.allocInit(12, 3); {11723#true} is VALID [2022-04-28 10:05:25,406 INFO L272 TraceCheckUtils]: 0: Hoare triple {11723#true} call ULTIMATE.init(); {11723#true} is VALID [2022-04-28 10:05:25,406 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:05:25,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1795655586] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:05:25,406 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:05:25,406 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 32 [2022-04-28 10:05:25,407 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:05:25,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [847012667] [2022-04-28 10:05:25,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [847012667] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:05:25,407 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:05:25,407 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-28 10:05:25,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025282593] [2022-04-28 10:05:25,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:05:25,407 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 16 states have internal predecessors, (22), 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 26 [2022-04-28 10:05:25,407 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:05:25,407 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 16 states have internal predecessors, (22), 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-28 10:05:25,422 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:05:25,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-28 10:05:25,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:05:25,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-28 10:05:25,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=760, Unknown=0, NotChecked=0, Total=992 [2022-04-28 10:05:25,423 INFO L87 Difference]: Start difference. First operand 62 states and 78 transitions. Second operand has 17 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 16 states have internal predecessors, (22), 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-28 10:05:26,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:05:26,880 INFO L93 Difference]: Finished difference Result 86 states and 118 transitions. [2022-04-28 10:05:26,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-28 10:05:26,880 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 16 states have internal predecessors, (22), 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 26 [2022-04-28 10:05:26,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:05:26,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 16 states have internal predecessors, (22), 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-28 10:05:26,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 97 transitions. [2022-04-28 10:05:26,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 16 states have internal predecessors, (22), 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-28 10:05:26,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 97 transitions. [2022-04-28 10:05:26,882 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 97 transitions. [2022-04-28 10:05:26,953 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:05:26,971 INFO L225 Difference]: With dead ends: 86 [2022-04-28 10:05:26,971 INFO L226 Difference]: Without dead ends: 80 [2022-04-28 10:05:26,972 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=472, Invalid=1598, Unknown=0, NotChecked=0, Total=2070 [2022-04-28 10:05:26,972 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 76 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 860 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 915 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 860 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-28 10:05:26,972 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 105 Invalid, 915 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 860 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-28 10:05:26,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-04-28 10:05:27,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 67. [2022-04-28 10:05:27,030 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:05:27,030 INFO L82 GeneralOperation]: Start isEquivalent. First operand 80 states. Second operand has 67 states, 62 states have (on average 1.3064516129032258) internal successors, (81), 62 states have internal predecessors, (81), 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-28 10:05:27,030 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand has 67 states, 62 states have (on average 1.3064516129032258) internal successors, (81), 62 states have internal predecessors, (81), 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-28 10:05:27,030 INFO L87 Difference]: Start difference. First operand 80 states. Second operand has 67 states, 62 states have (on average 1.3064516129032258) internal successors, (81), 62 states have internal predecessors, (81), 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-28 10:05:27,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:05:27,031 INFO L93 Difference]: Finished difference Result 80 states and 98 transitions. [2022-04-28 10:05:27,031 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 98 transitions. [2022-04-28 10:05:27,031 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:05:27,031 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:05:27,031 INFO L74 IsIncluded]: Start isIncluded. First operand has 67 states, 62 states have (on average 1.3064516129032258) internal successors, (81), 62 states have internal predecessors, (81), 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 80 states. [2022-04-28 10:05:27,031 INFO L87 Difference]: Start difference. First operand has 67 states, 62 states have (on average 1.3064516129032258) internal successors, (81), 62 states have internal predecessors, (81), 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 80 states. [2022-04-28 10:05:27,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:05:27,032 INFO L93 Difference]: Finished difference Result 80 states and 98 transitions. [2022-04-28 10:05:27,032 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 98 transitions. [2022-04-28 10:05:27,032 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:05:27,032 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:05:27,032 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:05:27,032 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:05:27,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 62 states have (on average 1.3064516129032258) internal successors, (81), 62 states have internal predecessors, (81), 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-28 10:05:27,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 85 transitions. [2022-04-28 10:05:27,033 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 85 transitions. Word has length 26 [2022-04-28 10:05:27,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:05:27,033 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 85 transitions. [2022-04-28 10:05:27,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 16 states have internal predecessors, (22), 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-28 10:05:27,033 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 67 states and 85 transitions. [2022-04-28 10:05:27,346 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:05:27,346 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 85 transitions. [2022-04-28 10:05:27,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-28 10:05:27,346 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:05:27,346 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:05:27,351 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-04-28 10:05:27,546 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-04-28 10:05:27,547 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:05:27,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:05:27,547 INFO L85 PathProgramCache]: Analyzing trace with hash -921018945, now seen corresponding path program 27 times [2022-04-28 10:05:27,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:05:27,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2142506321] [2022-04-28 10:05:27,550 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:05:27,550 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:05:27,550 INFO L85 PathProgramCache]: Analyzing trace with hash -921018945, now seen corresponding path program 28 times [2022-04-28 10:05:27,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:05:27,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518161101] [2022-04-28 10:05:27,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:05:27,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:05:27,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:05:27,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:05:27,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:05:27,678 INFO L290 TraceCheckUtils]: 0: Hoare triple {12422#(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(10, 2);call #Ultimate.allocInit(12, 3); {12407#true} is VALID [2022-04-28 10:05:27,678 INFO L290 TraceCheckUtils]: 1: Hoare triple {12407#true} assume true; {12407#true} is VALID [2022-04-28 10:05:27,678 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12407#true} {12407#true} #61#return; {12407#true} is VALID [2022-04-28 10:05:27,678 INFO L272 TraceCheckUtils]: 0: Hoare triple {12407#true} call ULTIMATE.init(); {12422#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:05:27,678 INFO L290 TraceCheckUtils]: 1: Hoare triple {12422#(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(10, 2);call #Ultimate.allocInit(12, 3); {12407#true} is VALID [2022-04-28 10:05:27,679 INFO L290 TraceCheckUtils]: 2: Hoare triple {12407#true} assume true; {12407#true} is VALID [2022-04-28 10:05:27,679 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12407#true} {12407#true} #61#return; {12407#true} is VALID [2022-04-28 10:05:27,679 INFO L272 TraceCheckUtils]: 4: Hoare triple {12407#true} call #t~ret11 := main(); {12407#true} is VALID [2022-04-28 10:05:27,679 INFO L290 TraceCheckUtils]: 5: Hoare triple {12407#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {12412#(= main_~y~0 0)} is VALID [2022-04-28 10:05:27,679 INFO L290 TraceCheckUtils]: 6: Hoare triple {12412#(= 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; {12413#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:05:27,680 INFO L290 TraceCheckUtils]: 7: Hoare triple {12413#(and (<= 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; {12414#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:05:27,680 INFO L290 TraceCheckUtils]: 8: Hoare triple {12414#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {12415#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:05:27,681 INFO L290 TraceCheckUtils]: 9: Hoare triple {12415#(and (<= main_~y~0 3) (<= 3 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; {12416#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:05:27,681 INFO L290 TraceCheckUtils]: 10: Hoare triple {12416#(and (<= main_~y~0 4) (<= 4 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; {12417#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:05:27,682 INFO L290 TraceCheckUtils]: 11: Hoare triple {12417#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {12417#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:05:27,682 INFO L290 TraceCheckUtils]: 12: Hoare triple {12417#(and (<= 5 main_~y~0) (<= main_~y~0 5))} ~z~0 := ~y~0; {12418#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:05:27,682 INFO L290 TraceCheckUtils]: 13: Hoare triple {12418#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12419#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:05:27,683 INFO L290 TraceCheckUtils]: 14: Hoare triple {12419#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12420#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:05:27,683 INFO L290 TraceCheckUtils]: 15: Hoare triple {12420#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12421#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} is VALID [2022-04-28 10:05:27,684 INFO L290 TraceCheckUtils]: 16: Hoare triple {12421#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {12408#false} is VALID [2022-04-28 10:05:27,684 INFO L290 TraceCheckUtils]: 17: Hoare triple {12408#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {12408#false} is VALID [2022-04-28 10:05:27,684 INFO L290 TraceCheckUtils]: 18: Hoare triple {12408#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {12408#false} is VALID [2022-04-28 10:05:27,684 INFO L290 TraceCheckUtils]: 19: Hoare triple {12408#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {12408#false} is VALID [2022-04-28 10:05:27,684 INFO L290 TraceCheckUtils]: 20: Hoare triple {12408#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {12408#false} is VALID [2022-04-28 10:05:27,684 INFO L290 TraceCheckUtils]: 21: Hoare triple {12408#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {12408#false} is VALID [2022-04-28 10:05:27,684 INFO L290 TraceCheckUtils]: 22: Hoare triple {12408#false} assume !(~y~0 % 4294967296 > 0); {12408#false} is VALID [2022-04-28 10:05:27,684 INFO L272 TraceCheckUtils]: 23: Hoare triple {12408#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {12408#false} is VALID [2022-04-28 10:05:27,684 INFO L290 TraceCheckUtils]: 24: Hoare triple {12408#false} ~cond := #in~cond; {12408#false} is VALID [2022-04-28 10:05:27,684 INFO L290 TraceCheckUtils]: 25: Hoare triple {12408#false} assume 0 == ~cond; {12408#false} is VALID [2022-04-28 10:05:27,684 INFO L290 TraceCheckUtils]: 26: Hoare triple {12408#false} assume !false; {12408#false} is VALID [2022-04-28 10:05:27,685 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-28 10:05:27,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:05:27,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518161101] [2022-04-28 10:05:27,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518161101] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:05:27,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1255820403] [2022-04-28 10:05:27,685 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:05:27,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:05:27,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:05:27,686 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:05:27,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-04-28 10:05:27,720 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:05:27,720 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:05:27,721 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-28 10:05:27,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:05:27,726 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:05:27,889 INFO L272 TraceCheckUtils]: 0: Hoare triple {12407#true} call ULTIMATE.init(); {12407#true} is VALID [2022-04-28 10:05:27,889 INFO L290 TraceCheckUtils]: 1: Hoare triple {12407#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(10, 2);call #Ultimate.allocInit(12, 3); {12407#true} is VALID [2022-04-28 10:05:27,890 INFO L290 TraceCheckUtils]: 2: Hoare triple {12407#true} assume true; {12407#true} is VALID [2022-04-28 10:05:27,890 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12407#true} {12407#true} #61#return; {12407#true} is VALID [2022-04-28 10:05:27,890 INFO L272 TraceCheckUtils]: 4: Hoare triple {12407#true} call #t~ret11 := main(); {12407#true} is VALID [2022-04-28 10:05:27,890 INFO L290 TraceCheckUtils]: 5: Hoare triple {12407#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {12412#(= main_~y~0 0)} is VALID [2022-04-28 10:05:27,890 INFO L290 TraceCheckUtils]: 6: Hoare triple {12412#(= 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; {12413#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:05:27,891 INFO L290 TraceCheckUtils]: 7: Hoare triple {12413#(and (<= 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; {12414#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:05:27,891 INFO L290 TraceCheckUtils]: 8: Hoare triple {12414#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {12415#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:05:27,892 INFO L290 TraceCheckUtils]: 9: Hoare triple {12415#(and (<= main_~y~0 3) (<= 3 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; {12416#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:05:27,892 INFO L290 TraceCheckUtils]: 10: Hoare triple {12416#(and (<= main_~y~0 4) (<= 4 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; {12417#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:05:27,893 INFO L290 TraceCheckUtils]: 11: Hoare triple {12417#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {12417#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:05:27,893 INFO L290 TraceCheckUtils]: 12: Hoare triple {12417#(and (<= 5 main_~y~0) (<= main_~y~0 5))} ~z~0 := ~y~0; {12462#(and (= main_~z~0 main_~y~0) (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:05:27,893 INFO L290 TraceCheckUtils]: 13: Hoare triple {12462#(and (= main_~z~0 main_~y~0) (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12466#(and (<= 5 main_~y~0) (<= main_~y~0 5) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-28 10:05:27,894 INFO L290 TraceCheckUtils]: 14: Hoare triple {12466#(and (<= 5 main_~y~0) (<= main_~y~0 5) (= main_~y~0 (+ main_~z~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12470#(and (<= 5 main_~y~0) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)) (<= main_~y~0 5))} is VALID [2022-04-28 10:05:27,894 INFO L290 TraceCheckUtils]: 15: Hoare triple {12470#(and (<= 5 main_~y~0) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)) (<= main_~y~0 5))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12474#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:05:27,895 INFO L290 TraceCheckUtils]: 16: Hoare triple {12474#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~z~0 % 4294967296 > 0); {12408#false} is VALID [2022-04-28 10:05:27,895 INFO L290 TraceCheckUtils]: 17: Hoare triple {12408#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {12408#false} is VALID [2022-04-28 10:05:27,895 INFO L290 TraceCheckUtils]: 18: Hoare triple {12408#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {12408#false} is VALID [2022-04-28 10:05:27,895 INFO L290 TraceCheckUtils]: 19: Hoare triple {12408#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {12408#false} is VALID [2022-04-28 10:05:27,895 INFO L290 TraceCheckUtils]: 20: Hoare triple {12408#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {12408#false} is VALID [2022-04-28 10:05:27,895 INFO L290 TraceCheckUtils]: 21: Hoare triple {12408#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {12408#false} is VALID [2022-04-28 10:05:27,895 INFO L290 TraceCheckUtils]: 22: Hoare triple {12408#false} assume !(~y~0 % 4294967296 > 0); {12408#false} is VALID [2022-04-28 10:05:27,895 INFO L272 TraceCheckUtils]: 23: Hoare triple {12408#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {12408#false} is VALID [2022-04-28 10:05:27,895 INFO L290 TraceCheckUtils]: 24: Hoare triple {12408#false} ~cond := #in~cond; {12408#false} is VALID [2022-04-28 10:05:27,895 INFO L290 TraceCheckUtils]: 25: Hoare triple {12408#false} assume 0 == ~cond; {12408#false} is VALID [2022-04-28 10:05:27,895 INFO L290 TraceCheckUtils]: 26: Hoare triple {12408#false} assume !false; {12408#false} is VALID [2022-04-28 10:05:27,896 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-28 10:05:27,896 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:05:28,123 INFO L290 TraceCheckUtils]: 26: Hoare triple {12408#false} assume !false; {12408#false} is VALID [2022-04-28 10:05:28,123 INFO L290 TraceCheckUtils]: 25: Hoare triple {12408#false} assume 0 == ~cond; {12408#false} is VALID [2022-04-28 10:05:28,123 INFO L290 TraceCheckUtils]: 24: Hoare triple {12408#false} ~cond := #in~cond; {12408#false} is VALID [2022-04-28 10:05:28,123 INFO L272 TraceCheckUtils]: 23: Hoare triple {12408#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {12408#false} is VALID [2022-04-28 10:05:28,124 INFO L290 TraceCheckUtils]: 22: Hoare triple {12408#false} assume !(~y~0 % 4294967296 > 0); {12408#false} is VALID [2022-04-28 10:05:28,124 INFO L290 TraceCheckUtils]: 21: Hoare triple {12408#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {12408#false} is VALID [2022-04-28 10:05:28,124 INFO L290 TraceCheckUtils]: 20: Hoare triple {12526#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {12408#false} is VALID [2022-04-28 10:05:28,125 INFO L290 TraceCheckUtils]: 19: Hoare triple {12530#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {12526#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:05:28,126 INFO L290 TraceCheckUtils]: 18: Hoare triple {12534#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {12530#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:05:28,126 INFO L290 TraceCheckUtils]: 17: Hoare triple {12538#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {12534#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-28 10:05:28,127 INFO L290 TraceCheckUtils]: 16: Hoare triple {12542#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {12538#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-28 10:05:28,127 INFO L290 TraceCheckUtils]: 15: Hoare triple {12546#(or (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12542#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))))} is VALID [2022-04-28 10:05:28,128 INFO L290 TraceCheckUtils]: 14: Hoare triple {12550#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12546#(or (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:05:28,129 INFO L290 TraceCheckUtils]: 13: Hoare triple {12554#(or (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12550#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))))} is VALID [2022-04-28 10:05:28,129 INFO L290 TraceCheckUtils]: 12: Hoare triple {12407#true} ~z~0 := ~y~0; {12554#(or (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} is VALID [2022-04-28 10:05:28,129 INFO L290 TraceCheckUtils]: 11: Hoare triple {12407#true} assume !(~x~0 % 4294967296 > 0); {12407#true} is VALID [2022-04-28 10:05:28,129 INFO L290 TraceCheckUtils]: 10: Hoare triple {12407#true} 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; {12407#true} is VALID [2022-04-28 10:05:28,129 INFO L290 TraceCheckUtils]: 9: Hoare triple {12407#true} 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; {12407#true} is VALID [2022-04-28 10:05:28,129 INFO L290 TraceCheckUtils]: 8: Hoare triple {12407#true} 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; {12407#true} is VALID [2022-04-28 10:05:28,130 INFO L290 TraceCheckUtils]: 7: Hoare triple {12407#true} 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; {12407#true} is VALID [2022-04-28 10:05:28,130 INFO L290 TraceCheckUtils]: 6: Hoare triple {12407#true} 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; {12407#true} is VALID [2022-04-28 10:05:28,130 INFO L290 TraceCheckUtils]: 5: Hoare triple {12407#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {12407#true} is VALID [2022-04-28 10:05:28,130 INFO L272 TraceCheckUtils]: 4: Hoare triple {12407#true} call #t~ret11 := main(); {12407#true} is VALID [2022-04-28 10:05:28,130 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12407#true} {12407#true} #61#return; {12407#true} is VALID [2022-04-28 10:05:28,130 INFO L290 TraceCheckUtils]: 2: Hoare triple {12407#true} assume true; {12407#true} is VALID [2022-04-28 10:05:28,130 INFO L290 TraceCheckUtils]: 1: Hoare triple {12407#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(10, 2);call #Ultimate.allocInit(12, 3); {12407#true} is VALID [2022-04-28 10:05:28,130 INFO L272 TraceCheckUtils]: 0: Hoare triple {12407#true} call ULTIMATE.init(); {12407#true} is VALID [2022-04-28 10:05:28,130 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-28 10:05:28,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1255820403] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:05:28,130 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:05:28,130 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 10] total 25 [2022-04-28 10:05:28,130 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:05:28,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2142506321] [2022-04-28 10:05:28,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2142506321] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:05:28,131 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:05:28,131 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 10:05:28,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784819134] [2022-04-28 10:05:28,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:05:28,131 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 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 27 [2022-04-28 10:05:28,131 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:05:28,131 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 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-28 10:05:28,149 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-28 10:05:28,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 10:05:28,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:05:28,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 10:05:28,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=500, Unknown=0, NotChecked=0, Total=600 [2022-04-28 10:05:28,149 INFO L87 Difference]: Start difference. First operand 67 states and 85 transitions. Second operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 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-28 10:05:28,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:05:28,698 INFO L93 Difference]: Finished difference Result 86 states and 104 transitions. [2022-04-28 10:05:28,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 10:05:28,698 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 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 27 [2022-04-28 10:05:28,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:05:28,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 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-28 10:05:28,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 45 transitions. [2022-04-28 10:05:28,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 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-28 10:05:28,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 45 transitions. [2022-04-28 10:05:28,699 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 45 transitions. [2022-04-28 10:05:28,734 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:05:28,735 INFO L225 Difference]: With dead ends: 86 [2022-04-28 10:05:28,735 INFO L226 Difference]: Without dead ends: 75 [2022-04-28 10:05:28,736 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=178, Invalid=1012, Unknown=0, NotChecked=0, Total=1190 [2022-04-28 10:05:28,736 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 17 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 10:05:28,736 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 58 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 10:05:28,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-04-28 10:05:28,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 68. [2022-04-28 10:05:28,796 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:05:28,796 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 states. Second operand has 68 states, 63 states have (on average 1.3015873015873016) internal successors, (82), 63 states have internal predecessors, (82), 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-28 10:05:28,796 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand has 68 states, 63 states have (on average 1.3015873015873016) internal successors, (82), 63 states have internal predecessors, (82), 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-28 10:05:28,796 INFO L87 Difference]: Start difference. First operand 75 states. Second operand has 68 states, 63 states have (on average 1.3015873015873016) internal successors, (82), 63 states have internal predecessors, (82), 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-28 10:05:28,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:05:28,797 INFO L93 Difference]: Finished difference Result 75 states and 93 transitions. [2022-04-28 10:05:28,797 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 93 transitions. [2022-04-28 10:05:28,798 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:05:28,798 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:05:28,798 INFO L74 IsIncluded]: Start isIncluded. First operand has 68 states, 63 states have (on average 1.3015873015873016) internal successors, (82), 63 states have internal predecessors, (82), 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 75 states. [2022-04-28 10:05:28,798 INFO L87 Difference]: Start difference. First operand has 68 states, 63 states have (on average 1.3015873015873016) internal successors, (82), 63 states have internal predecessors, (82), 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 75 states. [2022-04-28 10:05:28,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:05:28,799 INFO L93 Difference]: Finished difference Result 75 states and 93 transitions. [2022-04-28 10:05:28,799 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 93 transitions. [2022-04-28 10:05:28,799 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:05:28,799 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:05:28,799 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:05:28,799 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:05:28,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 63 states have (on average 1.3015873015873016) internal successors, (82), 63 states have internal predecessors, (82), 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-28 10:05:28,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 86 transitions. [2022-04-28 10:05:28,800 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 86 transitions. Word has length 27 [2022-04-28 10:05:28,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:05:28,800 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 86 transitions. [2022-04-28 10:05:28,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 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-28 10:05:28,800 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 68 states and 86 transitions. [2022-04-28 10:05:29,251 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:05:29,251 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 86 transitions. [2022-04-28 10:05:29,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-28 10:05:29,251 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:05:29,251 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:05:29,269 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-04-28 10:05:29,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-04-28 10:05:29,452 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:05:29,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:05:29,452 INFO L85 PathProgramCache]: Analyzing trace with hash 8867439, now seen corresponding path program 29 times [2022-04-28 10:05:29,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:05:29,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [494006089] [2022-04-28 10:05:29,454 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:05:29,454 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:05:29,454 INFO L85 PathProgramCache]: Analyzing trace with hash 8867439, now seen corresponding path program 30 times [2022-04-28 10:05:29,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:05:29,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272772421] [2022-04-28 10:05:29,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:05:29,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:05:29,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:05:29,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:05:29,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:05:29,585 INFO L290 TraceCheckUtils]: 0: Hoare triple {13088#(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(10, 2);call #Ultimate.allocInit(12, 3); {13074#true} is VALID [2022-04-28 10:05:29,585 INFO L290 TraceCheckUtils]: 1: Hoare triple {13074#true} assume true; {13074#true} is VALID [2022-04-28 10:05:29,585 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13074#true} {13074#true} #61#return; {13074#true} is VALID [2022-04-28 10:05:29,585 INFO L272 TraceCheckUtils]: 0: Hoare triple {13074#true} call ULTIMATE.init(); {13088#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:05:29,585 INFO L290 TraceCheckUtils]: 1: Hoare triple {13088#(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(10, 2);call #Ultimate.allocInit(12, 3); {13074#true} is VALID [2022-04-28 10:05:29,586 INFO L290 TraceCheckUtils]: 2: Hoare triple {13074#true} assume true; {13074#true} is VALID [2022-04-28 10:05:29,586 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13074#true} {13074#true} #61#return; {13074#true} is VALID [2022-04-28 10:05:29,586 INFO L272 TraceCheckUtils]: 4: Hoare triple {13074#true} call #t~ret11 := main(); {13074#true} is VALID [2022-04-28 10:05:29,586 INFO L290 TraceCheckUtils]: 5: Hoare triple {13074#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {13079#(= main_~y~0 0)} is VALID [2022-04-28 10:05:29,586 INFO L290 TraceCheckUtils]: 6: Hoare triple {13079#(= 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; {13080#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:05:29,587 INFO L290 TraceCheckUtils]: 7: Hoare triple {13080#(and (<= 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; {13081#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:05:29,587 INFO L290 TraceCheckUtils]: 8: Hoare triple {13081#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {13082#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:05:29,588 INFO L290 TraceCheckUtils]: 9: Hoare triple {13082#(and (<= main_~y~0 3) (<= 3 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; {13083#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:05:29,588 INFO L290 TraceCheckUtils]: 10: Hoare triple {13083#(and (<= main_~y~0 4) (<= 4 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; {13084#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:05:29,589 INFO L290 TraceCheckUtils]: 11: Hoare triple {13084#(and (<= 5 main_~y~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; {13085#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:05:29,589 INFO L290 TraceCheckUtils]: 12: Hoare triple {13085#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {13085#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:05:29,590 INFO L290 TraceCheckUtils]: 13: Hoare triple {13085#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {13086#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:05:29,590 INFO L290 TraceCheckUtils]: 14: Hoare triple {13086#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13087#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:05:29,591 INFO L290 TraceCheckUtils]: 15: Hoare triple {13087#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {13075#false} is VALID [2022-04-28 10:05:29,591 INFO L290 TraceCheckUtils]: 16: Hoare triple {13075#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13075#false} is VALID [2022-04-28 10:05:29,591 INFO L290 TraceCheckUtils]: 17: Hoare triple {13075#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13075#false} is VALID [2022-04-28 10:05:29,591 INFO L290 TraceCheckUtils]: 18: Hoare triple {13075#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13075#false} is VALID [2022-04-28 10:05:29,591 INFO L290 TraceCheckUtils]: 19: Hoare triple {13075#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13075#false} is VALID [2022-04-28 10:05:29,591 INFO L290 TraceCheckUtils]: 20: Hoare triple {13075#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13075#false} is VALID [2022-04-28 10:05:29,591 INFO L290 TraceCheckUtils]: 21: Hoare triple {13075#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13075#false} is VALID [2022-04-28 10:05:29,591 INFO L290 TraceCheckUtils]: 22: Hoare triple {13075#false} assume !(~y~0 % 4294967296 > 0); {13075#false} is VALID [2022-04-28 10:05:29,591 INFO L272 TraceCheckUtils]: 23: Hoare triple {13075#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {13075#false} is VALID [2022-04-28 10:05:29,591 INFO L290 TraceCheckUtils]: 24: Hoare triple {13075#false} ~cond := #in~cond; {13075#false} is VALID [2022-04-28 10:05:29,591 INFO L290 TraceCheckUtils]: 25: Hoare triple {13075#false} assume 0 == ~cond; {13075#false} is VALID [2022-04-28 10:05:29,591 INFO L290 TraceCheckUtils]: 26: Hoare triple {13075#false} assume !false; {13075#false} is VALID [2022-04-28 10:05:29,591 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-28 10:05:29,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:05:29,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272772421] [2022-04-28 10:05:29,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272772421] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:05:29,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [138264784] [2022-04-28 10:05:29,592 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:05:29,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:05:29,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:05:29,593 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:05:29,594 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-04-28 10:05:29,643 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-28 10:05:29,643 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:05:29,644 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-28 10:05:29,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:05:29,651 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:05:29,838 INFO L272 TraceCheckUtils]: 0: Hoare triple {13074#true} call ULTIMATE.init(); {13074#true} is VALID [2022-04-28 10:05:29,838 INFO L290 TraceCheckUtils]: 1: Hoare triple {13074#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(10, 2);call #Ultimate.allocInit(12, 3); {13074#true} is VALID [2022-04-28 10:05:29,838 INFO L290 TraceCheckUtils]: 2: Hoare triple {13074#true} assume true; {13074#true} is VALID [2022-04-28 10:05:29,838 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13074#true} {13074#true} #61#return; {13074#true} is VALID [2022-04-28 10:05:29,838 INFO L272 TraceCheckUtils]: 4: Hoare triple {13074#true} call #t~ret11 := main(); {13074#true} is VALID [2022-04-28 10:05:29,838 INFO L290 TraceCheckUtils]: 5: Hoare triple {13074#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {13079#(= main_~y~0 0)} is VALID [2022-04-28 10:05:29,839 INFO L290 TraceCheckUtils]: 6: Hoare triple {13079#(= 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; {13080#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:05:29,839 INFO L290 TraceCheckUtils]: 7: Hoare triple {13080#(and (<= 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; {13081#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:05:29,840 INFO L290 TraceCheckUtils]: 8: Hoare triple {13081#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {13082#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:05:29,840 INFO L290 TraceCheckUtils]: 9: Hoare triple {13082#(and (<= main_~y~0 3) (<= 3 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; {13083#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:05:29,841 INFO L290 TraceCheckUtils]: 10: Hoare triple {13083#(and (<= main_~y~0 4) (<= 4 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; {13084#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:05:29,841 INFO L290 TraceCheckUtils]: 11: Hoare triple {13084#(and (<= 5 main_~y~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; {13085#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:05:29,841 INFO L290 TraceCheckUtils]: 12: Hoare triple {13085#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {13085#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:05:29,842 INFO L290 TraceCheckUtils]: 13: Hoare triple {13085#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {13086#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:05:29,842 INFO L290 TraceCheckUtils]: 14: Hoare triple {13086#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13134#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:05:29,843 INFO L290 TraceCheckUtils]: 15: Hoare triple {13134#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {13075#false} is VALID [2022-04-28 10:05:29,843 INFO L290 TraceCheckUtils]: 16: Hoare triple {13075#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13075#false} is VALID [2022-04-28 10:05:29,843 INFO L290 TraceCheckUtils]: 17: Hoare triple {13075#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13075#false} is VALID [2022-04-28 10:05:29,843 INFO L290 TraceCheckUtils]: 18: Hoare triple {13075#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13075#false} is VALID [2022-04-28 10:05:29,843 INFO L290 TraceCheckUtils]: 19: Hoare triple {13075#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13075#false} is VALID [2022-04-28 10:05:29,843 INFO L290 TraceCheckUtils]: 20: Hoare triple {13075#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13075#false} is VALID [2022-04-28 10:05:29,843 INFO L290 TraceCheckUtils]: 21: Hoare triple {13075#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13075#false} is VALID [2022-04-28 10:05:29,843 INFO L290 TraceCheckUtils]: 22: Hoare triple {13075#false} assume !(~y~0 % 4294967296 > 0); {13075#false} is VALID [2022-04-28 10:05:29,843 INFO L272 TraceCheckUtils]: 23: Hoare triple {13075#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {13075#false} is VALID [2022-04-28 10:05:29,843 INFO L290 TraceCheckUtils]: 24: Hoare triple {13075#false} ~cond := #in~cond; {13075#false} is VALID [2022-04-28 10:05:29,843 INFO L290 TraceCheckUtils]: 25: Hoare triple {13075#false} assume 0 == ~cond; {13075#false} is VALID [2022-04-28 10:05:29,843 INFO L290 TraceCheckUtils]: 26: Hoare triple {13075#false} assume !false; {13075#false} is VALID [2022-04-28 10:05:29,843 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-28 10:05:29,843 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:05:30,030 INFO L290 TraceCheckUtils]: 26: Hoare triple {13075#false} assume !false; {13075#false} is VALID [2022-04-28 10:05:30,030 INFO L290 TraceCheckUtils]: 25: Hoare triple {13075#false} assume 0 == ~cond; {13075#false} is VALID [2022-04-28 10:05:30,030 INFO L290 TraceCheckUtils]: 24: Hoare triple {13075#false} ~cond := #in~cond; {13075#false} is VALID [2022-04-28 10:05:30,030 INFO L272 TraceCheckUtils]: 23: Hoare triple {13075#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {13075#false} is VALID [2022-04-28 10:05:30,030 INFO L290 TraceCheckUtils]: 22: Hoare triple {13075#false} assume !(~y~0 % 4294967296 > 0); {13075#false} is VALID [2022-04-28 10:05:30,030 INFO L290 TraceCheckUtils]: 21: Hoare triple {13075#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13075#false} is VALID [2022-04-28 10:05:30,030 INFO L290 TraceCheckUtils]: 20: Hoare triple {13075#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13075#false} is VALID [2022-04-28 10:05:30,031 INFO L290 TraceCheckUtils]: 19: Hoare triple {13075#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13075#false} is VALID [2022-04-28 10:05:30,031 INFO L290 TraceCheckUtils]: 18: Hoare triple {13075#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13075#false} is VALID [2022-04-28 10:05:30,031 INFO L290 TraceCheckUtils]: 17: Hoare triple {13075#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13075#false} is VALID [2022-04-28 10:05:30,031 INFO L290 TraceCheckUtils]: 16: Hoare triple {13075#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13075#false} is VALID [2022-04-28 10:05:30,031 INFO L290 TraceCheckUtils]: 15: Hoare triple {13204#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {13075#false} is VALID [2022-04-28 10:05:30,032 INFO L290 TraceCheckUtils]: 14: Hoare triple {13208#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13204#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:05:30,032 INFO L290 TraceCheckUtils]: 13: Hoare triple {13212#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} ~z~0 := ~y~0; {13208#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:05:30,032 INFO L290 TraceCheckUtils]: 12: Hoare triple {13212#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {13212#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:05:30,033 INFO L290 TraceCheckUtils]: 11: Hoare triple {13219#(< 0 (mod main_~y~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; {13212#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:05:30,034 INFO L290 TraceCheckUtils]: 10: Hoare triple {13223#(< 0 (mod (+ main_~y~0 1) 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; {13219#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:05:30,034 INFO L290 TraceCheckUtils]: 9: Hoare triple {13227#(< 0 (mod (+ main_~y~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; {13223#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:05:30,035 INFO L290 TraceCheckUtils]: 8: Hoare triple {13231#(< 0 (mod (+ main_~y~0 3) 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; {13227#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:05:30,036 INFO L290 TraceCheckUtils]: 7: Hoare triple {13235#(< 0 (mod (+ main_~y~0 4) 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; {13231#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:05:30,036 INFO L290 TraceCheckUtils]: 6: Hoare triple {13239#(< 0 (mod (+ 5 main_~y~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; {13235#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:05:30,041 INFO L290 TraceCheckUtils]: 5: Hoare triple {13074#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {13239#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:05:30,041 INFO L272 TraceCheckUtils]: 4: Hoare triple {13074#true} call #t~ret11 := main(); {13074#true} is VALID [2022-04-28 10:05:30,041 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13074#true} {13074#true} #61#return; {13074#true} is VALID [2022-04-28 10:05:30,041 INFO L290 TraceCheckUtils]: 2: Hoare triple {13074#true} assume true; {13074#true} is VALID [2022-04-28 10:05:30,041 INFO L290 TraceCheckUtils]: 1: Hoare triple {13074#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(10, 2);call #Ultimate.allocInit(12, 3); {13074#true} is VALID [2022-04-28 10:05:30,041 INFO L272 TraceCheckUtils]: 0: Hoare triple {13074#true} call ULTIMATE.init(); {13074#true} is VALID [2022-04-28 10:05:30,042 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-28 10:05:30,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [138264784] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:05:30,042 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:05:30,042 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 22 [2022-04-28 10:05:30,042 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:05:30,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [494006089] [2022-04-28 10:05:30,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [494006089] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:05:30,042 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:05:30,042 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 10:05:30,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800788820] [2022-04-28 10:05:30,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:05:30,042 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.5) internal successors, (18), 11 states have internal predecessors, (18), 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 27 [2022-04-28 10:05:30,043 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:05:30,043 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 1.5) internal successors, (18), 11 states have internal predecessors, (18), 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-28 10:05:30,056 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:05:30,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 10:05:30,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:05:30,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 10:05:30,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2022-04-28 10:05:30,057 INFO L87 Difference]: Start difference. First operand 68 states and 86 transitions. Second operand has 12 states, 12 states have (on average 1.5) internal successors, (18), 11 states have internal predecessors, (18), 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-28 10:05:30,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:05:30,617 INFO L93 Difference]: Finished difference Result 89 states and 107 transitions. [2022-04-28 10:05:30,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 10:05:30,617 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.5) internal successors, (18), 11 states have internal predecessors, (18), 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 27 [2022-04-28 10:05:30,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:05:30,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.5) internal successors, (18), 11 states have internal predecessors, (18), 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-28 10:05:30,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 50 transitions. [2022-04-28 10:05:30,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.5) internal successors, (18), 11 states have internal predecessors, (18), 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-28 10:05:30,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 50 transitions. [2022-04-28 10:05:30,619 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 50 transitions. [2022-04-28 10:05:30,668 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:05:30,669 INFO L225 Difference]: With dead ends: 89 [2022-04-28 10:05:30,669 INFO L226 Difference]: Without dead ends: 77 [2022-04-28 10:05:30,669 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=218, Invalid=774, Unknown=0, NotChecked=0, Total=992 [2022-04-28 10:05:30,669 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 25 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 10:05:30,670 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 63 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 10:05:30,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-04-28 10:05:30,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 69. [2022-04-28 10:05:30,742 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:05:30,742 INFO L82 GeneralOperation]: Start isEquivalent. First operand 77 states. Second operand has 69 states, 64 states have (on average 1.296875) internal successors, (83), 64 states have internal predecessors, (83), 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-28 10:05:30,742 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand has 69 states, 64 states have (on average 1.296875) internal successors, (83), 64 states have internal predecessors, (83), 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-28 10:05:30,742 INFO L87 Difference]: Start difference. First operand 77 states. Second operand has 69 states, 64 states have (on average 1.296875) internal successors, (83), 64 states have internal predecessors, (83), 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-28 10:05:30,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:05:30,743 INFO L93 Difference]: Finished difference Result 77 states and 95 transitions. [2022-04-28 10:05:30,743 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 95 transitions. [2022-04-28 10:05:30,743 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:05:30,743 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:05:30,743 INFO L74 IsIncluded]: Start isIncluded. First operand has 69 states, 64 states have (on average 1.296875) internal successors, (83), 64 states have internal predecessors, (83), 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 77 states. [2022-04-28 10:05:30,744 INFO L87 Difference]: Start difference. First operand has 69 states, 64 states have (on average 1.296875) internal successors, (83), 64 states have internal predecessors, (83), 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 77 states. [2022-04-28 10:05:30,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:05:30,744 INFO L93 Difference]: Finished difference Result 77 states and 95 transitions. [2022-04-28 10:05:30,744 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 95 transitions. [2022-04-28 10:05:30,745 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:05:30,745 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:05:30,745 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:05:30,745 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:05:30,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 64 states have (on average 1.296875) internal successors, (83), 64 states have internal predecessors, (83), 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-28 10:05:30,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 87 transitions. [2022-04-28 10:05:30,745 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 87 transitions. Word has length 27 [2022-04-28 10:05:30,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:05:30,746 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 87 transitions. [2022-04-28 10:05:30,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.5) internal successors, (18), 11 states have internal predecessors, (18), 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-28 10:05:30,746 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 69 states and 87 transitions. [2022-04-28 10:05:32,942 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 86 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 10:05:32,943 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 87 transitions. [2022-04-28 10:05:32,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-28 10:05:32,943 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:05:32,943 INFO L195 NwaCegarLoop]: trace histogram [13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:05:32,958 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-04-28 10:05:33,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-04-28 10:05:33,144 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:05:33,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:05:33,144 INFO L85 PathProgramCache]: Analyzing trace with hash 867538926, now seen corresponding path program 25 times [2022-04-28 10:05:33,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:05:33,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [725543249] [2022-04-28 10:05:33,146 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:05:33,146 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:05:33,146 INFO L85 PathProgramCache]: Analyzing trace with hash 867538926, now seen corresponding path program 26 times [2022-04-28 10:05:33,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:05:33,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347296355] [2022-04-28 10:05:33,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:05:33,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:05:33,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:05:33,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:05:33,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:05:33,403 INFO L290 TraceCheckUtils]: 0: Hoare triple {13770#(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(10, 2);call #Ultimate.allocInit(12, 3); {13750#true} is VALID [2022-04-28 10:05:33,403 INFO L290 TraceCheckUtils]: 1: Hoare triple {13750#true} assume true; {13750#true} is VALID [2022-04-28 10:05:33,403 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13750#true} {13750#true} #61#return; {13750#true} is VALID [2022-04-28 10:05:33,404 INFO L272 TraceCheckUtils]: 0: Hoare triple {13750#true} call ULTIMATE.init(); {13770#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:05:33,404 INFO L290 TraceCheckUtils]: 1: Hoare triple {13770#(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(10, 2);call #Ultimate.allocInit(12, 3); {13750#true} is VALID [2022-04-28 10:05:33,404 INFO L290 TraceCheckUtils]: 2: Hoare triple {13750#true} assume true; {13750#true} is VALID [2022-04-28 10:05:33,404 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13750#true} {13750#true} #61#return; {13750#true} is VALID [2022-04-28 10:05:33,404 INFO L272 TraceCheckUtils]: 4: Hoare triple {13750#true} call #t~ret11 := main(); {13750#true} is VALID [2022-04-28 10:05:33,404 INFO L290 TraceCheckUtils]: 5: Hoare triple {13750#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {13755#(= main_~y~0 0)} is VALID [2022-04-28 10:05:33,404 INFO L290 TraceCheckUtils]: 6: Hoare triple {13755#(= 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; {13756#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:05:33,405 INFO L290 TraceCheckUtils]: 7: Hoare triple {13756#(and (<= 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; {13757#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:05:33,405 INFO L290 TraceCheckUtils]: 8: Hoare triple {13757#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {13758#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:05:33,406 INFO L290 TraceCheckUtils]: 9: Hoare triple {13758#(and (<= main_~y~0 3) (<= 3 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; {13759#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:05:33,406 INFO L290 TraceCheckUtils]: 10: Hoare triple {13759#(and (<= main_~y~0 4) (<= 4 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; {13760#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:05:33,407 INFO L290 TraceCheckUtils]: 11: Hoare triple {13760#(and (<= 5 main_~y~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; {13761#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:05:33,407 INFO L290 TraceCheckUtils]: 12: Hoare triple {13761#(and (<= main_~y~0 6) (<= 6 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; {13762#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:05:33,408 INFO L290 TraceCheckUtils]: 13: Hoare triple {13762#(and (<= 7 main_~y~0) (<= main_~y~0 7))} 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; {13763#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:05:33,408 INFO L290 TraceCheckUtils]: 14: Hoare triple {13763#(and (<= main_~y~0 8) (<= 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; {13764#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:05:33,409 INFO L290 TraceCheckUtils]: 15: Hoare triple {13764#(and (<= 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; {13765#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:05:33,409 INFO L290 TraceCheckUtils]: 16: Hoare triple {13765#(and (<= main_~y~0 10) (<= 10 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; {13766#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:05:33,410 INFO L290 TraceCheckUtils]: 17: Hoare triple {13766#(and (<= main_~y~0 11) (<= 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; {13767#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:05:33,410 INFO L290 TraceCheckUtils]: 18: Hoare triple {13767#(and (<= 12 main_~y~0) (<= main_~y~0 12))} 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; {13768#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:05:33,411 INFO L290 TraceCheckUtils]: 19: Hoare triple {13768#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {13768#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:05:33,411 INFO L290 TraceCheckUtils]: 20: Hoare triple {13768#(and (<= main_~y~0 13) (<= 13 main_~y~0))} ~z~0 := ~y~0; {13769#(and (<= 13 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:05:33,412 INFO L290 TraceCheckUtils]: 21: Hoare triple {13769#(and (<= 13 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {13751#false} is VALID [2022-04-28 10:05:33,412 INFO L290 TraceCheckUtils]: 22: Hoare triple {13751#false} assume !(~y~0 % 4294967296 > 0); {13751#false} is VALID [2022-04-28 10:05:33,412 INFO L272 TraceCheckUtils]: 23: Hoare triple {13751#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {13751#false} is VALID [2022-04-28 10:05:33,412 INFO L290 TraceCheckUtils]: 24: Hoare triple {13751#false} ~cond := #in~cond; {13751#false} is VALID [2022-04-28 10:05:33,412 INFO L290 TraceCheckUtils]: 25: Hoare triple {13751#false} assume 0 == ~cond; {13751#false} is VALID [2022-04-28 10:05:33,412 INFO L290 TraceCheckUtils]: 26: Hoare triple {13751#false} assume !false; {13751#false} is VALID [2022-04-28 10:05:33,412 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:05:33,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:05:33,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347296355] [2022-04-28 10:05:33,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347296355] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:05:33,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1958256019] [2022-04-28 10:05:33,412 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:05:33,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:05:33,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:05:33,413 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:05:33,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-04-28 10:05:33,445 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:05:33,445 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:05:33,446 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-28 10:05:33,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:05:33,460 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:05:33,688 INFO L272 TraceCheckUtils]: 0: Hoare triple {13750#true} call ULTIMATE.init(); {13750#true} is VALID [2022-04-28 10:05:33,688 INFO L290 TraceCheckUtils]: 1: Hoare triple {13750#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(10, 2);call #Ultimate.allocInit(12, 3); {13750#true} is VALID [2022-04-28 10:05:33,688 INFO L290 TraceCheckUtils]: 2: Hoare triple {13750#true} assume true; {13750#true} is VALID [2022-04-28 10:05:33,688 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13750#true} {13750#true} #61#return; {13750#true} is VALID [2022-04-28 10:05:33,688 INFO L272 TraceCheckUtils]: 4: Hoare triple {13750#true} call #t~ret11 := main(); {13750#true} is VALID [2022-04-28 10:05:33,689 INFO L290 TraceCheckUtils]: 5: Hoare triple {13750#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {13755#(= main_~y~0 0)} is VALID [2022-04-28 10:05:33,689 INFO L290 TraceCheckUtils]: 6: Hoare triple {13755#(= 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; {13756#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:05:33,689 INFO L290 TraceCheckUtils]: 7: Hoare triple {13756#(and (<= 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; {13757#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:05:33,690 INFO L290 TraceCheckUtils]: 8: Hoare triple {13757#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {13758#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:05:33,690 INFO L290 TraceCheckUtils]: 9: Hoare triple {13758#(and (<= main_~y~0 3) (<= 3 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; {13759#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:05:33,692 INFO L290 TraceCheckUtils]: 10: Hoare triple {13759#(and (<= main_~y~0 4) (<= 4 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; {13760#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:05:33,693 INFO L290 TraceCheckUtils]: 11: Hoare triple {13760#(and (<= 5 main_~y~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; {13761#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:05:33,693 INFO L290 TraceCheckUtils]: 12: Hoare triple {13761#(and (<= main_~y~0 6) (<= 6 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; {13762#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:05:33,694 INFO L290 TraceCheckUtils]: 13: Hoare triple {13762#(and (<= 7 main_~y~0) (<= main_~y~0 7))} 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; {13763#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:05:33,694 INFO L290 TraceCheckUtils]: 14: Hoare triple {13763#(and (<= main_~y~0 8) (<= 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; {13764#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:05:33,695 INFO L290 TraceCheckUtils]: 15: Hoare triple {13764#(and (<= 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; {13765#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:05:33,695 INFO L290 TraceCheckUtils]: 16: Hoare triple {13765#(and (<= main_~y~0 10) (<= 10 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; {13766#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:05:33,696 INFO L290 TraceCheckUtils]: 17: Hoare triple {13766#(and (<= main_~y~0 11) (<= 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; {13767#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:05:33,696 INFO L290 TraceCheckUtils]: 18: Hoare triple {13767#(and (<= 12 main_~y~0) (<= main_~y~0 12))} 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; {13768#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:05:33,697 INFO L290 TraceCheckUtils]: 19: Hoare triple {13768#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {13768#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:05:33,697 INFO L290 TraceCheckUtils]: 20: Hoare triple {13768#(and (<= main_~y~0 13) (<= 13 main_~y~0))} ~z~0 := ~y~0; {13834#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-28 10:05:33,697 INFO L290 TraceCheckUtils]: 21: Hoare triple {13834#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !(~z~0 % 4294967296 > 0); {13751#false} is VALID [2022-04-28 10:05:33,697 INFO L290 TraceCheckUtils]: 22: Hoare triple {13751#false} assume !(~y~0 % 4294967296 > 0); {13751#false} is VALID [2022-04-28 10:05:33,697 INFO L272 TraceCheckUtils]: 23: Hoare triple {13751#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {13751#false} is VALID [2022-04-28 10:05:33,697 INFO L290 TraceCheckUtils]: 24: Hoare triple {13751#false} ~cond := #in~cond; {13751#false} is VALID [2022-04-28 10:05:33,697 INFO L290 TraceCheckUtils]: 25: Hoare triple {13751#false} assume 0 == ~cond; {13751#false} is VALID [2022-04-28 10:05:33,698 INFO L290 TraceCheckUtils]: 26: Hoare triple {13751#false} assume !false; {13751#false} is VALID [2022-04-28 10:05:33,698 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:05:33,698 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:05:34,114 INFO L290 TraceCheckUtils]: 26: Hoare triple {13751#false} assume !false; {13751#false} is VALID [2022-04-28 10:05:34,115 INFO L290 TraceCheckUtils]: 25: Hoare triple {13751#false} assume 0 == ~cond; {13751#false} is VALID [2022-04-28 10:05:34,115 INFO L290 TraceCheckUtils]: 24: Hoare triple {13751#false} ~cond := #in~cond; {13751#false} is VALID [2022-04-28 10:05:34,115 INFO L272 TraceCheckUtils]: 23: Hoare triple {13751#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {13751#false} is VALID [2022-04-28 10:05:34,115 INFO L290 TraceCheckUtils]: 22: Hoare triple {13751#false} assume !(~y~0 % 4294967296 > 0); {13751#false} is VALID [2022-04-28 10:05:34,115 INFO L290 TraceCheckUtils]: 21: Hoare triple {13868#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {13751#false} is VALID [2022-04-28 10:05:34,115 INFO L290 TraceCheckUtils]: 20: Hoare triple {13872#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {13868#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:05:34,116 INFO L290 TraceCheckUtils]: 19: Hoare triple {13872#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {13872#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:05:34,116 INFO L290 TraceCheckUtils]: 18: Hoare triple {13879#(< 0 (mod (+ main_~y~0 1) 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; {13872#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:05:34,117 INFO L290 TraceCheckUtils]: 17: Hoare triple {13883#(< 0 (mod (+ main_~y~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; {13879#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:05:34,118 INFO L290 TraceCheckUtils]: 16: Hoare triple {13887#(< 0 (mod (+ main_~y~0 3) 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; {13883#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:05:34,118 INFO L290 TraceCheckUtils]: 15: Hoare triple {13891#(< 0 (mod (+ main_~y~0 4) 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; {13887#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:05:34,119 INFO L290 TraceCheckUtils]: 14: Hoare triple {13895#(< 0 (mod (+ 5 main_~y~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; {13891#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:05:34,119 INFO L290 TraceCheckUtils]: 13: Hoare triple {13899#(< 0 (mod (+ main_~y~0 6) 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; {13895#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:05:34,120 INFO L290 TraceCheckUtils]: 12: Hoare triple {13903#(< 0 (mod (+ 7 main_~y~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; {13899#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:05:34,121 INFO L290 TraceCheckUtils]: 11: Hoare triple {13907#(< 0 (mod (+ main_~y~0 8) 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; {13903#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:05:34,121 INFO L290 TraceCheckUtils]: 10: Hoare triple {13911#(< 0 (mod (+ main_~y~0 9) 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; {13907#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:05:34,122 INFO L290 TraceCheckUtils]: 9: Hoare triple {13915#(< 0 (mod (+ main_~y~0 10) 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; {13911#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:05:34,123 INFO L290 TraceCheckUtils]: 8: Hoare triple {13919#(< 0 (mod (+ main_~y~0 11) 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; {13915#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-28 10:05:34,123 INFO L290 TraceCheckUtils]: 7: Hoare triple {13923#(< 0 (mod (+ main_~y~0 12) 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; {13919#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-28 10:05:34,124 INFO L290 TraceCheckUtils]: 6: Hoare triple {13927#(< 0 (mod (+ main_~y~0 13) 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; {13923#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-28 10:05:34,124 INFO L290 TraceCheckUtils]: 5: Hoare triple {13750#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {13927#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-28 10:05:34,124 INFO L272 TraceCheckUtils]: 4: Hoare triple {13750#true} call #t~ret11 := main(); {13750#true} is VALID [2022-04-28 10:05:34,124 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13750#true} {13750#true} #61#return; {13750#true} is VALID [2022-04-28 10:05:34,124 INFO L290 TraceCheckUtils]: 2: Hoare triple {13750#true} assume true; {13750#true} is VALID [2022-04-28 10:05:34,124 INFO L290 TraceCheckUtils]: 1: Hoare triple {13750#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(10, 2);call #Ultimate.allocInit(12, 3); {13750#true} is VALID [2022-04-28 10:05:34,124 INFO L272 TraceCheckUtils]: 0: Hoare triple {13750#true} call ULTIMATE.init(); {13750#true} is VALID [2022-04-28 10:05:34,125 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:05:34,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1958256019] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:05:34,125 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:05:34,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 34 [2022-04-28 10:05:34,125 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:05:34,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [725543249] [2022-04-28 10:05:34,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [725543249] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:05:34,125 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:05:34,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-28 10:05:34,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481699353] [2022-04-28 10:05:34,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:05:34,125 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 17 states have internal predecessors, (23), 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 27 [2022-04-28 10:05:34,126 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:05:34,126 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 17 states have internal predecessors, (23), 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-28 10:05:34,141 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:05:34,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-28 10:05:34,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:05:34,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-28 10:05:34,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=859, Unknown=0, NotChecked=0, Total=1122 [2022-04-28 10:05:34,141 INFO L87 Difference]: Start difference. First operand 69 states and 87 transitions. Second operand has 18 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 17 states have internal predecessors, (23), 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-28 10:05:35,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:05:35,826 INFO L93 Difference]: Finished difference Result 94 states and 129 transitions. [2022-04-28 10:05:35,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-28 10:05:35,826 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 17 states have internal predecessors, (23), 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 27 [2022-04-28 10:05:35,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:05:35,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 17 states have internal predecessors, (23), 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-28 10:05:35,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 104 transitions. [2022-04-28 10:05:35,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 17 states have internal predecessors, (23), 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-28 10:05:35,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 104 transitions. [2022-04-28 10:05:35,828 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 104 transitions. [2022-04-28 10:05:35,909 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:05:35,910 INFO L225 Difference]: With dead ends: 94 [2022-04-28 10:05:35,910 INFO L226 Difference]: Without dead ends: 88 [2022-04-28 10:05:35,910 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=535, Invalid=1817, Unknown=0, NotChecked=0, Total=2352 [2022-04-28 10:05:35,911 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 84 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 1010 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 1069 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 1010 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-28 10:05:35,911 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 113 Invalid, 1069 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 1010 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-28 10:05:35,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-04-28 10:05:35,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 74. [2022-04-28 10:05:35,984 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:05:35,984 INFO L82 GeneralOperation]: Start isEquivalent. First operand 88 states. Second operand has 74 states, 69 states have (on average 1.3043478260869565) internal successors, (90), 69 states have internal predecessors, (90), 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-28 10:05:35,984 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand has 74 states, 69 states have (on average 1.3043478260869565) internal successors, (90), 69 states have internal predecessors, (90), 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-28 10:05:35,984 INFO L87 Difference]: Start difference. First operand 88 states. Second operand has 74 states, 69 states have (on average 1.3043478260869565) internal successors, (90), 69 states have internal predecessors, (90), 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-28 10:05:35,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:05:35,985 INFO L93 Difference]: Finished difference Result 88 states and 108 transitions. [2022-04-28 10:05:35,985 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 108 transitions. [2022-04-28 10:05:35,985 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:05:35,985 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:05:35,986 INFO L74 IsIncluded]: Start isIncluded. First operand has 74 states, 69 states have (on average 1.3043478260869565) internal successors, (90), 69 states have internal predecessors, (90), 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 88 states. [2022-04-28 10:05:35,986 INFO L87 Difference]: Start difference. First operand has 74 states, 69 states have (on average 1.3043478260869565) internal successors, (90), 69 states have internal predecessors, (90), 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 88 states. [2022-04-28 10:05:35,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:05:35,986 INFO L93 Difference]: Finished difference Result 88 states and 108 transitions. [2022-04-28 10:05:35,986 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 108 transitions. [2022-04-28 10:05:35,987 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:05:35,987 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:05:35,987 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:05:35,987 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:05:35,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 69 states have (on average 1.3043478260869565) internal successors, (90), 69 states have internal predecessors, (90), 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-28 10:05:35,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 94 transitions. [2022-04-28 10:05:35,988 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 94 transitions. Word has length 27 [2022-04-28 10:05:35,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:05:35,988 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 94 transitions. [2022-04-28 10:05:35,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 17 states have internal predecessors, (23), 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-28 10:05:35,988 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 74 states and 94 transitions. [2022-04-28 10:05:37,545 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:05:37,545 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 94 transitions. [2022-04-28 10:05:37,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-28 10:05:37,546 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:05:37,546 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:05:37,561 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2022-04-28 10:05:37,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-04-28 10:05:37,746 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:05:37,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:05:37,747 INFO L85 PathProgramCache]: Analyzing trace with hash -603591809, now seen corresponding path program 31 times [2022-04-28 10:05:37,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:05:37,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [531870845] [2022-04-28 10:05:37,753 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:05:37,753 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:05:37,753 INFO L85 PathProgramCache]: Analyzing trace with hash -603591809, now seen corresponding path program 32 times [2022-04-28 10:05:37,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:05:37,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127515800] [2022-04-28 10:05:37,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:05:37,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:05:37,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:05:37,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:05:37,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:05:37,916 INFO L290 TraceCheckUtils]: 0: Hoare triple {14506#(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(10, 2);call #Ultimate.allocInit(12, 3); {14490#true} is VALID [2022-04-28 10:05:37,916 INFO L290 TraceCheckUtils]: 1: Hoare triple {14490#true} assume true; {14490#true} is VALID [2022-04-28 10:05:37,916 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14490#true} {14490#true} #61#return; {14490#true} is VALID [2022-04-28 10:05:37,916 INFO L272 TraceCheckUtils]: 0: Hoare triple {14490#true} call ULTIMATE.init(); {14506#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:05:37,916 INFO L290 TraceCheckUtils]: 1: Hoare triple {14506#(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(10, 2);call #Ultimate.allocInit(12, 3); {14490#true} is VALID [2022-04-28 10:05:37,916 INFO L290 TraceCheckUtils]: 2: Hoare triple {14490#true} assume true; {14490#true} is VALID [2022-04-28 10:05:37,916 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14490#true} {14490#true} #61#return; {14490#true} is VALID [2022-04-28 10:05:37,917 INFO L272 TraceCheckUtils]: 4: Hoare triple {14490#true} call #t~ret11 := main(); {14490#true} is VALID [2022-04-28 10:05:37,917 INFO L290 TraceCheckUtils]: 5: Hoare triple {14490#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {14495#(= main_~y~0 0)} is VALID [2022-04-28 10:05:37,918 INFO L290 TraceCheckUtils]: 6: Hoare triple {14495#(= 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; {14496#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:05:37,918 INFO L290 TraceCheckUtils]: 7: Hoare triple {14496#(and (<= 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; {14497#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:05:37,919 INFO L290 TraceCheckUtils]: 8: Hoare triple {14497#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {14498#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:05:37,919 INFO L290 TraceCheckUtils]: 9: Hoare triple {14498#(and (<= main_~y~0 3) (<= 3 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; {14499#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:05:37,920 INFO L290 TraceCheckUtils]: 10: Hoare triple {14499#(and (<= main_~y~0 4) (<= 4 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; {14500#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:05:37,920 INFO L290 TraceCheckUtils]: 11: Hoare triple {14500#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {14500#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:05:37,920 INFO L290 TraceCheckUtils]: 12: Hoare triple {14500#(and (<= 5 main_~y~0) (<= main_~y~0 5))} ~z~0 := ~y~0; {14501#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:05:37,921 INFO L290 TraceCheckUtils]: 13: Hoare triple {14501#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14502#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:05:37,922 INFO L290 TraceCheckUtils]: 14: Hoare triple {14502#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14503#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:05:37,922 INFO L290 TraceCheckUtils]: 15: Hoare triple {14503#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14504#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-28 10:05:37,923 INFO L290 TraceCheckUtils]: 16: Hoare triple {14504#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14505#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-28 10:05:37,923 INFO L290 TraceCheckUtils]: 17: Hoare triple {14505#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {14491#false} is VALID [2022-04-28 10:05:37,923 INFO L290 TraceCheckUtils]: 18: Hoare triple {14491#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14491#false} is VALID [2022-04-28 10:05:37,923 INFO L290 TraceCheckUtils]: 19: Hoare triple {14491#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14491#false} is VALID [2022-04-28 10:05:37,923 INFO L290 TraceCheckUtils]: 20: Hoare triple {14491#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14491#false} is VALID [2022-04-28 10:05:37,923 INFO L290 TraceCheckUtils]: 21: Hoare triple {14491#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14491#false} is VALID [2022-04-28 10:05:37,923 INFO L290 TraceCheckUtils]: 22: Hoare triple {14491#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14491#false} is VALID [2022-04-28 10:05:37,923 INFO L290 TraceCheckUtils]: 23: Hoare triple {14491#false} assume !(~y~0 % 4294967296 > 0); {14491#false} is VALID [2022-04-28 10:05:37,923 INFO L272 TraceCheckUtils]: 24: Hoare triple {14491#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {14491#false} is VALID [2022-04-28 10:05:37,923 INFO L290 TraceCheckUtils]: 25: Hoare triple {14491#false} ~cond := #in~cond; {14491#false} is VALID [2022-04-28 10:05:37,923 INFO L290 TraceCheckUtils]: 26: Hoare triple {14491#false} assume 0 == ~cond; {14491#false} is VALID [2022-04-28 10:05:37,923 INFO L290 TraceCheckUtils]: 27: Hoare triple {14491#false} assume !false; {14491#false} is VALID [2022-04-28 10:05:37,924 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-28 10:05:37,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:05:37,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127515800] [2022-04-28 10:05:37,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127515800] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:05:37,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [210393324] [2022-04-28 10:05:37,924 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:05:37,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:05:37,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:05:37,925 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:05:37,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-04-28 10:05:37,955 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:05:37,955 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:05:37,956 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-28 10:05:37,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:05:37,968 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:05:38,155 INFO L272 TraceCheckUtils]: 0: Hoare triple {14490#true} call ULTIMATE.init(); {14490#true} is VALID [2022-04-28 10:05:38,156 INFO L290 TraceCheckUtils]: 1: Hoare triple {14490#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(10, 2);call #Ultimate.allocInit(12, 3); {14490#true} is VALID [2022-04-28 10:05:38,156 INFO L290 TraceCheckUtils]: 2: Hoare triple {14490#true} assume true; {14490#true} is VALID [2022-04-28 10:05:38,156 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14490#true} {14490#true} #61#return; {14490#true} is VALID [2022-04-28 10:05:38,156 INFO L272 TraceCheckUtils]: 4: Hoare triple {14490#true} call #t~ret11 := main(); {14490#true} is VALID [2022-04-28 10:05:38,156 INFO L290 TraceCheckUtils]: 5: Hoare triple {14490#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {14495#(= main_~y~0 0)} is VALID [2022-04-28 10:05:38,156 INFO L290 TraceCheckUtils]: 6: Hoare triple {14495#(= 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; {14496#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:05:38,157 INFO L290 TraceCheckUtils]: 7: Hoare triple {14496#(and (<= 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; {14497#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:05:38,157 INFO L290 TraceCheckUtils]: 8: Hoare triple {14497#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {14498#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:05:38,158 INFO L290 TraceCheckUtils]: 9: Hoare triple {14498#(and (<= main_~y~0 3) (<= 3 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; {14499#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:05:38,158 INFO L290 TraceCheckUtils]: 10: Hoare triple {14499#(and (<= main_~y~0 4) (<= 4 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; {14500#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:05:38,169 INFO L290 TraceCheckUtils]: 11: Hoare triple {14500#(and (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {14500#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:05:38,169 INFO L290 TraceCheckUtils]: 12: Hoare triple {14500#(and (<= 5 main_~y~0) (<= main_~y~0 5))} ~z~0 := ~y~0; {14546#(and (= main_~z~0 main_~y~0) (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:05:38,170 INFO L290 TraceCheckUtils]: 13: Hoare triple {14546#(and (= main_~z~0 main_~y~0) (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14550#(and (<= 5 main_~y~0) (<= main_~y~0 5) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-28 10:05:38,170 INFO L290 TraceCheckUtils]: 14: Hoare triple {14550#(and (<= 5 main_~y~0) (<= main_~y~0 5) (= main_~y~0 (+ main_~z~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14554#(and (<= 5 main_~y~0) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)) (<= main_~y~0 5))} is VALID [2022-04-28 10:05:38,171 INFO L290 TraceCheckUtils]: 15: Hoare triple {14554#(and (<= 5 main_~y~0) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)) (<= main_~y~0 5))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14558#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:05:38,172 INFO L290 TraceCheckUtils]: 16: Hoare triple {14558#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= 5 main_~y~0) (<= main_~y~0 5))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14562#(and (= (+ main_~y~0 (- 3)) (+ main_~z~0 1)) (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:05:38,172 INFO L290 TraceCheckUtils]: 17: Hoare triple {14562#(and (= (+ main_~y~0 (- 3)) (+ main_~z~0 1)) (<= 5 main_~y~0) (<= main_~y~0 5))} assume !(~z~0 % 4294967296 > 0); {14491#false} is VALID [2022-04-28 10:05:38,172 INFO L290 TraceCheckUtils]: 18: Hoare triple {14491#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14491#false} is VALID [2022-04-28 10:05:38,172 INFO L290 TraceCheckUtils]: 19: Hoare triple {14491#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14491#false} is VALID [2022-04-28 10:05:38,172 INFO L290 TraceCheckUtils]: 20: Hoare triple {14491#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14491#false} is VALID [2022-04-28 10:05:38,172 INFO L290 TraceCheckUtils]: 21: Hoare triple {14491#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14491#false} is VALID [2022-04-28 10:05:38,172 INFO L290 TraceCheckUtils]: 22: Hoare triple {14491#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14491#false} is VALID [2022-04-28 10:05:38,172 INFO L290 TraceCheckUtils]: 23: Hoare triple {14491#false} assume !(~y~0 % 4294967296 > 0); {14491#false} is VALID [2022-04-28 10:05:38,173 INFO L272 TraceCheckUtils]: 24: Hoare triple {14491#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {14491#false} is VALID [2022-04-28 10:05:38,173 INFO L290 TraceCheckUtils]: 25: Hoare triple {14491#false} ~cond := #in~cond; {14491#false} is VALID [2022-04-28 10:05:38,173 INFO L290 TraceCheckUtils]: 26: Hoare triple {14491#false} assume 0 == ~cond; {14491#false} is VALID [2022-04-28 10:05:38,173 INFO L290 TraceCheckUtils]: 27: Hoare triple {14491#false} assume !false; {14491#false} is VALID [2022-04-28 10:05:38,173 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-28 10:05:38,173 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:05:38,442 INFO L290 TraceCheckUtils]: 27: Hoare triple {14491#false} assume !false; {14491#false} is VALID [2022-04-28 10:05:38,442 INFO L290 TraceCheckUtils]: 26: Hoare triple {14491#false} assume 0 == ~cond; {14491#false} is VALID [2022-04-28 10:05:38,442 INFO L290 TraceCheckUtils]: 25: Hoare triple {14491#false} ~cond := #in~cond; {14491#false} is VALID [2022-04-28 10:05:38,443 INFO L272 TraceCheckUtils]: 24: Hoare triple {14491#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {14491#false} is VALID [2022-04-28 10:05:38,443 INFO L290 TraceCheckUtils]: 23: Hoare triple {14491#false} assume !(~y~0 % 4294967296 > 0); {14491#false} is VALID [2022-04-28 10:05:38,443 INFO L290 TraceCheckUtils]: 22: Hoare triple {14611#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14491#false} is VALID [2022-04-28 10:05:38,444 INFO L290 TraceCheckUtils]: 21: Hoare triple {14615#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14611#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:05:38,444 INFO L290 TraceCheckUtils]: 20: Hoare triple {14619#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14615#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:05:38,445 INFO L290 TraceCheckUtils]: 19: Hoare triple {14623#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14619#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-28 10:05:38,446 INFO L290 TraceCheckUtils]: 18: Hoare triple {14627#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {14623#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-28 10:05:38,446 INFO L290 TraceCheckUtils]: 17: Hoare triple {14631#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {14627#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:05:38,451 INFO L290 TraceCheckUtils]: 16: Hoare triple {14635#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14631#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} is VALID [2022-04-28 10:05:38,452 INFO L290 TraceCheckUtils]: 15: Hoare triple {14639#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14635#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} is VALID [2022-04-28 10:05:38,452 INFO L290 TraceCheckUtils]: 14: Hoare triple {14643#(or (< 0 (mod (+ main_~z~0 4294967293) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14639#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} is VALID [2022-04-28 10:05:38,453 INFO L290 TraceCheckUtils]: 13: Hoare triple {14647#(or (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {14643#(or (< 0 (mod (+ main_~z~0 4294967293) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} is VALID [2022-04-28 10:05:38,453 INFO L290 TraceCheckUtils]: 12: Hoare triple {14490#true} ~z~0 := ~y~0; {14647#(or (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} is VALID [2022-04-28 10:05:38,454 INFO L290 TraceCheckUtils]: 11: Hoare triple {14490#true} assume !(~x~0 % 4294967296 > 0); {14490#true} is VALID [2022-04-28 10:05:38,454 INFO L290 TraceCheckUtils]: 10: Hoare triple {14490#true} 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; {14490#true} is VALID [2022-04-28 10:05:38,454 INFO L290 TraceCheckUtils]: 9: Hoare triple {14490#true} 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; {14490#true} is VALID [2022-04-28 10:05:38,454 INFO L290 TraceCheckUtils]: 8: Hoare triple {14490#true} 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; {14490#true} is VALID [2022-04-28 10:05:38,454 INFO L290 TraceCheckUtils]: 7: Hoare triple {14490#true} 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; {14490#true} is VALID [2022-04-28 10:05:38,454 INFO L290 TraceCheckUtils]: 6: Hoare triple {14490#true} 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; {14490#true} is VALID [2022-04-28 10:05:38,454 INFO L290 TraceCheckUtils]: 5: Hoare triple {14490#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {14490#true} is VALID [2022-04-28 10:05:38,454 INFO L272 TraceCheckUtils]: 4: Hoare triple {14490#true} call #t~ret11 := main(); {14490#true} is VALID [2022-04-28 10:05:38,454 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14490#true} {14490#true} #61#return; {14490#true} is VALID [2022-04-28 10:05:38,454 INFO L290 TraceCheckUtils]: 2: Hoare triple {14490#true} assume true; {14490#true} is VALID [2022-04-28 10:05:38,454 INFO L290 TraceCheckUtils]: 1: Hoare triple {14490#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(10, 2);call #Ultimate.allocInit(12, 3); {14490#true} is VALID [2022-04-28 10:05:38,454 INFO L272 TraceCheckUtils]: 0: Hoare triple {14490#true} call ULTIMATE.init(); {14490#true} is VALID [2022-04-28 10:05:38,454 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-28 10:05:38,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [210393324] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:05:38,454 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:05:38,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 12] total 29 [2022-04-28 10:05:38,455 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:05:38,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [531870845] [2022-04-28 10:05:38,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [531870845] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:05:38,455 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:05:38,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 10:05:38,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758185264] [2022-04-28 10:05:38,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:05:38,455 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 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 28 [2022-04-28 10:05:38,455 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:05:38,455 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 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-28 10:05:38,472 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-28 10:05:38,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 10:05:38,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:05:38,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 10:05:38,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=685, Unknown=0, NotChecked=0, Total=812 [2022-04-28 10:05:38,473 INFO L87 Difference]: Start difference. First operand 74 states and 94 transitions. Second operand has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 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-28 10:05:39,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:05:39,109 INFO L93 Difference]: Finished difference Result 93 states and 113 transitions. [2022-04-28 10:05:39,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-28 10:05:39,109 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 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 28 [2022-04-28 10:05:39,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:05:39,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 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-28 10:05:39,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 46 transitions. [2022-04-28 10:05:39,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 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-28 10:05:39,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 46 transitions. [2022-04-28 10:05:39,111 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 46 transitions. [2022-04-28 10:05:39,167 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:05:39,167 INFO L225 Difference]: With dead ends: 93 [2022-04-28 10:05:39,168 INFO L226 Difference]: Without dead ends: 82 [2022-04-28 10:05:39,168 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=221, Invalid=1339, Unknown=0, NotChecked=0, Total=1560 [2022-04-28 10:05:39,168 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 17 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 10:05:39,169 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 63 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 10:05:39,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-04-28 10:05:39,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 75. [2022-04-28 10:05:39,243 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:05:39,243 INFO L82 GeneralOperation]: Start isEquivalent. First operand 82 states. Second operand has 75 states, 70 states have (on average 1.3) internal successors, (91), 70 states have internal predecessors, (91), 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-28 10:05:39,243 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand has 75 states, 70 states have (on average 1.3) internal successors, (91), 70 states have internal predecessors, (91), 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-28 10:05:39,243 INFO L87 Difference]: Start difference. First operand 82 states. Second operand has 75 states, 70 states have (on average 1.3) internal successors, (91), 70 states have internal predecessors, (91), 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-28 10:05:39,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:05:39,244 INFO L93 Difference]: Finished difference Result 82 states and 102 transitions. [2022-04-28 10:05:39,244 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 102 transitions. [2022-04-28 10:05:39,245 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:05:39,245 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:05:39,245 INFO L74 IsIncluded]: Start isIncluded. First operand has 75 states, 70 states have (on average 1.3) internal successors, (91), 70 states have internal predecessors, (91), 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 82 states. [2022-04-28 10:05:39,245 INFO L87 Difference]: Start difference. First operand has 75 states, 70 states have (on average 1.3) internal successors, (91), 70 states have internal predecessors, (91), 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 82 states. [2022-04-28 10:05:39,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:05:39,246 INFO L93 Difference]: Finished difference Result 82 states and 102 transitions. [2022-04-28 10:05:39,246 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 102 transitions. [2022-04-28 10:05:39,246 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:05:39,246 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:05:39,246 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:05:39,246 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:05:39,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 70 states have (on average 1.3) internal successors, (91), 70 states have internal predecessors, (91), 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-28 10:05:39,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 95 transitions. [2022-04-28 10:05:39,247 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 95 transitions. Word has length 28 [2022-04-28 10:05:39,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:05:39,247 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 95 transitions. [2022-04-28 10:05:39,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 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-28 10:05:39,247 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 75 states and 95 transitions. [2022-04-28 10:05:41,053 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:05:41,054 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 95 transitions. [2022-04-28 10:05:41,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-28 10:05:41,054 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:05:41,054 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:05:41,071 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-04-28 10:05:41,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:05:41,259 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:05:41,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:05:41,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1955495667, now seen corresponding path program 33 times [2022-04-28 10:05:41,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:05:41,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1961557780] [2022-04-28 10:05:41,262 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:05:41,262 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:05:41,262 INFO L85 PathProgramCache]: Analyzing trace with hash -1955495667, now seen corresponding path program 34 times [2022-04-28 10:05:41,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:05:41,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771958281] [2022-04-28 10:05:41,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:05:41,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:05:41,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:05:41,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:05:41,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:05:41,411 INFO L290 TraceCheckUtils]: 0: Hoare triple {15226#(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(10, 2);call #Ultimate.allocInit(12, 3); {15211#true} is VALID [2022-04-28 10:05:41,411 INFO L290 TraceCheckUtils]: 1: Hoare triple {15211#true} assume true; {15211#true} is VALID [2022-04-28 10:05:41,411 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15211#true} {15211#true} #61#return; {15211#true} is VALID [2022-04-28 10:05:41,412 INFO L272 TraceCheckUtils]: 0: Hoare triple {15211#true} call ULTIMATE.init(); {15226#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:05:41,412 INFO L290 TraceCheckUtils]: 1: Hoare triple {15226#(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(10, 2);call #Ultimate.allocInit(12, 3); {15211#true} is VALID [2022-04-28 10:05:41,412 INFO L290 TraceCheckUtils]: 2: Hoare triple {15211#true} assume true; {15211#true} is VALID [2022-04-28 10:05:41,412 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15211#true} {15211#true} #61#return; {15211#true} is VALID [2022-04-28 10:05:41,412 INFO L272 TraceCheckUtils]: 4: Hoare triple {15211#true} call #t~ret11 := main(); {15211#true} is VALID [2022-04-28 10:05:41,413 INFO L290 TraceCheckUtils]: 5: Hoare triple {15211#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {15216#(= main_~y~0 0)} is VALID [2022-04-28 10:05:41,415 INFO L290 TraceCheckUtils]: 6: Hoare triple {15216#(= 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; {15217#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:05:41,419 INFO L290 TraceCheckUtils]: 7: Hoare triple {15217#(and (<= 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; {15218#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:05:41,419 INFO L290 TraceCheckUtils]: 8: Hoare triple {15218#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {15219#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:05:41,420 INFO L290 TraceCheckUtils]: 9: Hoare triple {15219#(and (<= main_~y~0 3) (<= 3 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; {15220#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:05:41,421 INFO L290 TraceCheckUtils]: 10: Hoare triple {15220#(and (<= main_~y~0 4) (<= 4 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; {15221#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:05:41,421 INFO L290 TraceCheckUtils]: 11: Hoare triple {15221#(and (<= 5 main_~y~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; {15222#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:05:41,421 INFO L290 TraceCheckUtils]: 12: Hoare triple {15222#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {15222#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:05:41,422 INFO L290 TraceCheckUtils]: 13: Hoare triple {15222#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {15223#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:05:41,422 INFO L290 TraceCheckUtils]: 14: Hoare triple {15223#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {15224#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:05:41,423 INFO L290 TraceCheckUtils]: 15: Hoare triple {15224#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {15225#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:05:41,423 INFO L290 TraceCheckUtils]: 16: Hoare triple {15225#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {15212#false} is VALID [2022-04-28 10:05:41,423 INFO L290 TraceCheckUtils]: 17: Hoare triple {15212#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {15212#false} is VALID [2022-04-28 10:05:41,423 INFO L290 TraceCheckUtils]: 18: Hoare triple {15212#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {15212#false} is VALID [2022-04-28 10:05:41,424 INFO L290 TraceCheckUtils]: 19: Hoare triple {15212#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {15212#false} is VALID [2022-04-28 10:05:41,424 INFO L290 TraceCheckUtils]: 20: Hoare triple {15212#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {15212#false} is VALID [2022-04-28 10:05:41,424 INFO L290 TraceCheckUtils]: 21: Hoare triple {15212#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {15212#false} is VALID [2022-04-28 10:05:41,424 INFO L290 TraceCheckUtils]: 22: Hoare triple {15212#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {15212#false} is VALID [2022-04-28 10:05:41,424 INFO L290 TraceCheckUtils]: 23: Hoare triple {15212#false} assume !(~y~0 % 4294967296 > 0); {15212#false} is VALID [2022-04-28 10:05:41,424 INFO L272 TraceCheckUtils]: 24: Hoare triple {15212#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {15212#false} is VALID [2022-04-28 10:05:41,424 INFO L290 TraceCheckUtils]: 25: Hoare triple {15212#false} ~cond := #in~cond; {15212#false} is VALID [2022-04-28 10:05:41,424 INFO L290 TraceCheckUtils]: 26: Hoare triple {15212#false} assume 0 == ~cond; {15212#false} is VALID [2022-04-28 10:05:41,424 INFO L290 TraceCheckUtils]: 27: Hoare triple {15212#false} assume !false; {15212#false} is VALID [2022-04-28 10:05:41,424 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-28 10:05:41,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:05:41,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771958281] [2022-04-28 10:05:41,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771958281] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:05:41,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [313277639] [2022-04-28 10:05:41,424 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:05:41,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:05:41,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:05:41,425 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:05:41,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-04-28 10:05:41,453 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:05:41,454 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:05:41,454 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-28 10:05:41,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:05:41,460 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:05:41,672 INFO L272 TraceCheckUtils]: 0: Hoare triple {15211#true} call ULTIMATE.init(); {15211#true} is VALID [2022-04-28 10:05:41,672 INFO L290 TraceCheckUtils]: 1: Hoare triple {15211#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(10, 2);call #Ultimate.allocInit(12, 3); {15211#true} is VALID [2022-04-28 10:05:41,672 INFO L290 TraceCheckUtils]: 2: Hoare triple {15211#true} assume true; {15211#true} is VALID [2022-04-28 10:05:41,672 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15211#true} {15211#true} #61#return; {15211#true} is VALID [2022-04-28 10:05:41,672 INFO L272 TraceCheckUtils]: 4: Hoare triple {15211#true} call #t~ret11 := main(); {15211#true} is VALID [2022-04-28 10:05:41,672 INFO L290 TraceCheckUtils]: 5: Hoare triple {15211#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {15216#(= main_~y~0 0)} is VALID [2022-04-28 10:05:41,673 INFO L290 TraceCheckUtils]: 6: Hoare triple {15216#(= 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; {15217#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:05:41,673 INFO L290 TraceCheckUtils]: 7: Hoare triple {15217#(and (<= 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; {15218#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:05:41,674 INFO L290 TraceCheckUtils]: 8: Hoare triple {15218#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {15219#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:05:41,674 INFO L290 TraceCheckUtils]: 9: Hoare triple {15219#(and (<= main_~y~0 3) (<= 3 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; {15220#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:05:41,675 INFO L290 TraceCheckUtils]: 10: Hoare triple {15220#(and (<= main_~y~0 4) (<= 4 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; {15221#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:05:41,675 INFO L290 TraceCheckUtils]: 11: Hoare triple {15221#(and (<= 5 main_~y~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; {15222#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:05:41,676 INFO L290 TraceCheckUtils]: 12: Hoare triple {15222#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {15222#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:05:41,676 INFO L290 TraceCheckUtils]: 13: Hoare triple {15222#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {15223#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:05:41,677 INFO L290 TraceCheckUtils]: 14: Hoare triple {15223#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {15224#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:05:41,677 INFO L290 TraceCheckUtils]: 15: Hoare triple {15224#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {15275#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:05:41,678 INFO L290 TraceCheckUtils]: 16: Hoare triple {15275#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !(~z~0 % 4294967296 > 0); {15212#false} is VALID [2022-04-28 10:05:41,678 INFO L290 TraceCheckUtils]: 17: Hoare triple {15212#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {15212#false} is VALID [2022-04-28 10:05:41,678 INFO L290 TraceCheckUtils]: 18: Hoare triple {15212#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {15212#false} is VALID [2022-04-28 10:05:41,678 INFO L290 TraceCheckUtils]: 19: Hoare triple {15212#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {15212#false} is VALID [2022-04-28 10:05:41,678 INFO L290 TraceCheckUtils]: 20: Hoare triple {15212#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {15212#false} is VALID [2022-04-28 10:05:41,678 INFO L290 TraceCheckUtils]: 21: Hoare triple {15212#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {15212#false} is VALID [2022-04-28 10:05:41,678 INFO L290 TraceCheckUtils]: 22: Hoare triple {15212#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {15212#false} is VALID [2022-04-28 10:05:41,678 INFO L290 TraceCheckUtils]: 23: Hoare triple {15212#false} assume !(~y~0 % 4294967296 > 0); {15212#false} is VALID [2022-04-28 10:05:41,678 INFO L272 TraceCheckUtils]: 24: Hoare triple {15212#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {15212#false} is VALID [2022-04-28 10:05:41,678 INFO L290 TraceCheckUtils]: 25: Hoare triple {15212#false} ~cond := #in~cond; {15212#false} is VALID [2022-04-28 10:05:41,678 INFO L290 TraceCheckUtils]: 26: Hoare triple {15212#false} assume 0 == ~cond; {15212#false} is VALID [2022-04-28 10:05:41,678 INFO L290 TraceCheckUtils]: 27: Hoare triple {15212#false} assume !false; {15212#false} is VALID [2022-04-28 10:05:41,678 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-28 10:05:41,678 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:05:41,898 INFO L290 TraceCheckUtils]: 27: Hoare triple {15212#false} assume !false; {15212#false} is VALID [2022-04-28 10:05:41,898 INFO L290 TraceCheckUtils]: 26: Hoare triple {15212#false} assume 0 == ~cond; {15212#false} is VALID [2022-04-28 10:05:41,898 INFO L290 TraceCheckUtils]: 25: Hoare triple {15212#false} ~cond := #in~cond; {15212#false} is VALID [2022-04-28 10:05:41,898 INFO L272 TraceCheckUtils]: 24: Hoare triple {15212#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {15212#false} is VALID [2022-04-28 10:05:41,898 INFO L290 TraceCheckUtils]: 23: Hoare triple {15212#false} assume !(~y~0 % 4294967296 > 0); {15212#false} is VALID [2022-04-28 10:05:41,899 INFO L290 TraceCheckUtils]: 22: Hoare triple {15212#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {15212#false} is VALID [2022-04-28 10:05:41,899 INFO L290 TraceCheckUtils]: 21: Hoare triple {15212#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {15212#false} is VALID [2022-04-28 10:05:41,899 INFO L290 TraceCheckUtils]: 20: Hoare triple {15212#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {15212#false} is VALID [2022-04-28 10:05:41,899 INFO L290 TraceCheckUtils]: 19: Hoare triple {15212#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {15212#false} is VALID [2022-04-28 10:05:41,899 INFO L290 TraceCheckUtils]: 18: Hoare triple {15212#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {15212#false} is VALID [2022-04-28 10:05:41,899 INFO L290 TraceCheckUtils]: 17: Hoare triple {15212#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {15212#false} is VALID [2022-04-28 10:05:41,899 INFO L290 TraceCheckUtils]: 16: Hoare triple {15345#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {15212#false} is VALID [2022-04-28 10:05:41,900 INFO L290 TraceCheckUtils]: 15: Hoare triple {15349#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {15345#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:05:41,901 INFO L290 TraceCheckUtils]: 14: Hoare triple {15353#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {15349#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:05:41,901 INFO L290 TraceCheckUtils]: 13: Hoare triple {15357#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} ~z~0 := ~y~0; {15353#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-28 10:05:41,901 INFO L290 TraceCheckUtils]: 12: Hoare triple {15357#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !(~x~0 % 4294967296 > 0); {15357#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:05:41,902 INFO L290 TraceCheckUtils]: 11: Hoare triple {15364#(< 0 (mod (+ main_~y~0 4294967295) 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; {15357#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:05:41,903 INFO L290 TraceCheckUtils]: 10: Hoare triple {15368#(< 0 (mod main_~y~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; {15364#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:05:41,903 INFO L290 TraceCheckUtils]: 9: Hoare triple {15372#(< 0 (mod (+ main_~y~0 1) 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; {15368#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:05:41,904 INFO L290 TraceCheckUtils]: 8: Hoare triple {15376#(< 0 (mod (+ main_~y~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; {15372#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:05:41,908 INFO L290 TraceCheckUtils]: 7: Hoare triple {15380#(< 0 (mod (+ main_~y~0 3) 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; {15376#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:05:41,909 INFO L290 TraceCheckUtils]: 6: Hoare triple {15384#(< 0 (mod (+ main_~y~0 4) 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; {15380#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:05:41,909 INFO L290 TraceCheckUtils]: 5: Hoare triple {15211#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {15384#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:05:41,909 INFO L272 TraceCheckUtils]: 4: Hoare triple {15211#true} call #t~ret11 := main(); {15211#true} is VALID [2022-04-28 10:05:41,909 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15211#true} {15211#true} #61#return; {15211#true} is VALID [2022-04-28 10:05:41,909 INFO L290 TraceCheckUtils]: 2: Hoare triple {15211#true} assume true; {15211#true} is VALID [2022-04-28 10:05:41,909 INFO L290 TraceCheckUtils]: 1: Hoare triple {15211#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(10, 2);call #Ultimate.allocInit(12, 3); {15211#true} is VALID [2022-04-28 10:05:41,909 INFO L272 TraceCheckUtils]: 0: Hoare triple {15211#true} call ULTIMATE.init(); {15211#true} is VALID [2022-04-28 10:05:41,909 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-28 10:05:41,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [313277639] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:05:41,910 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:05:41,910 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 24 [2022-04-28 10:05:41,910 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:05:41,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1961557780] [2022-04-28 10:05:41,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1961557780] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:05:41,910 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:05:41,910 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 10:05:41,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155848625] [2022-04-28 10:05:41,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:05:41,910 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 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 28 [2022-04-28 10:05:41,910 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:05:41,910 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 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-28 10:05:41,927 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-28 10:05:41,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 10:05:41,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:05:41,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 10:05:41,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=446, Unknown=0, NotChecked=0, Total=552 [2022-04-28 10:05:41,928 INFO L87 Difference]: Start difference. First operand 75 states and 95 transitions. Second operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 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-28 10:05:42,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:05:42,615 INFO L93 Difference]: Finished difference Result 96 states and 116 transitions. [2022-04-28 10:05:42,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-28 10:05:42,615 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 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 28 [2022-04-28 10:05:42,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:05:42,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 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-28 10:05:42,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 52 transitions. [2022-04-28 10:05:42,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 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-28 10:05:42,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 52 transitions. [2022-04-28 10:05:42,617 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 52 transitions. [2022-04-28 10:05:42,671 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:05:42,671 INFO L225 Difference]: With dead ends: 96 [2022-04-28 10:05:42,671 INFO L226 Difference]: Without dead ends: 84 [2022-04-28 10:05:42,672 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=266, Invalid=994, Unknown=0, NotChecked=0, Total=1260 [2022-04-28 10:05:42,672 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 24 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 10:05:42,673 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 70 Invalid, 339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 10:05:42,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-04-28 10:05:42,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 76. [2022-04-28 10:05:42,750 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:05:42,750 INFO L82 GeneralOperation]: Start isEquivalent. First operand 84 states. Second operand has 76 states, 71 states have (on average 1.295774647887324) internal successors, (92), 71 states have internal predecessors, (92), 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-28 10:05:42,750 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand has 76 states, 71 states have (on average 1.295774647887324) internal successors, (92), 71 states have internal predecessors, (92), 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-28 10:05:42,751 INFO L87 Difference]: Start difference. First operand 84 states. Second operand has 76 states, 71 states have (on average 1.295774647887324) internal successors, (92), 71 states have internal predecessors, (92), 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-28 10:05:42,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:05:42,751 INFO L93 Difference]: Finished difference Result 84 states and 104 transitions. [2022-04-28 10:05:42,751 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 104 transitions. [2022-04-28 10:05:42,752 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:05:42,752 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:05:42,752 INFO L74 IsIncluded]: Start isIncluded. First operand has 76 states, 71 states have (on average 1.295774647887324) internal successors, (92), 71 states have internal predecessors, (92), 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 84 states. [2022-04-28 10:05:42,752 INFO L87 Difference]: Start difference. First operand has 76 states, 71 states have (on average 1.295774647887324) internal successors, (92), 71 states have internal predecessors, (92), 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 84 states. [2022-04-28 10:05:42,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:05:42,753 INFO L93 Difference]: Finished difference Result 84 states and 104 transitions. [2022-04-28 10:05:42,753 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 104 transitions. [2022-04-28 10:05:42,753 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:05:42,753 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:05:42,753 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:05:42,753 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:05:42,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 71 states have (on average 1.295774647887324) internal successors, (92), 71 states have internal predecessors, (92), 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-28 10:05:42,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 96 transitions. [2022-04-28 10:05:42,754 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 96 transitions. Word has length 28 [2022-04-28 10:05:42,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:05:42,754 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 96 transitions. [2022-04-28 10:05:42,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 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-28 10:05:42,754 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 76 states and 96 transitions. [2022-04-28 10:05:43,711 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:05:43,711 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 96 transitions. [2022-04-28 10:05:43,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-28 10:05:43,712 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:05:43,712 INFO L195 NwaCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:05:43,729 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-04-28 10:05:43,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2022-04-28 10:05:43,924 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:05:43,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:05:43,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1976758829, now seen corresponding path program 27 times [2022-04-28 10:05:43,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:05:43,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2144096954] [2022-04-28 10:05:43,926 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:05:43,926 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:05:43,926 INFO L85 PathProgramCache]: Analyzing trace with hash 1976758829, now seen corresponding path program 28 times [2022-04-28 10:05:43,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:05:43,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124777760] [2022-04-28 10:05:43,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:05:43,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:05:43,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:05:44,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:05:44,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:05:44,193 INFO L290 TraceCheckUtils]: 0: Hoare triple {15962#(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(10, 2);call #Ultimate.allocInit(12, 3); {15941#true} is VALID [2022-04-28 10:05:44,194 INFO L290 TraceCheckUtils]: 1: Hoare triple {15941#true} assume true; {15941#true} is VALID [2022-04-28 10:05:44,194 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15941#true} {15941#true} #61#return; {15941#true} is VALID [2022-04-28 10:05:44,194 INFO L272 TraceCheckUtils]: 0: Hoare triple {15941#true} call ULTIMATE.init(); {15962#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:05:44,194 INFO L290 TraceCheckUtils]: 1: Hoare triple {15962#(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(10, 2);call #Ultimate.allocInit(12, 3); {15941#true} is VALID [2022-04-28 10:05:44,194 INFO L290 TraceCheckUtils]: 2: Hoare triple {15941#true} assume true; {15941#true} is VALID [2022-04-28 10:05:44,194 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15941#true} {15941#true} #61#return; {15941#true} is VALID [2022-04-28 10:05:44,194 INFO L272 TraceCheckUtils]: 4: Hoare triple {15941#true} call #t~ret11 := main(); {15941#true} is VALID [2022-04-28 10:05:44,195 INFO L290 TraceCheckUtils]: 5: Hoare triple {15941#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {15946#(= main_~y~0 0)} is VALID [2022-04-28 10:05:44,195 INFO L290 TraceCheckUtils]: 6: Hoare triple {15946#(= 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; {15947#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:05:44,196 INFO L290 TraceCheckUtils]: 7: Hoare triple {15947#(and (<= 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; {15948#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:05:44,196 INFO L290 TraceCheckUtils]: 8: Hoare triple {15948#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {15949#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:05:44,197 INFO L290 TraceCheckUtils]: 9: Hoare triple {15949#(and (<= main_~y~0 3) (<= 3 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; {15950#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:05:44,197 INFO L290 TraceCheckUtils]: 10: Hoare triple {15950#(and (<= main_~y~0 4) (<= 4 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; {15951#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:05:44,198 INFO L290 TraceCheckUtils]: 11: Hoare triple {15951#(and (<= 5 main_~y~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; {15952#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:05:44,198 INFO L290 TraceCheckUtils]: 12: Hoare triple {15952#(and (<= main_~y~0 6) (<= 6 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; {15953#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:05:44,199 INFO L290 TraceCheckUtils]: 13: Hoare triple {15953#(and (<= 7 main_~y~0) (<= main_~y~0 7))} 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; {15954#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:05:44,200 INFO L290 TraceCheckUtils]: 14: Hoare triple {15954#(and (<= main_~y~0 8) (<= 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; {15955#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:05:44,200 INFO L290 TraceCheckUtils]: 15: Hoare triple {15955#(and (<= 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; {15956#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:05:44,201 INFO L290 TraceCheckUtils]: 16: Hoare triple {15956#(and (<= main_~y~0 10) (<= 10 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; {15957#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:05:44,201 INFO L290 TraceCheckUtils]: 17: Hoare triple {15957#(and (<= main_~y~0 11) (<= 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; {15958#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:05:44,202 INFO L290 TraceCheckUtils]: 18: Hoare triple {15958#(and (<= 12 main_~y~0) (<= main_~y~0 12))} 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; {15959#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:05:44,202 INFO L290 TraceCheckUtils]: 19: Hoare triple {15959#(and (<= main_~y~0 13) (<= 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; {15960#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:05:44,203 INFO L290 TraceCheckUtils]: 20: Hoare triple {15960#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !(~x~0 % 4294967296 > 0); {15960#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:05:44,203 INFO L290 TraceCheckUtils]: 21: Hoare triple {15960#(and (<= 14 main_~y~0) (<= main_~y~0 14))} ~z~0 := ~y~0; {15961#(and (<= 14 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:05:44,204 INFO L290 TraceCheckUtils]: 22: Hoare triple {15961#(and (<= 14 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {15942#false} is VALID [2022-04-28 10:05:44,204 INFO L290 TraceCheckUtils]: 23: Hoare triple {15942#false} assume !(~y~0 % 4294967296 > 0); {15942#false} is VALID [2022-04-28 10:05:44,204 INFO L272 TraceCheckUtils]: 24: Hoare triple {15942#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {15942#false} is VALID [2022-04-28 10:05:44,204 INFO L290 TraceCheckUtils]: 25: Hoare triple {15942#false} ~cond := #in~cond; {15942#false} is VALID [2022-04-28 10:05:44,204 INFO L290 TraceCheckUtils]: 26: Hoare triple {15942#false} assume 0 == ~cond; {15942#false} is VALID [2022-04-28 10:05:44,204 INFO L290 TraceCheckUtils]: 27: Hoare triple {15942#false} assume !false; {15942#false} is VALID [2022-04-28 10:05:44,204 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:05:44,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:05:44,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124777760] [2022-04-28 10:05:44,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124777760] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:05:44,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [321005426] [2022-04-28 10:05:44,205 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:05:44,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:05:44,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:05:44,206 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:05:44,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-04-28 10:05:44,239 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:05:44,239 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:05:44,240 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-28 10:05:44,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:05:44,246 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:05:44,478 INFO L272 TraceCheckUtils]: 0: Hoare triple {15941#true} call ULTIMATE.init(); {15941#true} is VALID [2022-04-28 10:05:44,478 INFO L290 TraceCheckUtils]: 1: Hoare triple {15941#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(10, 2);call #Ultimate.allocInit(12, 3); {15941#true} is VALID [2022-04-28 10:05:44,478 INFO L290 TraceCheckUtils]: 2: Hoare triple {15941#true} assume true; {15941#true} is VALID [2022-04-28 10:05:44,478 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15941#true} {15941#true} #61#return; {15941#true} is VALID [2022-04-28 10:05:44,478 INFO L272 TraceCheckUtils]: 4: Hoare triple {15941#true} call #t~ret11 := main(); {15941#true} is VALID [2022-04-28 10:05:44,479 INFO L290 TraceCheckUtils]: 5: Hoare triple {15941#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {15946#(= main_~y~0 0)} is VALID [2022-04-28 10:05:44,479 INFO L290 TraceCheckUtils]: 6: Hoare triple {15946#(= 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; {15947#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:05:44,480 INFO L290 TraceCheckUtils]: 7: Hoare triple {15947#(and (<= 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; {15948#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:05:44,480 INFO L290 TraceCheckUtils]: 8: Hoare triple {15948#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {15949#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:05:44,481 INFO L290 TraceCheckUtils]: 9: Hoare triple {15949#(and (<= main_~y~0 3) (<= 3 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; {15950#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:05:44,481 INFO L290 TraceCheckUtils]: 10: Hoare triple {15950#(and (<= main_~y~0 4) (<= 4 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; {15951#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:05:44,482 INFO L290 TraceCheckUtils]: 11: Hoare triple {15951#(and (<= 5 main_~y~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; {15952#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:05:44,482 INFO L290 TraceCheckUtils]: 12: Hoare triple {15952#(and (<= main_~y~0 6) (<= 6 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; {15953#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:05:44,483 INFO L290 TraceCheckUtils]: 13: Hoare triple {15953#(and (<= 7 main_~y~0) (<= main_~y~0 7))} 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; {15954#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:05:44,483 INFO L290 TraceCheckUtils]: 14: Hoare triple {15954#(and (<= main_~y~0 8) (<= 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; {15955#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:05:44,484 INFO L290 TraceCheckUtils]: 15: Hoare triple {15955#(and (<= 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; {15956#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:05:44,484 INFO L290 TraceCheckUtils]: 16: Hoare triple {15956#(and (<= main_~y~0 10) (<= 10 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; {15957#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:05:44,485 INFO L290 TraceCheckUtils]: 17: Hoare triple {15957#(and (<= main_~y~0 11) (<= 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; {15958#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:05:44,485 INFO L290 TraceCheckUtils]: 18: Hoare triple {15958#(and (<= 12 main_~y~0) (<= main_~y~0 12))} 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; {15959#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:05:44,486 INFO L290 TraceCheckUtils]: 19: Hoare triple {15959#(and (<= main_~y~0 13) (<= 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; {15960#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:05:44,486 INFO L290 TraceCheckUtils]: 20: Hoare triple {15960#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !(~x~0 % 4294967296 > 0); {15960#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:05:44,486 INFO L290 TraceCheckUtils]: 21: Hoare triple {15960#(and (<= 14 main_~y~0) (<= main_~y~0 14))} ~z~0 := ~y~0; {16029#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-28 10:05:44,487 INFO L290 TraceCheckUtils]: 22: Hoare triple {16029#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !(~z~0 % 4294967296 > 0); {15942#false} is VALID [2022-04-28 10:05:44,487 INFO L290 TraceCheckUtils]: 23: Hoare triple {15942#false} assume !(~y~0 % 4294967296 > 0); {15942#false} is VALID [2022-04-28 10:05:44,487 INFO L272 TraceCheckUtils]: 24: Hoare triple {15942#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {15942#false} is VALID [2022-04-28 10:05:44,487 INFO L290 TraceCheckUtils]: 25: Hoare triple {15942#false} ~cond := #in~cond; {15942#false} is VALID [2022-04-28 10:05:44,487 INFO L290 TraceCheckUtils]: 26: Hoare triple {15942#false} assume 0 == ~cond; {15942#false} is VALID [2022-04-28 10:05:44,487 INFO L290 TraceCheckUtils]: 27: Hoare triple {15942#false} assume !false; {15942#false} is VALID [2022-04-28 10:05:44,487 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:05:44,487 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:05:44,939 INFO L290 TraceCheckUtils]: 27: Hoare triple {15942#false} assume !false; {15942#false} is VALID [2022-04-28 10:05:44,939 INFO L290 TraceCheckUtils]: 26: Hoare triple {15942#false} assume 0 == ~cond; {15942#false} is VALID [2022-04-28 10:05:44,939 INFO L290 TraceCheckUtils]: 25: Hoare triple {15942#false} ~cond := #in~cond; {15942#false} is VALID [2022-04-28 10:05:44,939 INFO L272 TraceCheckUtils]: 24: Hoare triple {15942#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {15942#false} is VALID [2022-04-28 10:05:44,939 INFO L290 TraceCheckUtils]: 23: Hoare triple {15942#false} assume !(~y~0 % 4294967296 > 0); {15942#false} is VALID [2022-04-28 10:05:44,940 INFO L290 TraceCheckUtils]: 22: Hoare triple {16063#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {15942#false} is VALID [2022-04-28 10:05:44,940 INFO L290 TraceCheckUtils]: 21: Hoare triple {16067#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {16063#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:05:44,940 INFO L290 TraceCheckUtils]: 20: Hoare triple {16067#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {16067#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:05:44,941 INFO L290 TraceCheckUtils]: 19: Hoare triple {16074#(< 0 (mod (+ main_~y~0 1) 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; {16067#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:05:44,942 INFO L290 TraceCheckUtils]: 18: Hoare triple {16078#(< 0 (mod (+ main_~y~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; {16074#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:05:44,942 INFO L290 TraceCheckUtils]: 17: Hoare triple {16082#(< 0 (mod (+ main_~y~0 3) 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; {16078#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:05:44,943 INFO L290 TraceCheckUtils]: 16: Hoare triple {16086#(< 0 (mod (+ main_~y~0 4) 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; {16082#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:05:44,943 INFO L290 TraceCheckUtils]: 15: Hoare triple {16090#(< 0 (mod (+ 5 main_~y~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; {16086#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:05:44,944 INFO L290 TraceCheckUtils]: 14: Hoare triple {16094#(< 0 (mod (+ main_~y~0 6) 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; {16090#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:05:44,945 INFO L290 TraceCheckUtils]: 13: Hoare triple {16098#(< 0 (mod (+ 7 main_~y~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; {16094#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:05:44,945 INFO L290 TraceCheckUtils]: 12: Hoare triple {16102#(< 0 (mod (+ main_~y~0 8) 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; {16098#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:05:44,946 INFO L290 TraceCheckUtils]: 11: Hoare triple {16106#(< 0 (mod (+ main_~y~0 9) 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; {16102#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:05:44,947 INFO L290 TraceCheckUtils]: 10: Hoare triple {16110#(< 0 (mod (+ main_~y~0 10) 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; {16106#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:05:44,947 INFO L290 TraceCheckUtils]: 9: Hoare triple {16114#(< 0 (mod (+ main_~y~0 11) 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; {16110#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-28 10:05:44,948 INFO L290 TraceCheckUtils]: 8: Hoare triple {16118#(< 0 (mod (+ main_~y~0 12) 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; {16114#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-28 10:05:44,949 INFO L290 TraceCheckUtils]: 7: Hoare triple {16122#(< 0 (mod (+ main_~y~0 13) 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; {16118#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-28 10:05:44,949 INFO L290 TraceCheckUtils]: 6: Hoare triple {16126#(< 0 (mod (+ main_~y~0 14) 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; {16122#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-28 10:05:44,949 INFO L290 TraceCheckUtils]: 5: Hoare triple {15941#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {16126#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-28 10:05:44,950 INFO L272 TraceCheckUtils]: 4: Hoare triple {15941#true} call #t~ret11 := main(); {15941#true} is VALID [2022-04-28 10:05:44,950 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15941#true} {15941#true} #61#return; {15941#true} is VALID [2022-04-28 10:05:44,950 INFO L290 TraceCheckUtils]: 2: Hoare triple {15941#true} assume true; {15941#true} is VALID [2022-04-28 10:05:44,950 INFO L290 TraceCheckUtils]: 1: Hoare triple {15941#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(10, 2);call #Ultimate.allocInit(12, 3); {15941#true} is VALID [2022-04-28 10:05:44,950 INFO L272 TraceCheckUtils]: 0: Hoare triple {15941#true} call ULTIMATE.init(); {15941#true} is VALID [2022-04-28 10:05:44,950 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:05:44,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [321005426] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:05:44,950 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:05:44,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 36 [2022-04-28 10:05:44,950 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:05:44,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2144096954] [2022-04-28 10:05:44,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2144096954] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:05:44,951 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:05:44,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-28 10:05:44,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568229214] [2022-04-28 10:05:44,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:05:44,952 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.263157894736842) internal successors, (24), 18 states have internal predecessors, (24), 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 28 [2022-04-28 10:05:44,952 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:05:44,952 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 1.263157894736842) internal successors, (24), 18 states have internal predecessors, (24), 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-28 10:05:44,969 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:05:44,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-28 10:05:44,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:05:44,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-28 10:05:44,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=296, Invalid=964, Unknown=0, NotChecked=0, Total=1260 [2022-04-28 10:05:44,970 INFO L87 Difference]: Start difference. First operand 76 states and 96 transitions. Second operand has 19 states, 19 states have (on average 1.263157894736842) internal successors, (24), 18 states have internal predecessors, (24), 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-28 10:05:46,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:05:46,910 INFO L93 Difference]: Finished difference Result 102 states and 140 transitions. [2022-04-28 10:05:46,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-28 10:05:46,910 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.263157894736842) internal successors, (24), 18 states have internal predecessors, (24), 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 28 [2022-04-28 10:05:46,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:05:46,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.263157894736842) internal successors, (24), 18 states have internal predecessors, (24), 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-28 10:05:46,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 111 transitions. [2022-04-28 10:05:46,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.263157894736842) internal successors, (24), 18 states have internal predecessors, (24), 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-28 10:05:46,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 111 transitions. [2022-04-28 10:05:46,912 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 111 transitions. [2022-04-28 10:05:47,004 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:05:47,005 INFO L225 Difference]: With dead ends: 102 [2022-04-28 10:05:47,005 INFO L226 Difference]: Without dead ends: 96 [2022-04-28 10:05:47,006 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=602, Invalid=2050, Unknown=0, NotChecked=0, Total=2652 [2022-04-28 10:05:47,006 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 92 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 1172 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 1235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 1172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-28 10:05:47,006 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 121 Invalid, 1235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 1172 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-28 10:05:47,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-04-28 10:05:47,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 81. [2022-04-28 10:05:47,083 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:05:47,083 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand has 81 states, 76 states have (on average 1.3026315789473684) internal successors, (99), 76 states have internal predecessors, (99), 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-28 10:05:47,083 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand has 81 states, 76 states have (on average 1.3026315789473684) internal successors, (99), 76 states have internal predecessors, (99), 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-28 10:05:47,083 INFO L87 Difference]: Start difference. First operand 96 states. Second operand has 81 states, 76 states have (on average 1.3026315789473684) internal successors, (99), 76 states have internal predecessors, (99), 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-28 10:05:47,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:05:47,084 INFO L93 Difference]: Finished difference Result 96 states and 118 transitions. [2022-04-28 10:05:47,084 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 118 transitions. [2022-04-28 10:05:47,084 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:05:47,084 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:05:47,084 INFO L74 IsIncluded]: Start isIncluded. First operand has 81 states, 76 states have (on average 1.3026315789473684) internal successors, (99), 76 states have internal predecessors, (99), 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 96 states. [2022-04-28 10:05:47,084 INFO L87 Difference]: Start difference. First operand has 81 states, 76 states have (on average 1.3026315789473684) internal successors, (99), 76 states have internal predecessors, (99), 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 96 states. [2022-04-28 10:05:47,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:05:47,085 INFO L93 Difference]: Finished difference Result 96 states and 118 transitions. [2022-04-28 10:05:47,085 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 118 transitions. [2022-04-28 10:05:47,085 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:05:47,085 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:05:47,085 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:05:47,085 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:05:47,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 76 states have (on average 1.3026315789473684) internal successors, (99), 76 states have internal predecessors, (99), 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-28 10:05:47,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 103 transitions. [2022-04-28 10:05:47,086 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 103 transitions. Word has length 28 [2022-04-28 10:05:47,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:05:47,086 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 103 transitions. [2022-04-28 10:05:47,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.263157894736842) internal successors, (24), 18 states have internal predecessors, (24), 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-28 10:05:47,086 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 81 states and 103 transitions. [2022-04-28 10:05:47,466 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:05:47,466 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 103 transitions. [2022-04-28 10:05:47,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-28 10:05:47,466 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:05:47,466 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:05:47,482 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2022-04-28 10:05:47,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:05:47,675 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:05:47,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:05:47,676 INFO L85 PathProgramCache]: Analyzing trace with hash 646714815, now seen corresponding path program 35 times [2022-04-28 10:05:47,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:05:47,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [537116897] [2022-04-28 10:05:47,678 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:05:47,678 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:05:47,678 INFO L85 PathProgramCache]: Analyzing trace with hash 646714815, now seen corresponding path program 36 times [2022-04-28 10:05:47,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:05:47,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018046846] [2022-04-28 10:05:47,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:05:47,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:05:47,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:05:48,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:05:48,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:05:48,228 INFO L290 TraceCheckUtils]: 0: Hoare triple {16758#(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(10, 2);call #Ultimate.allocInit(12, 3); {16737#true} is VALID [2022-04-28 10:05:48,228 INFO L290 TraceCheckUtils]: 1: Hoare triple {16737#true} assume true; {16737#true} is VALID [2022-04-28 10:05:48,228 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16737#true} {16737#true} #61#return; {16737#true} is VALID [2022-04-28 10:05:48,229 INFO L272 TraceCheckUtils]: 0: Hoare triple {16737#true} call ULTIMATE.init(); {16758#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:05:48,229 INFO L290 TraceCheckUtils]: 1: Hoare triple {16758#(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(10, 2);call #Ultimate.allocInit(12, 3); {16737#true} is VALID [2022-04-28 10:05:48,229 INFO L290 TraceCheckUtils]: 2: Hoare triple {16737#true} assume true; {16737#true} is VALID [2022-04-28 10:05:48,229 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16737#true} {16737#true} #61#return; {16737#true} is VALID [2022-04-28 10:05:48,229 INFO L272 TraceCheckUtils]: 4: Hoare triple {16737#true} call #t~ret11 := main(); {16737#true} is VALID [2022-04-28 10:05:48,229 INFO L290 TraceCheckUtils]: 5: Hoare triple {16737#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {16742#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-28 10:05:48,231 INFO L290 TraceCheckUtils]: 6: Hoare triple {16742#(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; {16743#(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-28 10:05:48,234 INFO L290 TraceCheckUtils]: 7: Hoare triple {16743#(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; {16744#(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-28 10:05:48,254 INFO L290 TraceCheckUtils]: 8: Hoare triple {16744#(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; {16745#(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-28 10:05:48,258 INFO L290 TraceCheckUtils]: 9: Hoare triple {16745#(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; {16746#(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-28 10:05:48,869 INFO L290 TraceCheckUtils]: 10: Hoare triple {16746#(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; {16747#(and (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~x~0) (* (- 1) main_~y~0) (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296) 5) main_~n~0) (<= 5 main_~y~0) (<= main_~n~0 (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) 4294967295)) (<= main_~y~0 5))} is VALID [2022-04-28 10:05:48,871 INFO L290 TraceCheckUtils]: 11: Hoare triple {16747#(and (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~x~0) (* (- 1) main_~y~0) (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296) 5) main_~n~0) (<= 5 main_~y~0) (<= main_~n~0 (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) 4294967295)) (<= main_~y~0 5))} assume !(~x~0 % 4294967296 > 0); {16748#(and (<= main_~y~0 5) (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) 5) main_~n~0))} is VALID [2022-04-28 10:05:48,871 INFO L290 TraceCheckUtils]: 12: Hoare triple {16748#(and (<= main_~y~0 5) (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) 5) main_~n~0))} ~z~0 := ~y~0; {16749#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 5) main_~n~0) (<= main_~z~0 5))} is VALID [2022-04-28 10:05:48,872 INFO L290 TraceCheckUtils]: 13: Hoare triple {16749#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 5) main_~n~0) (<= main_~z~0 5))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {16750#(and (<= main_~z~0 4) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 5) main_~n~0))} is VALID [2022-04-28 10:05:48,873 INFO L290 TraceCheckUtils]: 14: Hoare triple {16750#(and (<= main_~z~0 4) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 5) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {16751#(and (<= main_~z~0 3) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 5) main_~n~0))} is VALID [2022-04-28 10:05:48,874 INFO L290 TraceCheckUtils]: 15: Hoare triple {16751#(and (<= main_~z~0 3) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 5) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {16752#(and (<= (+ 5 (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0) (<= main_~z~0 2))} is VALID [2022-04-28 10:05:48,875 INFO L290 TraceCheckUtils]: 16: Hoare triple {16752#(and (<= (+ 5 (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0) (<= main_~z~0 2))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {16753#(and (<= main_~z~0 1) (<= (+ 5 (* (div (+ 4294967291 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} is VALID [2022-04-28 10:05:48,876 INFO L290 TraceCheckUtils]: 17: Hoare triple {16753#(and (<= main_~z~0 1) (<= (+ 5 (* (div (+ 4294967291 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {16754#(and (<= main_~z~0 0) (<= (+ 5 (* (div (+ 4294967290 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} is VALID [2022-04-28 10:05:48,876 INFO L290 TraceCheckUtils]: 18: Hoare triple {16754#(and (<= main_~z~0 0) (<= (+ 5 (* (div (+ 4294967290 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} assume !(~z~0 % 4294967296 > 0); {16754#(and (<= main_~z~0 0) (<= (+ 5 (* (div (+ 4294967290 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} is VALID [2022-04-28 10:05:48,877 INFO L290 TraceCheckUtils]: 19: Hoare triple {16754#(and (<= main_~z~0 0) (<= (+ 5 (* (div (+ 4294967290 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {16753#(and (<= main_~z~0 1) (<= (+ 5 (* (div (+ 4294967291 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} is VALID [2022-04-28 10:05:48,878 INFO L290 TraceCheckUtils]: 20: Hoare triple {16753#(and (<= main_~z~0 1) (<= (+ 5 (* (div (+ 4294967291 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {16752#(and (<= (+ 5 (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0) (<= main_~z~0 2))} is VALID [2022-04-28 10:05:48,879 INFO L290 TraceCheckUtils]: 21: Hoare triple {16752#(and (<= (+ 5 (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0) (<= main_~z~0 2))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {16751#(and (<= main_~z~0 3) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 5) main_~n~0))} is VALID [2022-04-28 10:05:48,880 INFO L290 TraceCheckUtils]: 22: Hoare triple {16751#(and (<= main_~z~0 3) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 5) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {16750#(and (<= main_~z~0 4) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 5) main_~n~0))} is VALID [2022-04-28 10:05:48,884 INFO L290 TraceCheckUtils]: 23: Hoare triple {16750#(and (<= main_~z~0 4) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 5) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {16755#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-28 10:05:48,884 INFO L290 TraceCheckUtils]: 24: Hoare triple {16755#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {16755#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-28 10:05:48,885 INFO L272 TraceCheckUtils]: 25: Hoare triple {16755#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {16756#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:05:48,886 INFO L290 TraceCheckUtils]: 26: Hoare triple {16756#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {16757#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 10:05:48,886 INFO L290 TraceCheckUtils]: 27: Hoare triple {16757#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {16738#false} is VALID [2022-04-28 10:05:48,886 INFO L290 TraceCheckUtils]: 28: Hoare triple {16738#false} assume !false; {16738#false} is VALID [2022-04-28 10:05:48,886 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:05:48,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:05:48,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018046846] [2022-04-28 10:05:48,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018046846] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:05:48,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [67146348] [2022-04-28 10:05:48,886 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:05:48,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:05:48,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:05:48,887 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:05:48,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-04-28 10:05:48,993 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-28 10:05:48,993 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:05:48,994 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 50 conjunts are in the unsatisfiable core [2022-04-28 10:05:49,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:05:49,003 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:06:10,351 INFO L272 TraceCheckUtils]: 0: Hoare triple {16737#true} call ULTIMATE.init(); {16737#true} is VALID [2022-04-28 10:06:10,351 INFO L290 TraceCheckUtils]: 1: Hoare triple {16737#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(10, 2);call #Ultimate.allocInit(12, 3); {16737#true} is VALID [2022-04-28 10:06:10,351 INFO L290 TraceCheckUtils]: 2: Hoare triple {16737#true} assume true; {16737#true} is VALID [2022-04-28 10:06:10,351 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16737#true} {16737#true} #61#return; {16737#true} is VALID [2022-04-28 10:06:10,351 INFO L272 TraceCheckUtils]: 4: Hoare triple {16737#true} call #t~ret11 := main(); {16737#true} is VALID [2022-04-28 10:06:10,352 INFO L290 TraceCheckUtils]: 5: Hoare triple {16737#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {16742#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-28 10:06:10,352 INFO L290 TraceCheckUtils]: 6: Hoare triple {16742#(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; {16780#(and (= (+ main_~x~0 1) main_~n~0) (= main_~y~0 1))} is VALID [2022-04-28 10:06:10,353 INFO L290 TraceCheckUtils]: 7: Hoare triple {16780#(and (= (+ main_~x~0 1) main_~n~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; {16784#(and (= (+ (- 1) main_~y~0) 1) (= (+ main_~x~0 1) (+ (- 1) main_~n~0)))} is VALID [2022-04-28 10:06:10,353 INFO L290 TraceCheckUtils]: 8: Hoare triple {16784#(and (= (+ (- 1) main_~y~0) 1) (= (+ main_~x~0 1) (+ (- 1) 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; {16788#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 1) main_~n~0) (+ main_~x~0 2)))} is VALID [2022-04-28 10:06:10,354 INFO L290 TraceCheckUtils]: 9: Hoare triple {16788#(and (= (+ (- 2) main_~y~0) 1) (= (+ (- 1) main_~n~0) (+ main_~x~0 2)))} 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; {16792#(and (= (+ main_~x~0 3) (+ (- 1) main_~n~0)) (= (+ main_~y~0 (- 3)) 1))} is VALID [2022-04-28 10:06:10,354 INFO L290 TraceCheckUtils]: 10: Hoare triple {16792#(and (= (+ main_~x~0 3) (+ (- 1) main_~n~0)) (= (+ main_~y~0 (- 3)) 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; {16796#(and (= 5 main_~y~0) (= (+ main_~x~0 4) (+ (- 1) main_~n~0)))} is VALID [2022-04-28 10:06:10,355 INFO L290 TraceCheckUtils]: 11: Hoare triple {16796#(and (= 5 main_~y~0) (= (+ main_~x~0 4) (+ (- 1) main_~n~0)))} assume !(~x~0 % 4294967296 > 0); {16748#(and (<= main_~y~0 5) (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) 5) main_~n~0))} is VALID [2022-04-28 10:06:10,356 INFO L290 TraceCheckUtils]: 12: Hoare triple {16748#(and (<= main_~y~0 5) (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) 5) main_~n~0))} ~z~0 := ~y~0; {16749#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 5) main_~n~0) (<= main_~z~0 5))} is VALID [2022-04-28 10:06:10,357 INFO L290 TraceCheckUtils]: 13: Hoare triple {16749#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 5) main_~n~0) (<= main_~z~0 5))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {16750#(and (<= main_~z~0 4) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 5) main_~n~0))} is VALID [2022-04-28 10:06:10,358 INFO L290 TraceCheckUtils]: 14: Hoare triple {16750#(and (<= main_~z~0 4) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 5) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {16751#(and (<= main_~z~0 3) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 5) main_~n~0))} is VALID [2022-04-28 10:06:10,359 INFO L290 TraceCheckUtils]: 15: Hoare triple {16751#(and (<= main_~z~0 3) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 5) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {16752#(and (<= (+ 5 (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0) (<= main_~z~0 2))} is VALID [2022-04-28 10:06:10,360 INFO L290 TraceCheckUtils]: 16: Hoare triple {16752#(and (<= (+ 5 (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0) (<= main_~z~0 2))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {16753#(and (<= main_~z~0 1) (<= (+ 5 (* (div (+ 4294967291 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} is VALID [2022-04-28 10:06:10,360 INFO L290 TraceCheckUtils]: 17: Hoare triple {16753#(and (<= main_~z~0 1) (<= (+ 5 (* (div (+ 4294967291 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {16754#(and (<= main_~z~0 0) (<= (+ 5 (* (div (+ 4294967290 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} is VALID [2022-04-28 10:06:10,361 INFO L290 TraceCheckUtils]: 18: Hoare triple {16754#(and (<= main_~z~0 0) (<= (+ 5 (* (div (+ 4294967290 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} assume !(~z~0 % 4294967296 > 0); {16754#(and (<= main_~z~0 0) (<= (+ 5 (* (div (+ 4294967290 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} is VALID [2022-04-28 10:06:10,362 INFO L290 TraceCheckUtils]: 19: Hoare triple {16754#(and (<= main_~z~0 0) (<= (+ 5 (* (div (+ 4294967290 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {16753#(and (<= main_~z~0 1) (<= (+ 5 (* (div (+ 4294967291 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} is VALID [2022-04-28 10:06:10,362 INFO L290 TraceCheckUtils]: 20: Hoare triple {16753#(and (<= main_~z~0 1) (<= (+ 5 (* (div (+ 4294967291 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {16752#(and (<= (+ 5 (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0) (<= main_~z~0 2))} is VALID [2022-04-28 10:06:10,363 INFO L290 TraceCheckUtils]: 21: Hoare triple {16752#(and (<= (+ 5 (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0) (<= main_~z~0 2))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {16751#(and (<= main_~z~0 3) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 5) main_~n~0))} is VALID [2022-04-28 10:06:10,364 INFO L290 TraceCheckUtils]: 22: Hoare triple {16751#(and (<= main_~z~0 3) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 5) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {16750#(and (<= main_~z~0 4) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 5) main_~n~0))} is VALID [2022-04-28 10:06:10,365 INFO L290 TraceCheckUtils]: 23: Hoare triple {16750#(and (<= main_~z~0 4) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 5) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {16749#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 5) main_~n~0) (<= main_~z~0 5))} is VALID [2022-04-28 10:06:10,365 INFO L290 TraceCheckUtils]: 24: Hoare triple {16749#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 5) main_~n~0) (<= main_~z~0 5))} assume !(~y~0 % 4294967296 > 0); {16749#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 5) main_~n~0) (<= main_~z~0 5))} is VALID [2022-04-28 10:06:10,367 INFO L272 TraceCheckUtils]: 25: Hoare triple {16749#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 5) main_~n~0) (<= main_~z~0 5))} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {16842#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:06:10,367 INFO L290 TraceCheckUtils]: 26: Hoare triple {16842#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {16846#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:06:10,367 INFO L290 TraceCheckUtils]: 27: Hoare triple {16846#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {16738#false} is VALID [2022-04-28 10:06:10,368 INFO L290 TraceCheckUtils]: 28: Hoare triple {16738#false} assume !false; {16738#false} is VALID [2022-04-28 10:06:10,368 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:06:10,368 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:06:12,058 INFO L290 TraceCheckUtils]: 28: Hoare triple {16738#false} assume !false; {16738#false} is VALID [2022-04-28 10:06:12,058 INFO L290 TraceCheckUtils]: 27: Hoare triple {16846#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {16738#false} is VALID [2022-04-28 10:06:12,059 INFO L290 TraceCheckUtils]: 26: Hoare triple {16842#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {16846#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:06:12,060 INFO L272 TraceCheckUtils]: 25: Hoare triple {16755#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {16842#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:06:12,060 INFO L290 TraceCheckUtils]: 24: Hoare triple {16755#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {16755#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-28 10:06:12,061 INFO L290 TraceCheckUtils]: 23: Hoare triple {16868#(and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {16755#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-28 10:06:12,062 INFO L290 TraceCheckUtils]: 22: Hoare triple {16872#(and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {16868#(and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-28 10:06:12,063 INFO L290 TraceCheckUtils]: 21: Hoare triple {16876#(and (< (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {16872#(and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-28 10:06:12,064 INFO L290 TraceCheckUtils]: 20: Hoare triple {16880#(and (< (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) main_~n~0) (+ 5 main_~z~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) main_~n~0)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {16876#(and (< (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296))))} is VALID [2022-04-28 10:06:12,065 INFO L290 TraceCheckUtils]: 19: Hoare triple {16884#(and (<= (+ 5 main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ 5 main_~z~0) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ 5 main_~z~0) 4294967296) 4294967296)) (+ main_~z~0 6 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {16880#(and (< (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) main_~n~0) (+ 5 main_~z~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-28 10:06:12,065 INFO L290 TraceCheckUtils]: 18: Hoare triple {16884#(and (<= (+ 5 main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ 5 main_~z~0) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ 5 main_~z~0) 4294967296) 4294967296)) (+ main_~z~0 6 (* (div main_~n~0 4294967296) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {16884#(and (<= (+ 5 main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ 5 main_~z~0) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ 5 main_~z~0) 4294967296) 4294967296)) (+ main_~z~0 6 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-28 10:06:12,066 INFO L290 TraceCheckUtils]: 17: Hoare triple {16880#(and (< (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) main_~n~0) (+ 5 main_~z~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) main_~n~0)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {16884#(and (<= (+ 5 main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ 5 main_~z~0) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ 5 main_~z~0) 4294967296) 4294967296)) (+ main_~z~0 6 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-28 10:06:12,067 INFO L290 TraceCheckUtils]: 16: Hoare triple {16876#(and (< (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {16880#(and (< (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) main_~n~0) (+ 5 main_~z~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-28 10:06:12,068 INFO L290 TraceCheckUtils]: 15: Hoare triple {16872#(and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {16876#(and (< (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296))))} is VALID [2022-04-28 10:06:12,069 INFO L290 TraceCheckUtils]: 14: Hoare triple {16868#(and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {16872#(and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-28 10:06:12,070 INFO L290 TraceCheckUtils]: 13: Hoare triple {16755#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {16868#(and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-28 10:06:12,070 INFO L290 TraceCheckUtils]: 12: Hoare triple {16906#(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)))} ~z~0 := ~y~0; {16755#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-28 10:06:12,071 INFO L290 TraceCheckUtils]: 11: Hoare triple {16910#(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); {16906#(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-28 10:06:12,072 INFO L290 TraceCheckUtils]: 10: Hoare triple {16914#(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; {16910#(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-28 10:06:12,074 INFO L290 TraceCheckUtils]: 9: Hoare triple {16918#(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; {16914#(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-28 10:06:12,075 INFO L290 TraceCheckUtils]: 8: Hoare triple {16922#(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; {16918#(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-28 10:06:12,076 INFO L290 TraceCheckUtils]: 7: Hoare triple {16926#(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; {16922#(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-28 10:06:12,078 INFO L290 TraceCheckUtils]: 6: Hoare triple {16930#(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; {16926#(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-28 10:06:12,079 INFO L290 TraceCheckUtils]: 5: Hoare triple {16737#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {16930#(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-28 10:06:12,079 INFO L272 TraceCheckUtils]: 4: Hoare triple {16737#true} call #t~ret11 := main(); {16737#true} is VALID [2022-04-28 10:06:12,079 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16737#true} {16737#true} #61#return; {16737#true} is VALID [2022-04-28 10:06:12,079 INFO L290 TraceCheckUtils]: 2: Hoare triple {16737#true} assume true; {16737#true} is VALID [2022-04-28 10:06:12,079 INFO L290 TraceCheckUtils]: 1: Hoare triple {16737#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(10, 2);call #Ultimate.allocInit(12, 3); {16737#true} is VALID [2022-04-28 10:06:12,079 INFO L272 TraceCheckUtils]: 0: Hoare triple {16737#true} call ULTIMATE.init(); {16737#true} is VALID [2022-04-28 10:06:12,079 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:06:12,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [67146348] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:06:12,079 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:06:12,079 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 17] total 38 [2022-04-28 10:06:12,080 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:06:12,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [537116897] [2022-04-28 10:06:12,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [537116897] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:06:12,080 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:06:12,080 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-28 10:06:12,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893315541] [2022-04-28 10:06:12,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:06:12,080 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 17 states have internal predecessors, (25), 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 29 [2022-04-28 10:06:12,080 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:06:12,080 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 17 states have internal predecessors, (25), 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-28 10:06:13,290 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-28 10:06:13,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-28 10:06:13,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:06:13,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-28 10:06:13,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1256, Unknown=0, NotChecked=0, Total=1406 [2022-04-28 10:06:13,291 INFO L87 Difference]: Start difference. First operand 81 states and 103 transitions. Second operand has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 17 states have internal predecessors, (25), 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-28 10:06:15,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:15,144 INFO L93 Difference]: Finished difference Result 102 states and 124 transitions. [2022-04-28 10:06:15,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-28 10:06:15,144 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 17 states have internal predecessors, (25), 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 29 [2022-04-28 10:06:15,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:06:15,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 17 states have internal predecessors, (25), 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-28 10:06:15,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 49 transitions. [2022-04-28 10:06:15,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 17 states have internal predecessors, (25), 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-28 10:06:15,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 49 transitions. [2022-04-28 10:06:15,146 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 49 transitions. [2022-04-28 10:06:15,204 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:06:15,204 INFO L225 Difference]: With dead ends: 102 [2022-04-28 10:06:15,204 INFO L226 Difference]: Without dead ends: 74 [2022-04-28 10:06:15,205 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 41 SyntacticMatches, 4 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 415 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=323, Invalid=2983, Unknown=0, NotChecked=0, Total=3306 [2022-04-28 10:06:15,206 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 20 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-28 10:06:15,206 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 89 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-28 10:06:15,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-04-28 10:06:15,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2022-04-28 10:06:15,272 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:06:15,272 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand has 74 states, 69 states have (on average 1.3043478260869565) internal successors, (90), 69 states have internal predecessors, (90), 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-28 10:06:15,272 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand has 74 states, 69 states have (on average 1.3043478260869565) internal successors, (90), 69 states have internal predecessors, (90), 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-28 10:06:15,273 INFO L87 Difference]: Start difference. First operand 74 states. Second operand has 74 states, 69 states have (on average 1.3043478260869565) internal successors, (90), 69 states have internal predecessors, (90), 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-28 10:06:15,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:15,273 INFO L93 Difference]: Finished difference Result 74 states and 94 transitions. [2022-04-28 10:06:15,273 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 94 transitions. [2022-04-28 10:06:15,273 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:06:15,273 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:06:15,274 INFO L74 IsIncluded]: Start isIncluded. First operand has 74 states, 69 states have (on average 1.3043478260869565) internal successors, (90), 69 states have internal predecessors, (90), 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 74 states. [2022-04-28 10:06:15,274 INFO L87 Difference]: Start difference. First operand has 74 states, 69 states have (on average 1.3043478260869565) internal successors, (90), 69 states have internal predecessors, (90), 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 74 states. [2022-04-28 10:06:15,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:15,274 INFO L93 Difference]: Finished difference Result 74 states and 94 transitions. [2022-04-28 10:06:15,274 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 94 transitions. [2022-04-28 10:06:15,274 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:06:15,274 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:06:15,275 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:06:15,275 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:06:15,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 69 states have (on average 1.3043478260869565) internal successors, (90), 69 states have internal predecessors, (90), 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-28 10:06:15,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 94 transitions. [2022-04-28 10:06:15,275 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 94 transitions. Word has length 29 [2022-04-28 10:06:15,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:06:15,275 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 94 transitions. [2022-04-28 10:06:15,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 17 states have internal predecessors, (25), 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-28 10:06:15,276 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 74 states and 94 transitions. [2022-04-28 10:06:17,527 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 93 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 10:06:17,527 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 94 transitions. [2022-04-28 10:06:17,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-28 10:06:17,528 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:06:17,528 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:06:17,544 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2022-04-28 10:06:17,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:06:17,735 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:06:17,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:06:17,736 INFO L85 PathProgramCache]: Analyzing trace with hash 1573757487, now seen corresponding path program 37 times [2022-04-28 10:06:17,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:06:17,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1709304351] [2022-04-28 10:06:17,738 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:06:17,738 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:06:17,738 INFO L85 PathProgramCache]: Analyzing trace with hash 1573757487, now seen corresponding path program 38 times [2022-04-28 10:06:17,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:06:17,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644193154] [2022-04-28 10:06:17,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:06:17,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:06:17,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:17,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:06:17,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:17,913 INFO L290 TraceCheckUtils]: 0: Hoare triple {17507#(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(10, 2);call #Ultimate.allocInit(12, 3); {17491#true} is VALID [2022-04-28 10:06:17,913 INFO L290 TraceCheckUtils]: 1: Hoare triple {17491#true} assume true; {17491#true} is VALID [2022-04-28 10:06:17,913 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {17491#true} {17491#true} #61#return; {17491#true} is VALID [2022-04-28 10:06:17,914 INFO L272 TraceCheckUtils]: 0: Hoare triple {17491#true} call ULTIMATE.init(); {17507#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:06:17,914 INFO L290 TraceCheckUtils]: 1: Hoare triple {17507#(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(10, 2);call #Ultimate.allocInit(12, 3); {17491#true} is VALID [2022-04-28 10:06:17,914 INFO L290 TraceCheckUtils]: 2: Hoare triple {17491#true} assume true; {17491#true} is VALID [2022-04-28 10:06:17,914 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17491#true} {17491#true} #61#return; {17491#true} is VALID [2022-04-28 10:06:17,914 INFO L272 TraceCheckUtils]: 4: Hoare triple {17491#true} call #t~ret11 := main(); {17491#true} is VALID [2022-04-28 10:06:17,914 INFO L290 TraceCheckUtils]: 5: Hoare triple {17491#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {17496#(= main_~y~0 0)} is VALID [2022-04-28 10:06:17,914 INFO L290 TraceCheckUtils]: 6: Hoare triple {17496#(= 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; {17497#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:06:17,915 INFO L290 TraceCheckUtils]: 7: Hoare triple {17497#(and (<= 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; {17498#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:06:17,915 INFO L290 TraceCheckUtils]: 8: Hoare triple {17498#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {17499#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:06:17,916 INFO L290 TraceCheckUtils]: 9: Hoare triple {17499#(and (<= main_~y~0 3) (<= 3 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; {17500#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:06:17,917 INFO L290 TraceCheckUtils]: 10: Hoare triple {17500#(and (<= main_~y~0 4) (<= 4 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; {17501#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:06:17,917 INFO L290 TraceCheckUtils]: 11: Hoare triple {17501#(and (<= 5 main_~y~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; {17502#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:06:17,917 INFO L290 TraceCheckUtils]: 12: Hoare triple {17502#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {17502#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:06:17,918 INFO L290 TraceCheckUtils]: 13: Hoare triple {17502#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {17503#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:06:17,918 INFO L290 TraceCheckUtils]: 14: Hoare triple {17503#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {17504#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:06:17,919 INFO L290 TraceCheckUtils]: 15: Hoare triple {17504#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {17505#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:06:17,919 INFO L290 TraceCheckUtils]: 16: Hoare triple {17505#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {17506#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:06:17,920 INFO L290 TraceCheckUtils]: 17: Hoare triple {17506#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {17492#false} is VALID [2022-04-28 10:06:17,920 INFO L290 TraceCheckUtils]: 18: Hoare triple {17492#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17492#false} is VALID [2022-04-28 10:06:17,920 INFO L290 TraceCheckUtils]: 19: Hoare triple {17492#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17492#false} is VALID [2022-04-28 10:06:17,920 INFO L290 TraceCheckUtils]: 20: Hoare triple {17492#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17492#false} is VALID [2022-04-28 10:06:17,920 INFO L290 TraceCheckUtils]: 21: Hoare triple {17492#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17492#false} is VALID [2022-04-28 10:06:17,920 INFO L290 TraceCheckUtils]: 22: Hoare triple {17492#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17492#false} is VALID [2022-04-28 10:06:17,920 INFO L290 TraceCheckUtils]: 23: Hoare triple {17492#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17492#false} is VALID [2022-04-28 10:06:17,920 INFO L290 TraceCheckUtils]: 24: Hoare triple {17492#false} assume !(~y~0 % 4294967296 > 0); {17492#false} is VALID [2022-04-28 10:06:17,920 INFO L272 TraceCheckUtils]: 25: Hoare triple {17492#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {17492#false} is VALID [2022-04-28 10:06:17,920 INFO L290 TraceCheckUtils]: 26: Hoare triple {17492#false} ~cond := #in~cond; {17492#false} is VALID [2022-04-28 10:06:17,920 INFO L290 TraceCheckUtils]: 27: Hoare triple {17492#false} assume 0 == ~cond; {17492#false} is VALID [2022-04-28 10:06:17,920 INFO L290 TraceCheckUtils]: 28: Hoare triple {17492#false} assume !false; {17492#false} is VALID [2022-04-28 10:06:17,921 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-28 10:06:17,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:06:17,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644193154] [2022-04-28 10:06:17,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644193154] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:06:17,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [225484116] [2022-04-28 10:06:17,921 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:06:17,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:06:17,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:06:17,922 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:06:17,923 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-04-28 10:06:17,961 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:06:17,961 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:06:17,961 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 30 conjunts are in the unsatisfiable core [2022-04-28 10:06:17,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:17,968 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:06:18,136 INFO L272 TraceCheckUtils]: 0: Hoare triple {17491#true} call ULTIMATE.init(); {17491#true} is VALID [2022-04-28 10:06:18,137 INFO L290 TraceCheckUtils]: 1: Hoare triple {17491#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(10, 2);call #Ultimate.allocInit(12, 3); {17491#true} is VALID [2022-04-28 10:06:18,137 INFO L290 TraceCheckUtils]: 2: Hoare triple {17491#true} assume true; {17491#true} is VALID [2022-04-28 10:06:18,137 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17491#true} {17491#true} #61#return; {17491#true} is VALID [2022-04-28 10:06:18,137 INFO L272 TraceCheckUtils]: 4: Hoare triple {17491#true} call #t~ret11 := main(); {17491#true} is VALID [2022-04-28 10:06:18,137 INFO L290 TraceCheckUtils]: 5: Hoare triple {17491#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {17496#(= main_~y~0 0)} is VALID [2022-04-28 10:06:18,137 INFO L290 TraceCheckUtils]: 6: Hoare triple {17496#(= 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; {17497#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:06:18,138 INFO L290 TraceCheckUtils]: 7: Hoare triple {17497#(and (<= 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; {17498#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:06:18,138 INFO L290 TraceCheckUtils]: 8: Hoare triple {17498#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {17499#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:06:18,139 INFO L290 TraceCheckUtils]: 9: Hoare triple {17499#(and (<= main_~y~0 3) (<= 3 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; {17500#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:06:18,139 INFO L290 TraceCheckUtils]: 10: Hoare triple {17500#(and (<= main_~y~0 4) (<= 4 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; {17501#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:06:18,140 INFO L290 TraceCheckUtils]: 11: Hoare triple {17501#(and (<= 5 main_~y~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; {17502#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:06:18,140 INFO L290 TraceCheckUtils]: 12: Hoare triple {17502#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {17502#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:06:18,140 INFO L290 TraceCheckUtils]: 13: Hoare triple {17502#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {17550#(and (<= main_~y~0 6) (= main_~z~0 main_~y~0) (<= 6 main_~y~0))} is VALID [2022-04-28 10:06:18,141 INFO L290 TraceCheckUtils]: 14: Hoare triple {17550#(and (<= main_~y~0 6) (= main_~z~0 main_~y~0) (<= 6 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {17554#(and (<= main_~y~0 6) (<= 6 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-28 10:06:18,141 INFO L290 TraceCheckUtils]: 15: Hoare triple {17554#(and (<= main_~y~0 6) (<= 6 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {17558#(and (<= main_~y~0 6) (= main_~y~0 (+ main_~z~0 2)) (<= 6 main_~y~0))} is VALID [2022-04-28 10:06:18,142 INFO L290 TraceCheckUtils]: 16: Hoare triple {17558#(and (<= main_~y~0 6) (= main_~y~0 (+ main_~z~0 2)) (<= 6 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {17562#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:06:18,142 INFO L290 TraceCheckUtils]: 17: Hoare triple {17562#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~z~0 % 4294967296 > 0); {17492#false} is VALID [2022-04-28 10:06:18,142 INFO L290 TraceCheckUtils]: 18: Hoare triple {17492#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17492#false} is VALID [2022-04-28 10:06:18,142 INFO L290 TraceCheckUtils]: 19: Hoare triple {17492#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17492#false} is VALID [2022-04-28 10:06:18,143 INFO L290 TraceCheckUtils]: 20: Hoare triple {17492#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17492#false} is VALID [2022-04-28 10:06:18,143 INFO L290 TraceCheckUtils]: 21: Hoare triple {17492#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17492#false} is VALID [2022-04-28 10:06:18,147 INFO L290 TraceCheckUtils]: 22: Hoare triple {17492#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17492#false} is VALID [2022-04-28 10:06:18,147 INFO L290 TraceCheckUtils]: 23: Hoare triple {17492#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17492#false} is VALID [2022-04-28 10:06:18,147 INFO L290 TraceCheckUtils]: 24: Hoare triple {17492#false} assume !(~y~0 % 4294967296 > 0); {17492#false} is VALID [2022-04-28 10:06:18,147 INFO L272 TraceCheckUtils]: 25: Hoare triple {17492#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {17492#false} is VALID [2022-04-28 10:06:18,147 INFO L290 TraceCheckUtils]: 26: Hoare triple {17492#false} ~cond := #in~cond; {17492#false} is VALID [2022-04-28 10:06:18,147 INFO L290 TraceCheckUtils]: 27: Hoare triple {17492#false} assume 0 == ~cond; {17492#false} is VALID [2022-04-28 10:06:18,147 INFO L290 TraceCheckUtils]: 28: Hoare triple {17492#false} assume !false; {17492#false} is VALID [2022-04-28 10:06:18,147 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-28 10:06:18,147 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:06:18,388 INFO L290 TraceCheckUtils]: 28: Hoare triple {17492#false} assume !false; {17492#false} is VALID [2022-04-28 10:06:18,389 INFO L290 TraceCheckUtils]: 27: Hoare triple {17492#false} assume 0 == ~cond; {17492#false} is VALID [2022-04-28 10:06:18,389 INFO L290 TraceCheckUtils]: 26: Hoare triple {17492#false} ~cond := #in~cond; {17492#false} is VALID [2022-04-28 10:06:18,389 INFO L272 TraceCheckUtils]: 25: Hoare triple {17492#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {17492#false} is VALID [2022-04-28 10:06:18,389 INFO L290 TraceCheckUtils]: 24: Hoare triple {17492#false} assume !(~y~0 % 4294967296 > 0); {17492#false} is VALID [2022-04-28 10:06:18,389 INFO L290 TraceCheckUtils]: 23: Hoare triple {17492#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17492#false} is VALID [2022-04-28 10:06:18,389 INFO L290 TraceCheckUtils]: 22: Hoare triple {17492#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17492#false} is VALID [2022-04-28 10:06:18,389 INFO L290 TraceCheckUtils]: 21: Hoare triple {17620#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17492#false} is VALID [2022-04-28 10:06:18,391 INFO L290 TraceCheckUtils]: 20: Hoare triple {17624#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17620#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:06:18,392 INFO L290 TraceCheckUtils]: 19: Hoare triple {17628#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17624#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:06:18,393 INFO L290 TraceCheckUtils]: 18: Hoare triple {17632#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17628#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-28 10:06:18,393 INFO L290 TraceCheckUtils]: 17: Hoare triple {17636#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {17632#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-28 10:06:18,395 INFO L290 TraceCheckUtils]: 16: Hoare triple {17640#(or (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {17636#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))))} is VALID [2022-04-28 10:06:18,396 INFO L290 TraceCheckUtils]: 15: Hoare triple {17644#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {17640#(or (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:06:18,397 INFO L290 TraceCheckUtils]: 14: Hoare triple {17648#(or (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {17644#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))))} is VALID [2022-04-28 10:06:18,398 INFO L290 TraceCheckUtils]: 13: Hoare triple {17491#true} ~z~0 := ~y~0; {17648#(or (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} is VALID [2022-04-28 10:06:18,398 INFO L290 TraceCheckUtils]: 12: Hoare triple {17491#true} assume !(~x~0 % 4294967296 > 0); {17491#true} is VALID [2022-04-28 10:06:18,398 INFO L290 TraceCheckUtils]: 11: Hoare triple {17491#true} 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; {17491#true} is VALID [2022-04-28 10:06:18,398 INFO L290 TraceCheckUtils]: 10: Hoare triple {17491#true} 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; {17491#true} is VALID [2022-04-28 10:06:18,398 INFO L290 TraceCheckUtils]: 9: Hoare triple {17491#true} 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; {17491#true} is VALID [2022-04-28 10:06:18,398 INFO L290 TraceCheckUtils]: 8: Hoare triple {17491#true} 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; {17491#true} is VALID [2022-04-28 10:06:18,398 INFO L290 TraceCheckUtils]: 7: Hoare triple {17491#true} 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; {17491#true} is VALID [2022-04-28 10:06:18,398 INFO L290 TraceCheckUtils]: 6: Hoare triple {17491#true} 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; {17491#true} is VALID [2022-04-28 10:06:18,398 INFO L290 TraceCheckUtils]: 5: Hoare triple {17491#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {17491#true} is VALID [2022-04-28 10:06:18,398 INFO L272 TraceCheckUtils]: 4: Hoare triple {17491#true} call #t~ret11 := main(); {17491#true} is VALID [2022-04-28 10:06:18,398 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17491#true} {17491#true} #61#return; {17491#true} is VALID [2022-04-28 10:06:18,398 INFO L290 TraceCheckUtils]: 2: Hoare triple {17491#true} assume true; {17491#true} is VALID [2022-04-28 10:06:18,398 INFO L290 TraceCheckUtils]: 1: Hoare triple {17491#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(10, 2);call #Ultimate.allocInit(12, 3); {17491#true} is VALID [2022-04-28 10:06:18,398 INFO L272 TraceCheckUtils]: 0: Hoare triple {17491#true} call ULTIMATE.init(); {17491#true} is VALID [2022-04-28 10:06:18,398 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-28 10:06:18,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [225484116] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:06:18,399 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:06:18,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 10] total 26 [2022-04-28 10:06:18,399 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:06:18,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1709304351] [2022-04-28 10:06:18,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1709304351] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:06:18,399 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:06:18,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 10:06:18,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304883279] [2022-04-28 10:06:18,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:06:18,399 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 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 29 [2022-04-28 10:06:18,399 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:06:18,400 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 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-28 10:06:18,415 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-28 10:06:18,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 10:06:18,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:06:18,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 10:06:18,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=545, Unknown=0, NotChecked=0, Total=650 [2022-04-28 10:06:18,416 INFO L87 Difference]: Start difference. First operand 74 states and 94 transitions. Second operand has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 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-28 10:06:19,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:19,007 INFO L93 Difference]: Finished difference Result 95 states and 115 transitions. [2022-04-28 10:06:19,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-28 10:06:19,007 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 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 29 [2022-04-28 10:06:19,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:06:19,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 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-28 10:06:19,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 47 transitions. [2022-04-28 10:06:19,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 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-28 10:06:19,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 47 transitions. [2022-04-28 10:06:19,008 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 47 transitions. [2022-04-28 10:06:19,043 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:06:19,043 INFO L225 Difference]: With dead ends: 95 [2022-04-28 10:06:19,043 INFO L226 Difference]: Without dead ends: 83 [2022-04-28 10:06:19,044 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=189, Invalid=1143, Unknown=0, NotChecked=0, Total=1332 [2022-04-28 10:06:19,044 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 17 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 10:06:19,044 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 58 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 10:06:19,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-04-28 10:06:19,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 75. [2022-04-28 10:06:19,125 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:06:19,125 INFO L82 GeneralOperation]: Start isEquivalent. First operand 83 states. Second operand has 75 states, 70 states have (on average 1.3) internal successors, (91), 70 states have internal predecessors, (91), 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-28 10:06:19,125 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand has 75 states, 70 states have (on average 1.3) internal successors, (91), 70 states have internal predecessors, (91), 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-28 10:06:19,125 INFO L87 Difference]: Start difference. First operand 83 states. Second operand has 75 states, 70 states have (on average 1.3) internal successors, (91), 70 states have internal predecessors, (91), 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-28 10:06:19,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:19,126 INFO L93 Difference]: Finished difference Result 83 states and 103 transitions. [2022-04-28 10:06:19,126 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 103 transitions. [2022-04-28 10:06:19,131 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:06:19,131 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:06:19,131 INFO L74 IsIncluded]: Start isIncluded. First operand has 75 states, 70 states have (on average 1.3) internal successors, (91), 70 states have internal predecessors, (91), 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 83 states. [2022-04-28 10:06:19,131 INFO L87 Difference]: Start difference. First operand has 75 states, 70 states have (on average 1.3) internal successors, (91), 70 states have internal predecessors, (91), 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 83 states. [2022-04-28 10:06:19,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:19,132 INFO L93 Difference]: Finished difference Result 83 states and 103 transitions. [2022-04-28 10:06:19,132 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 103 transitions. [2022-04-28 10:06:19,132 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:06:19,132 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:06:19,132 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:06:19,132 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:06:19,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 70 states have (on average 1.3) internal successors, (91), 70 states have internal predecessors, (91), 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-28 10:06:19,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 95 transitions. [2022-04-28 10:06:19,133 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 95 transitions. Word has length 29 [2022-04-28 10:06:19,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:06:19,133 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 95 transitions. [2022-04-28 10:06:19,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 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-28 10:06:19,133 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 75 states and 95 transitions. [2022-04-28 10:06:20,406 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:06:20,406 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 95 transitions. [2022-04-28 10:06:20,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-28 10:06:20,406 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:06:20,406 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:06:20,422 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2022-04-28 10:06:20,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2022-04-28 10:06:20,607 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:06:20,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:06:20,607 INFO L85 PathProgramCache]: Analyzing trace with hash 335464319, now seen corresponding path program 39 times [2022-04-28 10:06:20,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:06:20,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [886236474] [2022-04-28 10:06:20,609 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:06:20,609 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:06:20,609 INFO L85 PathProgramCache]: Analyzing trace with hash 335464319, now seen corresponding path program 40 times [2022-04-28 10:06:20,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:06:20,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600993320] [2022-04-28 10:06:20,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:06:20,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:06:20,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:20,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:06:20,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:20,784 INFO L290 TraceCheckUtils]: 0: Hoare triple {18236#(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(10, 2);call #Ultimate.allocInit(12, 3); {18221#true} is VALID [2022-04-28 10:06:20,784 INFO L290 TraceCheckUtils]: 1: Hoare triple {18221#true} assume true; {18221#true} is VALID [2022-04-28 10:06:20,784 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18221#true} {18221#true} #61#return; {18221#true} is VALID [2022-04-28 10:06:20,784 INFO L272 TraceCheckUtils]: 0: Hoare triple {18221#true} call ULTIMATE.init(); {18236#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:06:20,784 INFO L290 TraceCheckUtils]: 1: Hoare triple {18236#(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(10, 2);call #Ultimate.allocInit(12, 3); {18221#true} is VALID [2022-04-28 10:06:20,784 INFO L290 TraceCheckUtils]: 2: Hoare triple {18221#true} assume true; {18221#true} is VALID [2022-04-28 10:06:20,784 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18221#true} {18221#true} #61#return; {18221#true} is VALID [2022-04-28 10:06:20,785 INFO L272 TraceCheckUtils]: 4: Hoare triple {18221#true} call #t~ret11 := main(); {18221#true} is VALID [2022-04-28 10:06:20,785 INFO L290 TraceCheckUtils]: 5: Hoare triple {18221#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {18226#(= main_~y~0 0)} is VALID [2022-04-28 10:06:20,785 INFO L290 TraceCheckUtils]: 6: Hoare triple {18226#(= 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; {18227#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:06:20,786 INFO L290 TraceCheckUtils]: 7: Hoare triple {18227#(and (<= 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; {18228#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:06:20,786 INFO L290 TraceCheckUtils]: 8: Hoare triple {18228#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {18229#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:06:20,787 INFO L290 TraceCheckUtils]: 9: Hoare triple {18229#(and (<= main_~y~0 3) (<= 3 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; {18230#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:06:20,787 INFO L290 TraceCheckUtils]: 10: Hoare triple {18230#(and (<= main_~y~0 4) (<= 4 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; {18231#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:06:20,788 INFO L290 TraceCheckUtils]: 11: Hoare triple {18231#(and (<= 5 main_~y~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; {18232#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:06:20,788 INFO L290 TraceCheckUtils]: 12: Hoare triple {18232#(and (<= main_~y~0 6) (<= 6 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; {18233#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:06:20,789 INFO L290 TraceCheckUtils]: 13: Hoare triple {18233#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {18233#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:06:20,789 INFO L290 TraceCheckUtils]: 14: Hoare triple {18233#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {18234#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:06:20,789 INFO L290 TraceCheckUtils]: 15: Hoare triple {18234#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {18235#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} is VALID [2022-04-28 10:06:20,790 INFO L290 TraceCheckUtils]: 16: Hoare triple {18235#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {18222#false} is VALID [2022-04-28 10:06:20,790 INFO L290 TraceCheckUtils]: 17: Hoare triple {18222#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {18222#false} is VALID [2022-04-28 10:06:20,790 INFO L290 TraceCheckUtils]: 18: Hoare triple {18222#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {18222#false} is VALID [2022-04-28 10:06:20,790 INFO L290 TraceCheckUtils]: 19: Hoare triple {18222#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {18222#false} is VALID [2022-04-28 10:06:20,790 INFO L290 TraceCheckUtils]: 20: Hoare triple {18222#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {18222#false} is VALID [2022-04-28 10:06:20,790 INFO L290 TraceCheckUtils]: 21: Hoare triple {18222#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {18222#false} is VALID [2022-04-28 10:06:20,790 INFO L290 TraceCheckUtils]: 22: Hoare triple {18222#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {18222#false} is VALID [2022-04-28 10:06:20,790 INFO L290 TraceCheckUtils]: 23: Hoare triple {18222#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {18222#false} is VALID [2022-04-28 10:06:20,790 INFO L290 TraceCheckUtils]: 24: Hoare triple {18222#false} assume !(~y~0 % 4294967296 > 0); {18222#false} is VALID [2022-04-28 10:06:20,790 INFO L272 TraceCheckUtils]: 25: Hoare triple {18222#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {18222#false} is VALID [2022-04-28 10:06:20,790 INFO L290 TraceCheckUtils]: 26: Hoare triple {18222#false} ~cond := #in~cond; {18222#false} is VALID [2022-04-28 10:06:20,790 INFO L290 TraceCheckUtils]: 27: Hoare triple {18222#false} assume 0 == ~cond; {18222#false} is VALID [2022-04-28 10:06:20,790 INFO L290 TraceCheckUtils]: 28: Hoare triple {18222#false} assume !false; {18222#false} is VALID [2022-04-28 10:06:20,791 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-28 10:06:20,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:06:20,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600993320] [2022-04-28 10:06:20,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600993320] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:06:20,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1330915283] [2022-04-28 10:06:20,791 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:06:20,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:06:20,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:06:20,792 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:06:20,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-04-28 10:06:20,829 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:06:20,829 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:06:20,830 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-28 10:06:20,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:20,835 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:06:21,036 INFO L272 TraceCheckUtils]: 0: Hoare triple {18221#true} call ULTIMATE.init(); {18221#true} is VALID [2022-04-28 10:06:21,036 INFO L290 TraceCheckUtils]: 1: Hoare triple {18221#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(10, 2);call #Ultimate.allocInit(12, 3); {18221#true} is VALID [2022-04-28 10:06:21,036 INFO L290 TraceCheckUtils]: 2: Hoare triple {18221#true} assume true; {18221#true} is VALID [2022-04-28 10:06:21,036 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18221#true} {18221#true} #61#return; {18221#true} is VALID [2022-04-28 10:06:21,037 INFO L272 TraceCheckUtils]: 4: Hoare triple {18221#true} call #t~ret11 := main(); {18221#true} is VALID [2022-04-28 10:06:21,037 INFO L290 TraceCheckUtils]: 5: Hoare triple {18221#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {18226#(= main_~y~0 0)} is VALID [2022-04-28 10:06:21,037 INFO L290 TraceCheckUtils]: 6: Hoare triple {18226#(= 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; {18227#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:06:21,038 INFO L290 TraceCheckUtils]: 7: Hoare triple {18227#(and (<= 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; {18228#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:06:21,038 INFO L290 TraceCheckUtils]: 8: Hoare triple {18228#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {18229#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:06:21,039 INFO L290 TraceCheckUtils]: 9: Hoare triple {18229#(and (<= main_~y~0 3) (<= 3 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; {18230#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:06:21,039 INFO L290 TraceCheckUtils]: 10: Hoare triple {18230#(and (<= main_~y~0 4) (<= 4 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; {18231#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:06:21,040 INFO L290 TraceCheckUtils]: 11: Hoare triple {18231#(and (<= 5 main_~y~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; {18232#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:06:21,040 INFO L290 TraceCheckUtils]: 12: Hoare triple {18232#(and (<= main_~y~0 6) (<= 6 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; {18233#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:06:21,040 INFO L290 TraceCheckUtils]: 13: Hoare triple {18233#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {18233#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:06:21,041 INFO L290 TraceCheckUtils]: 14: Hoare triple {18233#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {18234#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:06:21,041 INFO L290 TraceCheckUtils]: 15: Hoare triple {18234#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {18285#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:06:21,042 INFO L290 TraceCheckUtils]: 16: Hoare triple {18285#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {18222#false} is VALID [2022-04-28 10:06:21,042 INFO L290 TraceCheckUtils]: 17: Hoare triple {18222#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {18222#false} is VALID [2022-04-28 10:06:21,042 INFO L290 TraceCheckUtils]: 18: Hoare triple {18222#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {18222#false} is VALID [2022-04-28 10:06:21,042 INFO L290 TraceCheckUtils]: 19: Hoare triple {18222#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {18222#false} is VALID [2022-04-28 10:06:21,042 INFO L290 TraceCheckUtils]: 20: Hoare triple {18222#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {18222#false} is VALID [2022-04-28 10:06:21,042 INFO L290 TraceCheckUtils]: 21: Hoare triple {18222#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {18222#false} is VALID [2022-04-28 10:06:21,042 INFO L290 TraceCheckUtils]: 22: Hoare triple {18222#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {18222#false} is VALID [2022-04-28 10:06:21,042 INFO L290 TraceCheckUtils]: 23: Hoare triple {18222#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {18222#false} is VALID [2022-04-28 10:06:21,042 INFO L290 TraceCheckUtils]: 24: Hoare triple {18222#false} assume !(~y~0 % 4294967296 > 0); {18222#false} is VALID [2022-04-28 10:06:21,042 INFO L272 TraceCheckUtils]: 25: Hoare triple {18222#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {18222#false} is VALID [2022-04-28 10:06:21,042 INFO L290 TraceCheckUtils]: 26: Hoare triple {18222#false} ~cond := #in~cond; {18222#false} is VALID [2022-04-28 10:06:21,042 INFO L290 TraceCheckUtils]: 27: Hoare triple {18222#false} assume 0 == ~cond; {18222#false} is VALID [2022-04-28 10:06:21,042 INFO L290 TraceCheckUtils]: 28: Hoare triple {18222#false} assume !false; {18222#false} is VALID [2022-04-28 10:06:21,042 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-28 10:06:21,043 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:06:21,254 INFO L290 TraceCheckUtils]: 28: Hoare triple {18222#false} assume !false; {18222#false} is VALID [2022-04-28 10:06:21,254 INFO L290 TraceCheckUtils]: 27: Hoare triple {18222#false} assume 0 == ~cond; {18222#false} is VALID [2022-04-28 10:06:21,254 INFO L290 TraceCheckUtils]: 26: Hoare triple {18222#false} ~cond := #in~cond; {18222#false} is VALID [2022-04-28 10:06:21,254 INFO L272 TraceCheckUtils]: 25: Hoare triple {18222#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {18222#false} is VALID [2022-04-28 10:06:21,254 INFO L290 TraceCheckUtils]: 24: Hoare triple {18222#false} assume !(~y~0 % 4294967296 > 0); {18222#false} is VALID [2022-04-28 10:06:21,254 INFO L290 TraceCheckUtils]: 23: Hoare triple {18222#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {18222#false} is VALID [2022-04-28 10:06:21,255 INFO L290 TraceCheckUtils]: 22: Hoare triple {18222#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {18222#false} is VALID [2022-04-28 10:06:21,255 INFO L290 TraceCheckUtils]: 21: Hoare triple {18222#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {18222#false} is VALID [2022-04-28 10:06:21,255 INFO L290 TraceCheckUtils]: 20: Hoare triple {18222#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {18222#false} is VALID [2022-04-28 10:06:21,255 INFO L290 TraceCheckUtils]: 19: Hoare triple {18222#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {18222#false} is VALID [2022-04-28 10:06:21,255 INFO L290 TraceCheckUtils]: 18: Hoare triple {18222#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {18222#false} is VALID [2022-04-28 10:06:21,255 INFO L290 TraceCheckUtils]: 17: Hoare triple {18222#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {18222#false} is VALID [2022-04-28 10:06:21,255 INFO L290 TraceCheckUtils]: 16: Hoare triple {18361#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {18222#false} is VALID [2022-04-28 10:06:21,256 INFO L290 TraceCheckUtils]: 15: Hoare triple {18365#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {18361#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:06:21,256 INFO L290 TraceCheckUtils]: 14: Hoare triple {18369#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} ~z~0 := ~y~0; {18365#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:06:21,256 INFO L290 TraceCheckUtils]: 13: Hoare triple {18369#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {18369#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:06:21,257 INFO L290 TraceCheckUtils]: 12: Hoare triple {18376#(< 0 (mod main_~y~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; {18369#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:06:21,258 INFO L290 TraceCheckUtils]: 11: Hoare triple {18380#(< 0 (mod (+ main_~y~0 1) 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; {18376#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:06:21,258 INFO L290 TraceCheckUtils]: 10: Hoare triple {18384#(< 0 (mod (+ main_~y~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; {18380#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:06:21,259 INFO L290 TraceCheckUtils]: 9: Hoare triple {18388#(< 0 (mod (+ main_~y~0 3) 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; {18384#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:06:21,260 INFO L290 TraceCheckUtils]: 8: Hoare triple {18392#(< 0 (mod (+ main_~y~0 4) 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; {18388#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:06:21,260 INFO L290 TraceCheckUtils]: 7: Hoare triple {18396#(< 0 (mod (+ 5 main_~y~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; {18392#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:06:21,261 INFO L290 TraceCheckUtils]: 6: Hoare triple {18400#(< 0 (mod (+ main_~y~0 6) 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; {18396#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:06:21,261 INFO L290 TraceCheckUtils]: 5: Hoare triple {18221#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {18400#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:06:21,261 INFO L272 TraceCheckUtils]: 4: Hoare triple {18221#true} call #t~ret11 := main(); {18221#true} is VALID [2022-04-28 10:06:21,261 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18221#true} {18221#true} #61#return; {18221#true} is VALID [2022-04-28 10:06:21,261 INFO L290 TraceCheckUtils]: 2: Hoare triple {18221#true} assume true; {18221#true} is VALID [2022-04-28 10:06:21,261 INFO L290 TraceCheckUtils]: 1: Hoare triple {18221#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(10, 2);call #Ultimate.allocInit(12, 3); {18221#true} is VALID [2022-04-28 10:06:21,261 INFO L272 TraceCheckUtils]: 0: Hoare triple {18221#true} call ULTIMATE.init(); {18221#true} is VALID [2022-04-28 10:06:21,262 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-28 10:06:21,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1330915283] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:06:21,262 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:06:21,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 24 [2022-04-28 10:06:21,262 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:06:21,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [886236474] [2022-04-28 10:06:21,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [886236474] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:06:21,262 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:06:21,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 10:06:21,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653218053] [2022-04-28 10:06:21,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:06:21,262 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 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 29 [2022-04-28 10:06:21,262 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:06:21,263 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 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-28 10:06:21,276 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-28 10:06:21,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 10:06:21,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:06:21,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 10:06:21,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=437, Unknown=0, NotChecked=0, Total=552 [2022-04-28 10:06:21,277 INFO L87 Difference]: Start difference. First operand 75 states and 95 transitions. Second operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 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-28 10:06:21,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:21,925 INFO L93 Difference]: Finished difference Result 98 states and 118 transitions. [2022-04-28 10:06:21,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-28 10:06:21,925 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 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 29 [2022-04-28 10:06:21,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:06:21,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 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-28 10:06:21,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 52 transitions. [2022-04-28 10:06:21,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 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-28 10:06:21,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 52 transitions. [2022-04-28 10:06:21,926 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 52 transitions. [2022-04-28 10:06:21,963 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:06:21,964 INFO L225 Difference]: With dead ends: 98 [2022-04-28 10:06:21,964 INFO L226 Difference]: Without dead ends: 85 [2022-04-28 10:06:21,965 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=259, Invalid=931, Unknown=0, NotChecked=0, Total=1190 [2022-04-28 10:06:21,965 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 25 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 10:06:21,965 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 68 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 10:06:21,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-04-28 10:06:22,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 76. [2022-04-28 10:06:22,042 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:06:22,043 INFO L82 GeneralOperation]: Start isEquivalent. First operand 85 states. Second operand has 76 states, 71 states have (on average 1.295774647887324) internal successors, (92), 71 states have internal predecessors, (92), 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-28 10:06:22,043 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand has 76 states, 71 states have (on average 1.295774647887324) internal successors, (92), 71 states have internal predecessors, (92), 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-28 10:06:22,043 INFO L87 Difference]: Start difference. First operand 85 states. Second operand has 76 states, 71 states have (on average 1.295774647887324) internal successors, (92), 71 states have internal predecessors, (92), 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-28 10:06:22,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:22,044 INFO L93 Difference]: Finished difference Result 85 states and 105 transitions. [2022-04-28 10:06:22,044 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 105 transitions. [2022-04-28 10:06:22,044 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:06:22,044 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:06:22,044 INFO L74 IsIncluded]: Start isIncluded. First operand has 76 states, 71 states have (on average 1.295774647887324) internal successors, (92), 71 states have internal predecessors, (92), 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 85 states. [2022-04-28 10:06:22,044 INFO L87 Difference]: Start difference. First operand has 76 states, 71 states have (on average 1.295774647887324) internal successors, (92), 71 states have internal predecessors, (92), 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 85 states. [2022-04-28 10:06:22,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:22,045 INFO L93 Difference]: Finished difference Result 85 states and 105 transitions. [2022-04-28 10:06:22,045 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 105 transitions. [2022-04-28 10:06:22,045 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:06:22,045 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:06:22,045 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:06:22,045 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:06:22,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 71 states have (on average 1.295774647887324) internal successors, (92), 71 states have internal predecessors, (92), 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-28 10:06:22,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 96 transitions. [2022-04-28 10:06:22,046 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 96 transitions. Word has length 29 [2022-04-28 10:06:22,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:06:22,046 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 96 transitions. [2022-04-28 10:06:22,046 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 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-28 10:06:22,046 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 76 states and 96 transitions. [2022-04-28 10:06:24,220 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:06:24,220 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 96 transitions. [2022-04-28 10:06:24,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-28 10:06:24,221 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:06:24,221 INFO L195 NwaCegarLoop]: trace histogram [15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:06:24,236 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2022-04-28 10:06:24,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-04-28 10:06:24,421 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:06:24,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:06:24,422 INFO L85 PathProgramCache]: Analyzing trace with hash 2002837454, now seen corresponding path program 29 times [2022-04-28 10:06:24,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:06:24,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [191863296] [2022-04-28 10:06:24,424 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:06:24,424 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:06:24,424 INFO L85 PathProgramCache]: Analyzing trace with hash 2002837454, now seen corresponding path program 30 times [2022-04-28 10:06:24,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:06:24,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803592370] [2022-04-28 10:06:24,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:06:24,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:06:24,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:24,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:06:24,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:24,731 INFO L290 TraceCheckUtils]: 0: Hoare triple {18983#(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(10, 2);call #Ultimate.allocInit(12, 3); {18961#true} is VALID [2022-04-28 10:06:24,731 INFO L290 TraceCheckUtils]: 1: Hoare triple {18961#true} assume true; {18961#true} is VALID [2022-04-28 10:06:24,731 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18961#true} {18961#true} #61#return; {18961#true} is VALID [2022-04-28 10:06:24,734 INFO L272 TraceCheckUtils]: 0: Hoare triple {18961#true} call ULTIMATE.init(); {18983#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:06:24,734 INFO L290 TraceCheckUtils]: 1: Hoare triple {18983#(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(10, 2);call #Ultimate.allocInit(12, 3); {18961#true} is VALID [2022-04-28 10:06:24,734 INFO L290 TraceCheckUtils]: 2: Hoare triple {18961#true} assume true; {18961#true} is VALID [2022-04-28 10:06:24,734 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18961#true} {18961#true} #61#return; {18961#true} is VALID [2022-04-28 10:06:24,734 INFO L272 TraceCheckUtils]: 4: Hoare triple {18961#true} call #t~ret11 := main(); {18961#true} is VALID [2022-04-28 10:06:24,735 INFO L290 TraceCheckUtils]: 5: Hoare triple {18961#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {18966#(= main_~y~0 0)} is VALID [2022-04-28 10:06:24,735 INFO L290 TraceCheckUtils]: 6: Hoare triple {18966#(= 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; {18967#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:06:24,736 INFO L290 TraceCheckUtils]: 7: Hoare triple {18967#(and (<= 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; {18968#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:06:24,736 INFO L290 TraceCheckUtils]: 8: Hoare triple {18968#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {18969#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:06:24,737 INFO L290 TraceCheckUtils]: 9: Hoare triple {18969#(and (<= main_~y~0 3) (<= 3 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; {18970#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:06:24,737 INFO L290 TraceCheckUtils]: 10: Hoare triple {18970#(and (<= main_~y~0 4) (<= 4 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; {18971#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:06:24,738 INFO L290 TraceCheckUtils]: 11: Hoare triple {18971#(and (<= 5 main_~y~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; {18972#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:06:24,738 INFO L290 TraceCheckUtils]: 12: Hoare triple {18972#(and (<= main_~y~0 6) (<= 6 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; {18973#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:06:24,739 INFO L290 TraceCheckUtils]: 13: Hoare triple {18973#(and (<= 7 main_~y~0) (<= main_~y~0 7))} 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; {18974#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:06:24,739 INFO L290 TraceCheckUtils]: 14: Hoare triple {18974#(and (<= main_~y~0 8) (<= 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; {18975#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:06:24,740 INFO L290 TraceCheckUtils]: 15: Hoare triple {18975#(and (<= 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; {18976#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:06:24,740 INFO L290 TraceCheckUtils]: 16: Hoare triple {18976#(and (<= main_~y~0 10) (<= 10 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; {18977#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:06:24,741 INFO L290 TraceCheckUtils]: 17: Hoare triple {18977#(and (<= main_~y~0 11) (<= 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; {18978#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:06:24,742 INFO L290 TraceCheckUtils]: 18: Hoare triple {18978#(and (<= 12 main_~y~0) (<= main_~y~0 12))} 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; {18979#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:06:24,742 INFO L290 TraceCheckUtils]: 19: Hoare triple {18979#(and (<= main_~y~0 13) (<= 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; {18980#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:06:24,743 INFO L290 TraceCheckUtils]: 20: Hoare triple {18980#(and (<= 14 main_~y~0) (<= main_~y~0 14))} 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; {18981#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:06:24,743 INFO L290 TraceCheckUtils]: 21: Hoare triple {18981#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {18981#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:06:24,743 INFO L290 TraceCheckUtils]: 22: Hoare triple {18981#(and (<= main_~y~0 15) (<= 15 main_~y~0))} ~z~0 := ~y~0; {18982#(and (<= (div main_~z~0 4294967296) 0) (<= 15 main_~z~0))} is VALID [2022-04-28 10:06:24,744 INFO L290 TraceCheckUtils]: 23: Hoare triple {18982#(and (<= (div main_~z~0 4294967296) 0) (<= 15 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {18962#false} is VALID [2022-04-28 10:06:24,744 INFO L290 TraceCheckUtils]: 24: Hoare triple {18962#false} assume !(~y~0 % 4294967296 > 0); {18962#false} is VALID [2022-04-28 10:06:24,744 INFO L272 TraceCheckUtils]: 25: Hoare triple {18962#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {18962#false} is VALID [2022-04-28 10:06:24,744 INFO L290 TraceCheckUtils]: 26: Hoare triple {18962#false} ~cond := #in~cond; {18962#false} is VALID [2022-04-28 10:06:24,744 INFO L290 TraceCheckUtils]: 27: Hoare triple {18962#false} assume 0 == ~cond; {18962#false} is VALID [2022-04-28 10:06:24,744 INFO L290 TraceCheckUtils]: 28: Hoare triple {18962#false} assume !false; {18962#false} is VALID [2022-04-28 10:06:24,744 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:06:24,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:06:24,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803592370] [2022-04-28 10:06:24,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803592370] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:06:24,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1504286713] [2022-04-28 10:06:24,745 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:06:24,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:06:24,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:06:24,746 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:06:24,747 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-04-28 10:06:24,938 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2022-04-28 10:06:24,938 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:06:24,939 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-28 10:06:24,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:24,946 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:06:25,182 INFO L272 TraceCheckUtils]: 0: Hoare triple {18961#true} call ULTIMATE.init(); {18961#true} is VALID [2022-04-28 10:06:25,182 INFO L290 TraceCheckUtils]: 1: Hoare triple {18961#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(10, 2);call #Ultimate.allocInit(12, 3); {18961#true} is VALID [2022-04-28 10:06:25,182 INFO L290 TraceCheckUtils]: 2: Hoare triple {18961#true} assume true; {18961#true} is VALID [2022-04-28 10:06:25,182 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18961#true} {18961#true} #61#return; {18961#true} is VALID [2022-04-28 10:06:25,182 INFO L272 TraceCheckUtils]: 4: Hoare triple {18961#true} call #t~ret11 := main(); {18961#true} is VALID [2022-04-28 10:06:25,183 INFO L290 TraceCheckUtils]: 5: Hoare triple {18961#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {18966#(= main_~y~0 0)} is VALID [2022-04-28 10:06:25,183 INFO L290 TraceCheckUtils]: 6: Hoare triple {18966#(= 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; {18967#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:06:25,183 INFO L290 TraceCheckUtils]: 7: Hoare triple {18967#(and (<= 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; {18968#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:06:25,184 INFO L290 TraceCheckUtils]: 8: Hoare triple {18968#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {18969#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:06:25,184 INFO L290 TraceCheckUtils]: 9: Hoare triple {18969#(and (<= main_~y~0 3) (<= 3 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; {18970#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:06:25,185 INFO L290 TraceCheckUtils]: 10: Hoare triple {18970#(and (<= main_~y~0 4) (<= 4 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; {18971#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:06:25,185 INFO L290 TraceCheckUtils]: 11: Hoare triple {18971#(and (<= 5 main_~y~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; {18972#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:06:25,186 INFO L290 TraceCheckUtils]: 12: Hoare triple {18972#(and (<= main_~y~0 6) (<= 6 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; {18973#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:06:25,186 INFO L290 TraceCheckUtils]: 13: Hoare triple {18973#(and (<= 7 main_~y~0) (<= main_~y~0 7))} 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; {18974#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:06:25,187 INFO L290 TraceCheckUtils]: 14: Hoare triple {18974#(and (<= main_~y~0 8) (<= 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; {18975#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:06:25,187 INFO L290 TraceCheckUtils]: 15: Hoare triple {18975#(and (<= 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; {18976#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:06:25,188 INFO L290 TraceCheckUtils]: 16: Hoare triple {18976#(and (<= main_~y~0 10) (<= 10 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; {18977#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:06:25,188 INFO L290 TraceCheckUtils]: 17: Hoare triple {18977#(and (<= main_~y~0 11) (<= 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; {18978#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:06:25,189 INFO L290 TraceCheckUtils]: 18: Hoare triple {18978#(and (<= 12 main_~y~0) (<= main_~y~0 12))} 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; {18979#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:06:25,189 INFO L290 TraceCheckUtils]: 19: Hoare triple {18979#(and (<= main_~y~0 13) (<= 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; {18980#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:06:25,190 INFO L290 TraceCheckUtils]: 20: Hoare triple {18980#(and (<= 14 main_~y~0) (<= main_~y~0 14))} 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; {18981#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:06:25,190 INFO L290 TraceCheckUtils]: 21: Hoare triple {18981#(and (<= main_~y~0 15) (<= 15 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {18981#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:06:25,190 INFO L290 TraceCheckUtils]: 22: Hoare triple {18981#(and (<= main_~y~0 15) (<= 15 main_~y~0))} ~z~0 := ~y~0; {19053#(and (<= main_~z~0 15) (<= 15 main_~z~0))} is VALID [2022-04-28 10:06:25,191 INFO L290 TraceCheckUtils]: 23: Hoare triple {19053#(and (<= main_~z~0 15) (<= 15 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {18962#false} is VALID [2022-04-28 10:06:25,191 INFO L290 TraceCheckUtils]: 24: Hoare triple {18962#false} assume !(~y~0 % 4294967296 > 0); {18962#false} is VALID [2022-04-28 10:06:25,191 INFO L272 TraceCheckUtils]: 25: Hoare triple {18962#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {18962#false} is VALID [2022-04-28 10:06:25,191 INFO L290 TraceCheckUtils]: 26: Hoare triple {18962#false} ~cond := #in~cond; {18962#false} is VALID [2022-04-28 10:06:25,191 INFO L290 TraceCheckUtils]: 27: Hoare triple {18962#false} assume 0 == ~cond; {18962#false} is VALID [2022-04-28 10:06:25,191 INFO L290 TraceCheckUtils]: 28: Hoare triple {18962#false} assume !false; {18962#false} is VALID [2022-04-28 10:06:25,191 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:06:25,191 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:06:25,686 INFO L290 TraceCheckUtils]: 28: Hoare triple {18962#false} assume !false; {18962#false} is VALID [2022-04-28 10:06:25,686 INFO L290 TraceCheckUtils]: 27: Hoare triple {18962#false} assume 0 == ~cond; {18962#false} is VALID [2022-04-28 10:06:25,686 INFO L290 TraceCheckUtils]: 26: Hoare triple {18962#false} ~cond := #in~cond; {18962#false} is VALID [2022-04-28 10:06:25,686 INFO L272 TraceCheckUtils]: 25: Hoare triple {18962#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {18962#false} is VALID [2022-04-28 10:06:25,686 INFO L290 TraceCheckUtils]: 24: Hoare triple {18962#false} assume !(~y~0 % 4294967296 > 0); {18962#false} is VALID [2022-04-28 10:06:25,686 INFO L290 TraceCheckUtils]: 23: Hoare triple {19087#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {18962#false} is VALID [2022-04-28 10:06:25,686 INFO L290 TraceCheckUtils]: 22: Hoare triple {19091#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {19087#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:06:25,687 INFO L290 TraceCheckUtils]: 21: Hoare triple {19091#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {19091#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:06:25,687 INFO L290 TraceCheckUtils]: 20: Hoare triple {19098#(< 0 (mod (+ main_~y~0 1) 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; {19091#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:06:25,688 INFO L290 TraceCheckUtils]: 19: Hoare triple {19102#(< 0 (mod (+ main_~y~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; {19098#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:06:25,689 INFO L290 TraceCheckUtils]: 18: Hoare triple {19106#(< 0 (mod (+ main_~y~0 3) 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; {19102#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:06:25,689 INFO L290 TraceCheckUtils]: 17: Hoare triple {19110#(< 0 (mod (+ main_~y~0 4) 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; {19106#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:06:25,690 INFO L290 TraceCheckUtils]: 16: Hoare triple {19114#(< 0 (mod (+ 5 main_~y~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; {19110#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:06:25,690 INFO L290 TraceCheckUtils]: 15: Hoare triple {19118#(< 0 (mod (+ main_~y~0 6) 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; {19114#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:06:25,691 INFO L290 TraceCheckUtils]: 14: Hoare triple {19122#(< 0 (mod (+ 7 main_~y~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; {19118#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:06:25,692 INFO L290 TraceCheckUtils]: 13: Hoare triple {19126#(< 0 (mod (+ main_~y~0 8) 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; {19122#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:06:25,692 INFO L290 TraceCheckUtils]: 12: Hoare triple {19130#(< 0 (mod (+ main_~y~0 9) 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; {19126#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:06:25,693 INFO L290 TraceCheckUtils]: 11: Hoare triple {19134#(< 0 (mod (+ main_~y~0 10) 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; {19130#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:06:25,694 INFO L290 TraceCheckUtils]: 10: Hoare triple {19138#(< 0 (mod (+ main_~y~0 11) 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; {19134#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-28 10:06:25,694 INFO L290 TraceCheckUtils]: 9: Hoare triple {19142#(< 0 (mod (+ main_~y~0 12) 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; {19138#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-28 10:06:25,695 INFO L290 TraceCheckUtils]: 8: Hoare triple {19146#(< 0 (mod (+ main_~y~0 13) 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; {19142#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-28 10:06:25,695 INFO L290 TraceCheckUtils]: 7: Hoare triple {19150#(< 0 (mod (+ main_~y~0 14) 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; {19146#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-28 10:06:25,696 INFO L290 TraceCheckUtils]: 6: Hoare triple {19154#(< 0 (mod (+ main_~y~0 15) 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; {19150#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-28 10:06:25,696 INFO L290 TraceCheckUtils]: 5: Hoare triple {18961#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {19154#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID [2022-04-28 10:06:25,697 INFO L272 TraceCheckUtils]: 4: Hoare triple {18961#true} call #t~ret11 := main(); {18961#true} is VALID [2022-04-28 10:06:25,697 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18961#true} {18961#true} #61#return; {18961#true} is VALID [2022-04-28 10:06:25,697 INFO L290 TraceCheckUtils]: 2: Hoare triple {18961#true} assume true; {18961#true} is VALID [2022-04-28 10:06:25,697 INFO L290 TraceCheckUtils]: 1: Hoare triple {18961#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(10, 2);call #Ultimate.allocInit(12, 3); {18961#true} is VALID [2022-04-28 10:06:25,697 INFO L272 TraceCheckUtils]: 0: Hoare triple {18961#true} call ULTIMATE.init(); {18961#true} is VALID [2022-04-28 10:06:25,697 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:06:25,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1504286713] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:06:25,697 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:06:25,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 19] total 38 [2022-04-28 10:06:25,697 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:06:25,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [191863296] [2022-04-28 10:06:25,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [191863296] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:06:25,697 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:06:25,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-28 10:06:25,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528531159] [2022-04-28 10:06:25,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:06:25,698 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.25) internal successors, (25), 19 states have internal predecessors, (25), 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 29 [2022-04-28 10:06:25,698 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:06:25,698 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 1.25) internal successors, (25), 19 states have internal predecessors, (25), 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-28 10:06:25,716 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-28 10:06:25,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-28 10:06:25,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:06:25,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-28 10:06:25,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=331, Invalid=1075, Unknown=0, NotChecked=0, Total=1406 [2022-04-28 10:06:25,716 INFO L87 Difference]: Start difference. First operand 76 states and 96 transitions. Second operand has 20 states, 20 states have (on average 1.25) internal successors, (25), 19 states have internal predecessors, (25), 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-28 10:06:27,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:27,831 INFO L93 Difference]: Finished difference Result 103 states and 142 transitions. [2022-04-28 10:06:27,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-28 10:06:27,832 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.25) internal successors, (25), 19 states have internal predecessors, (25), 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 29 [2022-04-28 10:06:27,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:06:27,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.25) internal successors, (25), 19 states have internal predecessors, (25), 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-28 10:06:27,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 114 transitions. [2022-04-28 10:06:27,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.25) internal successors, (25), 19 states have internal predecessors, (25), 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-28 10:06:27,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 114 transitions. [2022-04-28 10:06:27,833 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 114 transitions. [2022-04-28 10:06:27,933 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:06:27,934 INFO L225 Difference]: With dead ends: 103 [2022-04-28 10:06:27,934 INFO L226 Difference]: Without dead ends: 97 [2022-04-28 10:06:27,935 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=673, Invalid=2297, Unknown=0, NotChecked=0, Total=2970 [2022-04-28 10:06:27,935 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 92 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 1281 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 1348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 1281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:06:27,935 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 126 Invalid, 1348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 1281 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-28 10:06:27,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-04-28 10:06:28,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 81. [2022-04-28 10:06:28,008 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:06:28,009 INFO L82 GeneralOperation]: Start isEquivalent. First operand 97 states. Second operand has 81 states, 76 states have (on average 1.3026315789473684) internal successors, (99), 76 states have internal predecessors, (99), 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-28 10:06:28,009 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states. Second operand has 81 states, 76 states have (on average 1.3026315789473684) internal successors, (99), 76 states have internal predecessors, (99), 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-28 10:06:28,009 INFO L87 Difference]: Start difference. First operand 97 states. Second operand has 81 states, 76 states have (on average 1.3026315789473684) internal successors, (99), 76 states have internal predecessors, (99), 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-28 10:06:28,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:28,010 INFO L93 Difference]: Finished difference Result 97 states and 119 transitions. [2022-04-28 10:06:28,010 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 119 transitions. [2022-04-28 10:06:28,010 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:06:28,010 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:06:28,010 INFO L74 IsIncluded]: Start isIncluded. First operand has 81 states, 76 states have (on average 1.3026315789473684) internal successors, (99), 76 states have internal predecessors, (99), 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 97 states. [2022-04-28 10:06:28,010 INFO L87 Difference]: Start difference. First operand has 81 states, 76 states have (on average 1.3026315789473684) internal successors, (99), 76 states have internal predecessors, (99), 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 97 states. [2022-04-28 10:06:28,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:28,011 INFO L93 Difference]: Finished difference Result 97 states and 119 transitions. [2022-04-28 10:06:28,011 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 119 transitions. [2022-04-28 10:06:28,011 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:06:28,011 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:06:28,011 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:06:28,011 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:06:28,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 76 states have (on average 1.3026315789473684) internal successors, (99), 76 states have internal predecessors, (99), 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-28 10:06:28,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 103 transitions. [2022-04-28 10:06:28,012 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 103 transitions. Word has length 29 [2022-04-28 10:06:28,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:06:28,012 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 103 transitions. [2022-04-28 10:06:28,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.25) internal successors, (25), 19 states have internal predecessors, (25), 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-28 10:06:28,012 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 81 states and 103 transitions. [2022-04-28 10:06:31,008 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 102 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 10:06:31,008 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 103 transitions. [2022-04-28 10:06:31,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-28 10:06:31,008 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:06:31,008 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:06:31,013 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Ended with exit code 0 [2022-04-28 10:06:31,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-04-28 10:06:31,209 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:06:31,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:06:31,209 INFO L85 PathProgramCache]: Analyzing trace with hash -688544435, now seen corresponding path program 41 times [2022-04-28 10:06:31,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:06:31,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [962346973] [2022-04-28 10:06:31,211 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:06:31,211 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:06:31,211 INFO L85 PathProgramCache]: Analyzing trace with hash -688544435, now seen corresponding path program 42 times [2022-04-28 10:06:31,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:06:31,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881477212] [2022-04-28 10:06:31,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:06:31,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:06:31,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:31,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:06:31,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:31,394 INFO L290 TraceCheckUtils]: 0: Hoare triple {19788#(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(10, 2);call #Ultimate.allocInit(12, 3); {19771#true} is VALID [2022-04-28 10:06:31,394 INFO L290 TraceCheckUtils]: 1: Hoare triple {19771#true} assume true; {19771#true} is VALID [2022-04-28 10:06:31,394 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {19771#true} {19771#true} #61#return; {19771#true} is VALID [2022-04-28 10:06:31,395 INFO L272 TraceCheckUtils]: 0: Hoare triple {19771#true} call ULTIMATE.init(); {19788#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:06:31,395 INFO L290 TraceCheckUtils]: 1: Hoare triple {19788#(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(10, 2);call #Ultimate.allocInit(12, 3); {19771#true} is VALID [2022-04-28 10:06:31,395 INFO L290 TraceCheckUtils]: 2: Hoare triple {19771#true} assume true; {19771#true} is VALID [2022-04-28 10:06:31,395 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19771#true} {19771#true} #61#return; {19771#true} is VALID [2022-04-28 10:06:31,395 INFO L272 TraceCheckUtils]: 4: Hoare triple {19771#true} call #t~ret11 := main(); {19771#true} is VALID [2022-04-28 10:06:31,395 INFO L290 TraceCheckUtils]: 5: Hoare triple {19771#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {19776#(= main_~y~0 0)} is VALID [2022-04-28 10:06:31,396 INFO L290 TraceCheckUtils]: 6: Hoare triple {19776#(= 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; {19777#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:06:31,396 INFO L290 TraceCheckUtils]: 7: Hoare triple {19777#(and (<= 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; {19778#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:06:31,397 INFO L290 TraceCheckUtils]: 8: Hoare triple {19778#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {19779#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:06:31,397 INFO L290 TraceCheckUtils]: 9: Hoare triple {19779#(and (<= main_~y~0 3) (<= 3 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; {19780#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:06:31,398 INFO L290 TraceCheckUtils]: 10: Hoare triple {19780#(and (<= main_~y~0 4) (<= 4 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; {19781#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:06:31,398 INFO L290 TraceCheckUtils]: 11: Hoare triple {19781#(and (<= 5 main_~y~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; {19782#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:06:31,399 INFO L290 TraceCheckUtils]: 12: Hoare triple {19782#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {19782#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:06:31,399 INFO L290 TraceCheckUtils]: 13: Hoare triple {19782#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {19783#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:06:31,399 INFO L290 TraceCheckUtils]: 14: Hoare triple {19783#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {19784#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:06:31,400 INFO L290 TraceCheckUtils]: 15: Hoare triple {19784#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {19785#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:06:31,400 INFO L290 TraceCheckUtils]: 16: Hoare triple {19785#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {19786#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:06:31,401 INFO L290 TraceCheckUtils]: 17: Hoare triple {19786#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {19787#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} is VALID [2022-04-28 10:06:31,401 INFO L290 TraceCheckUtils]: 18: Hoare triple {19787#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {19772#false} is VALID [2022-04-28 10:06:31,402 INFO L290 TraceCheckUtils]: 19: Hoare triple {19772#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {19772#false} is VALID [2022-04-28 10:06:31,402 INFO L290 TraceCheckUtils]: 20: Hoare triple {19772#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {19772#false} is VALID [2022-04-28 10:06:31,402 INFO L290 TraceCheckUtils]: 21: Hoare triple {19772#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {19772#false} is VALID [2022-04-28 10:06:31,402 INFO L290 TraceCheckUtils]: 22: Hoare triple {19772#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {19772#false} is VALID [2022-04-28 10:06:31,402 INFO L290 TraceCheckUtils]: 23: Hoare triple {19772#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {19772#false} is VALID [2022-04-28 10:06:31,402 INFO L290 TraceCheckUtils]: 24: Hoare triple {19772#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {19772#false} is VALID [2022-04-28 10:06:31,402 INFO L290 TraceCheckUtils]: 25: Hoare triple {19772#false} assume !(~y~0 % 4294967296 > 0); {19772#false} is VALID [2022-04-28 10:06:31,402 INFO L272 TraceCheckUtils]: 26: Hoare triple {19772#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {19772#false} is VALID [2022-04-28 10:06:31,402 INFO L290 TraceCheckUtils]: 27: Hoare triple {19772#false} ~cond := #in~cond; {19772#false} is VALID [2022-04-28 10:06:31,402 INFO L290 TraceCheckUtils]: 28: Hoare triple {19772#false} assume 0 == ~cond; {19772#false} is VALID [2022-04-28 10:06:31,402 INFO L290 TraceCheckUtils]: 29: Hoare triple {19772#false} assume !false; {19772#false} is VALID [2022-04-28 10:06:31,402 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-28 10:06:31,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:06:31,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881477212] [2022-04-28 10:06:31,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881477212] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:06:31,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [128986965] [2022-04-28 10:06:31,403 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:06:31,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:06:31,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:06:31,412 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:06:31,413 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-04-28 10:06:31,466 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-28 10:06:31,466 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:06:31,467 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 34 conjunts are in the unsatisfiable core [2022-04-28 10:06:31,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:31,475 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:06:31,681 INFO L272 TraceCheckUtils]: 0: Hoare triple {19771#true} call ULTIMATE.init(); {19771#true} is VALID [2022-04-28 10:06:31,681 INFO L290 TraceCheckUtils]: 1: Hoare triple {19771#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(10, 2);call #Ultimate.allocInit(12, 3); {19771#true} is VALID [2022-04-28 10:06:31,681 INFO L290 TraceCheckUtils]: 2: Hoare triple {19771#true} assume true; {19771#true} is VALID [2022-04-28 10:06:31,681 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19771#true} {19771#true} #61#return; {19771#true} is VALID [2022-04-28 10:06:31,681 INFO L272 TraceCheckUtils]: 4: Hoare triple {19771#true} call #t~ret11 := main(); {19771#true} is VALID [2022-04-28 10:06:31,681 INFO L290 TraceCheckUtils]: 5: Hoare triple {19771#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {19776#(= main_~y~0 0)} is VALID [2022-04-28 10:06:31,681 INFO L290 TraceCheckUtils]: 6: Hoare triple {19776#(= 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; {19777#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:06:31,682 INFO L290 TraceCheckUtils]: 7: Hoare triple {19777#(and (<= 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; {19778#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:06:31,682 INFO L290 TraceCheckUtils]: 8: Hoare triple {19778#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {19779#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:06:31,683 INFO L290 TraceCheckUtils]: 9: Hoare triple {19779#(and (<= main_~y~0 3) (<= 3 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; {19780#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:06:31,683 INFO L290 TraceCheckUtils]: 10: Hoare triple {19780#(and (<= main_~y~0 4) (<= 4 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; {19781#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:06:31,684 INFO L290 TraceCheckUtils]: 11: Hoare triple {19781#(and (<= 5 main_~y~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; {19782#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:06:31,684 INFO L290 TraceCheckUtils]: 12: Hoare triple {19782#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {19782#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:06:31,685 INFO L290 TraceCheckUtils]: 13: Hoare triple {19782#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {19831#(and (<= main_~y~0 6) (= main_~z~0 main_~y~0) (<= 6 main_~y~0))} is VALID [2022-04-28 10:06:31,685 INFO L290 TraceCheckUtils]: 14: Hoare triple {19831#(and (<= main_~y~0 6) (= main_~z~0 main_~y~0) (<= 6 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {19835#(and (<= main_~y~0 6) (<= 6 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-28 10:06:31,686 INFO L290 TraceCheckUtils]: 15: Hoare triple {19835#(and (<= main_~y~0 6) (<= 6 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {19839#(and (<= main_~y~0 6) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)) (<= 6 main_~y~0))} is VALID [2022-04-28 10:06:31,686 INFO L290 TraceCheckUtils]: 16: Hoare triple {19839#(and (<= main_~y~0 6) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)) (<= 6 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {19843#(and (<= main_~y~0 6) (= (+ main_~z~0 2) (+ (- 1) main_~y~0)) (<= 6 main_~y~0))} is VALID [2022-04-28 10:06:31,687 INFO L290 TraceCheckUtils]: 17: Hoare triple {19843#(and (<= main_~y~0 6) (= (+ main_~z~0 2) (+ (- 1) main_~y~0)) (<= 6 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {19847#(and (= (+ main_~z~0 3) (+ (- 1) main_~y~0)) (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:06:31,687 INFO L290 TraceCheckUtils]: 18: Hoare triple {19847#(and (= (+ main_~z~0 3) (+ (- 1) main_~y~0)) (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~z~0 % 4294967296 > 0); {19772#false} is VALID [2022-04-28 10:06:31,687 INFO L290 TraceCheckUtils]: 19: Hoare triple {19772#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {19772#false} is VALID [2022-04-28 10:06:31,687 INFO L290 TraceCheckUtils]: 20: Hoare triple {19772#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {19772#false} is VALID [2022-04-28 10:06:31,687 INFO L290 TraceCheckUtils]: 21: Hoare triple {19772#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {19772#false} is VALID [2022-04-28 10:06:31,687 INFO L290 TraceCheckUtils]: 22: Hoare triple {19772#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {19772#false} is VALID [2022-04-28 10:06:31,687 INFO L290 TraceCheckUtils]: 23: Hoare triple {19772#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {19772#false} is VALID [2022-04-28 10:06:31,687 INFO L290 TraceCheckUtils]: 24: Hoare triple {19772#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {19772#false} is VALID [2022-04-28 10:06:31,687 INFO L290 TraceCheckUtils]: 25: Hoare triple {19772#false} assume !(~y~0 % 4294967296 > 0); {19772#false} is VALID [2022-04-28 10:06:31,688 INFO L272 TraceCheckUtils]: 26: Hoare triple {19772#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {19772#false} is VALID [2022-04-28 10:06:31,688 INFO L290 TraceCheckUtils]: 27: Hoare triple {19772#false} ~cond := #in~cond; {19772#false} is VALID [2022-04-28 10:06:31,688 INFO L290 TraceCheckUtils]: 28: Hoare triple {19772#false} assume 0 == ~cond; {19772#false} is VALID [2022-04-28 10:06:31,688 INFO L290 TraceCheckUtils]: 29: Hoare triple {19772#false} assume !false; {19772#false} is VALID [2022-04-28 10:06:31,688 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-28 10:06:31,688 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:06:31,963 INFO L290 TraceCheckUtils]: 29: Hoare triple {19772#false} assume !false; {19772#false} is VALID [2022-04-28 10:06:31,963 INFO L290 TraceCheckUtils]: 28: Hoare triple {19772#false} assume 0 == ~cond; {19772#false} is VALID [2022-04-28 10:06:31,963 INFO L290 TraceCheckUtils]: 27: Hoare triple {19772#false} ~cond := #in~cond; {19772#false} is VALID [2022-04-28 10:06:31,963 INFO L272 TraceCheckUtils]: 26: Hoare triple {19772#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {19772#false} is VALID [2022-04-28 10:06:31,963 INFO L290 TraceCheckUtils]: 25: Hoare triple {19772#false} assume !(~y~0 % 4294967296 > 0); {19772#false} is VALID [2022-04-28 10:06:31,963 INFO L290 TraceCheckUtils]: 24: Hoare triple {19772#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {19772#false} is VALID [2022-04-28 10:06:31,964 INFO L290 TraceCheckUtils]: 23: Hoare triple {19902#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {19772#false} is VALID [2022-04-28 10:06:31,965 INFO L290 TraceCheckUtils]: 22: Hoare triple {19906#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {19902#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:06:31,966 INFO L290 TraceCheckUtils]: 21: Hoare triple {19910#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {19906#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:06:31,966 INFO L290 TraceCheckUtils]: 20: Hoare triple {19914#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {19910#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-28 10:06:31,967 INFO L290 TraceCheckUtils]: 19: Hoare triple {19918#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {19914#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-28 10:06:31,967 INFO L290 TraceCheckUtils]: 18: Hoare triple {19922#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {19918#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:06:31,968 INFO L290 TraceCheckUtils]: 17: Hoare triple {19926#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {19922#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} is VALID [2022-04-28 10:06:31,969 INFO L290 TraceCheckUtils]: 16: Hoare triple {19930#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {19926#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} is VALID [2022-04-28 10:06:31,970 INFO L290 TraceCheckUtils]: 15: Hoare triple {19934#(or (< 0 (mod (+ main_~z~0 4294967293) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {19930#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} is VALID [2022-04-28 10:06:31,970 INFO L290 TraceCheckUtils]: 14: Hoare triple {19938#(or (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {19934#(or (< 0 (mod (+ main_~z~0 4294967293) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} is VALID [2022-04-28 10:06:31,971 INFO L290 TraceCheckUtils]: 13: Hoare triple {19771#true} ~z~0 := ~y~0; {19938#(or (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} is VALID [2022-04-28 10:06:31,971 INFO L290 TraceCheckUtils]: 12: Hoare triple {19771#true} assume !(~x~0 % 4294967296 > 0); {19771#true} is VALID [2022-04-28 10:06:31,971 INFO L290 TraceCheckUtils]: 11: Hoare triple {19771#true} 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; {19771#true} is VALID [2022-04-28 10:06:31,971 INFO L290 TraceCheckUtils]: 10: Hoare triple {19771#true} 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; {19771#true} is VALID [2022-04-28 10:06:31,971 INFO L290 TraceCheckUtils]: 9: Hoare triple {19771#true} 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; {19771#true} is VALID [2022-04-28 10:06:31,971 INFO L290 TraceCheckUtils]: 8: Hoare triple {19771#true} 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; {19771#true} is VALID [2022-04-28 10:06:31,971 INFO L290 TraceCheckUtils]: 7: Hoare triple {19771#true} 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; {19771#true} is VALID [2022-04-28 10:06:31,971 INFO L290 TraceCheckUtils]: 6: Hoare triple {19771#true} 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; {19771#true} is VALID [2022-04-28 10:06:31,971 INFO L290 TraceCheckUtils]: 5: Hoare triple {19771#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {19771#true} is VALID [2022-04-28 10:06:31,971 INFO L272 TraceCheckUtils]: 4: Hoare triple {19771#true} call #t~ret11 := main(); {19771#true} is VALID [2022-04-28 10:06:31,971 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19771#true} {19771#true} #61#return; {19771#true} is VALID [2022-04-28 10:06:31,971 INFO L290 TraceCheckUtils]: 2: Hoare triple {19771#true} assume true; {19771#true} is VALID [2022-04-28 10:06:31,971 INFO L290 TraceCheckUtils]: 1: Hoare triple {19771#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(10, 2);call #Ultimate.allocInit(12, 3); {19771#true} is VALID [2022-04-28 10:06:31,971 INFO L272 TraceCheckUtils]: 0: Hoare triple {19771#true} call ULTIMATE.init(); {19771#true} is VALID [2022-04-28 10:06:31,972 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 10 proven. 20 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-04-28 10:06:31,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [128986965] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:06:31,972 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:06:31,972 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 12] total 30 [2022-04-28 10:06:31,972 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:06:31,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [962346973] [2022-04-28 10:06:31,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [962346973] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:06:31,972 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:06:31,972 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-28 10:06:31,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205376140] [2022-04-28 10:06:31,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:06:31,972 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 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 30 [2022-04-28 10:06:31,972 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:06:31,973 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 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-28 10:06:31,990 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:06:31,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-28 10:06:31,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:06:31,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-28 10:06:31,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=738, Unknown=0, NotChecked=0, Total=870 [2022-04-28 10:06:31,991 INFO L87 Difference]: Start difference. First operand 81 states and 103 transitions. Second operand has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 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-28 10:06:32,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:32,674 INFO L93 Difference]: Finished difference Result 102 states and 124 transitions. [2022-04-28 10:06:32,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-28 10:06:32,674 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 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 30 [2022-04-28 10:06:32,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:06:32,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 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-28 10:06:32,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 48 transitions. [2022-04-28 10:06:32,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 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-28 10:06:32,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 48 transitions. [2022-04-28 10:06:32,675 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 48 transitions. [2022-04-28 10:06:32,719 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:06:32,721 INFO L225 Difference]: With dead ends: 102 [2022-04-28 10:06:32,721 INFO L226 Difference]: Without dead ends: 90 [2022-04-28 10:06:32,721 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=232, Invalid=1490, Unknown=0, NotChecked=0, Total=1722 [2022-04-28 10:06:32,722 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 17 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 10:06:32,722 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 63 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 10:06:32,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-04-28 10:06:32,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 82. [2022-04-28 10:06:32,797 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:06:32,797 INFO L82 GeneralOperation]: Start isEquivalent. First operand 90 states. Second operand has 82 states, 77 states have (on average 1.2987012987012987) internal successors, (100), 77 states have internal predecessors, (100), 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-28 10:06:32,798 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand has 82 states, 77 states have (on average 1.2987012987012987) internal successors, (100), 77 states have internal predecessors, (100), 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-28 10:06:32,798 INFO L87 Difference]: Start difference. First operand 90 states. Second operand has 82 states, 77 states have (on average 1.2987012987012987) internal successors, (100), 77 states have internal predecessors, (100), 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-28 10:06:32,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:32,798 INFO L93 Difference]: Finished difference Result 90 states and 112 transitions. [2022-04-28 10:06:32,798 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 112 transitions. [2022-04-28 10:06:32,799 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:06:32,799 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:06:32,799 INFO L74 IsIncluded]: Start isIncluded. First operand has 82 states, 77 states have (on average 1.2987012987012987) internal successors, (100), 77 states have internal predecessors, (100), 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 90 states. [2022-04-28 10:06:32,799 INFO L87 Difference]: Start difference. First operand has 82 states, 77 states have (on average 1.2987012987012987) internal successors, (100), 77 states have internal predecessors, (100), 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 90 states. [2022-04-28 10:06:32,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:32,800 INFO L93 Difference]: Finished difference Result 90 states and 112 transitions. [2022-04-28 10:06:32,800 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 112 transitions. [2022-04-28 10:06:32,800 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:06:32,800 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:06:32,800 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:06:32,800 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:06:32,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 77 states have (on average 1.2987012987012987) internal successors, (100), 77 states have internal predecessors, (100), 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-28 10:06:32,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 104 transitions. [2022-04-28 10:06:32,801 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 104 transitions. Word has length 30 [2022-04-28 10:06:32,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:06:32,801 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 104 transitions. [2022-04-28 10:06:32,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 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-28 10:06:32,801 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 82 states and 104 transitions. [2022-04-28 10:06:35,595 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:06:35,595 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 104 transitions. [2022-04-28 10:06:35,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-28 10:06:35,596 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:06:35,596 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:06:35,611 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2022-04-28 10:06:35,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:06:35,796 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:06:35,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:06:35,796 INFO L85 PathProgramCache]: Analyzing trace with hash 352108927, now seen corresponding path program 43 times [2022-04-28 10:06:35,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:06:35,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1294969139] [2022-04-28 10:06:35,798 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:06:35,798 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:06:35,799 INFO L85 PathProgramCache]: Analyzing trace with hash 352108927, now seen corresponding path program 44 times [2022-04-28 10:06:35,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:06:35,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337571356] [2022-04-28 10:06:35,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:06:35,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:06:35,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:35,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:06:35,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:35,959 INFO L290 TraceCheckUtils]: 0: Hoare triple {20571#(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(10, 2);call #Ultimate.allocInit(12, 3); {20555#true} is VALID [2022-04-28 10:06:35,960 INFO L290 TraceCheckUtils]: 1: Hoare triple {20555#true} assume true; {20555#true} is VALID [2022-04-28 10:06:35,960 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {20555#true} {20555#true} #61#return; {20555#true} is VALID [2022-04-28 10:06:35,960 INFO L272 TraceCheckUtils]: 0: Hoare triple {20555#true} call ULTIMATE.init(); {20571#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:06:35,960 INFO L290 TraceCheckUtils]: 1: Hoare triple {20571#(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(10, 2);call #Ultimate.allocInit(12, 3); {20555#true} is VALID [2022-04-28 10:06:35,960 INFO L290 TraceCheckUtils]: 2: Hoare triple {20555#true} assume true; {20555#true} is VALID [2022-04-28 10:06:35,960 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20555#true} {20555#true} #61#return; {20555#true} is VALID [2022-04-28 10:06:35,960 INFO L272 TraceCheckUtils]: 4: Hoare triple {20555#true} call #t~ret11 := main(); {20555#true} is VALID [2022-04-28 10:06:35,960 INFO L290 TraceCheckUtils]: 5: Hoare triple {20555#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {20560#(= main_~y~0 0)} is VALID [2022-04-28 10:06:35,961 INFO L290 TraceCheckUtils]: 6: Hoare triple {20560#(= 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; {20561#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:06:35,961 INFO L290 TraceCheckUtils]: 7: Hoare triple {20561#(and (<= 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; {20562#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:06:35,962 INFO L290 TraceCheckUtils]: 8: Hoare triple {20562#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {20563#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:06:35,962 INFO L290 TraceCheckUtils]: 9: Hoare triple {20563#(and (<= main_~y~0 3) (<= 3 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; {20564#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:06:35,963 INFO L290 TraceCheckUtils]: 10: Hoare triple {20564#(and (<= main_~y~0 4) (<= 4 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; {20565#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:06:35,963 INFO L290 TraceCheckUtils]: 11: Hoare triple {20565#(and (<= 5 main_~y~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; {20566#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:06:35,964 INFO L290 TraceCheckUtils]: 12: Hoare triple {20566#(and (<= main_~y~0 6) (<= 6 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; {20567#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:06:35,964 INFO L290 TraceCheckUtils]: 13: Hoare triple {20567#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {20567#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:06:35,965 INFO L290 TraceCheckUtils]: 14: Hoare triple {20567#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {20568#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:06:35,965 INFO L290 TraceCheckUtils]: 15: Hoare triple {20568#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {20569#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:06:35,966 INFO L290 TraceCheckUtils]: 16: Hoare triple {20569#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {20570#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:06:35,966 INFO L290 TraceCheckUtils]: 17: Hoare triple {20570#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {20556#false} is VALID [2022-04-28 10:06:35,966 INFO L290 TraceCheckUtils]: 18: Hoare triple {20556#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20556#false} is VALID [2022-04-28 10:06:35,966 INFO L290 TraceCheckUtils]: 19: Hoare triple {20556#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20556#false} is VALID [2022-04-28 10:06:35,966 INFO L290 TraceCheckUtils]: 20: Hoare triple {20556#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20556#false} is VALID [2022-04-28 10:06:35,966 INFO L290 TraceCheckUtils]: 21: Hoare triple {20556#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20556#false} is VALID [2022-04-28 10:06:35,966 INFO L290 TraceCheckUtils]: 22: Hoare triple {20556#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20556#false} is VALID [2022-04-28 10:06:35,966 INFO L290 TraceCheckUtils]: 23: Hoare triple {20556#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20556#false} is VALID [2022-04-28 10:06:35,966 INFO L290 TraceCheckUtils]: 24: Hoare triple {20556#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20556#false} is VALID [2022-04-28 10:06:35,966 INFO L290 TraceCheckUtils]: 25: Hoare triple {20556#false} assume !(~y~0 % 4294967296 > 0); {20556#false} is VALID [2022-04-28 10:06:35,967 INFO L272 TraceCheckUtils]: 26: Hoare triple {20556#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {20556#false} is VALID [2022-04-28 10:06:35,967 INFO L290 TraceCheckUtils]: 27: Hoare triple {20556#false} ~cond := #in~cond; {20556#false} is VALID [2022-04-28 10:06:35,967 INFO L290 TraceCheckUtils]: 28: Hoare triple {20556#false} assume 0 == ~cond; {20556#false} is VALID [2022-04-28 10:06:35,967 INFO L290 TraceCheckUtils]: 29: Hoare triple {20556#false} assume !false; {20556#false} is VALID [2022-04-28 10:06:35,967 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-28 10:06:35,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:06:35,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337571356] [2022-04-28 10:06:35,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337571356] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:06:35,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [912358459] [2022-04-28 10:06:35,967 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:06:35,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:06:35,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:06:35,968 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:06:35,968 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2022-04-28 10:06:36,003 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:06:36,003 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:06:36,004 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-28 10:06:36,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:36,010 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:06:36,223 INFO L272 TraceCheckUtils]: 0: Hoare triple {20555#true} call ULTIMATE.init(); {20555#true} is VALID [2022-04-28 10:06:36,223 INFO L290 TraceCheckUtils]: 1: Hoare triple {20555#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(10, 2);call #Ultimate.allocInit(12, 3); {20555#true} is VALID [2022-04-28 10:06:36,223 INFO L290 TraceCheckUtils]: 2: Hoare triple {20555#true} assume true; {20555#true} is VALID [2022-04-28 10:06:36,223 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20555#true} {20555#true} #61#return; {20555#true} is VALID [2022-04-28 10:06:36,224 INFO L272 TraceCheckUtils]: 4: Hoare triple {20555#true} call #t~ret11 := main(); {20555#true} is VALID [2022-04-28 10:06:36,224 INFO L290 TraceCheckUtils]: 5: Hoare triple {20555#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {20560#(= main_~y~0 0)} is VALID [2022-04-28 10:06:36,224 INFO L290 TraceCheckUtils]: 6: Hoare triple {20560#(= 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; {20561#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:06:36,225 INFO L290 TraceCheckUtils]: 7: Hoare triple {20561#(and (<= 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; {20562#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:06:36,225 INFO L290 TraceCheckUtils]: 8: Hoare triple {20562#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {20563#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:06:36,226 INFO L290 TraceCheckUtils]: 9: Hoare triple {20563#(and (<= main_~y~0 3) (<= 3 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; {20564#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:06:36,226 INFO L290 TraceCheckUtils]: 10: Hoare triple {20564#(and (<= main_~y~0 4) (<= 4 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; {20565#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:06:36,227 INFO L290 TraceCheckUtils]: 11: Hoare triple {20565#(and (<= 5 main_~y~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; {20566#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:06:36,227 INFO L290 TraceCheckUtils]: 12: Hoare triple {20566#(and (<= main_~y~0 6) (<= 6 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; {20567#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:06:36,227 INFO L290 TraceCheckUtils]: 13: Hoare triple {20567#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {20567#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:06:36,228 INFO L290 TraceCheckUtils]: 14: Hoare triple {20567#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {20568#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:06:36,228 INFO L290 TraceCheckUtils]: 15: Hoare triple {20568#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {20569#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:06:36,229 INFO L290 TraceCheckUtils]: 16: Hoare triple {20569#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {20623#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:06:36,229 INFO L290 TraceCheckUtils]: 17: Hoare triple {20623#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {20556#false} is VALID [2022-04-28 10:06:36,229 INFO L290 TraceCheckUtils]: 18: Hoare triple {20556#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20556#false} is VALID [2022-04-28 10:06:36,229 INFO L290 TraceCheckUtils]: 19: Hoare triple {20556#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20556#false} is VALID [2022-04-28 10:06:36,229 INFO L290 TraceCheckUtils]: 20: Hoare triple {20556#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20556#false} is VALID [2022-04-28 10:06:36,229 INFO L290 TraceCheckUtils]: 21: Hoare triple {20556#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20556#false} is VALID [2022-04-28 10:06:36,229 INFO L290 TraceCheckUtils]: 22: Hoare triple {20556#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20556#false} is VALID [2022-04-28 10:06:36,229 INFO L290 TraceCheckUtils]: 23: Hoare triple {20556#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20556#false} is VALID [2022-04-28 10:06:36,230 INFO L290 TraceCheckUtils]: 24: Hoare triple {20556#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20556#false} is VALID [2022-04-28 10:06:36,230 INFO L290 TraceCheckUtils]: 25: Hoare triple {20556#false} assume !(~y~0 % 4294967296 > 0); {20556#false} is VALID [2022-04-28 10:06:36,230 INFO L272 TraceCheckUtils]: 26: Hoare triple {20556#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {20556#false} is VALID [2022-04-28 10:06:36,230 INFO L290 TraceCheckUtils]: 27: Hoare triple {20556#false} ~cond := #in~cond; {20556#false} is VALID [2022-04-28 10:06:36,230 INFO L290 TraceCheckUtils]: 28: Hoare triple {20556#false} assume 0 == ~cond; {20556#false} is VALID [2022-04-28 10:06:36,230 INFO L290 TraceCheckUtils]: 29: Hoare triple {20556#false} assume !false; {20556#false} is VALID [2022-04-28 10:06:36,230 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-28 10:06:36,230 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:06:36,473 INFO L290 TraceCheckUtils]: 29: Hoare triple {20556#false} assume !false; {20556#false} is VALID [2022-04-28 10:06:36,473 INFO L290 TraceCheckUtils]: 28: Hoare triple {20556#false} assume 0 == ~cond; {20556#false} is VALID [2022-04-28 10:06:36,473 INFO L290 TraceCheckUtils]: 27: Hoare triple {20556#false} ~cond := #in~cond; {20556#false} is VALID [2022-04-28 10:06:36,473 INFO L272 TraceCheckUtils]: 26: Hoare triple {20556#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {20556#false} is VALID [2022-04-28 10:06:36,473 INFO L290 TraceCheckUtils]: 25: Hoare triple {20556#false} assume !(~y~0 % 4294967296 > 0); {20556#false} is VALID [2022-04-28 10:06:36,473 INFO L290 TraceCheckUtils]: 24: Hoare triple {20556#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20556#false} is VALID [2022-04-28 10:06:36,473 INFO L290 TraceCheckUtils]: 23: Hoare triple {20556#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20556#false} is VALID [2022-04-28 10:06:36,473 INFO L290 TraceCheckUtils]: 22: Hoare triple {20556#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20556#false} is VALID [2022-04-28 10:06:36,473 INFO L290 TraceCheckUtils]: 21: Hoare triple {20556#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20556#false} is VALID [2022-04-28 10:06:36,473 INFO L290 TraceCheckUtils]: 20: Hoare triple {20556#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20556#false} is VALID [2022-04-28 10:06:36,473 INFO L290 TraceCheckUtils]: 19: Hoare triple {20556#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20556#false} is VALID [2022-04-28 10:06:36,473 INFO L290 TraceCheckUtils]: 18: Hoare triple {20556#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {20556#false} is VALID [2022-04-28 10:06:36,473 INFO L290 TraceCheckUtils]: 17: Hoare triple {20699#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {20556#false} is VALID [2022-04-28 10:06:36,474 INFO L290 TraceCheckUtils]: 16: Hoare triple {20703#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {20699#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:06:36,475 INFO L290 TraceCheckUtils]: 15: Hoare triple {20707#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {20703#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:06:36,475 INFO L290 TraceCheckUtils]: 14: Hoare triple {20711#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} ~z~0 := ~y~0; {20707#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-28 10:06:36,476 INFO L290 TraceCheckUtils]: 13: Hoare triple {20711#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !(~x~0 % 4294967296 > 0); {20711#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:06:36,476 INFO L290 TraceCheckUtils]: 12: Hoare triple {20718#(< 0 (mod (+ main_~y~0 4294967295) 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; {20711#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:06:36,477 INFO L290 TraceCheckUtils]: 11: Hoare triple {20722#(< 0 (mod main_~y~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; {20718#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:06:36,478 INFO L290 TraceCheckUtils]: 10: Hoare triple {20726#(< 0 (mod (+ main_~y~0 1) 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; {20722#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:06:36,478 INFO L290 TraceCheckUtils]: 9: Hoare triple {20730#(< 0 (mod (+ main_~y~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; {20726#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:06:36,479 INFO L290 TraceCheckUtils]: 8: Hoare triple {20734#(< 0 (mod (+ main_~y~0 3) 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; {20730#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:06:36,479 INFO L290 TraceCheckUtils]: 7: Hoare triple {20738#(< 0 (mod (+ main_~y~0 4) 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; {20734#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:06:36,480 INFO L290 TraceCheckUtils]: 6: Hoare triple {20742#(< 0 (mod (+ 5 main_~y~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; {20738#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:06:36,480 INFO L290 TraceCheckUtils]: 5: Hoare triple {20555#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {20742#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:06:36,480 INFO L272 TraceCheckUtils]: 4: Hoare triple {20555#true} call #t~ret11 := main(); {20555#true} is VALID [2022-04-28 10:06:36,481 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20555#true} {20555#true} #61#return; {20555#true} is VALID [2022-04-28 10:06:36,481 INFO L290 TraceCheckUtils]: 2: Hoare triple {20555#true} assume true; {20555#true} is VALID [2022-04-28 10:06:36,481 INFO L290 TraceCheckUtils]: 1: Hoare triple {20555#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(10, 2);call #Ultimate.allocInit(12, 3); {20555#true} is VALID [2022-04-28 10:06:36,481 INFO L272 TraceCheckUtils]: 0: Hoare triple {20555#true} call ULTIMATE.init(); {20555#true} is VALID [2022-04-28 10:06:36,481 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-28 10:06:36,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [912358459] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:06:36,481 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:06:36,481 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 26 [2022-04-28 10:06:36,481 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:06:36,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1294969139] [2022-04-28 10:06:36,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1294969139] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:06:36,481 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:06:36,481 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 10:06:36,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355089904] [2022-04-28 10:06:36,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:06:36,482 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 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 30 [2022-04-28 10:06:36,482 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:06:36,482 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 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-28 10:06:36,496 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-28 10:06:36,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 10:06:36,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:06:36,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 10:06:36,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=525, Unknown=0, NotChecked=0, Total=650 [2022-04-28 10:06:36,496 INFO L87 Difference]: Start difference. First operand 82 states and 104 transitions. Second operand has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 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-28 10:06:37,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:37,256 INFO L93 Difference]: Finished difference Result 105 states and 127 transitions. [2022-04-28 10:06:37,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-28 10:06:37,256 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 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 30 [2022-04-28 10:06:37,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:06:37,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 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-28 10:06:37,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 54 transitions. [2022-04-28 10:06:37,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 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-28 10:06:37,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 54 transitions. [2022-04-28 10:06:37,258 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 54 transitions. [2022-04-28 10:06:37,297 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:06:37,298 INFO L225 Difference]: With dead ends: 105 [2022-04-28 10:06:37,298 INFO L226 Difference]: Without dead ends: 92 [2022-04-28 10:06:37,298 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=309, Invalid=1173, Unknown=0, NotChecked=0, Total=1482 [2022-04-28 10:06:37,299 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 24 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 10:06:37,299 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 70 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 10:06:37,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-04-28 10:06:37,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 83. [2022-04-28 10:06:37,377 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:06:37,377 INFO L82 GeneralOperation]: Start isEquivalent. First operand 92 states. Second operand has 83 states, 78 states have (on average 1.294871794871795) internal successors, (101), 78 states have internal predecessors, (101), 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-28 10:06:37,377 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand has 83 states, 78 states have (on average 1.294871794871795) internal successors, (101), 78 states have internal predecessors, (101), 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-28 10:06:37,377 INFO L87 Difference]: Start difference. First operand 92 states. Second operand has 83 states, 78 states have (on average 1.294871794871795) internal successors, (101), 78 states have internal predecessors, (101), 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-28 10:06:37,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:37,378 INFO L93 Difference]: Finished difference Result 92 states and 114 transitions. [2022-04-28 10:06:37,378 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 114 transitions. [2022-04-28 10:06:37,378 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:06:37,378 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:06:37,379 INFO L74 IsIncluded]: Start isIncluded. First operand has 83 states, 78 states have (on average 1.294871794871795) internal successors, (101), 78 states have internal predecessors, (101), 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 92 states. [2022-04-28 10:06:37,379 INFO L87 Difference]: Start difference. First operand has 83 states, 78 states have (on average 1.294871794871795) internal successors, (101), 78 states have internal predecessors, (101), 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 92 states. [2022-04-28 10:06:37,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:37,379 INFO L93 Difference]: Finished difference Result 92 states and 114 transitions. [2022-04-28 10:06:37,379 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 114 transitions. [2022-04-28 10:06:37,379 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:06:37,380 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:06:37,380 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:06:37,380 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:06:37,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 78 states have (on average 1.294871794871795) internal successors, (101), 78 states have internal predecessors, (101), 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-28 10:06:37,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 105 transitions. [2022-04-28 10:06:37,380 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 105 transitions. Word has length 30 [2022-04-28 10:06:37,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:06:37,380 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 105 transitions. [2022-04-28 10:06:37,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 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-28 10:06:37,381 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 83 states and 105 transitions. [2022-04-28 10:06:38,763 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:06:38,764 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 105 transitions. [2022-04-28 10:06:38,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-28 10:06:38,764 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:06:38,764 INFO L195 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:06:38,780 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Forceful destruction successful, exit code 0 [2022-04-28 10:06:38,964 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-04-28 10:06:38,964 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:06:38,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:06:38,965 INFO L85 PathProgramCache]: Analyzing trace with hash -1483692467, now seen corresponding path program 31 times [2022-04-28 10:06:38,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:06:38,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [442314846] [2022-04-28 10:06:38,967 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:06:38,967 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:06:38,967 INFO L85 PathProgramCache]: Analyzing trace with hash -1483692467, now seen corresponding path program 32 times [2022-04-28 10:06:38,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:06:38,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602661706] [2022-04-28 10:06:38,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:06:38,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:06:38,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:39,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:06:39,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:39,259 INFO L290 TraceCheckUtils]: 0: Hoare triple {21372#(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(10, 2);call #Ultimate.allocInit(12, 3); {21349#true} is VALID [2022-04-28 10:06:39,259 INFO L290 TraceCheckUtils]: 1: Hoare triple {21349#true} assume true; {21349#true} is VALID [2022-04-28 10:06:39,259 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21349#true} {21349#true} #61#return; {21349#true} is VALID [2022-04-28 10:06:39,260 INFO L272 TraceCheckUtils]: 0: Hoare triple {21349#true} call ULTIMATE.init(); {21372#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:06:39,260 INFO L290 TraceCheckUtils]: 1: Hoare triple {21372#(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(10, 2);call #Ultimate.allocInit(12, 3); {21349#true} is VALID [2022-04-28 10:06:39,260 INFO L290 TraceCheckUtils]: 2: Hoare triple {21349#true} assume true; {21349#true} is VALID [2022-04-28 10:06:39,260 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21349#true} {21349#true} #61#return; {21349#true} is VALID [2022-04-28 10:06:39,260 INFO L272 TraceCheckUtils]: 4: Hoare triple {21349#true} call #t~ret11 := main(); {21349#true} is VALID [2022-04-28 10:06:39,260 INFO L290 TraceCheckUtils]: 5: Hoare triple {21349#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {21354#(= main_~y~0 0)} is VALID [2022-04-28 10:06:39,260 INFO L290 TraceCheckUtils]: 6: Hoare triple {21354#(= 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; {21355#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:06:39,261 INFO L290 TraceCheckUtils]: 7: Hoare triple {21355#(and (<= 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; {21356#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:06:39,261 INFO L290 TraceCheckUtils]: 8: Hoare triple {21356#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {21357#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:06:39,262 INFO L290 TraceCheckUtils]: 9: Hoare triple {21357#(and (<= main_~y~0 3) (<= 3 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; {21358#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:06:39,262 INFO L290 TraceCheckUtils]: 10: Hoare triple {21358#(and (<= main_~y~0 4) (<= 4 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; {21359#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:06:39,263 INFO L290 TraceCheckUtils]: 11: Hoare triple {21359#(and (<= 5 main_~y~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; {21360#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:06:39,263 INFO L290 TraceCheckUtils]: 12: Hoare triple {21360#(and (<= main_~y~0 6) (<= 6 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; {21361#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:06:39,264 INFO L290 TraceCheckUtils]: 13: Hoare triple {21361#(and (<= 7 main_~y~0) (<= main_~y~0 7))} 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; {21362#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:06:39,264 INFO L290 TraceCheckUtils]: 14: Hoare triple {21362#(and (<= main_~y~0 8) (<= 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; {21363#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:06:39,265 INFO L290 TraceCheckUtils]: 15: Hoare triple {21363#(and (<= 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; {21364#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:06:39,265 INFO L290 TraceCheckUtils]: 16: Hoare triple {21364#(and (<= main_~y~0 10) (<= 10 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; {21365#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:06:39,266 INFO L290 TraceCheckUtils]: 17: Hoare triple {21365#(and (<= main_~y~0 11) (<= 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; {21366#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:06:39,266 INFO L290 TraceCheckUtils]: 18: Hoare triple {21366#(and (<= 12 main_~y~0) (<= main_~y~0 12))} 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; {21367#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:06:39,267 INFO L290 TraceCheckUtils]: 19: Hoare triple {21367#(and (<= main_~y~0 13) (<= 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; {21368#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:06:39,267 INFO L290 TraceCheckUtils]: 20: Hoare triple {21368#(and (<= 14 main_~y~0) (<= main_~y~0 14))} 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; {21369#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:06:39,268 INFO L290 TraceCheckUtils]: 21: Hoare triple {21369#(and (<= main_~y~0 15) (<= 15 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; {21370#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:06:39,268 INFO L290 TraceCheckUtils]: 22: Hoare triple {21370#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !(~x~0 % 4294967296 > 0); {21370#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:06:39,269 INFO L290 TraceCheckUtils]: 23: Hoare triple {21370#(and (<= 16 main_~y~0) (<= main_~y~0 16))} ~z~0 := ~y~0; {21371#(and (<= 16 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:06:39,269 INFO L290 TraceCheckUtils]: 24: Hoare triple {21371#(and (<= 16 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {21350#false} is VALID [2022-04-28 10:06:39,269 INFO L290 TraceCheckUtils]: 25: Hoare triple {21350#false} assume !(~y~0 % 4294967296 > 0); {21350#false} is VALID [2022-04-28 10:06:39,269 INFO L272 TraceCheckUtils]: 26: Hoare triple {21350#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {21350#false} is VALID [2022-04-28 10:06:39,269 INFO L290 TraceCheckUtils]: 27: Hoare triple {21350#false} ~cond := #in~cond; {21350#false} is VALID [2022-04-28 10:06:39,269 INFO L290 TraceCheckUtils]: 28: Hoare triple {21350#false} assume 0 == ~cond; {21350#false} is VALID [2022-04-28 10:06:39,269 INFO L290 TraceCheckUtils]: 29: Hoare triple {21350#false} assume !false; {21350#false} is VALID [2022-04-28 10:06:39,269 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:06:39,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:06:39,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602661706] [2022-04-28 10:06:39,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602661706] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:06:39,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [899170841] [2022-04-28 10:06:39,270 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:06:39,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:06:39,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:06:39,271 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:06:39,271 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2022-04-28 10:06:39,305 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:06:39,306 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:06:39,306 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-28 10:06:39,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:39,313 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:06:39,558 INFO L272 TraceCheckUtils]: 0: Hoare triple {21349#true} call ULTIMATE.init(); {21349#true} is VALID [2022-04-28 10:06:39,558 INFO L290 TraceCheckUtils]: 1: Hoare triple {21349#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(10, 2);call #Ultimate.allocInit(12, 3); {21349#true} is VALID [2022-04-28 10:06:39,558 INFO L290 TraceCheckUtils]: 2: Hoare triple {21349#true} assume true; {21349#true} is VALID [2022-04-28 10:06:39,558 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21349#true} {21349#true} #61#return; {21349#true} is VALID [2022-04-28 10:06:39,558 INFO L272 TraceCheckUtils]: 4: Hoare triple {21349#true} call #t~ret11 := main(); {21349#true} is VALID [2022-04-28 10:06:39,558 INFO L290 TraceCheckUtils]: 5: Hoare triple {21349#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {21354#(= main_~y~0 0)} is VALID [2022-04-28 10:06:39,559 INFO L290 TraceCheckUtils]: 6: Hoare triple {21354#(= 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; {21355#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:06:39,559 INFO L290 TraceCheckUtils]: 7: Hoare triple {21355#(and (<= 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; {21356#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:06:39,560 INFO L290 TraceCheckUtils]: 8: Hoare triple {21356#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {21357#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:06:39,560 INFO L290 TraceCheckUtils]: 9: Hoare triple {21357#(and (<= main_~y~0 3) (<= 3 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; {21358#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:06:39,561 INFO L290 TraceCheckUtils]: 10: Hoare triple {21358#(and (<= main_~y~0 4) (<= 4 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; {21359#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:06:39,561 INFO L290 TraceCheckUtils]: 11: Hoare triple {21359#(and (<= 5 main_~y~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; {21360#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:06:39,562 INFO L290 TraceCheckUtils]: 12: Hoare triple {21360#(and (<= main_~y~0 6) (<= 6 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; {21361#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:06:39,562 INFO L290 TraceCheckUtils]: 13: Hoare triple {21361#(and (<= 7 main_~y~0) (<= main_~y~0 7))} 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; {21362#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:06:39,563 INFO L290 TraceCheckUtils]: 14: Hoare triple {21362#(and (<= main_~y~0 8) (<= 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; {21363#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:06:39,563 INFO L290 TraceCheckUtils]: 15: Hoare triple {21363#(and (<= 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; {21364#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:06:39,564 INFO L290 TraceCheckUtils]: 16: Hoare triple {21364#(and (<= main_~y~0 10) (<= 10 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; {21365#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:06:39,564 INFO L290 TraceCheckUtils]: 17: Hoare triple {21365#(and (<= main_~y~0 11) (<= 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; {21366#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:06:39,565 INFO L290 TraceCheckUtils]: 18: Hoare triple {21366#(and (<= 12 main_~y~0) (<= main_~y~0 12))} 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; {21367#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:06:39,565 INFO L290 TraceCheckUtils]: 19: Hoare triple {21367#(and (<= main_~y~0 13) (<= 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; {21368#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:06:39,566 INFO L290 TraceCheckUtils]: 20: Hoare triple {21368#(and (<= 14 main_~y~0) (<= main_~y~0 14))} 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; {21369#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:06:39,566 INFO L290 TraceCheckUtils]: 21: Hoare triple {21369#(and (<= main_~y~0 15) (<= 15 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; {21370#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:06:39,566 INFO L290 TraceCheckUtils]: 22: Hoare triple {21370#(and (<= 16 main_~y~0) (<= main_~y~0 16))} assume !(~x~0 % 4294967296 > 0); {21370#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:06:39,567 INFO L290 TraceCheckUtils]: 23: Hoare triple {21370#(and (<= 16 main_~y~0) (<= main_~y~0 16))} ~z~0 := ~y~0; {21445#(and (<= 16 main_~z~0) (<= main_~z~0 16))} is VALID [2022-04-28 10:06:39,567 INFO L290 TraceCheckUtils]: 24: Hoare triple {21445#(and (<= 16 main_~z~0) (<= main_~z~0 16))} assume !(~z~0 % 4294967296 > 0); {21350#false} is VALID [2022-04-28 10:06:39,567 INFO L290 TraceCheckUtils]: 25: Hoare triple {21350#false} assume !(~y~0 % 4294967296 > 0); {21350#false} is VALID [2022-04-28 10:06:39,567 INFO L272 TraceCheckUtils]: 26: Hoare triple {21350#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {21350#false} is VALID [2022-04-28 10:06:39,567 INFO L290 TraceCheckUtils]: 27: Hoare triple {21350#false} ~cond := #in~cond; {21350#false} is VALID [2022-04-28 10:06:39,567 INFO L290 TraceCheckUtils]: 28: Hoare triple {21350#false} assume 0 == ~cond; {21350#false} is VALID [2022-04-28 10:06:39,567 INFO L290 TraceCheckUtils]: 29: Hoare triple {21350#false} assume !false; {21350#false} is VALID [2022-04-28 10:06:39,567 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:06:39,568 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:06:40,113 INFO L290 TraceCheckUtils]: 29: Hoare triple {21350#false} assume !false; {21350#false} is VALID [2022-04-28 10:06:40,114 INFO L290 TraceCheckUtils]: 28: Hoare triple {21350#false} assume 0 == ~cond; {21350#false} is VALID [2022-04-28 10:06:40,114 INFO L290 TraceCheckUtils]: 27: Hoare triple {21350#false} ~cond := #in~cond; {21350#false} is VALID [2022-04-28 10:06:40,114 INFO L272 TraceCheckUtils]: 26: Hoare triple {21350#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {21350#false} is VALID [2022-04-28 10:06:40,114 INFO L290 TraceCheckUtils]: 25: Hoare triple {21350#false} assume !(~y~0 % 4294967296 > 0); {21350#false} is VALID [2022-04-28 10:06:40,114 INFO L290 TraceCheckUtils]: 24: Hoare triple {21479#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {21350#false} is VALID [2022-04-28 10:06:40,114 INFO L290 TraceCheckUtils]: 23: Hoare triple {21483#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {21479#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:06:40,115 INFO L290 TraceCheckUtils]: 22: Hoare triple {21483#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {21483#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:06:40,115 INFO L290 TraceCheckUtils]: 21: Hoare triple {21490#(< 0 (mod (+ main_~y~0 1) 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; {21483#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:06:40,116 INFO L290 TraceCheckUtils]: 20: Hoare triple {21494#(< 0 (mod (+ main_~y~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; {21490#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:06:40,116 INFO L290 TraceCheckUtils]: 19: Hoare triple {21498#(< 0 (mod (+ main_~y~0 3) 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; {21494#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:06:40,117 INFO L290 TraceCheckUtils]: 18: Hoare triple {21502#(< 0 (mod (+ main_~y~0 4) 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; {21498#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:06:40,118 INFO L290 TraceCheckUtils]: 17: Hoare triple {21506#(< 0 (mod (+ 5 main_~y~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; {21502#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:06:40,118 INFO L290 TraceCheckUtils]: 16: Hoare triple {21510#(< 0 (mod (+ main_~y~0 6) 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; {21506#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:06:40,119 INFO L290 TraceCheckUtils]: 15: Hoare triple {21514#(< 0 (mod (+ 7 main_~y~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; {21510#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:06:40,120 INFO L290 TraceCheckUtils]: 14: Hoare triple {21518#(< 0 (mod (+ main_~y~0 8) 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; {21514#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:06:40,120 INFO L290 TraceCheckUtils]: 13: Hoare triple {21522#(< 0 (mod (+ main_~y~0 9) 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; {21518#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:06:40,121 INFO L290 TraceCheckUtils]: 12: Hoare triple {21526#(< 0 (mod (+ main_~y~0 10) 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; {21522#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:06:40,122 INFO L290 TraceCheckUtils]: 11: Hoare triple {21530#(< 0 (mod (+ main_~y~0 11) 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; {21526#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-28 10:06:40,122 INFO L290 TraceCheckUtils]: 10: Hoare triple {21534#(< 0 (mod (+ main_~y~0 12) 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; {21530#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-28 10:06:40,123 INFO L290 TraceCheckUtils]: 9: Hoare triple {21538#(< 0 (mod (+ main_~y~0 13) 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; {21534#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-28 10:06:40,124 INFO L290 TraceCheckUtils]: 8: Hoare triple {21542#(< 0 (mod (+ main_~y~0 14) 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; {21538#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-28 10:06:40,124 INFO L290 TraceCheckUtils]: 7: Hoare triple {21546#(< 0 (mod (+ main_~y~0 15) 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; {21542#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-28 10:06:40,125 INFO L290 TraceCheckUtils]: 6: Hoare triple {21550#(< 0 (mod (+ main_~y~0 16) 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; {21546#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID [2022-04-28 10:06:40,125 INFO L290 TraceCheckUtils]: 5: Hoare triple {21349#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {21550#(< 0 (mod (+ main_~y~0 16) 4294967296))} is VALID [2022-04-28 10:06:40,125 INFO L272 TraceCheckUtils]: 4: Hoare triple {21349#true} call #t~ret11 := main(); {21349#true} is VALID [2022-04-28 10:06:40,125 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21349#true} {21349#true} #61#return; {21349#true} is VALID [2022-04-28 10:06:40,125 INFO L290 TraceCheckUtils]: 2: Hoare triple {21349#true} assume true; {21349#true} is VALID [2022-04-28 10:06:40,125 INFO L290 TraceCheckUtils]: 1: Hoare triple {21349#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(10, 2);call #Ultimate.allocInit(12, 3); {21349#true} is VALID [2022-04-28 10:06:40,125 INFO L272 TraceCheckUtils]: 0: Hoare triple {21349#true} call ULTIMATE.init(); {21349#true} is VALID [2022-04-28 10:06:40,126 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:06:40,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [899170841] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:06:40,126 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:06:40,126 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 40 [2022-04-28 10:06:40,126 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:06:40,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [442314846] [2022-04-28 10:06:40,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [442314846] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:06:40,126 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:06:40,126 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-28 10:06:40,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368162924] [2022-04-28 10:06:40,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:06:40,126 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 20 states have internal predecessors, (26), 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 30 [2022-04-28 10:06:40,127 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:06:40,127 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 20 states have internal predecessors, (26), 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-28 10:06:40,143 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:06:40,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-28 10:06:40,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:06:40,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-28 10:06:40,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=368, Invalid=1192, Unknown=0, NotChecked=0, Total=1560 [2022-04-28 10:06:40,144 INFO L87 Difference]: Start difference. First operand 83 states and 105 transitions. Second operand has 21 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 20 states have internal predecessors, (26), 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-28 10:06:42,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:42,524 INFO L93 Difference]: Finished difference Result 111 states and 153 transitions. [2022-04-28 10:06:42,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-28 10:06:42,525 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 20 states have internal predecessors, (26), 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 30 [2022-04-28 10:06:42,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:06:42,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 20 states have internal predecessors, (26), 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-28 10:06:42,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 121 transitions. [2022-04-28 10:06:42,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 20 states have internal predecessors, (26), 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-28 10:06:42,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 121 transitions. [2022-04-28 10:06:42,526 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 121 transitions. [2022-04-28 10:06:42,615 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 121 edges. 121 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:06:42,616 INFO L225 Difference]: With dead ends: 111 [2022-04-28 10:06:42,616 INFO L226 Difference]: Without dead ends: 105 [2022-04-28 10:06:42,617 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=748, Invalid=2558, Unknown=0, NotChecked=0, Total=3306 [2022-04-28 10:06:42,617 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 100 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 1463 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 1534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 1463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:06:42,617 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 134 Invalid, 1534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 1463 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-28 10:06:42,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-04-28 10:06:42,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 88. [2022-04-28 10:06:42,698 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:06:42,698 INFO L82 GeneralOperation]: Start isEquivalent. First operand 105 states. Second operand has 88 states, 83 states have (on average 1.3012048192771084) internal successors, (108), 83 states have internal predecessors, (108), 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-28 10:06:42,698 INFO L74 IsIncluded]: Start isIncluded. First operand 105 states. Second operand has 88 states, 83 states have (on average 1.3012048192771084) internal successors, (108), 83 states have internal predecessors, (108), 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-28 10:06:42,698 INFO L87 Difference]: Start difference. First operand 105 states. Second operand has 88 states, 83 states have (on average 1.3012048192771084) internal successors, (108), 83 states have internal predecessors, (108), 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-28 10:06:42,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:42,699 INFO L93 Difference]: Finished difference Result 105 states and 129 transitions. [2022-04-28 10:06:42,699 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 129 transitions. [2022-04-28 10:06:42,699 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:06:42,699 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:06:42,699 INFO L74 IsIncluded]: Start isIncluded. First operand has 88 states, 83 states have (on average 1.3012048192771084) internal successors, (108), 83 states have internal predecessors, (108), 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 105 states. [2022-04-28 10:06:42,700 INFO L87 Difference]: Start difference. First operand has 88 states, 83 states have (on average 1.3012048192771084) internal successors, (108), 83 states have internal predecessors, (108), 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 105 states. [2022-04-28 10:06:42,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:42,700 INFO L93 Difference]: Finished difference Result 105 states and 129 transitions. [2022-04-28 10:06:42,700 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 129 transitions. [2022-04-28 10:06:42,701 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:06:42,701 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:06:42,701 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:06:42,701 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:06:42,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 83 states have (on average 1.3012048192771084) internal successors, (108), 83 states have internal predecessors, (108), 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-28 10:06:42,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 112 transitions. [2022-04-28 10:06:42,702 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 112 transitions. Word has length 30 [2022-04-28 10:06:42,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:06:42,702 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 112 transitions. [2022-04-28 10:06:42,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 20 states have internal predecessors, (26), 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-28 10:06:42,702 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 88 states and 112 transitions. [2022-04-28 10:06:46,923 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 110 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-28 10:06:46,923 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 112 transitions. [2022-04-28 10:06:46,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-28 10:06:46,923 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:06:46,923 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:06:46,939 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Forceful destruction successful, exit code 0 [2022-04-28 10:06:47,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-04-28 10:06:47,124 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:06:47,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:06:47,124 INFO L85 PathProgramCache]: Analyzing trace with hash -2100427281, now seen corresponding path program 45 times [2022-04-28 10:06:47,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:06:47,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1821528560] [2022-04-28 10:06:47,126 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:06:47,126 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:06:47,126 INFO L85 PathProgramCache]: Analyzing trace with hash -2100427281, now seen corresponding path program 46 times [2022-04-28 10:06:47,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:06:47,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612695699] [2022-04-28 10:06:47,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:06:47,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:06:47,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:47,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:06:47,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:47,314 INFO L290 TraceCheckUtils]: 0: Hoare triple {22233#(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(10, 2);call #Ultimate.allocInit(12, 3); {22215#true} is VALID [2022-04-28 10:06:47,314 INFO L290 TraceCheckUtils]: 1: Hoare triple {22215#true} assume true; {22215#true} is VALID [2022-04-28 10:06:47,314 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22215#true} {22215#true} #61#return; {22215#true} is VALID [2022-04-28 10:06:47,314 INFO L272 TraceCheckUtils]: 0: Hoare triple {22215#true} call ULTIMATE.init(); {22233#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:06:47,314 INFO L290 TraceCheckUtils]: 1: Hoare triple {22233#(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(10, 2);call #Ultimate.allocInit(12, 3); {22215#true} is VALID [2022-04-28 10:06:47,315 INFO L290 TraceCheckUtils]: 2: Hoare triple {22215#true} assume true; {22215#true} is VALID [2022-04-28 10:06:47,315 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22215#true} {22215#true} #61#return; {22215#true} is VALID [2022-04-28 10:06:47,315 INFO L272 TraceCheckUtils]: 4: Hoare triple {22215#true} call #t~ret11 := main(); {22215#true} is VALID [2022-04-28 10:06:47,315 INFO L290 TraceCheckUtils]: 5: Hoare triple {22215#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {22220#(= main_~y~0 0)} is VALID [2022-04-28 10:06:47,315 INFO L290 TraceCheckUtils]: 6: Hoare triple {22220#(= 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; {22221#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:06:47,316 INFO L290 TraceCheckUtils]: 7: Hoare triple {22221#(and (<= 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; {22222#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:06:47,316 INFO L290 TraceCheckUtils]: 8: Hoare triple {22222#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {22223#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:06:47,317 INFO L290 TraceCheckUtils]: 9: Hoare triple {22223#(and (<= main_~y~0 3) (<= 3 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; {22224#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:06:47,317 INFO L290 TraceCheckUtils]: 10: Hoare triple {22224#(and (<= main_~y~0 4) (<= 4 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; {22225#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:06:47,318 INFO L290 TraceCheckUtils]: 11: Hoare triple {22225#(and (<= 5 main_~y~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; {22226#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:06:47,318 INFO L290 TraceCheckUtils]: 12: Hoare triple {22226#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {22226#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:06:47,318 INFO L290 TraceCheckUtils]: 13: Hoare triple {22226#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {22227#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:06:47,319 INFO L290 TraceCheckUtils]: 14: Hoare triple {22227#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {22228#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:06:47,319 INFO L290 TraceCheckUtils]: 15: Hoare triple {22228#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {22229#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:06:47,320 INFO L290 TraceCheckUtils]: 16: Hoare triple {22229#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {22230#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:06:47,320 INFO L290 TraceCheckUtils]: 17: Hoare triple {22230#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {22231#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-28 10:06:47,321 INFO L290 TraceCheckUtils]: 18: Hoare triple {22231#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {22232#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-28 10:06:47,321 INFO L290 TraceCheckUtils]: 19: Hoare triple {22232#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {22216#false} is VALID [2022-04-28 10:06:47,321 INFO L290 TraceCheckUtils]: 20: Hoare triple {22216#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {22216#false} is VALID [2022-04-28 10:06:47,321 INFO L290 TraceCheckUtils]: 21: Hoare triple {22216#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {22216#false} is VALID [2022-04-28 10:06:47,322 INFO L290 TraceCheckUtils]: 22: Hoare triple {22216#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {22216#false} is VALID [2022-04-28 10:06:47,322 INFO L290 TraceCheckUtils]: 23: Hoare triple {22216#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {22216#false} is VALID [2022-04-28 10:06:47,322 INFO L290 TraceCheckUtils]: 24: Hoare triple {22216#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {22216#false} is VALID [2022-04-28 10:06:47,322 INFO L290 TraceCheckUtils]: 25: Hoare triple {22216#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {22216#false} is VALID [2022-04-28 10:06:47,322 INFO L290 TraceCheckUtils]: 26: Hoare triple {22216#false} assume !(~y~0 % 4294967296 > 0); {22216#false} is VALID [2022-04-28 10:06:47,322 INFO L272 TraceCheckUtils]: 27: Hoare triple {22216#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {22216#false} is VALID [2022-04-28 10:06:47,322 INFO L290 TraceCheckUtils]: 28: Hoare triple {22216#false} ~cond := #in~cond; {22216#false} is VALID [2022-04-28 10:06:47,322 INFO L290 TraceCheckUtils]: 29: Hoare triple {22216#false} assume 0 == ~cond; {22216#false} is VALID [2022-04-28 10:06:47,322 INFO L290 TraceCheckUtils]: 30: Hoare triple {22216#false} assume !false; {22216#false} is VALID [2022-04-28 10:06:47,322 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-28 10:06:47,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:06:47,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612695699] [2022-04-28 10:06:47,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612695699] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:06:47,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1265072397] [2022-04-28 10:06:47,322 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:06:47,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:06:47,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:06:47,323 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:06:47,324 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2022-04-28 10:06:47,358 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:06:47,359 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:06:47,359 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 38 conjunts are in the unsatisfiable core [2022-04-28 10:06:47,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:47,369 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:06:47,595 INFO L272 TraceCheckUtils]: 0: Hoare triple {22215#true} call ULTIMATE.init(); {22215#true} is VALID [2022-04-28 10:06:47,595 INFO L290 TraceCheckUtils]: 1: Hoare triple {22215#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(10, 2);call #Ultimate.allocInit(12, 3); {22215#true} is VALID [2022-04-28 10:06:47,595 INFO L290 TraceCheckUtils]: 2: Hoare triple {22215#true} assume true; {22215#true} is VALID [2022-04-28 10:06:47,595 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22215#true} {22215#true} #61#return; {22215#true} is VALID [2022-04-28 10:06:47,595 INFO L272 TraceCheckUtils]: 4: Hoare triple {22215#true} call #t~ret11 := main(); {22215#true} is VALID [2022-04-28 10:06:47,604 INFO L290 TraceCheckUtils]: 5: Hoare triple {22215#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {22220#(= main_~y~0 0)} is VALID [2022-04-28 10:06:47,604 INFO L290 TraceCheckUtils]: 6: Hoare triple {22220#(= 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; {22221#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:06:47,604 INFO L290 TraceCheckUtils]: 7: Hoare triple {22221#(and (<= 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; {22222#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:06:47,605 INFO L290 TraceCheckUtils]: 8: Hoare triple {22222#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {22223#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:06:47,605 INFO L290 TraceCheckUtils]: 9: Hoare triple {22223#(and (<= main_~y~0 3) (<= 3 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; {22224#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:06:47,606 INFO L290 TraceCheckUtils]: 10: Hoare triple {22224#(and (<= main_~y~0 4) (<= 4 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; {22225#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:06:47,606 INFO L290 TraceCheckUtils]: 11: Hoare triple {22225#(and (<= 5 main_~y~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; {22226#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:06:47,607 INFO L290 TraceCheckUtils]: 12: Hoare triple {22226#(and (<= main_~y~0 6) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {22226#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:06:47,607 INFO L290 TraceCheckUtils]: 13: Hoare triple {22226#(and (<= main_~y~0 6) (<= 6 main_~y~0))} ~z~0 := ~y~0; {22276#(and (<= main_~y~0 6) (= main_~z~0 main_~y~0) (<= 6 main_~y~0))} is VALID [2022-04-28 10:06:47,607 INFO L290 TraceCheckUtils]: 14: Hoare triple {22276#(and (<= main_~y~0 6) (= main_~z~0 main_~y~0) (<= 6 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {22280#(and (<= main_~y~0 6) (<= 6 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-28 10:06:47,608 INFO L290 TraceCheckUtils]: 15: Hoare triple {22280#(and (<= main_~y~0 6) (<= 6 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {22284#(and (<= main_~y~0 6) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)) (<= 6 main_~y~0))} is VALID [2022-04-28 10:06:47,609 INFO L290 TraceCheckUtils]: 16: Hoare triple {22284#(and (<= main_~y~0 6) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)) (<= 6 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {22288#(and (<= main_~y~0 6) (= (+ main_~z~0 2) (+ (- 1) main_~y~0)) (<= 6 main_~y~0))} is VALID [2022-04-28 10:06:47,609 INFO L290 TraceCheckUtils]: 17: Hoare triple {22288#(and (<= main_~y~0 6) (= (+ main_~z~0 2) (+ (- 1) main_~y~0)) (<= 6 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {22292#(and (<= main_~y~0 6) (= (+ main_~y~0 (- 3)) (+ main_~z~0 1)) (<= 6 main_~y~0))} is VALID [2022-04-28 10:06:47,610 INFO L290 TraceCheckUtils]: 18: Hoare triple {22292#(and (<= main_~y~0 6) (= (+ main_~y~0 (- 3)) (+ main_~z~0 1)) (<= 6 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {22296#(and (<= main_~y~0 6) (= (+ main_~y~0 (- 4)) (+ main_~z~0 1)) (<= 6 main_~y~0))} is VALID [2022-04-28 10:06:47,610 INFO L290 TraceCheckUtils]: 19: Hoare triple {22296#(and (<= main_~y~0 6) (= (+ main_~y~0 (- 4)) (+ main_~z~0 1)) (<= 6 main_~y~0))} assume !(~z~0 % 4294967296 > 0); {22216#false} is VALID [2022-04-28 10:06:47,610 INFO L290 TraceCheckUtils]: 20: Hoare triple {22216#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {22216#false} is VALID [2022-04-28 10:06:47,610 INFO L290 TraceCheckUtils]: 21: Hoare triple {22216#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {22216#false} is VALID [2022-04-28 10:06:47,610 INFO L290 TraceCheckUtils]: 22: Hoare triple {22216#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {22216#false} is VALID [2022-04-28 10:06:47,610 INFO L290 TraceCheckUtils]: 23: Hoare triple {22216#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {22216#false} is VALID [2022-04-28 10:06:47,610 INFO L290 TraceCheckUtils]: 24: Hoare triple {22216#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {22216#false} is VALID [2022-04-28 10:06:47,611 INFO L290 TraceCheckUtils]: 25: Hoare triple {22216#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {22216#false} is VALID [2022-04-28 10:06:47,611 INFO L290 TraceCheckUtils]: 26: Hoare triple {22216#false} assume !(~y~0 % 4294967296 > 0); {22216#false} is VALID [2022-04-28 10:06:47,611 INFO L272 TraceCheckUtils]: 27: Hoare triple {22216#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {22216#false} is VALID [2022-04-28 10:06:47,611 INFO L290 TraceCheckUtils]: 28: Hoare triple {22216#false} ~cond := #in~cond; {22216#false} is VALID [2022-04-28 10:06:47,611 INFO L290 TraceCheckUtils]: 29: Hoare triple {22216#false} assume 0 == ~cond; {22216#false} is VALID [2022-04-28 10:06:47,611 INFO L290 TraceCheckUtils]: 30: Hoare triple {22216#false} assume !false; {22216#false} is VALID [2022-04-28 10:06:47,611 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-28 10:06:47,611 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:06:47,977 INFO L290 TraceCheckUtils]: 30: Hoare triple {22216#false} assume !false; {22216#false} is VALID [2022-04-28 10:06:47,978 INFO L290 TraceCheckUtils]: 29: Hoare triple {22216#false} assume 0 == ~cond; {22216#false} is VALID [2022-04-28 10:06:47,978 INFO L290 TraceCheckUtils]: 28: Hoare triple {22216#false} ~cond := #in~cond; {22216#false} is VALID [2022-04-28 10:06:47,978 INFO L272 TraceCheckUtils]: 27: Hoare triple {22216#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {22216#false} is VALID [2022-04-28 10:06:47,978 INFO L290 TraceCheckUtils]: 26: Hoare triple {22216#false} assume !(~y~0 % 4294967296 > 0); {22216#false} is VALID [2022-04-28 10:06:47,978 INFO L290 TraceCheckUtils]: 25: Hoare triple {22348#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {22216#false} is VALID [2022-04-28 10:06:47,979 INFO L290 TraceCheckUtils]: 24: Hoare triple {22352#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {22348#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:06:47,980 INFO L290 TraceCheckUtils]: 23: Hoare triple {22356#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {22352#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:06:47,980 INFO L290 TraceCheckUtils]: 22: Hoare triple {22360#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {22356#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-28 10:06:47,981 INFO L290 TraceCheckUtils]: 21: Hoare triple {22364#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {22360#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-28 10:06:47,982 INFO L290 TraceCheckUtils]: 20: Hoare triple {22368#(not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {22364#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:06:47,982 INFO L290 TraceCheckUtils]: 19: Hoare triple {22372#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296))) (< 0 (mod main_~z~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {22368#(not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:06:47,983 INFO L290 TraceCheckUtils]: 18: Hoare triple {22376#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {22372#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-28 10:06:47,984 INFO L290 TraceCheckUtils]: 17: Hoare triple {22380#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296))) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {22376#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:06:47,985 INFO L290 TraceCheckUtils]: 16: Hoare triple {22384#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {22380#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296))) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)))} is VALID [2022-04-28 10:06:47,986 INFO L290 TraceCheckUtils]: 15: Hoare triple {22388#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296))) (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {22384#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} is VALID [2022-04-28 10:06:47,986 INFO L290 TraceCheckUtils]: 14: Hoare triple {22392#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296))) (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {22388#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296))) (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)))} is VALID [2022-04-28 10:06:47,987 INFO L290 TraceCheckUtils]: 13: Hoare triple {22215#true} ~z~0 := ~y~0; {22392#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296))) (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)))} is VALID [2022-04-28 10:06:47,987 INFO L290 TraceCheckUtils]: 12: Hoare triple {22215#true} assume !(~x~0 % 4294967296 > 0); {22215#true} is VALID [2022-04-28 10:06:47,987 INFO L290 TraceCheckUtils]: 11: Hoare triple {22215#true} 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; {22215#true} is VALID [2022-04-28 10:06:47,987 INFO L290 TraceCheckUtils]: 10: Hoare triple {22215#true} 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; {22215#true} is VALID [2022-04-28 10:06:47,987 INFO L290 TraceCheckUtils]: 9: Hoare triple {22215#true} 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; {22215#true} is VALID [2022-04-28 10:06:47,987 INFO L290 TraceCheckUtils]: 8: Hoare triple {22215#true} 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; {22215#true} is VALID [2022-04-28 10:06:47,987 INFO L290 TraceCheckUtils]: 7: Hoare triple {22215#true} 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; {22215#true} is VALID [2022-04-28 10:06:47,987 INFO L290 TraceCheckUtils]: 6: Hoare triple {22215#true} 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; {22215#true} is VALID [2022-04-28 10:06:47,987 INFO L290 TraceCheckUtils]: 5: Hoare triple {22215#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {22215#true} is VALID [2022-04-28 10:06:47,987 INFO L272 TraceCheckUtils]: 4: Hoare triple {22215#true} call #t~ret11 := main(); {22215#true} is VALID [2022-04-28 10:06:47,987 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22215#true} {22215#true} #61#return; {22215#true} is VALID [2022-04-28 10:06:47,987 INFO L290 TraceCheckUtils]: 2: Hoare triple {22215#true} assume true; {22215#true} is VALID [2022-04-28 10:06:47,987 INFO L290 TraceCheckUtils]: 1: Hoare triple {22215#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(10, 2);call #Ultimate.allocInit(12, 3); {22215#true} is VALID [2022-04-28 10:06:47,987 INFO L272 TraceCheckUtils]: 0: Hoare triple {22215#true} call ULTIMATE.init(); {22215#true} is VALID [2022-04-28 10:06:47,987 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-28 10:06:47,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1265072397] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:06:47,988 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:06:47,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 14] total 34 [2022-04-28 10:06:47,988 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:06:47,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1821528560] [2022-04-28 10:06:47,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1821528560] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:06:47,988 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:06:47,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-28 10:06:47,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111490139] [2022-04-28 10:06:47,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:06:47,988 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 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 31 [2022-04-28 10:06:47,988 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:06:47,989 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 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-28 10:06:48,005 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:06:48,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-28 10:06:48,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:06:48,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-28 10:06:48,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=959, Unknown=0, NotChecked=0, Total=1122 [2022-04-28 10:06:48,005 INFO L87 Difference]: Start difference. First operand 88 states and 112 transitions. Second operand has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 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-28 10:06:48,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:48,790 INFO L93 Difference]: Finished difference Result 109 states and 133 transitions. [2022-04-28 10:06:48,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-28 10:06:48,790 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 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 31 [2022-04-28 10:06:48,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:06:48,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 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-28 10:06:48,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 49 transitions. [2022-04-28 10:06:48,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 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-28 10:06:48,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 49 transitions. [2022-04-28 10:06:48,791 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 49 transitions. [2022-04-28 10:06:48,826 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:06:48,827 INFO L225 Difference]: With dead ends: 109 [2022-04-28 10:06:48,827 INFO L226 Difference]: Without dead ends: 97 [2022-04-28 10:06:48,827 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 335 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=281, Invalid=1881, Unknown=0, NotChecked=0, Total=2162 [2022-04-28 10:06:48,827 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 17 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 10:06:48,827 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 68 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 10:06:48,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-04-28 10:06:48,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 89. [2022-04-28 10:06:48,910 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:06:48,910 INFO L82 GeneralOperation]: Start isEquivalent. First operand 97 states. Second operand has 89 states, 84 states have (on average 1.2976190476190477) internal successors, (109), 84 states have internal predecessors, (109), 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-28 10:06:48,910 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states. Second operand has 89 states, 84 states have (on average 1.2976190476190477) internal successors, (109), 84 states have internal predecessors, (109), 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-28 10:06:48,910 INFO L87 Difference]: Start difference. First operand 97 states. Second operand has 89 states, 84 states have (on average 1.2976190476190477) internal successors, (109), 84 states have internal predecessors, (109), 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-28 10:06:48,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:48,911 INFO L93 Difference]: Finished difference Result 97 states and 121 transitions. [2022-04-28 10:06:48,911 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 121 transitions. [2022-04-28 10:06:48,911 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:06:48,911 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:06:48,911 INFO L74 IsIncluded]: Start isIncluded. First operand has 89 states, 84 states have (on average 1.2976190476190477) internal successors, (109), 84 states have internal predecessors, (109), 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 97 states. [2022-04-28 10:06:48,911 INFO L87 Difference]: Start difference. First operand has 89 states, 84 states have (on average 1.2976190476190477) internal successors, (109), 84 states have internal predecessors, (109), 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 97 states. [2022-04-28 10:06:48,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:48,912 INFO L93 Difference]: Finished difference Result 97 states and 121 transitions. [2022-04-28 10:06:48,912 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 121 transitions. [2022-04-28 10:06:48,912 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:06:48,912 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:06:48,912 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:06:48,912 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:06:48,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 84 states have (on average 1.2976190476190477) internal successors, (109), 84 states have internal predecessors, (109), 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-28 10:06:48,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 113 transitions. [2022-04-28 10:06:48,913 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 113 transitions. Word has length 31 [2022-04-28 10:06:48,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:06:48,913 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 113 transitions. [2022-04-28 10:06:48,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 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-28 10:06:48,913 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 89 states and 113 transitions. [2022-04-28 10:06:49,318 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:06:49,318 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 113 transitions. [2022-04-28 10:06:49,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-28 10:06:49,318 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:06:49,318 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:06:49,334 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Forceful destruction successful, exit code 0 [2022-04-28 10:06:49,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-04-28 10:06:49,519 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:06:49,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:06:49,519 INFO L85 PathProgramCache]: Analyzing trace with hash 868091775, now seen corresponding path program 47 times [2022-04-28 10:06:49,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:06:49,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1746456095] [2022-04-28 10:06:49,528 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:06:49,528 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:06:49,528 INFO L85 PathProgramCache]: Analyzing trace with hash 868091775, now seen corresponding path program 48 times [2022-04-28 10:06:49,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:06:49,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980725057] [2022-04-28 10:06:49,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:06:49,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:06:49,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:49,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:06:49,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:49,700 INFO L290 TraceCheckUtils]: 0: Hoare triple {23070#(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(10, 2);call #Ultimate.allocInit(12, 3); {23053#true} is VALID [2022-04-28 10:06:49,700 INFO L290 TraceCheckUtils]: 1: Hoare triple {23053#true} assume true; {23053#true} is VALID [2022-04-28 10:06:49,700 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23053#true} {23053#true} #61#return; {23053#true} is VALID [2022-04-28 10:06:49,703 INFO L272 TraceCheckUtils]: 0: Hoare triple {23053#true} call ULTIMATE.init(); {23070#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:06:49,703 INFO L290 TraceCheckUtils]: 1: Hoare triple {23070#(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(10, 2);call #Ultimate.allocInit(12, 3); {23053#true} is VALID [2022-04-28 10:06:49,703 INFO L290 TraceCheckUtils]: 2: Hoare triple {23053#true} assume true; {23053#true} is VALID [2022-04-28 10:06:49,703 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23053#true} {23053#true} #61#return; {23053#true} is VALID [2022-04-28 10:06:49,703 INFO L272 TraceCheckUtils]: 4: Hoare triple {23053#true} call #t~ret11 := main(); {23053#true} is VALID [2022-04-28 10:06:49,703 INFO L290 TraceCheckUtils]: 5: Hoare triple {23053#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {23058#(= main_~y~0 0)} is VALID [2022-04-28 10:06:49,704 INFO L290 TraceCheckUtils]: 6: Hoare triple {23058#(= 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; {23059#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:06:49,704 INFO L290 TraceCheckUtils]: 7: Hoare triple {23059#(and (<= 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; {23060#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:06:49,705 INFO L290 TraceCheckUtils]: 8: Hoare triple {23060#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {23061#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:06:49,705 INFO L290 TraceCheckUtils]: 9: Hoare triple {23061#(and (<= main_~y~0 3) (<= 3 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; {23062#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:06:49,706 INFO L290 TraceCheckUtils]: 10: Hoare triple {23062#(and (<= main_~y~0 4) (<= 4 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; {23063#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:06:49,706 INFO L290 TraceCheckUtils]: 11: Hoare triple {23063#(and (<= 5 main_~y~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; {23064#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:06:49,707 INFO L290 TraceCheckUtils]: 12: Hoare triple {23064#(and (<= main_~y~0 6) (<= 6 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; {23065#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:06:49,707 INFO L290 TraceCheckUtils]: 13: Hoare triple {23065#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {23065#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:06:49,707 INFO L290 TraceCheckUtils]: 14: Hoare triple {23065#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {23066#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:06:49,708 INFO L290 TraceCheckUtils]: 15: Hoare triple {23066#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {23067#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:06:49,708 INFO L290 TraceCheckUtils]: 16: Hoare triple {23067#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {23068#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:06:49,709 INFO L290 TraceCheckUtils]: 17: Hoare triple {23068#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {23069#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:06:49,709 INFO L290 TraceCheckUtils]: 18: Hoare triple {23069#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {23054#false} is VALID [2022-04-28 10:06:49,709 INFO L290 TraceCheckUtils]: 19: Hoare triple {23054#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23054#false} is VALID [2022-04-28 10:06:49,710 INFO L290 TraceCheckUtils]: 20: Hoare triple {23054#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23054#false} is VALID [2022-04-28 10:06:49,710 INFO L290 TraceCheckUtils]: 21: Hoare triple {23054#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23054#false} is VALID [2022-04-28 10:06:49,710 INFO L290 TraceCheckUtils]: 22: Hoare triple {23054#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23054#false} is VALID [2022-04-28 10:06:49,710 INFO L290 TraceCheckUtils]: 23: Hoare triple {23054#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23054#false} is VALID [2022-04-28 10:06:49,710 INFO L290 TraceCheckUtils]: 24: Hoare triple {23054#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23054#false} is VALID [2022-04-28 10:06:49,710 INFO L290 TraceCheckUtils]: 25: Hoare triple {23054#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23054#false} is VALID [2022-04-28 10:06:49,710 INFO L290 TraceCheckUtils]: 26: Hoare triple {23054#false} assume !(~y~0 % 4294967296 > 0); {23054#false} is VALID [2022-04-28 10:06:49,710 INFO L272 TraceCheckUtils]: 27: Hoare triple {23054#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {23054#false} is VALID [2022-04-28 10:06:49,710 INFO L290 TraceCheckUtils]: 28: Hoare triple {23054#false} ~cond := #in~cond; {23054#false} is VALID [2022-04-28 10:06:49,710 INFO L290 TraceCheckUtils]: 29: Hoare triple {23054#false} assume 0 == ~cond; {23054#false} is VALID [2022-04-28 10:06:49,710 INFO L290 TraceCheckUtils]: 30: Hoare triple {23054#false} assume !false; {23054#false} is VALID [2022-04-28 10:06:49,710 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-28 10:06:49,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:06:49,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980725057] [2022-04-28 10:06:49,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980725057] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:06:49,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [360294067] [2022-04-28 10:06:49,710 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:06:49,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:06:49,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:06:49,711 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:06:49,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2022-04-28 10:06:49,770 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-28 10:06:49,770 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:06:49,771 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-28 10:06:49,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:49,778 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:06:49,994 INFO L272 TraceCheckUtils]: 0: Hoare triple {23053#true} call ULTIMATE.init(); {23053#true} is VALID [2022-04-28 10:06:49,994 INFO L290 TraceCheckUtils]: 1: Hoare triple {23053#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(10, 2);call #Ultimate.allocInit(12, 3); {23053#true} is VALID [2022-04-28 10:06:49,994 INFO L290 TraceCheckUtils]: 2: Hoare triple {23053#true} assume true; {23053#true} is VALID [2022-04-28 10:06:49,994 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23053#true} {23053#true} #61#return; {23053#true} is VALID [2022-04-28 10:06:49,994 INFO L272 TraceCheckUtils]: 4: Hoare triple {23053#true} call #t~ret11 := main(); {23053#true} is VALID [2022-04-28 10:06:49,995 INFO L290 TraceCheckUtils]: 5: Hoare triple {23053#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {23058#(= main_~y~0 0)} is VALID [2022-04-28 10:06:49,996 INFO L290 TraceCheckUtils]: 6: Hoare triple {23058#(= 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; {23059#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:06:49,996 INFO L290 TraceCheckUtils]: 7: Hoare triple {23059#(and (<= 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; {23060#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:06:49,997 INFO L290 TraceCheckUtils]: 8: Hoare triple {23060#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {23061#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:06:49,997 INFO L290 TraceCheckUtils]: 9: Hoare triple {23061#(and (<= main_~y~0 3) (<= 3 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; {23062#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:06:49,998 INFO L290 TraceCheckUtils]: 10: Hoare triple {23062#(and (<= main_~y~0 4) (<= 4 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; {23063#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:06:49,998 INFO L290 TraceCheckUtils]: 11: Hoare triple {23063#(and (<= 5 main_~y~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; {23064#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:06:49,999 INFO L290 TraceCheckUtils]: 12: Hoare triple {23064#(and (<= main_~y~0 6) (<= 6 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; {23065#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:06:49,999 INFO L290 TraceCheckUtils]: 13: Hoare triple {23065#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {23065#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:06:49,999 INFO L290 TraceCheckUtils]: 14: Hoare triple {23065#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {23066#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:06:50,000 INFO L290 TraceCheckUtils]: 15: Hoare triple {23066#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {23067#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:06:50,000 INFO L290 TraceCheckUtils]: 16: Hoare triple {23067#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {23068#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:06:50,001 INFO L290 TraceCheckUtils]: 17: Hoare triple {23068#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {23125#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:06:50,001 INFO L290 TraceCheckUtils]: 18: Hoare triple {23125#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !(~z~0 % 4294967296 > 0); {23054#false} is VALID [2022-04-28 10:06:50,001 INFO L290 TraceCheckUtils]: 19: Hoare triple {23054#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23054#false} is VALID [2022-04-28 10:06:50,001 INFO L290 TraceCheckUtils]: 20: Hoare triple {23054#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23054#false} is VALID [2022-04-28 10:06:50,002 INFO L290 TraceCheckUtils]: 21: Hoare triple {23054#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23054#false} is VALID [2022-04-28 10:06:50,002 INFO L290 TraceCheckUtils]: 22: Hoare triple {23054#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23054#false} is VALID [2022-04-28 10:06:50,002 INFO L290 TraceCheckUtils]: 23: Hoare triple {23054#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23054#false} is VALID [2022-04-28 10:06:50,002 INFO L290 TraceCheckUtils]: 24: Hoare triple {23054#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23054#false} is VALID [2022-04-28 10:06:50,002 INFO L290 TraceCheckUtils]: 25: Hoare triple {23054#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23054#false} is VALID [2022-04-28 10:06:50,002 INFO L290 TraceCheckUtils]: 26: Hoare triple {23054#false} assume !(~y~0 % 4294967296 > 0); {23054#false} is VALID [2022-04-28 10:06:50,002 INFO L272 TraceCheckUtils]: 27: Hoare triple {23054#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {23054#false} is VALID [2022-04-28 10:06:50,002 INFO L290 TraceCheckUtils]: 28: Hoare triple {23054#false} ~cond := #in~cond; {23054#false} is VALID [2022-04-28 10:06:50,002 INFO L290 TraceCheckUtils]: 29: Hoare triple {23054#false} assume 0 == ~cond; {23054#false} is VALID [2022-04-28 10:06:50,002 INFO L290 TraceCheckUtils]: 30: Hoare triple {23054#false} assume !false; {23054#false} is VALID [2022-04-28 10:06:50,002 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-28 10:06:50,002 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:06:50,278 INFO L290 TraceCheckUtils]: 30: Hoare triple {23054#false} assume !false; {23054#false} is VALID [2022-04-28 10:06:50,278 INFO L290 TraceCheckUtils]: 29: Hoare triple {23054#false} assume 0 == ~cond; {23054#false} is VALID [2022-04-28 10:06:50,278 INFO L290 TraceCheckUtils]: 28: Hoare triple {23054#false} ~cond := #in~cond; {23054#false} is VALID [2022-04-28 10:06:50,278 INFO L272 TraceCheckUtils]: 27: Hoare triple {23054#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {23054#false} is VALID [2022-04-28 10:06:50,278 INFO L290 TraceCheckUtils]: 26: Hoare triple {23054#false} assume !(~y~0 % 4294967296 > 0); {23054#false} is VALID [2022-04-28 10:06:50,278 INFO L290 TraceCheckUtils]: 25: Hoare triple {23054#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23054#false} is VALID [2022-04-28 10:06:50,278 INFO L290 TraceCheckUtils]: 24: Hoare triple {23054#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23054#false} is VALID [2022-04-28 10:06:50,278 INFO L290 TraceCheckUtils]: 23: Hoare triple {23054#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23054#false} is VALID [2022-04-28 10:06:50,278 INFO L290 TraceCheckUtils]: 22: Hoare triple {23054#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23054#false} is VALID [2022-04-28 10:06:50,278 INFO L290 TraceCheckUtils]: 21: Hoare triple {23054#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23054#false} is VALID [2022-04-28 10:06:50,278 INFO L290 TraceCheckUtils]: 20: Hoare triple {23054#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23054#false} is VALID [2022-04-28 10:06:50,278 INFO L290 TraceCheckUtils]: 19: Hoare triple {23054#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23054#false} is VALID [2022-04-28 10:06:50,278 INFO L290 TraceCheckUtils]: 18: Hoare triple {23201#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {23054#false} is VALID [2022-04-28 10:06:50,279 INFO L290 TraceCheckUtils]: 17: Hoare triple {23205#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {23201#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:06:50,280 INFO L290 TraceCheckUtils]: 16: Hoare triple {23209#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {23205#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:06:50,281 INFO L290 TraceCheckUtils]: 15: Hoare triple {23213#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {23209#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-28 10:06:50,281 INFO L290 TraceCheckUtils]: 14: Hoare triple {23217#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} ~z~0 := ~y~0; {23213#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-28 10:06:50,281 INFO L290 TraceCheckUtils]: 13: Hoare triple {23217#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !(~x~0 % 4294967296 > 0); {23217#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 10:06:50,282 INFO L290 TraceCheckUtils]: 12: Hoare triple {23224#(< 0 (mod (+ main_~y~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; {23217#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 10:06:50,282 INFO L290 TraceCheckUtils]: 11: Hoare triple {23228#(< 0 (mod (+ main_~y~0 4294967295) 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; {23224#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:06:50,283 INFO L290 TraceCheckUtils]: 10: Hoare triple {23232#(< 0 (mod main_~y~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; {23228#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:06:50,284 INFO L290 TraceCheckUtils]: 9: Hoare triple {23236#(< 0 (mod (+ main_~y~0 1) 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; {23232#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:06:50,284 INFO L290 TraceCheckUtils]: 8: Hoare triple {23240#(< 0 (mod (+ main_~y~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; {23236#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:06:50,285 INFO L290 TraceCheckUtils]: 7: Hoare triple {23244#(< 0 (mod (+ main_~y~0 3) 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; {23240#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:06:50,286 INFO L290 TraceCheckUtils]: 6: Hoare triple {23248#(< 0 (mod (+ main_~y~0 4) 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; {23244#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:06:50,286 INFO L290 TraceCheckUtils]: 5: Hoare triple {23053#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {23248#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:06:50,286 INFO L272 TraceCheckUtils]: 4: Hoare triple {23053#true} call #t~ret11 := main(); {23053#true} is VALID [2022-04-28 10:06:50,286 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23053#true} {23053#true} #61#return; {23053#true} is VALID [2022-04-28 10:06:50,286 INFO L290 TraceCheckUtils]: 2: Hoare triple {23053#true} assume true; {23053#true} is VALID [2022-04-28 10:06:50,286 INFO L290 TraceCheckUtils]: 1: Hoare triple {23053#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(10, 2);call #Ultimate.allocInit(12, 3); {23053#true} is VALID [2022-04-28 10:06:50,286 INFO L272 TraceCheckUtils]: 0: Hoare triple {23053#true} call ULTIMATE.init(); {23053#true} is VALID [2022-04-28 10:06:50,286 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-28 10:06:50,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [360294067] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:06:50,287 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:06:50,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 28 [2022-04-28 10:06:50,287 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:06:50,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1746456095] [2022-04-28 10:06:50,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1746456095] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:06:50,287 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:06:50,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-28 10:06:50,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794954746] [2022-04-28 10:06:50,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:06:50,287 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 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 31 [2022-04-28 10:06:50,287 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:06:50,287 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 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-28 10:06:50,308 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:06:50,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-28 10:06:50,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:06:50,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-28 10:06:50,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=619, Unknown=0, NotChecked=0, Total=756 [2022-04-28 10:06:50,308 INFO L87 Difference]: Start difference. First operand 89 states and 113 transitions. Second operand has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 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-28 10:06:51,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:51,224 INFO L93 Difference]: Finished difference Result 112 states and 136 transitions. [2022-04-28 10:06:51,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-28 10:06:51,224 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 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 31 [2022-04-28 10:06:51,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:06:51,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 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-28 10:06:51,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 56 transitions. [2022-04-28 10:06:51,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 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-28 10:06:51,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 56 transitions. [2022-04-28 10:06:51,225 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 56 transitions. [2022-04-28 10:06:51,272 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:06:51,273 INFO L225 Difference]: With dead ends: 112 [2022-04-28 10:06:51,273 INFO L226 Difference]: Without dead ends: 99 [2022-04-28 10:06:51,274 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=365, Invalid=1441, Unknown=0, NotChecked=0, Total=1806 [2022-04-28 10:06:51,274 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 23 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 10:06:51,274 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 80 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 10:06:51,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-04-28 10:06:51,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 90. [2022-04-28 10:06:51,370 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:06:51,370 INFO L82 GeneralOperation]: Start isEquivalent. First operand 99 states. Second operand has 90 states, 85 states have (on average 1.2941176470588236) internal successors, (110), 85 states have internal predecessors, (110), 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-28 10:06:51,370 INFO L74 IsIncluded]: Start isIncluded. First operand 99 states. Second operand has 90 states, 85 states have (on average 1.2941176470588236) internal successors, (110), 85 states have internal predecessors, (110), 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-28 10:06:51,370 INFO L87 Difference]: Start difference. First operand 99 states. Second operand has 90 states, 85 states have (on average 1.2941176470588236) internal successors, (110), 85 states have internal predecessors, (110), 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-28 10:06:51,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:51,371 INFO L93 Difference]: Finished difference Result 99 states and 123 transitions. [2022-04-28 10:06:51,371 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 123 transitions. [2022-04-28 10:06:51,371 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:06:51,371 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:06:51,372 INFO L74 IsIncluded]: Start isIncluded. First operand has 90 states, 85 states have (on average 1.2941176470588236) internal successors, (110), 85 states have internal predecessors, (110), 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 99 states. [2022-04-28 10:06:51,372 INFO L87 Difference]: Start difference. First operand has 90 states, 85 states have (on average 1.2941176470588236) internal successors, (110), 85 states have internal predecessors, (110), 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 99 states. [2022-04-28 10:06:51,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:51,372 INFO L93 Difference]: Finished difference Result 99 states and 123 transitions. [2022-04-28 10:06:51,372 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 123 transitions. [2022-04-28 10:06:51,373 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:06:51,373 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:06:51,373 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:06:51,373 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:06:51,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 85 states have (on average 1.2941176470588236) internal successors, (110), 85 states have internal predecessors, (110), 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-28 10:06:51,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 114 transitions. [2022-04-28 10:06:51,374 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 114 transitions. Word has length 31 [2022-04-28 10:06:51,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:06:51,374 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 114 transitions. [2022-04-28 10:06:51,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 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-28 10:06:51,374 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 90 states and 114 transitions. [2022-04-28 10:06:53,586 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:06:53,586 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 114 transitions. [2022-04-28 10:06:53,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-28 10:06:53,586 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:06:53,586 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:06:53,602 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Forceful destruction successful, exit code 0 [2022-04-28 10:06:53,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable40 [2022-04-28 10:06:53,799 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:06:53,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:06:53,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1135709231, now seen corresponding path program 49 times [2022-04-28 10:06:53,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:06:53,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [176430000] [2022-04-28 10:06:53,802 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:06:53,802 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:06:53,802 INFO L85 PathProgramCache]: Analyzing trace with hash 1135709231, now seen corresponding path program 50 times [2022-04-28 10:06:53,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:06:53,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082419019] [2022-04-28 10:06:53,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:06:53,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:06:53,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:53,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:06:53,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:53,959 INFO L290 TraceCheckUtils]: 0: Hoare triple {23917#(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(10, 2);call #Ultimate.allocInit(12, 3); {23901#true} is VALID [2022-04-28 10:06:53,960 INFO L290 TraceCheckUtils]: 1: Hoare triple {23901#true} assume true; {23901#true} is VALID [2022-04-28 10:06:53,960 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23901#true} {23901#true} #61#return; {23901#true} is VALID [2022-04-28 10:06:53,960 INFO L272 TraceCheckUtils]: 0: Hoare triple {23901#true} call ULTIMATE.init(); {23917#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:06:53,960 INFO L290 TraceCheckUtils]: 1: Hoare triple {23917#(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(10, 2);call #Ultimate.allocInit(12, 3); {23901#true} is VALID [2022-04-28 10:06:53,960 INFO L290 TraceCheckUtils]: 2: Hoare triple {23901#true} assume true; {23901#true} is VALID [2022-04-28 10:06:53,960 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23901#true} {23901#true} #61#return; {23901#true} is VALID [2022-04-28 10:06:53,960 INFO L272 TraceCheckUtils]: 4: Hoare triple {23901#true} call #t~ret11 := main(); {23901#true} is VALID [2022-04-28 10:06:53,960 INFO L290 TraceCheckUtils]: 5: Hoare triple {23901#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {23906#(= main_~y~0 0)} is VALID [2022-04-28 10:06:53,961 INFO L290 TraceCheckUtils]: 6: Hoare triple {23906#(= 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; {23907#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:06:53,961 INFO L290 TraceCheckUtils]: 7: Hoare triple {23907#(and (<= 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; {23908#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:06:53,962 INFO L290 TraceCheckUtils]: 8: Hoare triple {23908#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {23909#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:06:53,962 INFO L290 TraceCheckUtils]: 9: Hoare triple {23909#(and (<= main_~y~0 3) (<= 3 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; {23910#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:06:53,963 INFO L290 TraceCheckUtils]: 10: Hoare triple {23910#(and (<= main_~y~0 4) (<= 4 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; {23911#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:06:53,963 INFO L290 TraceCheckUtils]: 11: Hoare triple {23911#(and (<= 5 main_~y~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; {23912#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:06:53,964 INFO L290 TraceCheckUtils]: 12: Hoare triple {23912#(and (<= main_~y~0 6) (<= 6 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; {23913#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:06:53,964 INFO L290 TraceCheckUtils]: 13: Hoare triple {23913#(and (<= 7 main_~y~0) (<= main_~y~0 7))} 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; {23914#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:06:53,965 INFO L290 TraceCheckUtils]: 14: Hoare triple {23914#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {23914#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:06:53,965 INFO L290 TraceCheckUtils]: 15: Hoare triple {23914#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {23915#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:06:53,966 INFO L290 TraceCheckUtils]: 16: Hoare triple {23915#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {23916#(and (<= 7 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:06:53,966 INFO L290 TraceCheckUtils]: 17: Hoare triple {23916#(and (<= 7 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {23902#false} is VALID [2022-04-28 10:06:53,966 INFO L290 TraceCheckUtils]: 18: Hoare triple {23902#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23902#false} is VALID [2022-04-28 10:06:53,966 INFO L290 TraceCheckUtils]: 19: Hoare triple {23902#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23902#false} is VALID [2022-04-28 10:06:53,966 INFO L290 TraceCheckUtils]: 20: Hoare triple {23902#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23902#false} is VALID [2022-04-28 10:06:53,966 INFO L290 TraceCheckUtils]: 21: Hoare triple {23902#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23902#false} is VALID [2022-04-28 10:06:53,966 INFO L290 TraceCheckUtils]: 22: Hoare triple {23902#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23902#false} is VALID [2022-04-28 10:06:53,966 INFO L290 TraceCheckUtils]: 23: Hoare triple {23902#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23902#false} is VALID [2022-04-28 10:06:53,966 INFO L290 TraceCheckUtils]: 24: Hoare triple {23902#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23902#false} is VALID [2022-04-28 10:06:53,966 INFO L290 TraceCheckUtils]: 25: Hoare triple {23902#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23902#false} is VALID [2022-04-28 10:06:53,966 INFO L290 TraceCheckUtils]: 26: Hoare triple {23902#false} assume !(~y~0 % 4294967296 > 0); {23902#false} is VALID [2022-04-28 10:06:53,966 INFO L272 TraceCheckUtils]: 27: Hoare triple {23902#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {23902#false} is VALID [2022-04-28 10:06:53,967 INFO L290 TraceCheckUtils]: 28: Hoare triple {23902#false} ~cond := #in~cond; {23902#false} is VALID [2022-04-28 10:06:53,967 INFO L290 TraceCheckUtils]: 29: Hoare triple {23902#false} assume 0 == ~cond; {23902#false} is VALID [2022-04-28 10:06:53,967 INFO L290 TraceCheckUtils]: 30: Hoare triple {23902#false} assume !false; {23902#false} is VALID [2022-04-28 10:06:53,967 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-28 10:06:53,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:06:53,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082419019] [2022-04-28 10:06:53,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082419019] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:06:53,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1186786617] [2022-04-28 10:06:53,967 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:06:53,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:06:53,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:06:53,968 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:06:53,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2022-04-28 10:06:54,004 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:06:54,004 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:06:54,004 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-28 10:06:54,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:54,013 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:06:54,216 INFO L272 TraceCheckUtils]: 0: Hoare triple {23901#true} call ULTIMATE.init(); {23901#true} is VALID [2022-04-28 10:06:54,216 INFO L290 TraceCheckUtils]: 1: Hoare triple {23901#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(10, 2);call #Ultimate.allocInit(12, 3); {23901#true} is VALID [2022-04-28 10:06:54,216 INFO L290 TraceCheckUtils]: 2: Hoare triple {23901#true} assume true; {23901#true} is VALID [2022-04-28 10:06:54,216 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23901#true} {23901#true} #61#return; {23901#true} is VALID [2022-04-28 10:06:54,216 INFO L272 TraceCheckUtils]: 4: Hoare triple {23901#true} call #t~ret11 := main(); {23901#true} is VALID [2022-04-28 10:06:54,216 INFO L290 TraceCheckUtils]: 5: Hoare triple {23901#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {23906#(= main_~y~0 0)} is VALID [2022-04-28 10:06:54,217 INFO L290 TraceCheckUtils]: 6: Hoare triple {23906#(= 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; {23907#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:06:54,217 INFO L290 TraceCheckUtils]: 7: Hoare triple {23907#(and (<= 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; {23908#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:06:54,218 INFO L290 TraceCheckUtils]: 8: Hoare triple {23908#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {23909#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:06:54,218 INFO L290 TraceCheckUtils]: 9: Hoare triple {23909#(and (<= main_~y~0 3) (<= 3 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; {23910#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:06:54,219 INFO L290 TraceCheckUtils]: 10: Hoare triple {23910#(and (<= main_~y~0 4) (<= 4 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; {23911#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:06:54,219 INFO L290 TraceCheckUtils]: 11: Hoare triple {23911#(and (<= 5 main_~y~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; {23912#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:06:54,220 INFO L290 TraceCheckUtils]: 12: Hoare triple {23912#(and (<= main_~y~0 6) (<= 6 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; {23913#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:06:54,220 INFO L290 TraceCheckUtils]: 13: Hoare triple {23913#(and (<= 7 main_~y~0) (<= main_~y~0 7))} 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; {23914#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:06:54,221 INFO L290 TraceCheckUtils]: 14: Hoare triple {23914#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {23914#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:06:54,221 INFO L290 TraceCheckUtils]: 15: Hoare triple {23914#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {23915#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:06:54,222 INFO L290 TraceCheckUtils]: 16: Hoare triple {23915#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {23969#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:06:54,222 INFO L290 TraceCheckUtils]: 17: Hoare triple {23969#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {23902#false} is VALID [2022-04-28 10:06:54,222 INFO L290 TraceCheckUtils]: 18: Hoare triple {23902#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23902#false} is VALID [2022-04-28 10:06:54,222 INFO L290 TraceCheckUtils]: 19: Hoare triple {23902#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23902#false} is VALID [2022-04-28 10:06:54,222 INFO L290 TraceCheckUtils]: 20: Hoare triple {23902#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23902#false} is VALID [2022-04-28 10:06:54,222 INFO L290 TraceCheckUtils]: 21: Hoare triple {23902#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23902#false} is VALID [2022-04-28 10:06:54,222 INFO L290 TraceCheckUtils]: 22: Hoare triple {23902#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23902#false} is VALID [2022-04-28 10:06:54,222 INFO L290 TraceCheckUtils]: 23: Hoare triple {23902#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23902#false} is VALID [2022-04-28 10:06:54,222 INFO L290 TraceCheckUtils]: 24: Hoare triple {23902#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23902#false} is VALID [2022-04-28 10:06:54,222 INFO L290 TraceCheckUtils]: 25: Hoare triple {23902#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23902#false} is VALID [2022-04-28 10:06:54,222 INFO L290 TraceCheckUtils]: 26: Hoare triple {23902#false} assume !(~y~0 % 4294967296 > 0); {23902#false} is VALID [2022-04-28 10:06:54,222 INFO L272 TraceCheckUtils]: 27: Hoare triple {23902#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {23902#false} is VALID [2022-04-28 10:06:54,223 INFO L290 TraceCheckUtils]: 28: Hoare triple {23902#false} ~cond := #in~cond; {23902#false} is VALID [2022-04-28 10:06:54,223 INFO L290 TraceCheckUtils]: 29: Hoare triple {23902#false} assume 0 == ~cond; {23902#false} is VALID [2022-04-28 10:06:54,223 INFO L290 TraceCheckUtils]: 30: Hoare triple {23902#false} assume !false; {23902#false} is VALID [2022-04-28 10:06:54,223 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-28 10:06:54,223 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:06:54,480 INFO L290 TraceCheckUtils]: 30: Hoare triple {23902#false} assume !false; {23902#false} is VALID [2022-04-28 10:06:54,480 INFO L290 TraceCheckUtils]: 29: Hoare triple {23902#false} assume 0 == ~cond; {23902#false} is VALID [2022-04-28 10:06:54,480 INFO L290 TraceCheckUtils]: 28: Hoare triple {23902#false} ~cond := #in~cond; {23902#false} is VALID [2022-04-28 10:06:54,480 INFO L272 TraceCheckUtils]: 27: Hoare triple {23902#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {23902#false} is VALID [2022-04-28 10:06:54,480 INFO L290 TraceCheckUtils]: 26: Hoare triple {23902#false} assume !(~y~0 % 4294967296 > 0); {23902#false} is VALID [2022-04-28 10:06:54,480 INFO L290 TraceCheckUtils]: 25: Hoare triple {23902#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23902#false} is VALID [2022-04-28 10:06:54,481 INFO L290 TraceCheckUtils]: 24: Hoare triple {23902#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23902#false} is VALID [2022-04-28 10:06:54,481 INFO L290 TraceCheckUtils]: 23: Hoare triple {23902#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23902#false} is VALID [2022-04-28 10:06:54,481 INFO L290 TraceCheckUtils]: 22: Hoare triple {23902#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23902#false} is VALID [2022-04-28 10:06:54,481 INFO L290 TraceCheckUtils]: 21: Hoare triple {23902#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23902#false} is VALID [2022-04-28 10:06:54,481 INFO L290 TraceCheckUtils]: 20: Hoare triple {23902#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23902#false} is VALID [2022-04-28 10:06:54,481 INFO L290 TraceCheckUtils]: 19: Hoare triple {23902#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23902#false} is VALID [2022-04-28 10:06:54,481 INFO L290 TraceCheckUtils]: 18: Hoare triple {23902#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {23902#false} is VALID [2022-04-28 10:06:54,481 INFO L290 TraceCheckUtils]: 17: Hoare triple {24051#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {23902#false} is VALID [2022-04-28 10:06:54,482 INFO L290 TraceCheckUtils]: 16: Hoare triple {24055#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {24051#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:06:54,482 INFO L290 TraceCheckUtils]: 15: Hoare triple {24059#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} ~z~0 := ~y~0; {24055#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:06:54,482 INFO L290 TraceCheckUtils]: 14: Hoare triple {24059#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {24059#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:06:54,483 INFO L290 TraceCheckUtils]: 13: Hoare triple {24066#(< 0 (mod main_~y~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; {24059#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:06:54,484 INFO L290 TraceCheckUtils]: 12: Hoare triple {24070#(< 0 (mod (+ main_~y~0 1) 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; {24066#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:06:54,484 INFO L290 TraceCheckUtils]: 11: Hoare triple {24074#(< 0 (mod (+ main_~y~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; {24070#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:06:54,485 INFO L290 TraceCheckUtils]: 10: Hoare triple {24078#(< 0 (mod (+ main_~y~0 3) 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; {24074#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:06:54,486 INFO L290 TraceCheckUtils]: 9: Hoare triple {24082#(< 0 (mod (+ main_~y~0 4) 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; {24078#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:06:54,486 INFO L290 TraceCheckUtils]: 8: Hoare triple {24086#(< 0 (mod (+ 5 main_~y~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; {24082#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:06:54,487 INFO L290 TraceCheckUtils]: 7: Hoare triple {24090#(< 0 (mod (+ main_~y~0 6) 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; {24086#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:06:54,488 INFO L290 TraceCheckUtils]: 6: Hoare triple {24094#(< 0 (mod (+ 7 main_~y~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; {24090#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:06:54,488 INFO L290 TraceCheckUtils]: 5: Hoare triple {23901#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {24094#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:06:54,488 INFO L272 TraceCheckUtils]: 4: Hoare triple {23901#true} call #t~ret11 := main(); {23901#true} is VALID [2022-04-28 10:06:54,488 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23901#true} {23901#true} #61#return; {23901#true} is VALID [2022-04-28 10:06:54,488 INFO L290 TraceCheckUtils]: 2: Hoare triple {23901#true} assume true; {23901#true} is VALID [2022-04-28 10:06:54,488 INFO L290 TraceCheckUtils]: 1: Hoare triple {23901#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(10, 2);call #Ultimate.allocInit(12, 3); {23901#true} is VALID [2022-04-28 10:06:54,488 INFO L272 TraceCheckUtils]: 0: Hoare triple {23901#true} call ULTIMATE.init(); {23901#true} is VALID [2022-04-28 10:06:54,488 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-28 10:06:54,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1186786617] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:06:54,488 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:06:54,488 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 26 [2022-04-28 10:06:54,489 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:06:54,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [176430000] [2022-04-28 10:06:54,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [176430000] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:06:54,489 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:06:54,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 10:06:54,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415338702] [2022-04-28 10:06:54,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:06:54,489 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 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 31 [2022-04-28 10:06:54,489 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:06:54,489 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 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-28 10:06:54,504 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-28 10:06:54,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 10:06:54,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:06:54,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 10:06:54,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=514, Unknown=0, NotChecked=0, Total=650 [2022-04-28 10:06:54,504 INFO L87 Difference]: Start difference. First operand 90 states and 114 transitions. Second operand has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 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-28 10:06:55,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:55,269 INFO L93 Difference]: Finished difference Result 115 states and 139 transitions. [2022-04-28 10:06:55,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-28 10:06:55,269 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 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 31 [2022-04-28 10:06:55,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:06:55,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 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-28 10:06:55,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 58 transitions. [2022-04-28 10:06:55,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 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-28 10:06:55,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 58 transitions. [2022-04-28 10:06:55,270 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 58 transitions. [2022-04-28 10:06:55,312 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:06:55,313 INFO L225 Difference]: With dead ends: 115 [2022-04-28 10:06:55,313 INFO L226 Difference]: Without dead ends: 101 [2022-04-28 10:06:55,313 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=304, Invalid=1102, Unknown=0, NotChecked=0, Total=1406 [2022-04-28 10:06:55,313 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 32 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 10:06:55,313 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 71 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 10:06:55,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-04-28 10:06:55,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 91. [2022-04-28 10:06:55,412 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:06:55,412 INFO L82 GeneralOperation]: Start isEquivalent. First operand 101 states. Second operand has 91 states, 86 states have (on average 1.2906976744186047) internal successors, (111), 86 states have internal predecessors, (111), 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-28 10:06:55,412 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand has 91 states, 86 states have (on average 1.2906976744186047) internal successors, (111), 86 states have internal predecessors, (111), 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-28 10:06:55,412 INFO L87 Difference]: Start difference. First operand 101 states. Second operand has 91 states, 86 states have (on average 1.2906976744186047) internal successors, (111), 86 states have internal predecessors, (111), 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-28 10:06:55,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:55,413 INFO L93 Difference]: Finished difference Result 101 states and 125 transitions. [2022-04-28 10:06:55,413 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 125 transitions. [2022-04-28 10:06:55,413 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:06:55,413 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:06:55,413 INFO L74 IsIncluded]: Start isIncluded. First operand has 91 states, 86 states have (on average 1.2906976744186047) internal successors, (111), 86 states have internal predecessors, (111), 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 101 states. [2022-04-28 10:06:55,413 INFO L87 Difference]: Start difference. First operand has 91 states, 86 states have (on average 1.2906976744186047) internal successors, (111), 86 states have internal predecessors, (111), 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 101 states. [2022-04-28 10:06:55,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:06:55,414 INFO L93 Difference]: Finished difference Result 101 states and 125 transitions. [2022-04-28 10:06:55,414 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 125 transitions. [2022-04-28 10:06:55,414 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:06:55,414 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:06:55,414 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:06:55,414 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:06:55,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 86 states have (on average 1.2906976744186047) internal successors, (111), 86 states have internal predecessors, (111), 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-28 10:06:55,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 115 transitions. [2022-04-28 10:06:55,415 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 115 transitions. Word has length 31 [2022-04-28 10:06:55,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:06:55,415 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 115 transitions. [2022-04-28 10:06:55,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 13 states have internal predecessors, (20), 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-28 10:06:55,415 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 91 states and 115 transitions. [2022-04-28 10:06:56,811 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:06:56,811 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 115 transitions. [2022-04-28 10:06:56,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-28 10:06:56,811 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:06:56,811 INFO L195 NwaCegarLoop]: trace histogram [17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:06:56,828 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Ended with exit code 0 [2022-04-28 10:06:57,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:06:57,012 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:06:57,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:06:57,012 INFO L85 PathProgramCache]: Analyzing trace with hash 2103029678, now seen corresponding path program 33 times [2022-04-28 10:06:57,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:06:57,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [996874060] [2022-04-28 10:06:57,014 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:06:57,014 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:06:57,014 INFO L85 PathProgramCache]: Analyzing trace with hash 2103029678, now seen corresponding path program 34 times [2022-04-28 10:06:57,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:06:57,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534962604] [2022-04-28 10:06:57,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:06:57,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:06:57,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:57,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:06:57,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:57,328 INFO L290 TraceCheckUtils]: 0: Hoare triple {24777#(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(10, 2);call #Ultimate.allocInit(12, 3); {24753#true} is VALID [2022-04-28 10:06:57,328 INFO L290 TraceCheckUtils]: 1: Hoare triple {24753#true} assume true; {24753#true} is VALID [2022-04-28 10:06:57,328 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24753#true} {24753#true} #61#return; {24753#true} is VALID [2022-04-28 10:06:57,328 INFO L272 TraceCheckUtils]: 0: Hoare triple {24753#true} call ULTIMATE.init(); {24777#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:06:57,329 INFO L290 TraceCheckUtils]: 1: Hoare triple {24777#(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(10, 2);call #Ultimate.allocInit(12, 3); {24753#true} is VALID [2022-04-28 10:06:57,329 INFO L290 TraceCheckUtils]: 2: Hoare triple {24753#true} assume true; {24753#true} is VALID [2022-04-28 10:06:57,329 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24753#true} {24753#true} #61#return; {24753#true} is VALID [2022-04-28 10:06:57,329 INFO L272 TraceCheckUtils]: 4: Hoare triple {24753#true} call #t~ret11 := main(); {24753#true} is VALID [2022-04-28 10:06:57,329 INFO L290 TraceCheckUtils]: 5: Hoare triple {24753#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {24758#(= main_~y~0 0)} is VALID [2022-04-28 10:06:57,329 INFO L290 TraceCheckUtils]: 6: Hoare triple {24758#(= 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; {24759#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:06:57,330 INFO L290 TraceCheckUtils]: 7: Hoare triple {24759#(and (<= 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; {24760#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:06:57,330 INFO L290 TraceCheckUtils]: 8: Hoare triple {24760#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {24761#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:06:57,331 INFO L290 TraceCheckUtils]: 9: Hoare triple {24761#(and (<= main_~y~0 3) (<= 3 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; {24762#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:06:57,331 INFO L290 TraceCheckUtils]: 10: Hoare triple {24762#(and (<= main_~y~0 4) (<= 4 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; {24763#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:06:57,332 INFO L290 TraceCheckUtils]: 11: Hoare triple {24763#(and (<= 5 main_~y~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; {24764#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:06:57,332 INFO L290 TraceCheckUtils]: 12: Hoare triple {24764#(and (<= main_~y~0 6) (<= 6 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; {24765#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:06:57,333 INFO L290 TraceCheckUtils]: 13: Hoare triple {24765#(and (<= 7 main_~y~0) (<= main_~y~0 7))} 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; {24766#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:06:57,333 INFO L290 TraceCheckUtils]: 14: Hoare triple {24766#(and (<= main_~y~0 8) (<= 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; {24767#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:06:57,334 INFO L290 TraceCheckUtils]: 15: Hoare triple {24767#(and (<= 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; {24768#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:06:57,335 INFO L290 TraceCheckUtils]: 16: Hoare triple {24768#(and (<= main_~y~0 10) (<= 10 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; {24769#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:06:57,335 INFO L290 TraceCheckUtils]: 17: Hoare triple {24769#(and (<= main_~y~0 11) (<= 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; {24770#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:06:57,336 INFO L290 TraceCheckUtils]: 18: Hoare triple {24770#(and (<= 12 main_~y~0) (<= main_~y~0 12))} 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; {24771#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:06:57,336 INFO L290 TraceCheckUtils]: 19: Hoare triple {24771#(and (<= main_~y~0 13) (<= 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; {24772#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:06:57,337 INFO L290 TraceCheckUtils]: 20: Hoare triple {24772#(and (<= 14 main_~y~0) (<= main_~y~0 14))} 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; {24773#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:06:57,337 INFO L290 TraceCheckUtils]: 21: Hoare triple {24773#(and (<= main_~y~0 15) (<= 15 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; {24774#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:06:57,338 INFO L290 TraceCheckUtils]: 22: Hoare triple {24774#(and (<= 16 main_~y~0) (<= main_~y~0 16))} 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; {24775#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:06:57,338 INFO L290 TraceCheckUtils]: 23: Hoare triple {24775#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {24775#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:06:57,338 INFO L290 TraceCheckUtils]: 24: Hoare triple {24775#(and (<= main_~y~0 17) (<= 17 main_~y~0))} ~z~0 := ~y~0; {24776#(and (<= (div main_~z~0 4294967296) 0) (<= 17 main_~z~0))} is VALID [2022-04-28 10:06:57,339 INFO L290 TraceCheckUtils]: 25: Hoare triple {24776#(and (<= (div main_~z~0 4294967296) 0) (<= 17 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {24754#false} is VALID [2022-04-28 10:06:57,339 INFO L290 TraceCheckUtils]: 26: Hoare triple {24754#false} assume !(~y~0 % 4294967296 > 0); {24754#false} is VALID [2022-04-28 10:06:57,339 INFO L272 TraceCheckUtils]: 27: Hoare triple {24754#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {24754#false} is VALID [2022-04-28 10:06:57,339 INFO L290 TraceCheckUtils]: 28: Hoare triple {24754#false} ~cond := #in~cond; {24754#false} is VALID [2022-04-28 10:06:57,339 INFO L290 TraceCheckUtils]: 29: Hoare triple {24754#false} assume 0 == ~cond; {24754#false} is VALID [2022-04-28 10:06:57,339 INFO L290 TraceCheckUtils]: 30: Hoare triple {24754#false} assume !false; {24754#false} is VALID [2022-04-28 10:06:57,339 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:06:57,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:06:57,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534962604] [2022-04-28 10:06:57,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534962604] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:06:57,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [674784597] [2022-04-28 10:06:57,340 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:06:57,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:06:57,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:06:57,340 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:06:57,350 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2022-04-28 10:06:57,384 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:06:57,385 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:06:57,385 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 39 conjunts are in the unsatisfiable core [2022-04-28 10:06:57,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:06:57,392 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:06:57,646 INFO L272 TraceCheckUtils]: 0: Hoare triple {24753#true} call ULTIMATE.init(); {24753#true} is VALID [2022-04-28 10:06:57,646 INFO L290 TraceCheckUtils]: 1: Hoare triple {24753#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(10, 2);call #Ultimate.allocInit(12, 3); {24753#true} is VALID [2022-04-28 10:06:57,646 INFO L290 TraceCheckUtils]: 2: Hoare triple {24753#true} assume true; {24753#true} is VALID [2022-04-28 10:06:57,647 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24753#true} {24753#true} #61#return; {24753#true} is VALID [2022-04-28 10:06:57,647 INFO L272 TraceCheckUtils]: 4: Hoare triple {24753#true} call #t~ret11 := main(); {24753#true} is VALID [2022-04-28 10:06:57,647 INFO L290 TraceCheckUtils]: 5: Hoare triple {24753#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {24758#(= main_~y~0 0)} is VALID [2022-04-28 10:06:57,647 INFO L290 TraceCheckUtils]: 6: Hoare triple {24758#(= 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; {24759#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:06:57,648 INFO L290 TraceCheckUtils]: 7: Hoare triple {24759#(and (<= 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; {24760#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:06:57,648 INFO L290 TraceCheckUtils]: 8: Hoare triple {24760#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {24761#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:06:57,649 INFO L290 TraceCheckUtils]: 9: Hoare triple {24761#(and (<= main_~y~0 3) (<= 3 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; {24762#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:06:57,649 INFO L290 TraceCheckUtils]: 10: Hoare triple {24762#(and (<= main_~y~0 4) (<= 4 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; {24763#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:06:57,650 INFO L290 TraceCheckUtils]: 11: Hoare triple {24763#(and (<= 5 main_~y~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; {24764#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:06:57,650 INFO L290 TraceCheckUtils]: 12: Hoare triple {24764#(and (<= main_~y~0 6) (<= 6 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; {24765#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:06:57,651 INFO L290 TraceCheckUtils]: 13: Hoare triple {24765#(and (<= 7 main_~y~0) (<= main_~y~0 7))} 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; {24766#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:06:57,651 INFO L290 TraceCheckUtils]: 14: Hoare triple {24766#(and (<= main_~y~0 8) (<= 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; {24767#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:06:57,652 INFO L290 TraceCheckUtils]: 15: Hoare triple {24767#(and (<= 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; {24768#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:06:57,652 INFO L290 TraceCheckUtils]: 16: Hoare triple {24768#(and (<= main_~y~0 10) (<= 10 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; {24769#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:06:57,653 INFO L290 TraceCheckUtils]: 17: Hoare triple {24769#(and (<= main_~y~0 11) (<= 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; {24770#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:06:57,653 INFO L290 TraceCheckUtils]: 18: Hoare triple {24770#(and (<= 12 main_~y~0) (<= main_~y~0 12))} 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; {24771#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:06:57,654 INFO L290 TraceCheckUtils]: 19: Hoare triple {24771#(and (<= main_~y~0 13) (<= 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; {24772#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:06:57,654 INFO L290 TraceCheckUtils]: 20: Hoare triple {24772#(and (<= 14 main_~y~0) (<= main_~y~0 14))} 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; {24773#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:06:57,655 INFO L290 TraceCheckUtils]: 21: Hoare triple {24773#(and (<= main_~y~0 15) (<= 15 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; {24774#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:06:57,655 INFO L290 TraceCheckUtils]: 22: Hoare triple {24774#(and (<= 16 main_~y~0) (<= main_~y~0 16))} 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; {24775#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:06:57,655 INFO L290 TraceCheckUtils]: 23: Hoare triple {24775#(and (<= main_~y~0 17) (<= 17 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {24775#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:06:57,656 INFO L290 TraceCheckUtils]: 24: Hoare triple {24775#(and (<= main_~y~0 17) (<= 17 main_~y~0))} ~z~0 := ~y~0; {24853#(and (<= 17 main_~z~0) (<= main_~z~0 17))} is VALID [2022-04-28 10:06:57,656 INFO L290 TraceCheckUtils]: 25: Hoare triple {24853#(and (<= 17 main_~z~0) (<= main_~z~0 17))} assume !(~z~0 % 4294967296 > 0); {24754#false} is VALID [2022-04-28 10:06:57,656 INFO L290 TraceCheckUtils]: 26: Hoare triple {24754#false} assume !(~y~0 % 4294967296 > 0); {24754#false} is VALID [2022-04-28 10:06:57,656 INFO L272 TraceCheckUtils]: 27: Hoare triple {24754#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {24754#false} is VALID [2022-04-28 10:06:57,656 INFO L290 TraceCheckUtils]: 28: Hoare triple {24754#false} ~cond := #in~cond; {24754#false} is VALID [2022-04-28 10:06:57,656 INFO L290 TraceCheckUtils]: 29: Hoare triple {24754#false} assume 0 == ~cond; {24754#false} is VALID [2022-04-28 10:06:57,656 INFO L290 TraceCheckUtils]: 30: Hoare triple {24754#false} assume !false; {24754#false} is VALID [2022-04-28 10:06:57,656 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:06:57,657 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:06:58,244 INFO L290 TraceCheckUtils]: 30: Hoare triple {24754#false} assume !false; {24754#false} is VALID [2022-04-28 10:06:58,245 INFO L290 TraceCheckUtils]: 29: Hoare triple {24754#false} assume 0 == ~cond; {24754#false} is VALID [2022-04-28 10:06:58,245 INFO L290 TraceCheckUtils]: 28: Hoare triple {24754#false} ~cond := #in~cond; {24754#false} is VALID [2022-04-28 10:06:58,245 INFO L272 TraceCheckUtils]: 27: Hoare triple {24754#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {24754#false} is VALID [2022-04-28 10:06:58,245 INFO L290 TraceCheckUtils]: 26: Hoare triple {24754#false} assume !(~y~0 % 4294967296 > 0); {24754#false} is VALID [2022-04-28 10:06:58,245 INFO L290 TraceCheckUtils]: 25: Hoare triple {24887#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {24754#false} is VALID [2022-04-28 10:06:58,245 INFO L290 TraceCheckUtils]: 24: Hoare triple {24891#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {24887#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:06:58,245 INFO L290 TraceCheckUtils]: 23: Hoare triple {24891#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {24891#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:06:58,246 INFO L290 TraceCheckUtils]: 22: Hoare triple {24898#(< 0 (mod (+ main_~y~0 1) 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; {24891#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:06:58,247 INFO L290 TraceCheckUtils]: 21: Hoare triple {24902#(< 0 (mod (+ main_~y~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; {24898#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:06:58,247 INFO L290 TraceCheckUtils]: 20: Hoare triple {24906#(< 0 (mod (+ main_~y~0 3) 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; {24902#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:06:58,248 INFO L290 TraceCheckUtils]: 19: Hoare triple {24910#(< 0 (mod (+ main_~y~0 4) 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; {24906#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:06:58,249 INFO L290 TraceCheckUtils]: 18: Hoare triple {24914#(< 0 (mod (+ 5 main_~y~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; {24910#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:06:58,249 INFO L290 TraceCheckUtils]: 17: Hoare triple {24918#(< 0 (mod (+ main_~y~0 6) 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; {24914#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:06:58,250 INFO L290 TraceCheckUtils]: 16: Hoare triple {24922#(< 0 (mod (+ 7 main_~y~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; {24918#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:06:58,250 INFO L290 TraceCheckUtils]: 15: Hoare triple {24926#(< 0 (mod (+ main_~y~0 8) 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; {24922#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:06:58,251 INFO L290 TraceCheckUtils]: 14: Hoare triple {24930#(< 0 (mod (+ main_~y~0 9) 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; {24926#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:06:58,252 INFO L290 TraceCheckUtils]: 13: Hoare triple {24934#(< 0 (mod (+ main_~y~0 10) 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; {24930#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:06:58,252 INFO L290 TraceCheckUtils]: 12: Hoare triple {24938#(< 0 (mod (+ main_~y~0 11) 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; {24934#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-28 10:06:58,253 INFO L290 TraceCheckUtils]: 11: Hoare triple {24942#(< 0 (mod (+ main_~y~0 12) 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; {24938#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-28 10:06:58,254 INFO L290 TraceCheckUtils]: 10: Hoare triple {24946#(< 0 (mod (+ main_~y~0 13) 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; {24942#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-28 10:06:58,254 INFO L290 TraceCheckUtils]: 9: Hoare triple {24950#(< 0 (mod (+ main_~y~0 14) 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; {24946#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-28 10:06:58,255 INFO L290 TraceCheckUtils]: 8: Hoare triple {24954#(< 0 (mod (+ main_~y~0 15) 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; {24950#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-28 10:06:58,256 INFO L290 TraceCheckUtils]: 7: Hoare triple {24958#(< 0 (mod (+ main_~y~0 16) 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; {24954#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID [2022-04-28 10:06:58,256 INFO L290 TraceCheckUtils]: 6: Hoare triple {24962#(< 0 (mod (+ main_~y~0 17) 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; {24958#(< 0 (mod (+ main_~y~0 16) 4294967296))} is VALID [2022-04-28 10:06:58,257 INFO L290 TraceCheckUtils]: 5: Hoare triple {24753#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {24962#(< 0 (mod (+ main_~y~0 17) 4294967296))} is VALID [2022-04-28 10:06:58,257 INFO L272 TraceCheckUtils]: 4: Hoare triple {24753#true} call #t~ret11 := main(); {24753#true} is VALID [2022-04-28 10:06:58,257 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24753#true} {24753#true} #61#return; {24753#true} is VALID [2022-04-28 10:06:58,257 INFO L290 TraceCheckUtils]: 2: Hoare triple {24753#true} assume true; {24753#true} is VALID [2022-04-28 10:06:58,257 INFO L290 TraceCheckUtils]: 1: Hoare triple {24753#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(10, 2);call #Ultimate.allocInit(12, 3); {24753#true} is VALID [2022-04-28 10:06:58,257 INFO L272 TraceCheckUtils]: 0: Hoare triple {24753#true} call ULTIMATE.init(); {24753#true} is VALID [2022-04-28 10:06:58,257 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:06:58,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [674784597] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:06:58,257 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:06:58,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 21] total 42 [2022-04-28 10:06:58,257 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:06:58,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [996874060] [2022-04-28 10:06:58,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [996874060] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:06:58,258 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:06:58,258 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-28 10:06:58,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811075894] [2022-04-28 10:06:58,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:06:58,258 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 21 states have internal predecessors, (27), 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 31 [2022-04-28 10:06:58,258 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:06:58,258 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 21 states have internal predecessors, (27), 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-28 10:06:58,275 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:06:58,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-28 10:06:58,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:06:58,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-28 10:06:58,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=407, Invalid=1315, Unknown=0, NotChecked=0, Total=1722 [2022-04-28 10:06:58,276 INFO L87 Difference]: Start difference. First operand 91 states and 115 transitions. Second operand has 22 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 21 states have internal predecessors, (27), 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-28 10:07:00,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:07:00,901 INFO L93 Difference]: Finished difference Result 120 states and 165 transitions. [2022-04-28 10:07:00,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-28 10:07:00,901 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 21 states have internal predecessors, (27), 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 31 [2022-04-28 10:07:00,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:07:00,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 21 states have internal predecessors, (27), 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-28 10:07:00,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 128 transitions. [2022-04-28 10:07:00,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 21 states have internal predecessors, (27), 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-28 10:07:00,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 128 transitions. [2022-04-28 10:07:00,903 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 128 transitions. [2022-04-28 10:07:00,997 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 128 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:07:00,998 INFO L225 Difference]: With dead ends: 120 [2022-04-28 10:07:00,998 INFO L226 Difference]: Without dead ends: 114 [2022-04-28 10:07:00,998 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=827, Invalid=2833, Unknown=0, NotChecked=0, Total=3660 [2022-04-28 10:07:00,999 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 108 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 1657 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 1732 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 1657 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-04-28 10:07:00,999 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 142 Invalid, 1732 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 1657 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-04-28 10:07:00,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-04-28 10:07:01,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 96. [2022-04-28 10:07:01,091 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:07:01,091 INFO L82 GeneralOperation]: Start isEquivalent. First operand 114 states. Second operand has 96 states, 91 states have (on average 1.2967032967032968) internal successors, (118), 91 states have internal predecessors, (118), 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-28 10:07:01,091 INFO L74 IsIncluded]: Start isIncluded. First operand 114 states. Second operand has 96 states, 91 states have (on average 1.2967032967032968) internal successors, (118), 91 states have internal predecessors, (118), 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-28 10:07:01,091 INFO L87 Difference]: Start difference. First operand 114 states. Second operand has 96 states, 91 states have (on average 1.2967032967032968) internal successors, (118), 91 states have internal predecessors, (118), 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-28 10:07:01,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:07:01,092 INFO L93 Difference]: Finished difference Result 114 states and 140 transitions. [2022-04-28 10:07:01,092 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 140 transitions. [2022-04-28 10:07:01,092 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:07:01,092 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:07:01,092 INFO L74 IsIncluded]: Start isIncluded. First operand has 96 states, 91 states have (on average 1.2967032967032968) internal successors, (118), 91 states have internal predecessors, (118), 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 114 states. [2022-04-28 10:07:01,093 INFO L87 Difference]: Start difference. First operand has 96 states, 91 states have (on average 1.2967032967032968) internal successors, (118), 91 states have internal predecessors, (118), 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 114 states. [2022-04-28 10:07:01,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:07:01,093 INFO L93 Difference]: Finished difference Result 114 states and 140 transitions. [2022-04-28 10:07:01,093 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 140 transitions. [2022-04-28 10:07:01,094 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:07:01,094 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:07:01,094 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:07:01,094 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:07:01,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 91 states have (on average 1.2967032967032968) internal successors, (118), 91 states have internal predecessors, (118), 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-28 10:07:01,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 122 transitions. [2022-04-28 10:07:01,095 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 122 transitions. Word has length 31 [2022-04-28 10:07:01,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:07:01,095 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 122 transitions. [2022-04-28 10:07:01,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 21 states have internal predecessors, (27), 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-28 10:07:01,095 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 96 states and 122 transitions. [2022-04-28 10:07:05,081 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 121 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 10:07:05,081 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 122 transitions. [2022-04-28 10:07:05,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-28 10:07:05,081 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:07:05,082 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:07:05,099 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Forceful destruction successful, exit code 0 [2022-04-28 10:07:05,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:07:05,291 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:07:05,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:07:05,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1375844749, now seen corresponding path program 51 times [2022-04-28 10:07:05,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:07:05,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1055927011] [2022-04-28 10:07:05,294 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:07:05,294 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:07:05,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1375844749, now seen corresponding path program 52 times [2022-04-28 10:07:05,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:07:05,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414478083] [2022-04-28 10:07:05,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:07:05,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:07:05,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:07:05,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:07:05,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:07:05,922 INFO L290 TraceCheckUtils]: 0: Hoare triple {25704#(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(10, 2);call #Ultimate.allocInit(12, 3); {25681#true} is VALID [2022-04-28 10:07:05,922 INFO L290 TraceCheckUtils]: 1: Hoare triple {25681#true} assume true; {25681#true} is VALID [2022-04-28 10:07:05,922 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25681#true} {25681#true} #61#return; {25681#true} is VALID [2022-04-28 10:07:05,922 INFO L272 TraceCheckUtils]: 0: Hoare triple {25681#true} call ULTIMATE.init(); {25704#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:07:05,922 INFO L290 TraceCheckUtils]: 1: Hoare triple {25704#(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(10, 2);call #Ultimate.allocInit(12, 3); {25681#true} is VALID [2022-04-28 10:07:05,922 INFO L290 TraceCheckUtils]: 2: Hoare triple {25681#true} assume true; {25681#true} is VALID [2022-04-28 10:07:05,922 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25681#true} {25681#true} #61#return; {25681#true} is VALID [2022-04-28 10:07:05,922 INFO L272 TraceCheckUtils]: 4: Hoare triple {25681#true} call #t~ret11 := main(); {25681#true} is VALID [2022-04-28 10:07:05,923 INFO L290 TraceCheckUtils]: 5: Hoare triple {25681#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {25686#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-28 10:07:05,924 INFO L290 TraceCheckUtils]: 6: Hoare triple {25686#(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; {25687#(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-28 10:07:05,927 INFO L290 TraceCheckUtils]: 7: Hoare triple {25687#(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; {25688#(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-28 10:07:05,955 INFO L290 TraceCheckUtils]: 8: Hoare triple {25688#(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; {25689#(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-28 10:07:05,960 INFO L290 TraceCheckUtils]: 9: Hoare triple {25689#(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; {25690#(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-28 10:07:05,994 INFO L290 TraceCheckUtils]: 10: Hoare triple {25690#(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; {25691#(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-28 10:07:05,998 INFO L290 TraceCheckUtils]: 11: Hoare triple {25691#(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; {25692#(and (<= main_~y~0 6) (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~x~0) (* (- 1) main_~y~0) (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296) 6) main_~n~0) (<= main_~n~0 (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) 4294967295)) (<= 6 main_~y~0))} is VALID [2022-04-28 10:07:06,000 INFO L290 TraceCheckUtils]: 12: Hoare triple {25692#(and (<= main_~y~0 6) (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~x~0) (* (- 1) main_~y~0) (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296) 6) main_~n~0) (<= main_~n~0 (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) 4294967295)) (<= 6 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {25693#(and (<= main_~y~0 6) (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) 6) main_~n~0))} is VALID [2022-04-28 10:07:06,000 INFO L290 TraceCheckUtils]: 13: Hoare triple {25693#(and (<= main_~y~0 6) (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) 6) main_~n~0))} ~z~0 := ~y~0; {25694#(and (<= main_~z~0 6) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 6) main_~n~0))} is VALID [2022-04-28 10:07:06,001 INFO L290 TraceCheckUtils]: 14: Hoare triple {25694#(and (<= main_~z~0 6) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 6) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {25695#(and (<= main_~z~0 5) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 6) main_~n~0))} is VALID [2022-04-28 10:07:06,002 INFO L290 TraceCheckUtils]: 15: Hoare triple {25695#(and (<= main_~z~0 5) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 6) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {25696#(and (<= main_~z~0 4) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 6) main_~n~0))} is VALID [2022-04-28 10:07:06,003 INFO L290 TraceCheckUtils]: 16: Hoare triple {25696#(and (<= main_~z~0 4) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 6) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {25697#(and (<= main_~z~0 3) (<= (+ 6 (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} is VALID [2022-04-28 10:07:06,004 INFO L290 TraceCheckUtils]: 17: Hoare triple {25697#(and (<= main_~z~0 3) (<= (+ 6 (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {25698#(and (<= main_~z~0 2) (<= (+ 6 (* (div (+ 4294967291 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} is VALID [2022-04-28 10:07:06,005 INFO L290 TraceCheckUtils]: 18: Hoare triple {25698#(and (<= main_~z~0 2) (<= (+ 6 (* (div (+ 4294967291 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {25699#(and (<= (+ 6 (* (div (+ 4294967290 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0) (<= main_~z~0 1))} is VALID [2022-04-28 10:07:06,006 INFO L290 TraceCheckUtils]: 19: Hoare triple {25699#(and (<= (+ 6 (* (div (+ 4294967290 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0) (<= main_~z~0 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {25700#(and (<= main_~z~0 0) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967289) 4294967296) 4294967296) 6) main_~n~0))} is VALID [2022-04-28 10:07:06,006 INFO L290 TraceCheckUtils]: 20: Hoare triple {25700#(and (<= main_~z~0 0) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967289) 4294967296) 4294967296) 6) main_~n~0))} assume !(~z~0 % 4294967296 > 0); {25700#(and (<= main_~z~0 0) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967289) 4294967296) 4294967296) 6) main_~n~0))} is VALID [2022-04-28 10:07:06,007 INFO L290 TraceCheckUtils]: 21: Hoare triple {25700#(and (<= main_~z~0 0) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967289) 4294967296) 4294967296) 6) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {25699#(and (<= (+ 6 (* (div (+ 4294967290 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0) (<= main_~z~0 1))} is VALID [2022-04-28 10:07:06,008 INFO L290 TraceCheckUtils]: 22: Hoare triple {25699#(and (<= (+ 6 (* (div (+ 4294967290 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0) (<= main_~z~0 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {25698#(and (<= main_~z~0 2) (<= (+ 6 (* (div (+ 4294967291 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} is VALID [2022-04-28 10:07:06,009 INFO L290 TraceCheckUtils]: 23: Hoare triple {25698#(and (<= main_~z~0 2) (<= (+ 6 (* (div (+ 4294967291 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {25697#(and (<= main_~z~0 3) (<= (+ 6 (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} is VALID [2022-04-28 10:07:06,010 INFO L290 TraceCheckUtils]: 24: Hoare triple {25697#(and (<= main_~z~0 3) (<= (+ 6 (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {25696#(and (<= main_~z~0 4) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 6) main_~n~0))} is VALID [2022-04-28 10:07:06,011 INFO L290 TraceCheckUtils]: 25: Hoare triple {25696#(and (<= main_~z~0 4) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 6) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {25695#(and (<= main_~z~0 5) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 6) main_~n~0))} is VALID [2022-04-28 10:07:06,012 INFO L290 TraceCheckUtils]: 26: Hoare triple {25695#(and (<= main_~z~0 5) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 6) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {25701#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-28 10:07:06,013 INFO L290 TraceCheckUtils]: 27: Hoare triple {25701#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {25701#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-28 10:07:06,014 INFO L272 TraceCheckUtils]: 28: Hoare triple {25701#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {25702#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:07:06,014 INFO L290 TraceCheckUtils]: 29: Hoare triple {25702#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {25703#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 10:07:06,014 INFO L290 TraceCheckUtils]: 30: Hoare triple {25703#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {25682#false} is VALID [2022-04-28 10:07:06,014 INFO L290 TraceCheckUtils]: 31: Hoare triple {25682#false} assume !false; {25682#false} is VALID [2022-04-28 10:07:06,014 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:07:06,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:07:06,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414478083] [2022-04-28 10:07:06,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414478083] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:07:06,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [899241312] [2022-04-28 10:07:06,015 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:07:06,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:07:06,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:07:06,016 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:07:06,016 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2022-04-28 10:07:06,220 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:07:06,220 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:07:06,222 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 61 conjunts are in the unsatisfiable core [2022-04-28 10:07:06,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:07:06,234 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:07:31,536 INFO L272 TraceCheckUtils]: 0: Hoare triple {25681#true} call ULTIMATE.init(); {25681#true} is VALID [2022-04-28 10:07:31,537 INFO L290 TraceCheckUtils]: 1: Hoare triple {25681#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(10, 2);call #Ultimate.allocInit(12, 3); {25681#true} is VALID [2022-04-28 10:07:31,537 INFO L290 TraceCheckUtils]: 2: Hoare triple {25681#true} assume true; {25681#true} is VALID [2022-04-28 10:07:31,537 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25681#true} {25681#true} #61#return; {25681#true} is VALID [2022-04-28 10:07:31,537 INFO L272 TraceCheckUtils]: 4: Hoare triple {25681#true} call #t~ret11 := main(); {25681#true} is VALID [2022-04-28 10:07:31,537 INFO L290 TraceCheckUtils]: 5: Hoare triple {25681#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {25686#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-28 10:07:31,539 INFO L290 TraceCheckUtils]: 6: Hoare triple {25686#(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; {25687#(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-28 10:07:31,542 INFO L290 TraceCheckUtils]: 7: Hoare triple {25687#(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; {25688#(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-28 10:07:31,556 INFO L290 TraceCheckUtils]: 8: Hoare triple {25688#(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; {25689#(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-28 10:07:31,560 INFO L290 TraceCheckUtils]: 9: Hoare triple {25689#(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; {25735#(and (<= 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-28 10:07:31,612 INFO L290 TraceCheckUtils]: 10: Hoare triple {25735#(and (<= 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);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {25739#(and (<= (+ 5 main_~x~0) main_~n~0) (<= main_~x~0 (+ 4294967290 (* (div (+ main_~y~0 main_~x~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= main_~y~0 5))} is VALID [2022-04-28 10:07:31,613 INFO L290 TraceCheckUtils]: 11: Hoare triple {25739#(and (<= (+ 5 main_~x~0) main_~n~0) (<= main_~x~0 (+ 4294967290 (* (div (+ main_~y~0 main_~x~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= 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; {25743#(and (<= main_~y~0 6) (<= main_~x~0 (+ (* (div (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~y~0 main_~x~0 (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967289)) (<= (+ main_~x~0 6) main_~n~0))} is VALID [2022-04-28 10:07:31,618 INFO L290 TraceCheckUtils]: 12: Hoare triple {25743#(and (<= main_~y~0 6) (<= main_~x~0 (+ (* (div (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~y~0 main_~x~0 (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967289)) (<= (+ main_~x~0 6) main_~n~0))} assume !(~x~0 % 4294967296 > 0); {25693#(and (<= main_~y~0 6) (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) 6) main_~n~0))} is VALID [2022-04-28 10:07:31,619 INFO L290 TraceCheckUtils]: 13: Hoare triple {25693#(and (<= main_~y~0 6) (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) 6) main_~n~0))} ~z~0 := ~y~0; {25694#(and (<= main_~z~0 6) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 6) main_~n~0))} is VALID [2022-04-28 10:07:31,619 INFO L290 TraceCheckUtils]: 14: Hoare triple {25694#(and (<= main_~z~0 6) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 6) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {25695#(and (<= main_~z~0 5) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 6) main_~n~0))} is VALID [2022-04-28 10:07:31,620 INFO L290 TraceCheckUtils]: 15: Hoare triple {25695#(and (<= main_~z~0 5) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 6) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {25696#(and (<= main_~z~0 4) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 6) main_~n~0))} is VALID [2022-04-28 10:07:31,621 INFO L290 TraceCheckUtils]: 16: Hoare triple {25696#(and (<= main_~z~0 4) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 6) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {25697#(and (<= main_~z~0 3) (<= (+ 6 (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} is VALID [2022-04-28 10:07:31,622 INFO L290 TraceCheckUtils]: 17: Hoare triple {25697#(and (<= main_~z~0 3) (<= (+ 6 (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {25698#(and (<= main_~z~0 2) (<= (+ 6 (* (div (+ 4294967291 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} is VALID [2022-04-28 10:07:31,623 INFO L290 TraceCheckUtils]: 18: Hoare triple {25698#(and (<= main_~z~0 2) (<= (+ 6 (* (div (+ 4294967291 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {25699#(and (<= (+ 6 (* (div (+ 4294967290 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0) (<= main_~z~0 1))} is VALID [2022-04-28 10:07:31,624 INFO L290 TraceCheckUtils]: 19: Hoare triple {25699#(and (<= (+ 6 (* (div (+ 4294967290 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0) (<= main_~z~0 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {25700#(and (<= main_~z~0 0) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967289) 4294967296) 4294967296) 6) main_~n~0))} is VALID [2022-04-28 10:07:31,625 INFO L290 TraceCheckUtils]: 20: Hoare triple {25700#(and (<= main_~z~0 0) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967289) 4294967296) 4294967296) 6) main_~n~0))} assume !(~z~0 % 4294967296 > 0); {25700#(and (<= main_~z~0 0) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967289) 4294967296) 4294967296) 6) main_~n~0))} is VALID [2022-04-28 10:07:31,626 INFO L290 TraceCheckUtils]: 21: Hoare triple {25700#(and (<= main_~z~0 0) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967289) 4294967296) 4294967296) 6) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {25699#(and (<= (+ 6 (* (div (+ 4294967290 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0) (<= main_~z~0 1))} is VALID [2022-04-28 10:07:31,626 INFO L290 TraceCheckUtils]: 22: Hoare triple {25699#(and (<= (+ 6 (* (div (+ 4294967290 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0) (<= main_~z~0 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {25698#(and (<= main_~z~0 2) (<= (+ 6 (* (div (+ 4294967291 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} is VALID [2022-04-28 10:07:31,627 INFO L290 TraceCheckUtils]: 23: Hoare triple {25698#(and (<= main_~z~0 2) (<= (+ 6 (* (div (+ 4294967291 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {25697#(and (<= main_~z~0 3) (<= (+ 6 (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} is VALID [2022-04-28 10:07:31,628 INFO L290 TraceCheckUtils]: 24: Hoare triple {25697#(and (<= main_~z~0 3) (<= (+ 6 (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {25696#(and (<= main_~z~0 4) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 6) main_~n~0))} is VALID [2022-04-28 10:07:31,629 INFO L290 TraceCheckUtils]: 25: Hoare triple {25696#(and (<= main_~z~0 4) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 6) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {25695#(and (<= main_~z~0 5) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 6) main_~n~0))} is VALID [2022-04-28 10:07:31,630 INFO L290 TraceCheckUtils]: 26: Hoare triple {25695#(and (<= main_~z~0 5) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 6) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {25694#(and (<= main_~z~0 6) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 6) main_~n~0))} is VALID [2022-04-28 10:07:31,630 INFO L290 TraceCheckUtils]: 27: Hoare triple {25694#(and (<= main_~z~0 6) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 6) main_~n~0))} assume !(~y~0 % 4294967296 > 0); {25694#(and (<= main_~z~0 6) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 6) main_~n~0))} is VALID [2022-04-28 10:07:31,632 INFO L272 TraceCheckUtils]: 28: Hoare triple {25694#(and (<= main_~z~0 6) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 6) main_~n~0))} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {25795#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:07:31,632 INFO L290 TraceCheckUtils]: 29: Hoare triple {25795#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {25799#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:07:31,632 INFO L290 TraceCheckUtils]: 30: Hoare triple {25799#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {25682#false} is VALID [2022-04-28 10:07:31,632 INFO L290 TraceCheckUtils]: 31: Hoare triple {25682#false} assume !false; {25682#false} is VALID [2022-04-28 10:07:31,632 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:07:31,639 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:07:34,315 INFO L290 TraceCheckUtils]: 31: Hoare triple {25682#false} assume !false; {25682#false} is VALID [2022-04-28 10:07:34,316 INFO L290 TraceCheckUtils]: 30: Hoare triple {25799#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {25682#false} is VALID [2022-04-28 10:07:34,316 INFO L290 TraceCheckUtils]: 29: Hoare triple {25795#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {25799#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:07:34,317 INFO L272 TraceCheckUtils]: 28: Hoare triple {25701#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {25795#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:07:34,317 INFO L290 TraceCheckUtils]: 27: Hoare triple {25701#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {25701#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-28 10:07:34,318 INFO L290 TraceCheckUtils]: 26: Hoare triple {25821#(and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {25701#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-28 10:07:34,319 INFO L290 TraceCheckUtils]: 25: Hoare triple {25825#(and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {25821#(and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-28 10:07:34,320 INFO L290 TraceCheckUtils]: 24: Hoare triple {25829#(and (< (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {25825#(and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-28 10:07:34,321 INFO L290 TraceCheckUtils]: 23: Hoare triple {25833#(and (< (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) main_~n~0) (+ 5 main_~z~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) main_~n~0)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {25829#(and (< (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296))))} is VALID [2022-04-28 10:07:34,322 INFO L290 TraceCheckUtils]: 22: Hoare triple {25837#(and (<= (+ 5 main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ 5 main_~z~0) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ 5 main_~z~0) 4294967296) 4294967296)) (+ main_~z~0 6 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {25833#(and (< (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) main_~n~0) (+ 5 main_~z~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-28 10:07:34,322 INFO L290 TraceCheckUtils]: 21: Hoare triple {25841#(and (< (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) main_~n~0) (+ 7 main_~z~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 6 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) main_~n~0)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {25837#(and (<= (+ 5 main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ 5 main_~z~0) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ 5 main_~z~0) 4294967296) 4294967296)) (+ main_~z~0 6 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-28 10:07:34,323 INFO L290 TraceCheckUtils]: 20: Hoare triple {25841#(and (< (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) main_~n~0) (+ 7 main_~z~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 6 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) main_~n~0)))} assume !(~z~0 % 4294967296 > 0); {25841#(and (< (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) main_~n~0) (+ 7 main_~z~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 6 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-28 10:07:34,324 INFO L290 TraceCheckUtils]: 19: Hoare triple {25837#(and (<= (+ 5 main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ 5 main_~z~0) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ 5 main_~z~0) 4294967296) 4294967296)) (+ main_~z~0 6 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {25841#(and (< (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) main_~n~0) (+ 7 main_~z~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 6 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-28 10:07:34,325 INFO L290 TraceCheckUtils]: 18: Hoare triple {25833#(and (< (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) main_~n~0) (+ 5 main_~z~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) main_~n~0)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {25837#(and (<= (+ 5 main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ 5 main_~z~0) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ 5 main_~z~0) 4294967296) 4294967296)) (+ main_~z~0 6 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-28 10:07:34,325 INFO L290 TraceCheckUtils]: 17: Hoare triple {25829#(and (< (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {25833#(and (< (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) main_~n~0) (+ 5 main_~z~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-28 10:07:34,326 INFO L290 TraceCheckUtils]: 16: Hoare triple {25825#(and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {25829#(and (< (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296))))} is VALID [2022-04-28 10:07:34,327 INFO L290 TraceCheckUtils]: 15: Hoare triple {25821#(and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {25825#(and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-28 10:07:34,328 INFO L290 TraceCheckUtils]: 14: Hoare triple {25701#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {25821#(and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-28 10:07:34,328 INFO L290 TraceCheckUtils]: 13: Hoare triple {25866#(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)))} ~z~0 := ~y~0; {25701#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-28 10:07:34,329 INFO L290 TraceCheckUtils]: 12: Hoare triple {25870#(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); {25866#(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-28 10:07:34,331 INFO L290 TraceCheckUtils]: 11: Hoare triple {25874#(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; {25870#(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-28 10:07:34,332 INFO L290 TraceCheckUtils]: 10: Hoare triple {25878#(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; {25874#(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-28 10:07:34,333 INFO L290 TraceCheckUtils]: 9: Hoare triple {25882#(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; {25878#(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-28 10:07:34,334 INFO L290 TraceCheckUtils]: 8: Hoare triple {25886#(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; {25882#(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-28 10:07:34,336 INFO L290 TraceCheckUtils]: 7: Hoare triple {25890#(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; {25886#(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-28 10:07:34,337 INFO L290 TraceCheckUtils]: 6: Hoare triple {25894#(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; {25890#(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-28 10:07:34,338 INFO L290 TraceCheckUtils]: 5: Hoare triple {25681#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {25894#(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-28 10:07:34,338 INFO L272 TraceCheckUtils]: 4: Hoare triple {25681#true} call #t~ret11 := main(); {25681#true} is VALID [2022-04-28 10:07:34,338 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25681#true} {25681#true} #61#return; {25681#true} is VALID [2022-04-28 10:07:34,338 INFO L290 TraceCheckUtils]: 2: Hoare triple {25681#true} assume true; {25681#true} is VALID [2022-04-28 10:07:34,338 INFO L290 TraceCheckUtils]: 1: Hoare triple {25681#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(10, 2);call #Ultimate.allocInit(12, 3); {25681#true} is VALID [2022-04-28 10:07:34,338 INFO L272 TraceCheckUtils]: 0: Hoare triple {25681#true} call ULTIMATE.init(); {25681#true} is VALID [2022-04-28 10:07:34,338 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:07:34,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [899241312] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:07:34,338 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:07:34,339 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19, 19] total 40 [2022-04-28 10:07:34,339 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:07:34,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1055927011] [2022-04-28 10:07:34,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1055927011] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:07:34,339 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:07:34,339 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-28 10:07:34,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717976191] [2022-04-28 10:07:34,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:07:34,339 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 19 states have internal predecessors, (28), 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 32 [2022-04-28 10:07:34,339 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:07:34,339 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 19 states have internal predecessors, (28), 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-28 10:07:34,443 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:07:34,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-28 10:07:34,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:07:34,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-28 10:07:34,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=1404, Unknown=0, NotChecked=0, Total=1560 [2022-04-28 10:07:34,444 INFO L87 Difference]: Start difference. First operand 96 states and 122 transitions. Second operand has 21 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 19 states have internal predecessors, (28), 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-28 10:07:36,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:07:36,769 INFO L93 Difference]: Finished difference Result 119 states and 145 transitions. [2022-04-28 10:07:36,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-28 10:07:36,769 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 19 states have internal predecessors, (28), 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 32 [2022-04-28 10:07:36,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:07:36,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 19 states have internal predecessors, (28), 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-28 10:07:36,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 52 transitions. [2022-04-28 10:07:36,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 19 states have internal predecessors, (28), 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-28 10:07:36,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 52 transitions. [2022-04-28 10:07:36,770 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 52 transitions. [2022-04-28 10:07:36,889 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:07:36,890 INFO L225 Difference]: With dead ends: 119 [2022-04-28 10:07:36,890 INFO L226 Difference]: Without dead ends: 88 [2022-04-28 10:07:36,891 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 45 SyntacticMatches, 7 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 482 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=360, Invalid=3546, Unknown=0, NotChecked=0, Total=3906 [2022-04-28 10:07:36,891 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 20 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-28 10:07:36,891 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 99 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 502 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-28 10:07:36,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-04-28 10:07:36,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2022-04-28 10:07:36,982 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:07:36,982 INFO L82 GeneralOperation]: Start isEquivalent. First operand 88 states. Second operand has 88 states, 83 states have (on average 1.3012048192771084) internal successors, (108), 83 states have internal predecessors, (108), 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-28 10:07:36,982 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand has 88 states, 83 states have (on average 1.3012048192771084) internal successors, (108), 83 states have internal predecessors, (108), 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-28 10:07:36,982 INFO L87 Difference]: Start difference. First operand 88 states. Second operand has 88 states, 83 states have (on average 1.3012048192771084) internal successors, (108), 83 states have internal predecessors, (108), 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-28 10:07:36,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:07:36,983 INFO L93 Difference]: Finished difference Result 88 states and 112 transitions. [2022-04-28 10:07:36,983 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 112 transitions. [2022-04-28 10:07:36,983 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:07:36,983 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:07:36,983 INFO L74 IsIncluded]: Start isIncluded. First operand has 88 states, 83 states have (on average 1.3012048192771084) internal successors, (108), 83 states have internal predecessors, (108), 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 88 states. [2022-04-28 10:07:36,983 INFO L87 Difference]: Start difference. First operand has 88 states, 83 states have (on average 1.3012048192771084) internal successors, (108), 83 states have internal predecessors, (108), 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 88 states. [2022-04-28 10:07:36,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:07:36,984 INFO L93 Difference]: Finished difference Result 88 states and 112 transitions. [2022-04-28 10:07:36,984 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 112 transitions. [2022-04-28 10:07:36,984 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:07:36,984 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:07:36,984 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:07:36,984 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:07:36,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 83 states have (on average 1.3012048192771084) internal successors, (108), 83 states have internal predecessors, (108), 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-28 10:07:36,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 112 transitions. [2022-04-28 10:07:36,985 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 112 transitions. Word has length 32 [2022-04-28 10:07:36,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:07:36,985 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 112 transitions. [2022-04-28 10:07:36,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 19 states have internal predecessors, (28), 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-28 10:07:36,985 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 88 states and 112 transitions. [2022-04-28 10:07:37,318 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:07:37,318 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 112 transitions. [2022-04-28 10:07:37,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-28 10:07:37,318 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:07:37,318 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:07:37,324 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Forceful destruction successful, exit code 0 [2022-04-28 10:07:37,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2022-04-28 10:07:37,519 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:07:37,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:07:37,519 INFO L85 PathProgramCache]: Analyzing trace with hash -316309121, now seen corresponding path program 53 times [2022-04-28 10:07:37,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:07:37,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2085490975] [2022-04-28 10:07:37,522 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:07:37,522 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:07:37,522 INFO L85 PathProgramCache]: Analyzing trace with hash -316309121, now seen corresponding path program 54 times [2022-04-28 10:07:37,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:07:37,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056054378] [2022-04-28 10:07:37,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:07:37,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:07:37,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:07:37,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:07:37,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:07:37,711 INFO L290 TraceCheckUtils]: 0: Hoare triple {26569#(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(10, 2);call #Ultimate.allocInit(12, 3); {26551#true} is VALID [2022-04-28 10:07:37,711 INFO L290 TraceCheckUtils]: 1: Hoare triple {26551#true} assume true; {26551#true} is VALID [2022-04-28 10:07:37,711 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26551#true} {26551#true} #61#return; {26551#true} is VALID [2022-04-28 10:07:37,711 INFO L272 TraceCheckUtils]: 0: Hoare triple {26551#true} call ULTIMATE.init(); {26569#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:07:37,711 INFO L290 TraceCheckUtils]: 1: Hoare triple {26569#(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(10, 2);call #Ultimate.allocInit(12, 3); {26551#true} is VALID [2022-04-28 10:07:37,711 INFO L290 TraceCheckUtils]: 2: Hoare triple {26551#true} assume true; {26551#true} is VALID [2022-04-28 10:07:37,711 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26551#true} {26551#true} #61#return; {26551#true} is VALID [2022-04-28 10:07:37,711 INFO L272 TraceCheckUtils]: 4: Hoare triple {26551#true} call #t~ret11 := main(); {26551#true} is VALID [2022-04-28 10:07:37,712 INFO L290 TraceCheckUtils]: 5: Hoare triple {26551#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {26556#(= main_~y~0 0)} is VALID [2022-04-28 10:07:37,712 INFO L290 TraceCheckUtils]: 6: Hoare triple {26556#(= 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; {26557#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:07:37,713 INFO L290 TraceCheckUtils]: 7: Hoare triple {26557#(and (<= 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; {26558#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:07:37,713 INFO L290 TraceCheckUtils]: 8: Hoare triple {26558#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {26559#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:07:37,714 INFO L290 TraceCheckUtils]: 9: Hoare triple {26559#(and (<= main_~y~0 3) (<= 3 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; {26560#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:07:37,714 INFO L290 TraceCheckUtils]: 10: Hoare triple {26560#(and (<= main_~y~0 4) (<= 4 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; {26561#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:07:37,715 INFO L290 TraceCheckUtils]: 11: Hoare triple {26561#(and (<= 5 main_~y~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; {26562#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:07:37,715 INFO L290 TraceCheckUtils]: 12: Hoare triple {26562#(and (<= main_~y~0 6) (<= 6 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; {26563#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:07:37,715 INFO L290 TraceCheckUtils]: 13: Hoare triple {26563#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {26563#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:07:37,716 INFO L290 TraceCheckUtils]: 14: Hoare triple {26563#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {26564#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:07:37,716 INFO L290 TraceCheckUtils]: 15: Hoare triple {26564#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {26565#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:07:37,717 INFO L290 TraceCheckUtils]: 16: Hoare triple {26565#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {26566#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:07:37,717 INFO L290 TraceCheckUtils]: 17: Hoare triple {26566#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {26567#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:07:37,718 INFO L290 TraceCheckUtils]: 18: Hoare triple {26567#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {26568#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:07:37,718 INFO L290 TraceCheckUtils]: 19: Hoare triple {26568#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {26552#false} is VALID [2022-04-28 10:07:37,718 INFO L290 TraceCheckUtils]: 20: Hoare triple {26552#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {26552#false} is VALID [2022-04-28 10:07:37,718 INFO L290 TraceCheckUtils]: 21: Hoare triple {26552#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {26552#false} is VALID [2022-04-28 10:07:37,718 INFO L290 TraceCheckUtils]: 22: Hoare triple {26552#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {26552#false} is VALID [2022-04-28 10:07:37,718 INFO L290 TraceCheckUtils]: 23: Hoare triple {26552#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {26552#false} is VALID [2022-04-28 10:07:37,718 INFO L290 TraceCheckUtils]: 24: Hoare triple {26552#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {26552#false} is VALID [2022-04-28 10:07:37,718 INFO L290 TraceCheckUtils]: 25: Hoare triple {26552#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {26552#false} is VALID [2022-04-28 10:07:37,718 INFO L290 TraceCheckUtils]: 26: Hoare triple {26552#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {26552#false} is VALID [2022-04-28 10:07:37,718 INFO L290 TraceCheckUtils]: 27: Hoare triple {26552#false} assume !(~y~0 % 4294967296 > 0); {26552#false} is VALID [2022-04-28 10:07:37,719 INFO L272 TraceCheckUtils]: 28: Hoare triple {26552#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {26552#false} is VALID [2022-04-28 10:07:37,719 INFO L290 TraceCheckUtils]: 29: Hoare triple {26552#false} ~cond := #in~cond; {26552#false} is VALID [2022-04-28 10:07:37,719 INFO L290 TraceCheckUtils]: 30: Hoare triple {26552#false} assume 0 == ~cond; {26552#false} is VALID [2022-04-28 10:07:37,719 INFO L290 TraceCheckUtils]: 31: Hoare triple {26552#false} assume !false; {26552#false} is VALID [2022-04-28 10:07:37,719 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-28 10:07:37,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:07:37,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056054378] [2022-04-28 10:07:37,719 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056054378] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:07:37,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1179373476] [2022-04-28 10:07:37,719 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:07:37,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:07:37,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:07:37,720 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:07:37,720 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2022-04-28 10:07:37,783 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-28 10:07:37,783 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:07:37,784 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-28 10:07:37,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:07:37,792 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:07:38,003 INFO L272 TraceCheckUtils]: 0: Hoare triple {26551#true} call ULTIMATE.init(); {26551#true} is VALID [2022-04-28 10:07:38,004 INFO L290 TraceCheckUtils]: 1: Hoare triple {26551#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(10, 2);call #Ultimate.allocInit(12, 3); {26551#true} is VALID [2022-04-28 10:07:38,004 INFO L290 TraceCheckUtils]: 2: Hoare triple {26551#true} assume true; {26551#true} is VALID [2022-04-28 10:07:38,004 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26551#true} {26551#true} #61#return; {26551#true} is VALID [2022-04-28 10:07:38,004 INFO L272 TraceCheckUtils]: 4: Hoare triple {26551#true} call #t~ret11 := main(); {26551#true} is VALID [2022-04-28 10:07:38,005 INFO L290 TraceCheckUtils]: 5: Hoare triple {26551#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {26556#(= main_~y~0 0)} is VALID [2022-04-28 10:07:38,005 INFO L290 TraceCheckUtils]: 6: Hoare triple {26556#(= 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; {26557#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:07:38,006 INFO L290 TraceCheckUtils]: 7: Hoare triple {26557#(and (<= 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; {26558#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:07:38,006 INFO L290 TraceCheckUtils]: 8: Hoare triple {26558#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {26559#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:07:38,007 INFO L290 TraceCheckUtils]: 9: Hoare triple {26559#(and (<= main_~y~0 3) (<= 3 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; {26560#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:07:38,007 INFO L290 TraceCheckUtils]: 10: Hoare triple {26560#(and (<= main_~y~0 4) (<= 4 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; {26561#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:07:38,008 INFO L290 TraceCheckUtils]: 11: Hoare triple {26561#(and (<= 5 main_~y~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; {26562#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:07:38,008 INFO L290 TraceCheckUtils]: 12: Hoare triple {26562#(and (<= main_~y~0 6) (<= 6 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; {26563#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:07:38,008 INFO L290 TraceCheckUtils]: 13: Hoare triple {26563#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {26563#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:07:38,009 INFO L290 TraceCheckUtils]: 14: Hoare triple {26563#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {26615#(and (= main_~z~0 main_~y~0) (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:07:38,009 INFO L290 TraceCheckUtils]: 15: Hoare triple {26615#(and (= main_~z~0 main_~y~0) (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {26619#(and (<= 7 main_~y~0) (<= main_~y~0 7) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-28 10:07:38,010 INFO L290 TraceCheckUtils]: 16: Hoare triple {26619#(and (<= 7 main_~y~0) (<= main_~y~0 7) (= main_~y~0 (+ main_~z~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {26623#(and (<= 7 main_~y~0) (<= main_~y~0 7) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)))} is VALID [2022-04-28 10:07:38,010 INFO L290 TraceCheckUtils]: 17: Hoare triple {26623#(and (<= 7 main_~y~0) (<= main_~y~0 7) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {26627#(and (= (+ main_~z~0 2) (+ (- 1) main_~y~0)) (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:07:38,011 INFO L290 TraceCheckUtils]: 18: Hoare triple {26627#(and (= (+ main_~z~0 2) (+ (- 1) main_~y~0)) (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {26631#(and (= (+ main_~y~0 (- 3)) (+ main_~z~0 1)) (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:07:38,011 INFO L290 TraceCheckUtils]: 19: Hoare triple {26631#(and (= (+ main_~y~0 (- 3)) (+ main_~z~0 1)) (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~z~0 % 4294967296 > 0); {26552#false} is VALID [2022-04-28 10:07:38,011 INFO L290 TraceCheckUtils]: 20: Hoare triple {26552#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {26552#false} is VALID [2022-04-28 10:07:38,011 INFO L290 TraceCheckUtils]: 21: Hoare triple {26552#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {26552#false} is VALID [2022-04-28 10:07:38,011 INFO L290 TraceCheckUtils]: 22: Hoare triple {26552#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {26552#false} is VALID [2022-04-28 10:07:38,011 INFO L290 TraceCheckUtils]: 23: Hoare triple {26552#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {26552#false} is VALID [2022-04-28 10:07:38,011 INFO L290 TraceCheckUtils]: 24: Hoare triple {26552#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {26552#false} is VALID [2022-04-28 10:07:38,012 INFO L290 TraceCheckUtils]: 25: Hoare triple {26552#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {26552#false} is VALID [2022-04-28 10:07:38,012 INFO L290 TraceCheckUtils]: 26: Hoare triple {26552#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {26552#false} is VALID [2022-04-28 10:07:38,012 INFO L290 TraceCheckUtils]: 27: Hoare triple {26552#false} assume !(~y~0 % 4294967296 > 0); {26552#false} is VALID [2022-04-28 10:07:38,012 INFO L272 TraceCheckUtils]: 28: Hoare triple {26552#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {26552#false} is VALID [2022-04-28 10:07:38,012 INFO L290 TraceCheckUtils]: 29: Hoare triple {26552#false} ~cond := #in~cond; {26552#false} is VALID [2022-04-28 10:07:38,012 INFO L290 TraceCheckUtils]: 30: Hoare triple {26552#false} assume 0 == ~cond; {26552#false} is VALID [2022-04-28 10:07:38,012 INFO L290 TraceCheckUtils]: 31: Hoare triple {26552#false} assume !false; {26552#false} is VALID [2022-04-28 10:07:38,012 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-28 10:07:38,012 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:07:38,300 INFO L290 TraceCheckUtils]: 31: Hoare triple {26552#false} assume !false; {26552#false} is VALID [2022-04-28 10:07:38,300 INFO L290 TraceCheckUtils]: 30: Hoare triple {26552#false} assume 0 == ~cond; {26552#false} is VALID [2022-04-28 10:07:38,300 INFO L290 TraceCheckUtils]: 29: Hoare triple {26552#false} ~cond := #in~cond; {26552#false} is VALID [2022-04-28 10:07:38,300 INFO L272 TraceCheckUtils]: 28: Hoare triple {26552#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {26552#false} is VALID [2022-04-28 10:07:38,300 INFO L290 TraceCheckUtils]: 27: Hoare triple {26552#false} assume !(~y~0 % 4294967296 > 0); {26552#false} is VALID [2022-04-28 10:07:38,300 INFO L290 TraceCheckUtils]: 26: Hoare triple {26552#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {26552#false} is VALID [2022-04-28 10:07:38,301 INFO L290 TraceCheckUtils]: 25: Hoare triple {26552#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {26552#false} is VALID [2022-04-28 10:07:38,301 INFO L290 TraceCheckUtils]: 24: Hoare triple {26692#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {26552#false} is VALID [2022-04-28 10:07:38,302 INFO L290 TraceCheckUtils]: 23: Hoare triple {26696#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {26692#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:07:38,303 INFO L290 TraceCheckUtils]: 22: Hoare triple {26700#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {26696#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:07:38,304 INFO L290 TraceCheckUtils]: 21: Hoare triple {26704#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {26700#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-28 10:07:38,304 INFO L290 TraceCheckUtils]: 20: Hoare triple {26708#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {26704#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-28 10:07:38,304 INFO L290 TraceCheckUtils]: 19: Hoare triple {26712#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {26708#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:07:38,306 INFO L290 TraceCheckUtils]: 18: Hoare triple {26716#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {26712#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} is VALID [2022-04-28 10:07:38,306 INFO L290 TraceCheckUtils]: 17: Hoare triple {26720#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {26716#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} is VALID [2022-04-28 10:07:38,307 INFO L290 TraceCheckUtils]: 16: Hoare triple {26724#(or (< 0 (mod (+ main_~z~0 4294967293) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {26720#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} is VALID [2022-04-28 10:07:38,308 INFO L290 TraceCheckUtils]: 15: Hoare triple {26728#(or (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {26724#(or (< 0 (mod (+ main_~z~0 4294967293) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} is VALID [2022-04-28 10:07:38,308 INFO L290 TraceCheckUtils]: 14: Hoare triple {26551#true} ~z~0 := ~y~0; {26728#(or (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} is VALID [2022-04-28 10:07:38,308 INFO L290 TraceCheckUtils]: 13: Hoare triple {26551#true} assume !(~x~0 % 4294967296 > 0); {26551#true} is VALID [2022-04-28 10:07:38,308 INFO L290 TraceCheckUtils]: 12: Hoare triple {26551#true} 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; {26551#true} is VALID [2022-04-28 10:07:38,308 INFO L290 TraceCheckUtils]: 11: Hoare triple {26551#true} 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; {26551#true} is VALID [2022-04-28 10:07:38,309 INFO L290 TraceCheckUtils]: 10: Hoare triple {26551#true} 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; {26551#true} is VALID [2022-04-28 10:07:38,309 INFO L290 TraceCheckUtils]: 9: Hoare triple {26551#true} 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; {26551#true} is VALID [2022-04-28 10:07:38,309 INFO L290 TraceCheckUtils]: 8: Hoare triple {26551#true} 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; {26551#true} is VALID [2022-04-28 10:07:38,309 INFO L290 TraceCheckUtils]: 7: Hoare triple {26551#true} 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; {26551#true} is VALID [2022-04-28 10:07:38,309 INFO L290 TraceCheckUtils]: 6: Hoare triple {26551#true} 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; {26551#true} is VALID [2022-04-28 10:07:38,309 INFO L290 TraceCheckUtils]: 5: Hoare triple {26551#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {26551#true} is VALID [2022-04-28 10:07:38,309 INFO L272 TraceCheckUtils]: 4: Hoare triple {26551#true} call #t~ret11 := main(); {26551#true} is VALID [2022-04-28 10:07:38,309 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26551#true} {26551#true} #61#return; {26551#true} is VALID [2022-04-28 10:07:38,309 INFO L290 TraceCheckUtils]: 2: Hoare triple {26551#true} assume true; {26551#true} is VALID [2022-04-28 10:07:38,309 INFO L290 TraceCheckUtils]: 1: Hoare triple {26551#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(10, 2);call #Ultimate.allocInit(12, 3); {26551#true} is VALID [2022-04-28 10:07:38,309 INFO L272 TraceCheckUtils]: 0: Hoare triple {26551#true} call ULTIMATE.init(); {26551#true} is VALID [2022-04-28 10:07:38,309 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 15 proven. 20 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-04-28 10:07:38,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1179373476] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:07:38,309 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:07:38,309 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 12] total 31 [2022-04-28 10:07:38,309 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:07:38,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2085490975] [2022-04-28 10:07:38,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2085490975] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:07:38,310 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:07:38,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-28 10:07:38,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875930389] [2022-04-28 10:07:38,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:07:38,310 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 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 32 [2022-04-28 10:07:38,310 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:07:38,310 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 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-28 10:07:38,326 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:07:38,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-28 10:07:38,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:07:38,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-28 10:07:38,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=793, Unknown=0, NotChecked=0, Total=930 [2022-04-28 10:07:38,327 INFO L87 Difference]: Start difference. First operand 88 states and 112 transitions. Second operand has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 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-28 10:07:39,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:07:39,226 INFO L93 Difference]: Finished difference Result 111 states and 135 transitions. [2022-04-28 10:07:39,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-28 10:07:39,226 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 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 32 [2022-04-28 10:07:39,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:07:39,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 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-28 10:07:39,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 50 transitions. [2022-04-28 10:07:39,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 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-28 10:07:39,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 50 transitions. [2022-04-28 10:07:39,227 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 50 transitions. [2022-04-28 10:07:39,263 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:07:39,263 INFO L225 Difference]: With dead ends: 111 [2022-04-28 10:07:39,263 INFO L226 Difference]: Without dead ends: 98 [2022-04-28 10:07:39,264 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=243, Invalid=1649, Unknown=0, NotChecked=0, Total=1892 [2022-04-28 10:07:39,264 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 17 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 10:07:39,264 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 83 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 10:07:39,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-04-28 10:07:39,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 89. [2022-04-28 10:07:39,352 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:07:39,353 INFO L82 GeneralOperation]: Start isEquivalent. First operand 98 states. Second operand has 89 states, 84 states have (on average 1.2976190476190477) internal successors, (109), 84 states have internal predecessors, (109), 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-28 10:07:39,353 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand has 89 states, 84 states have (on average 1.2976190476190477) internal successors, (109), 84 states have internal predecessors, (109), 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-28 10:07:39,353 INFO L87 Difference]: Start difference. First operand 98 states. Second operand has 89 states, 84 states have (on average 1.2976190476190477) internal successors, (109), 84 states have internal predecessors, (109), 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-28 10:07:39,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:07:39,354 INFO L93 Difference]: Finished difference Result 98 states and 122 transitions. [2022-04-28 10:07:39,354 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 122 transitions. [2022-04-28 10:07:39,354 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:07:39,354 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:07:39,354 INFO L74 IsIncluded]: Start isIncluded. First operand has 89 states, 84 states have (on average 1.2976190476190477) internal successors, (109), 84 states have internal predecessors, (109), 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 98 states. [2022-04-28 10:07:39,354 INFO L87 Difference]: Start difference. First operand has 89 states, 84 states have (on average 1.2976190476190477) internal successors, (109), 84 states have internal predecessors, (109), 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 98 states. [2022-04-28 10:07:39,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:07:39,355 INFO L93 Difference]: Finished difference Result 98 states and 122 transitions. [2022-04-28 10:07:39,355 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 122 transitions. [2022-04-28 10:07:39,355 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:07:39,355 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:07:39,355 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:07:39,355 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:07:39,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 84 states have (on average 1.2976190476190477) internal successors, (109), 84 states have internal predecessors, (109), 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-28 10:07:39,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 113 transitions. [2022-04-28 10:07:39,356 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 113 transitions. Word has length 32 [2022-04-28 10:07:39,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:07:39,356 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 113 transitions. [2022-04-28 10:07:39,356 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 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-28 10:07:39,356 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 89 states and 113 transitions. [2022-04-28 10:07:42,767 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 112 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 10:07:42,767 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 113 transitions. [2022-04-28 10:07:42,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-28 10:07:42,771 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:07:42,771 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:07:42,789 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Forceful destruction successful, exit code 0 [2022-04-28 10:07:42,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2022-04-28 10:07:42,987 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:07:42,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:07:42,987 INFO L85 PathProgramCache]: Analyzing trace with hash 1879174029, now seen corresponding path program 55 times [2022-04-28 10:07:42,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:07:42,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [242936299] [2022-04-28 10:07:42,990 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:07:42,990 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:07:42,990 INFO L85 PathProgramCache]: Analyzing trace with hash 1879174029, now seen corresponding path program 56 times [2022-04-28 10:07:42,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:07:42,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637928999] [2022-04-28 10:07:42,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:07:42,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:07:43,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:07:43,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:07:43,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:07:43,157 INFO L290 TraceCheckUtils]: 0: Hoare triple {27415#(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(10, 2);call #Ultimate.allocInit(12, 3); {27398#true} is VALID [2022-04-28 10:07:43,157 INFO L290 TraceCheckUtils]: 1: Hoare triple {27398#true} assume true; {27398#true} is VALID [2022-04-28 10:07:43,157 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {27398#true} {27398#true} #61#return; {27398#true} is VALID [2022-04-28 10:07:43,158 INFO L272 TraceCheckUtils]: 0: Hoare triple {27398#true} call ULTIMATE.init(); {27415#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:07:43,158 INFO L290 TraceCheckUtils]: 1: Hoare triple {27415#(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(10, 2);call #Ultimate.allocInit(12, 3); {27398#true} is VALID [2022-04-28 10:07:43,158 INFO L290 TraceCheckUtils]: 2: Hoare triple {27398#true} assume true; {27398#true} is VALID [2022-04-28 10:07:43,158 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27398#true} {27398#true} #61#return; {27398#true} is VALID [2022-04-28 10:07:43,158 INFO L272 TraceCheckUtils]: 4: Hoare triple {27398#true} call #t~ret11 := main(); {27398#true} is VALID [2022-04-28 10:07:43,158 INFO L290 TraceCheckUtils]: 5: Hoare triple {27398#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {27403#(= main_~y~0 0)} is VALID [2022-04-28 10:07:43,159 INFO L290 TraceCheckUtils]: 6: Hoare triple {27403#(= 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; {27404#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:07:43,159 INFO L290 TraceCheckUtils]: 7: Hoare triple {27404#(and (<= 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; {27405#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:07:43,160 INFO L290 TraceCheckUtils]: 8: Hoare triple {27405#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {27406#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:07:43,160 INFO L290 TraceCheckUtils]: 9: Hoare triple {27406#(and (<= main_~y~0 3) (<= 3 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; {27407#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:07:43,161 INFO L290 TraceCheckUtils]: 10: Hoare triple {27407#(and (<= main_~y~0 4) (<= 4 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; {27408#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:07:43,161 INFO L290 TraceCheckUtils]: 11: Hoare triple {27408#(and (<= 5 main_~y~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; {27409#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:07:43,162 INFO L290 TraceCheckUtils]: 12: Hoare triple {27409#(and (<= main_~y~0 6) (<= 6 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; {27410#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:07:43,162 INFO L290 TraceCheckUtils]: 13: Hoare triple {27410#(and (<= 7 main_~y~0) (<= main_~y~0 7))} 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; {27411#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:07:43,162 INFO L290 TraceCheckUtils]: 14: Hoare triple {27411#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {27411#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:07:43,163 INFO L290 TraceCheckUtils]: 15: Hoare triple {27411#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {27412#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:07:43,163 INFO L290 TraceCheckUtils]: 16: Hoare triple {27412#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {27413#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:07:43,164 INFO L290 TraceCheckUtils]: 17: Hoare triple {27413#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {27414#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} is VALID [2022-04-28 10:07:43,164 INFO L290 TraceCheckUtils]: 18: Hoare triple {27414#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {27399#false} is VALID [2022-04-28 10:07:43,164 INFO L290 TraceCheckUtils]: 19: Hoare triple {27399#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {27399#false} is VALID [2022-04-28 10:07:43,164 INFO L290 TraceCheckUtils]: 20: Hoare triple {27399#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {27399#false} is VALID [2022-04-28 10:07:43,164 INFO L290 TraceCheckUtils]: 21: Hoare triple {27399#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {27399#false} is VALID [2022-04-28 10:07:43,164 INFO L290 TraceCheckUtils]: 22: Hoare triple {27399#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {27399#false} is VALID [2022-04-28 10:07:43,164 INFO L290 TraceCheckUtils]: 23: Hoare triple {27399#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {27399#false} is VALID [2022-04-28 10:07:43,165 INFO L290 TraceCheckUtils]: 24: Hoare triple {27399#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {27399#false} is VALID [2022-04-28 10:07:43,165 INFO L290 TraceCheckUtils]: 25: Hoare triple {27399#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {27399#false} is VALID [2022-04-28 10:07:43,165 INFO L290 TraceCheckUtils]: 26: Hoare triple {27399#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {27399#false} is VALID [2022-04-28 10:07:43,165 INFO L290 TraceCheckUtils]: 27: Hoare triple {27399#false} assume !(~y~0 % 4294967296 > 0); {27399#false} is VALID [2022-04-28 10:07:43,165 INFO L272 TraceCheckUtils]: 28: Hoare triple {27399#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {27399#false} is VALID [2022-04-28 10:07:43,165 INFO L290 TraceCheckUtils]: 29: Hoare triple {27399#false} ~cond := #in~cond; {27399#false} is VALID [2022-04-28 10:07:43,165 INFO L290 TraceCheckUtils]: 30: Hoare triple {27399#false} assume 0 == ~cond; {27399#false} is VALID [2022-04-28 10:07:43,165 INFO L290 TraceCheckUtils]: 31: Hoare triple {27399#false} assume !false; {27399#false} is VALID [2022-04-28 10:07:43,165 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-28 10:07:43,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:07:43,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637928999] [2022-04-28 10:07:43,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637928999] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:07:43,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [131951799] [2022-04-28 10:07:43,165 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:07:43,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:07:43,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:07:43,166 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:07:43,168 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Waiting until timeout for monitored process [2022-04-28 10:07:43,204 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:07:43,204 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:07:43,204 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-28 10:07:43,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:07:43,212 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:07:43,431 INFO L272 TraceCheckUtils]: 0: Hoare triple {27398#true} call ULTIMATE.init(); {27398#true} is VALID [2022-04-28 10:07:43,431 INFO L290 TraceCheckUtils]: 1: Hoare triple {27398#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(10, 2);call #Ultimate.allocInit(12, 3); {27398#true} is VALID [2022-04-28 10:07:43,431 INFO L290 TraceCheckUtils]: 2: Hoare triple {27398#true} assume true; {27398#true} is VALID [2022-04-28 10:07:43,431 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27398#true} {27398#true} #61#return; {27398#true} is VALID [2022-04-28 10:07:43,431 INFO L272 TraceCheckUtils]: 4: Hoare triple {27398#true} call #t~ret11 := main(); {27398#true} is VALID [2022-04-28 10:07:43,431 INFO L290 TraceCheckUtils]: 5: Hoare triple {27398#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {27403#(= main_~y~0 0)} is VALID [2022-04-28 10:07:43,432 INFO L290 TraceCheckUtils]: 6: Hoare triple {27403#(= 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; {27404#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:07:43,432 INFO L290 TraceCheckUtils]: 7: Hoare triple {27404#(and (<= 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; {27405#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:07:43,433 INFO L290 TraceCheckUtils]: 8: Hoare triple {27405#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {27406#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:07:43,433 INFO L290 TraceCheckUtils]: 9: Hoare triple {27406#(and (<= main_~y~0 3) (<= 3 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; {27407#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:07:43,434 INFO L290 TraceCheckUtils]: 10: Hoare triple {27407#(and (<= main_~y~0 4) (<= 4 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; {27408#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:07:43,434 INFO L290 TraceCheckUtils]: 11: Hoare triple {27408#(and (<= 5 main_~y~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; {27409#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:07:43,435 INFO L290 TraceCheckUtils]: 12: Hoare triple {27409#(and (<= main_~y~0 6) (<= 6 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; {27410#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:07:43,435 INFO L290 TraceCheckUtils]: 13: Hoare triple {27410#(and (<= 7 main_~y~0) (<= main_~y~0 7))} 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; {27411#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:07:43,435 INFO L290 TraceCheckUtils]: 14: Hoare triple {27411#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {27411#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:07:43,436 INFO L290 TraceCheckUtils]: 15: Hoare triple {27411#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {27412#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:07:43,436 INFO L290 TraceCheckUtils]: 16: Hoare triple {27412#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {27413#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:07:43,437 INFO L290 TraceCheckUtils]: 17: Hoare triple {27413#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {27470#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:07:43,437 INFO L290 TraceCheckUtils]: 18: Hoare triple {27470#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {27399#false} is VALID [2022-04-28 10:07:43,437 INFO L290 TraceCheckUtils]: 19: Hoare triple {27399#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {27399#false} is VALID [2022-04-28 10:07:43,437 INFO L290 TraceCheckUtils]: 20: Hoare triple {27399#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {27399#false} is VALID [2022-04-28 10:07:43,437 INFO L290 TraceCheckUtils]: 21: Hoare triple {27399#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {27399#false} is VALID [2022-04-28 10:07:43,437 INFO L290 TraceCheckUtils]: 22: Hoare triple {27399#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {27399#false} is VALID [2022-04-28 10:07:43,437 INFO L290 TraceCheckUtils]: 23: Hoare triple {27399#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {27399#false} is VALID [2022-04-28 10:07:43,437 INFO L290 TraceCheckUtils]: 24: Hoare triple {27399#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {27399#false} is VALID [2022-04-28 10:07:43,437 INFO L290 TraceCheckUtils]: 25: Hoare triple {27399#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {27399#false} is VALID [2022-04-28 10:07:43,438 INFO L290 TraceCheckUtils]: 26: Hoare triple {27399#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {27399#false} is VALID [2022-04-28 10:07:43,438 INFO L290 TraceCheckUtils]: 27: Hoare triple {27399#false} assume !(~y~0 % 4294967296 > 0); {27399#false} is VALID [2022-04-28 10:07:43,438 INFO L272 TraceCheckUtils]: 28: Hoare triple {27399#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {27399#false} is VALID [2022-04-28 10:07:43,438 INFO L290 TraceCheckUtils]: 29: Hoare triple {27399#false} ~cond := #in~cond; {27399#false} is VALID [2022-04-28 10:07:43,438 INFO L290 TraceCheckUtils]: 30: Hoare triple {27399#false} assume 0 == ~cond; {27399#false} is VALID [2022-04-28 10:07:43,438 INFO L290 TraceCheckUtils]: 31: Hoare triple {27399#false} assume !false; {27399#false} is VALID [2022-04-28 10:07:43,438 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-28 10:07:43,438 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:07:43,724 INFO L290 TraceCheckUtils]: 31: Hoare triple {27399#false} assume !false; {27399#false} is VALID [2022-04-28 10:07:43,739 INFO L290 TraceCheckUtils]: 30: Hoare triple {27399#false} assume 0 == ~cond; {27399#false} is VALID [2022-04-28 10:07:43,739 INFO L290 TraceCheckUtils]: 29: Hoare triple {27399#false} ~cond := #in~cond; {27399#false} is VALID [2022-04-28 10:07:43,739 INFO L272 TraceCheckUtils]: 28: Hoare triple {27399#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {27399#false} is VALID [2022-04-28 10:07:43,739 INFO L290 TraceCheckUtils]: 27: Hoare triple {27399#false} assume !(~y~0 % 4294967296 > 0); {27399#false} is VALID [2022-04-28 10:07:43,739 INFO L290 TraceCheckUtils]: 26: Hoare triple {27399#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {27399#false} is VALID [2022-04-28 10:07:43,739 INFO L290 TraceCheckUtils]: 25: Hoare triple {27399#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {27399#false} is VALID [2022-04-28 10:07:43,739 INFO L290 TraceCheckUtils]: 24: Hoare triple {27399#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {27399#false} is VALID [2022-04-28 10:07:43,739 INFO L290 TraceCheckUtils]: 23: Hoare triple {27399#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {27399#false} is VALID [2022-04-28 10:07:43,739 INFO L290 TraceCheckUtils]: 22: Hoare triple {27399#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {27399#false} is VALID [2022-04-28 10:07:43,740 INFO L290 TraceCheckUtils]: 21: Hoare triple {27399#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {27399#false} is VALID [2022-04-28 10:07:43,740 INFO L290 TraceCheckUtils]: 20: Hoare triple {27399#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {27399#false} is VALID [2022-04-28 10:07:43,740 INFO L290 TraceCheckUtils]: 19: Hoare triple {27399#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {27399#false} is VALID [2022-04-28 10:07:43,740 INFO L290 TraceCheckUtils]: 18: Hoare triple {27552#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {27399#false} is VALID [2022-04-28 10:07:43,741 INFO L290 TraceCheckUtils]: 17: Hoare triple {27556#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {27552#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:07:43,742 INFO L290 TraceCheckUtils]: 16: Hoare triple {27560#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {27556#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:07:43,742 INFO L290 TraceCheckUtils]: 15: Hoare triple {27564#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} ~z~0 := ~y~0; {27560#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-28 10:07:43,743 INFO L290 TraceCheckUtils]: 14: Hoare triple {27564#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !(~x~0 % 4294967296 > 0); {27564#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:07:43,743 INFO L290 TraceCheckUtils]: 13: Hoare triple {27571#(< 0 (mod (+ main_~y~0 4294967295) 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; {27564#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:07:43,744 INFO L290 TraceCheckUtils]: 12: Hoare triple {27575#(< 0 (mod main_~y~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; {27571#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:07:43,745 INFO L290 TraceCheckUtils]: 11: Hoare triple {27579#(< 0 (mod (+ main_~y~0 1) 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; {27575#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:07:43,745 INFO L290 TraceCheckUtils]: 10: Hoare triple {27583#(< 0 (mod (+ main_~y~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; {27579#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:07:43,746 INFO L290 TraceCheckUtils]: 9: Hoare triple {27587#(< 0 (mod (+ main_~y~0 3) 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; {27583#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:07:43,747 INFO L290 TraceCheckUtils]: 8: Hoare triple {27591#(< 0 (mod (+ main_~y~0 4) 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; {27587#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:07:43,748 INFO L290 TraceCheckUtils]: 7: Hoare triple {27595#(< 0 (mod (+ 5 main_~y~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; {27591#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:07:43,748 INFO L290 TraceCheckUtils]: 6: Hoare triple {27599#(< 0 (mod (+ main_~y~0 6) 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; {27595#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:07:43,749 INFO L290 TraceCheckUtils]: 5: Hoare triple {27398#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {27599#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:07:43,749 INFO L272 TraceCheckUtils]: 4: Hoare triple {27398#true} call #t~ret11 := main(); {27398#true} is VALID [2022-04-28 10:07:43,749 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27398#true} {27398#true} #61#return; {27398#true} is VALID [2022-04-28 10:07:43,749 INFO L290 TraceCheckUtils]: 2: Hoare triple {27398#true} assume true; {27398#true} is VALID [2022-04-28 10:07:43,749 INFO L290 TraceCheckUtils]: 1: Hoare triple {27398#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(10, 2);call #Ultimate.allocInit(12, 3); {27398#true} is VALID [2022-04-28 10:07:43,749 INFO L272 TraceCheckUtils]: 0: Hoare triple {27398#true} call ULTIMATE.init(); {27398#true} is VALID [2022-04-28 10:07:43,749 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-28 10:07:43,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [131951799] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:07:43,749 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:07:43,749 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 28 [2022-04-28 10:07:43,749 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:07:43,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [242936299] [2022-04-28 10:07:43,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [242936299] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:07:43,750 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:07:43,750 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-28 10:07:43,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306100965] [2022-04-28 10:07:43,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:07:43,750 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 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 32 [2022-04-28 10:07:43,750 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:07:43,750 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 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-28 10:07:43,765 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:07:43,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-28 10:07:43,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:07:43,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-28 10:07:43,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=610, Unknown=0, NotChecked=0, Total=756 [2022-04-28 10:07:43,766 INFO L87 Difference]: Start difference. First operand 89 states and 113 transitions. Second operand has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 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-28 10:07:44,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:07:44,574 INFO L93 Difference]: Finished difference Result 114 states and 138 transitions. [2022-04-28 10:07:44,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-28 10:07:44,574 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 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 32 [2022-04-28 10:07:44,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:07:44,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 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-28 10:07:44,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 56 transitions. [2022-04-28 10:07:44,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 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-28 10:07:44,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 56 transitions. [2022-04-28 10:07:44,575 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 56 transitions. [2022-04-28 10:07:44,618 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:07:44,619 INFO L225 Difference]: With dead ends: 114 [2022-04-28 10:07:44,619 INFO L226 Difference]: Without dead ends: 100 [2022-04-28 10:07:44,619 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=356, Invalid=1366, Unknown=0, NotChecked=0, Total=1722 [2022-04-28 10:07:44,619 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 24 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 10:07:44,619 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 70 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 10:07:44,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-04-28 10:07:44,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 90. [2022-04-28 10:07:44,705 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:07:44,705 INFO L82 GeneralOperation]: Start isEquivalent. First operand 100 states. Second operand has 90 states, 85 states have (on average 1.2941176470588236) internal successors, (110), 85 states have internal predecessors, (110), 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-28 10:07:44,705 INFO L74 IsIncluded]: Start isIncluded. First operand 100 states. Second operand has 90 states, 85 states have (on average 1.2941176470588236) internal successors, (110), 85 states have internal predecessors, (110), 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-28 10:07:44,705 INFO L87 Difference]: Start difference. First operand 100 states. Second operand has 90 states, 85 states have (on average 1.2941176470588236) internal successors, (110), 85 states have internal predecessors, (110), 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-28 10:07:44,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:07:44,706 INFO L93 Difference]: Finished difference Result 100 states and 124 transitions. [2022-04-28 10:07:44,706 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 124 transitions. [2022-04-28 10:07:44,706 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:07:44,706 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:07:44,706 INFO L74 IsIncluded]: Start isIncluded. First operand has 90 states, 85 states have (on average 1.2941176470588236) internal successors, (110), 85 states have internal predecessors, (110), 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 100 states. [2022-04-28 10:07:44,706 INFO L87 Difference]: Start difference. First operand has 90 states, 85 states have (on average 1.2941176470588236) internal successors, (110), 85 states have internal predecessors, (110), 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 100 states. [2022-04-28 10:07:44,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:07:44,707 INFO L93 Difference]: Finished difference Result 100 states and 124 transitions. [2022-04-28 10:07:44,707 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 124 transitions. [2022-04-28 10:07:44,707 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:07:44,707 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:07:44,707 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:07:44,707 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:07:44,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 85 states have (on average 1.2941176470588236) internal successors, (110), 85 states have internal predecessors, (110), 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-28 10:07:44,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 114 transitions. [2022-04-28 10:07:44,708 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 114 transitions. Word has length 32 [2022-04-28 10:07:44,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:07:44,708 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 114 transitions. [2022-04-28 10:07:44,708 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 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-28 10:07:44,708 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 90 states and 114 transitions. [2022-04-28 10:07:45,967 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:07:45,967 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 114 transitions. [2022-04-28 10:07:45,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-28 10:07:45,967 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:07:45,967 INFO L195 NwaCegarLoop]: trace histogram [18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:07:45,983 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Forceful destruction successful, exit code 0 [2022-04-28 10:07:46,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2022-04-28 10:07:46,168 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:07:46,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:07:46,168 INFO L85 PathProgramCache]: Analyzing trace with hash 1622266477, now seen corresponding path program 35 times [2022-04-28 10:07:46,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:07:46,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [709541179] [2022-04-28 10:07:46,170 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:07:46,171 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:07:46,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1622266477, now seen corresponding path program 36 times [2022-04-28 10:07:46,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:07:46,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872210312] [2022-04-28 10:07:46,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:07:46,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:07:46,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:07:46,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:07:46,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:07:46,480 INFO L290 TraceCheckUtils]: 0: Hoare triple {28281#(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(10, 2);call #Ultimate.allocInit(12, 3); {28256#true} is VALID [2022-04-28 10:07:46,480 INFO L290 TraceCheckUtils]: 1: Hoare triple {28256#true} assume true; {28256#true} is VALID [2022-04-28 10:07:46,480 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {28256#true} {28256#true} #61#return; {28256#true} is VALID [2022-04-28 10:07:46,481 INFO L272 TraceCheckUtils]: 0: Hoare triple {28256#true} call ULTIMATE.init(); {28281#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:07:46,481 INFO L290 TraceCheckUtils]: 1: Hoare triple {28281#(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(10, 2);call #Ultimate.allocInit(12, 3); {28256#true} is VALID [2022-04-28 10:07:46,481 INFO L290 TraceCheckUtils]: 2: Hoare triple {28256#true} assume true; {28256#true} is VALID [2022-04-28 10:07:46,481 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28256#true} {28256#true} #61#return; {28256#true} is VALID [2022-04-28 10:07:46,481 INFO L272 TraceCheckUtils]: 4: Hoare triple {28256#true} call #t~ret11 := main(); {28256#true} is VALID [2022-04-28 10:07:46,481 INFO L290 TraceCheckUtils]: 5: Hoare triple {28256#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {28261#(= main_~y~0 0)} is VALID [2022-04-28 10:07:46,481 INFO L290 TraceCheckUtils]: 6: Hoare triple {28261#(= 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; {28262#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:07:46,482 INFO L290 TraceCheckUtils]: 7: Hoare triple {28262#(and (<= 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; {28263#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:07:46,483 INFO L290 TraceCheckUtils]: 8: Hoare triple {28263#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {28264#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:07:46,483 INFO L290 TraceCheckUtils]: 9: Hoare triple {28264#(and (<= main_~y~0 3) (<= 3 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; {28265#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:07:46,484 INFO L290 TraceCheckUtils]: 10: Hoare triple {28265#(and (<= main_~y~0 4) (<= 4 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; {28266#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:07:46,484 INFO L290 TraceCheckUtils]: 11: Hoare triple {28266#(and (<= 5 main_~y~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; {28267#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:07:46,485 INFO L290 TraceCheckUtils]: 12: Hoare triple {28267#(and (<= main_~y~0 6) (<= 6 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; {28268#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:07:46,485 INFO L290 TraceCheckUtils]: 13: Hoare triple {28268#(and (<= 7 main_~y~0) (<= main_~y~0 7))} 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; {28269#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:07:46,485 INFO L290 TraceCheckUtils]: 14: Hoare triple {28269#(and (<= main_~y~0 8) (<= 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; {28270#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:07:46,486 INFO L290 TraceCheckUtils]: 15: Hoare triple {28270#(and (<= 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; {28271#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:07:46,486 INFO L290 TraceCheckUtils]: 16: Hoare triple {28271#(and (<= main_~y~0 10) (<= 10 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; {28272#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:07:46,487 INFO L290 TraceCheckUtils]: 17: Hoare triple {28272#(and (<= main_~y~0 11) (<= 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; {28273#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:07:46,487 INFO L290 TraceCheckUtils]: 18: Hoare triple {28273#(and (<= 12 main_~y~0) (<= main_~y~0 12))} 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; {28274#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:07:46,488 INFO L290 TraceCheckUtils]: 19: Hoare triple {28274#(and (<= main_~y~0 13) (<= 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; {28275#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:07:46,488 INFO L290 TraceCheckUtils]: 20: Hoare triple {28275#(and (<= 14 main_~y~0) (<= main_~y~0 14))} 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; {28276#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:07:46,489 INFO L290 TraceCheckUtils]: 21: Hoare triple {28276#(and (<= main_~y~0 15) (<= 15 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; {28277#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:07:46,489 INFO L290 TraceCheckUtils]: 22: Hoare triple {28277#(and (<= 16 main_~y~0) (<= main_~y~0 16))} 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; {28278#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:07:46,490 INFO L290 TraceCheckUtils]: 23: Hoare triple {28278#(and (<= main_~y~0 17) (<= 17 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; {28279#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 10:07:46,490 INFO L290 TraceCheckUtils]: 24: Hoare triple {28279#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !(~x~0 % 4294967296 > 0); {28279#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 10:07:46,491 INFO L290 TraceCheckUtils]: 25: Hoare triple {28279#(and (<= 18 main_~y~0) (<= main_~y~0 18))} ~z~0 := ~y~0; {28280#(and (<= (div main_~z~0 4294967296) 0) (<= 18 main_~z~0))} is VALID [2022-04-28 10:07:46,491 INFO L290 TraceCheckUtils]: 26: Hoare triple {28280#(and (<= (div main_~z~0 4294967296) 0) (<= 18 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {28257#false} is VALID [2022-04-28 10:07:46,491 INFO L290 TraceCheckUtils]: 27: Hoare triple {28257#false} assume !(~y~0 % 4294967296 > 0); {28257#false} is VALID [2022-04-28 10:07:46,491 INFO L272 TraceCheckUtils]: 28: Hoare triple {28257#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {28257#false} is VALID [2022-04-28 10:07:46,491 INFO L290 TraceCheckUtils]: 29: Hoare triple {28257#false} ~cond := #in~cond; {28257#false} is VALID [2022-04-28 10:07:46,491 INFO L290 TraceCheckUtils]: 30: Hoare triple {28257#false} assume 0 == ~cond; {28257#false} is VALID [2022-04-28 10:07:46,491 INFO L290 TraceCheckUtils]: 31: Hoare triple {28257#false} assume !false; {28257#false} is VALID [2022-04-28 10:07:46,492 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:07:46,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:07:46,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872210312] [2022-04-28 10:07:46,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872210312] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:07:46,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [745193376] [2022-04-28 10:07:46,492 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:07:46,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:07:46,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:07:46,493 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:07:46,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2022-04-28 10:07:46,764 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2022-04-28 10:07:46,765 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:07:46,766 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 41 conjunts are in the unsatisfiable core [2022-04-28 10:07:46,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:07:46,773 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:07:47,061 INFO L272 TraceCheckUtils]: 0: Hoare triple {28256#true} call ULTIMATE.init(); {28256#true} is VALID [2022-04-28 10:07:47,062 INFO L290 TraceCheckUtils]: 1: Hoare triple {28256#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(10, 2);call #Ultimate.allocInit(12, 3); {28256#true} is VALID [2022-04-28 10:07:47,062 INFO L290 TraceCheckUtils]: 2: Hoare triple {28256#true} assume true; {28256#true} is VALID [2022-04-28 10:07:47,062 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28256#true} {28256#true} #61#return; {28256#true} is VALID [2022-04-28 10:07:47,062 INFO L272 TraceCheckUtils]: 4: Hoare triple {28256#true} call #t~ret11 := main(); {28256#true} is VALID [2022-04-28 10:07:47,062 INFO L290 TraceCheckUtils]: 5: Hoare triple {28256#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {28261#(= main_~y~0 0)} is VALID [2022-04-28 10:07:47,062 INFO L290 TraceCheckUtils]: 6: Hoare triple {28261#(= 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; {28262#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:07:47,063 INFO L290 TraceCheckUtils]: 7: Hoare triple {28262#(and (<= 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; {28263#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:07:47,063 INFO L290 TraceCheckUtils]: 8: Hoare triple {28263#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {28264#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:07:47,064 INFO L290 TraceCheckUtils]: 9: Hoare triple {28264#(and (<= main_~y~0 3) (<= 3 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; {28265#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:07:47,064 INFO L290 TraceCheckUtils]: 10: Hoare triple {28265#(and (<= main_~y~0 4) (<= 4 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; {28266#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:07:47,065 INFO L290 TraceCheckUtils]: 11: Hoare triple {28266#(and (<= 5 main_~y~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; {28267#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:07:47,065 INFO L290 TraceCheckUtils]: 12: Hoare triple {28267#(and (<= main_~y~0 6) (<= 6 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; {28268#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:07:47,066 INFO L290 TraceCheckUtils]: 13: Hoare triple {28268#(and (<= 7 main_~y~0) (<= main_~y~0 7))} 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; {28269#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:07:47,066 INFO L290 TraceCheckUtils]: 14: Hoare triple {28269#(and (<= main_~y~0 8) (<= 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; {28270#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:07:47,067 INFO L290 TraceCheckUtils]: 15: Hoare triple {28270#(and (<= 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; {28271#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:07:47,067 INFO L290 TraceCheckUtils]: 16: Hoare triple {28271#(and (<= main_~y~0 10) (<= 10 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; {28272#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:07:47,068 INFO L290 TraceCheckUtils]: 17: Hoare triple {28272#(and (<= main_~y~0 11) (<= 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; {28273#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:07:47,068 INFO L290 TraceCheckUtils]: 18: Hoare triple {28273#(and (<= 12 main_~y~0) (<= main_~y~0 12))} 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; {28274#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:07:47,069 INFO L290 TraceCheckUtils]: 19: Hoare triple {28274#(and (<= main_~y~0 13) (<= 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; {28275#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:07:47,069 INFO L290 TraceCheckUtils]: 20: Hoare triple {28275#(and (<= 14 main_~y~0) (<= main_~y~0 14))} 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; {28276#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:07:47,070 INFO L290 TraceCheckUtils]: 21: Hoare triple {28276#(and (<= main_~y~0 15) (<= 15 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; {28277#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:07:47,070 INFO L290 TraceCheckUtils]: 22: Hoare triple {28277#(and (<= 16 main_~y~0) (<= main_~y~0 16))} 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; {28278#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:07:47,071 INFO L290 TraceCheckUtils]: 23: Hoare triple {28278#(and (<= main_~y~0 17) (<= 17 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; {28279#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 10:07:47,071 INFO L290 TraceCheckUtils]: 24: Hoare triple {28279#(and (<= 18 main_~y~0) (<= main_~y~0 18))} assume !(~x~0 % 4294967296 > 0); {28279#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 10:07:47,071 INFO L290 TraceCheckUtils]: 25: Hoare triple {28279#(and (<= 18 main_~y~0) (<= main_~y~0 18))} ~z~0 := ~y~0; {28360#(and (<= 18 main_~z~0) (<= main_~z~0 18))} is VALID [2022-04-28 10:07:47,072 INFO L290 TraceCheckUtils]: 26: Hoare triple {28360#(and (<= 18 main_~z~0) (<= main_~z~0 18))} assume !(~z~0 % 4294967296 > 0); {28257#false} is VALID [2022-04-28 10:07:47,072 INFO L290 TraceCheckUtils]: 27: Hoare triple {28257#false} assume !(~y~0 % 4294967296 > 0); {28257#false} is VALID [2022-04-28 10:07:47,072 INFO L272 TraceCheckUtils]: 28: Hoare triple {28257#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {28257#false} is VALID [2022-04-28 10:07:47,072 INFO L290 TraceCheckUtils]: 29: Hoare triple {28257#false} ~cond := #in~cond; {28257#false} is VALID [2022-04-28 10:07:47,072 INFO L290 TraceCheckUtils]: 30: Hoare triple {28257#false} assume 0 == ~cond; {28257#false} is VALID [2022-04-28 10:07:47,072 INFO L290 TraceCheckUtils]: 31: Hoare triple {28257#false} assume !false; {28257#false} is VALID [2022-04-28 10:07:47,072 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:07:47,072 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:07:47,731 INFO L290 TraceCheckUtils]: 31: Hoare triple {28257#false} assume !false; {28257#false} is VALID [2022-04-28 10:07:47,732 INFO L290 TraceCheckUtils]: 30: Hoare triple {28257#false} assume 0 == ~cond; {28257#false} is VALID [2022-04-28 10:07:47,732 INFO L290 TraceCheckUtils]: 29: Hoare triple {28257#false} ~cond := #in~cond; {28257#false} is VALID [2022-04-28 10:07:47,732 INFO L272 TraceCheckUtils]: 28: Hoare triple {28257#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {28257#false} is VALID [2022-04-28 10:07:47,732 INFO L290 TraceCheckUtils]: 27: Hoare triple {28257#false} assume !(~y~0 % 4294967296 > 0); {28257#false} is VALID [2022-04-28 10:07:47,732 INFO L290 TraceCheckUtils]: 26: Hoare triple {28394#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {28257#false} is VALID [2022-04-28 10:07:47,732 INFO L290 TraceCheckUtils]: 25: Hoare triple {28398#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {28394#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:07:47,732 INFO L290 TraceCheckUtils]: 24: Hoare triple {28398#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {28398#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:07:47,733 INFO L290 TraceCheckUtils]: 23: Hoare triple {28405#(< 0 (mod (+ main_~y~0 1) 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; {28398#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:07:47,734 INFO L290 TraceCheckUtils]: 22: Hoare triple {28409#(< 0 (mod (+ main_~y~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; {28405#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:07:47,734 INFO L290 TraceCheckUtils]: 21: Hoare triple {28413#(< 0 (mod (+ main_~y~0 3) 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; {28409#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:07:47,735 INFO L290 TraceCheckUtils]: 20: Hoare triple {28417#(< 0 (mod (+ main_~y~0 4) 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; {28413#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:07:47,736 INFO L290 TraceCheckUtils]: 19: Hoare triple {28421#(< 0 (mod (+ 5 main_~y~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; {28417#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:07:47,736 INFO L290 TraceCheckUtils]: 18: Hoare triple {28425#(< 0 (mod (+ main_~y~0 6) 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; {28421#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:07:47,737 INFO L290 TraceCheckUtils]: 17: Hoare triple {28429#(< 0 (mod (+ 7 main_~y~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; {28425#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:07:47,737 INFO L290 TraceCheckUtils]: 16: Hoare triple {28433#(< 0 (mod (+ main_~y~0 8) 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; {28429#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:07:47,738 INFO L290 TraceCheckUtils]: 15: Hoare triple {28437#(< 0 (mod (+ main_~y~0 9) 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; {28433#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:07:47,739 INFO L290 TraceCheckUtils]: 14: Hoare triple {28441#(< 0 (mod (+ main_~y~0 10) 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; {28437#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:07:47,739 INFO L290 TraceCheckUtils]: 13: Hoare triple {28445#(< 0 (mod (+ main_~y~0 11) 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; {28441#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-28 10:07:47,740 INFO L290 TraceCheckUtils]: 12: Hoare triple {28449#(< 0 (mod (+ main_~y~0 12) 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; {28445#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-28 10:07:47,741 INFO L290 TraceCheckUtils]: 11: Hoare triple {28453#(< 0 (mod (+ main_~y~0 13) 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; {28449#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-28 10:07:47,741 INFO L290 TraceCheckUtils]: 10: Hoare triple {28457#(< 0 (mod (+ main_~y~0 14) 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; {28453#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-28 10:07:47,742 INFO L290 TraceCheckUtils]: 9: Hoare triple {28461#(< 0 (mod (+ main_~y~0 15) 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; {28457#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-28 10:07:47,742 INFO L290 TraceCheckUtils]: 8: Hoare triple {28465#(< 0 (mod (+ main_~y~0 16) 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; {28461#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID [2022-04-28 10:07:47,743 INFO L290 TraceCheckUtils]: 7: Hoare triple {28469#(< 0 (mod (+ main_~y~0 17) 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; {28465#(< 0 (mod (+ main_~y~0 16) 4294967296))} is VALID [2022-04-28 10:07:47,744 INFO L290 TraceCheckUtils]: 6: Hoare triple {28473#(< 0 (mod (+ main_~y~0 18) 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; {28469#(< 0 (mod (+ main_~y~0 17) 4294967296))} is VALID [2022-04-28 10:07:47,744 INFO L290 TraceCheckUtils]: 5: Hoare triple {28256#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {28473#(< 0 (mod (+ main_~y~0 18) 4294967296))} is VALID [2022-04-28 10:07:47,744 INFO L272 TraceCheckUtils]: 4: Hoare triple {28256#true} call #t~ret11 := main(); {28256#true} is VALID [2022-04-28 10:07:47,744 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28256#true} {28256#true} #61#return; {28256#true} is VALID [2022-04-28 10:07:47,744 INFO L290 TraceCheckUtils]: 2: Hoare triple {28256#true} assume true; {28256#true} is VALID [2022-04-28 10:07:47,744 INFO L290 TraceCheckUtils]: 1: Hoare triple {28256#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(10, 2);call #Ultimate.allocInit(12, 3); {28256#true} is VALID [2022-04-28 10:07:47,744 INFO L272 TraceCheckUtils]: 0: Hoare triple {28256#true} call ULTIMATE.init(); {28256#true} is VALID [2022-04-28 10:07:47,744 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:07:47,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [745193376] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:07:47,745 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:07:47,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 44 [2022-04-28 10:07:47,745 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:07:47,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [709541179] [2022-04-28 10:07:47,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [709541179] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:07:47,745 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:07:47,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-28 10:07:47,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528605936] [2022-04-28 10:07:47,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:07:47,745 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 22 states have internal predecessors, (28), 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 32 [2022-04-28 10:07:47,745 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:07:47,745 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 23 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 22 states have internal predecessors, (28), 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-28 10:07:47,763 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:07:47,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-28 10:07:47,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:07:47,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-28 10:07:47,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=448, Invalid=1444, Unknown=0, NotChecked=0, Total=1892 [2022-04-28 10:07:47,764 INFO L87 Difference]: Start difference. First operand 90 states and 114 transitions. Second operand has 23 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 22 states have internal predecessors, (28), 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-28 10:07:50,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:07:50,592 INFO L93 Difference]: Finished difference Result 120 states and 166 transitions. [2022-04-28 10:07:50,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-28 10:07:50,592 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 22 states have internal predecessors, (28), 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 32 [2022-04-28 10:07:50,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:07:50,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 22 states have internal predecessors, (28), 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-28 10:07:50,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 131 transitions. [2022-04-28 10:07:50,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 22 states have internal predecessors, (28), 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-28 10:07:50,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 131 transitions. [2022-04-28 10:07:50,594 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 131 transitions. [2022-04-28 10:07:50,691 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 131 edges. 131 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:07:50,692 INFO L225 Difference]: With dead ends: 120 [2022-04-28 10:07:50,692 INFO L226 Difference]: Without dead ends: 114 [2022-04-28 10:07:50,692 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=910, Invalid=3122, Unknown=0, NotChecked=0, Total=4032 [2022-04-28 10:07:50,692 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 108 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 1786 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 1865 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 1786 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-04-28 10:07:50,693 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 147 Invalid, 1865 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 1786 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-04-28 10:07:50,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-04-28 10:07:50,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 95. [2022-04-28 10:07:50,785 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:07:50,786 INFO L82 GeneralOperation]: Start isEquivalent. First operand 114 states. Second operand has 95 states, 90 states have (on average 1.3) internal successors, (117), 90 states have internal predecessors, (117), 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-28 10:07:50,786 INFO L74 IsIncluded]: Start isIncluded. First operand 114 states. Second operand has 95 states, 90 states have (on average 1.3) internal successors, (117), 90 states have internal predecessors, (117), 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-28 10:07:50,786 INFO L87 Difference]: Start difference. First operand 114 states. Second operand has 95 states, 90 states have (on average 1.3) internal successors, (117), 90 states have internal predecessors, (117), 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-28 10:07:50,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:07:50,787 INFO L93 Difference]: Finished difference Result 114 states and 140 transitions. [2022-04-28 10:07:50,787 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 140 transitions. [2022-04-28 10:07:50,787 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:07:50,787 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:07:50,787 INFO L74 IsIncluded]: Start isIncluded. First operand has 95 states, 90 states have (on average 1.3) internal successors, (117), 90 states have internal predecessors, (117), 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 114 states. [2022-04-28 10:07:50,787 INFO L87 Difference]: Start difference. First operand has 95 states, 90 states have (on average 1.3) internal successors, (117), 90 states have internal predecessors, (117), 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 114 states. [2022-04-28 10:07:50,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:07:50,788 INFO L93 Difference]: Finished difference Result 114 states and 140 transitions. [2022-04-28 10:07:50,788 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 140 transitions. [2022-04-28 10:07:50,788 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:07:50,788 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:07:50,788 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:07:50,788 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:07:50,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 90 states have (on average 1.3) internal successors, (117), 90 states have internal predecessors, (117), 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-28 10:07:50,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 121 transitions. [2022-04-28 10:07:50,789 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 121 transitions. Word has length 32 [2022-04-28 10:07:50,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:07:50,789 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 121 transitions. [2022-04-28 10:07:50,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 22 states have internal predecessors, (28), 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-28 10:07:50,789 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 95 states and 121 transitions. [2022-04-28 10:07:55,044 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 121 edges. 119 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-28 10:07:55,044 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 121 transitions. [2022-04-28 10:07:55,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-28 10:07:55,044 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:07:55,044 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:07:55,048 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Forceful destruction successful, exit code 0 [2022-04-28 10:07:55,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46,47 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:07:55,245 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:07:55,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:07:55,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1621968767, now seen corresponding path program 57 times [2022-04-28 10:07:55,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:07:55,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1690360158] [2022-04-28 10:07:55,247 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:07:55,247 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:07:55,247 INFO L85 PathProgramCache]: Analyzing trace with hash 1621968767, now seen corresponding path program 58 times [2022-04-28 10:07:55,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:07:55,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769477599] [2022-04-28 10:07:55,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:07:55,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:07:55,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:07:55,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:07:55,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:07:55,460 INFO L290 TraceCheckUtils]: 0: Hoare triple {29211#(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(10, 2);call #Ultimate.allocInit(12, 3); {29192#true} is VALID [2022-04-28 10:07:55,460 INFO L290 TraceCheckUtils]: 1: Hoare triple {29192#true} assume true; {29192#true} is VALID [2022-04-28 10:07:55,460 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29192#true} {29192#true} #61#return; {29192#true} is VALID [2022-04-28 10:07:55,461 INFO L272 TraceCheckUtils]: 0: Hoare triple {29192#true} call ULTIMATE.init(); {29211#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:07:55,461 INFO L290 TraceCheckUtils]: 1: Hoare triple {29211#(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(10, 2);call #Ultimate.allocInit(12, 3); {29192#true} is VALID [2022-04-28 10:07:55,461 INFO L290 TraceCheckUtils]: 2: Hoare triple {29192#true} assume true; {29192#true} is VALID [2022-04-28 10:07:55,461 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29192#true} {29192#true} #61#return; {29192#true} is VALID [2022-04-28 10:07:55,461 INFO L272 TraceCheckUtils]: 4: Hoare triple {29192#true} call #t~ret11 := main(); {29192#true} is VALID [2022-04-28 10:07:55,461 INFO L290 TraceCheckUtils]: 5: Hoare triple {29192#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {29197#(= main_~y~0 0)} is VALID [2022-04-28 10:07:55,461 INFO L290 TraceCheckUtils]: 6: Hoare triple {29197#(= 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; {29198#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:07:55,462 INFO L290 TraceCheckUtils]: 7: Hoare triple {29198#(and (<= 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; {29199#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:07:55,463 INFO L290 TraceCheckUtils]: 8: Hoare triple {29199#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {29200#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:07:55,463 INFO L290 TraceCheckUtils]: 9: Hoare triple {29200#(and (<= main_~y~0 3) (<= 3 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; {29201#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:07:55,464 INFO L290 TraceCheckUtils]: 10: Hoare triple {29201#(and (<= main_~y~0 4) (<= 4 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; {29202#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:07:55,464 INFO L290 TraceCheckUtils]: 11: Hoare triple {29202#(and (<= 5 main_~y~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; {29203#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:07:55,465 INFO L290 TraceCheckUtils]: 12: Hoare triple {29203#(and (<= main_~y~0 6) (<= 6 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; {29204#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:07:55,465 INFO L290 TraceCheckUtils]: 13: Hoare triple {29204#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {29204#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:07:55,465 INFO L290 TraceCheckUtils]: 14: Hoare triple {29204#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {29205#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:07:55,466 INFO L290 TraceCheckUtils]: 15: Hoare triple {29205#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {29206#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:07:55,466 INFO L290 TraceCheckUtils]: 16: Hoare triple {29206#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {29207#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:07:55,467 INFO L290 TraceCheckUtils]: 17: Hoare triple {29207#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {29208#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:07:55,468 INFO L290 TraceCheckUtils]: 18: Hoare triple {29208#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {29209#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:07:55,468 INFO L290 TraceCheckUtils]: 19: Hoare triple {29209#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {29210#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} is VALID [2022-04-28 10:07:55,468 INFO L290 TraceCheckUtils]: 20: Hoare triple {29210#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {29193#false} is VALID [2022-04-28 10:07:55,469 INFO L290 TraceCheckUtils]: 21: Hoare triple {29193#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {29193#false} is VALID [2022-04-28 10:07:55,469 INFO L290 TraceCheckUtils]: 22: Hoare triple {29193#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {29193#false} is VALID [2022-04-28 10:07:55,469 INFO L290 TraceCheckUtils]: 23: Hoare triple {29193#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {29193#false} is VALID [2022-04-28 10:07:55,469 INFO L290 TraceCheckUtils]: 24: Hoare triple {29193#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {29193#false} is VALID [2022-04-28 10:07:55,469 INFO L290 TraceCheckUtils]: 25: Hoare triple {29193#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {29193#false} is VALID [2022-04-28 10:07:55,469 INFO L290 TraceCheckUtils]: 26: Hoare triple {29193#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {29193#false} is VALID [2022-04-28 10:07:55,469 INFO L290 TraceCheckUtils]: 27: Hoare triple {29193#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {29193#false} is VALID [2022-04-28 10:07:55,469 INFO L290 TraceCheckUtils]: 28: Hoare triple {29193#false} assume !(~y~0 % 4294967296 > 0); {29193#false} is VALID [2022-04-28 10:07:55,469 INFO L272 TraceCheckUtils]: 29: Hoare triple {29193#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {29193#false} is VALID [2022-04-28 10:07:55,469 INFO L290 TraceCheckUtils]: 30: Hoare triple {29193#false} ~cond := #in~cond; {29193#false} is VALID [2022-04-28 10:07:55,469 INFO L290 TraceCheckUtils]: 31: Hoare triple {29193#false} assume 0 == ~cond; {29193#false} is VALID [2022-04-28 10:07:55,469 INFO L290 TraceCheckUtils]: 32: Hoare triple {29193#false} assume !false; {29193#false} is VALID [2022-04-28 10:07:55,469 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-28 10:07:55,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:07:55,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769477599] [2022-04-28 10:07:55,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769477599] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:07:55,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [175844271] [2022-04-28 10:07:55,470 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:07:55,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:07:55,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:07:55,470 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:07:55,471 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Waiting until timeout for monitored process [2022-04-28 10:07:55,510 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:07:55,511 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:07:55,511 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 40 conjunts are in the unsatisfiable core [2022-04-28 10:07:55,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:07:55,519 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:07:55,794 INFO L272 TraceCheckUtils]: 0: Hoare triple {29192#true} call ULTIMATE.init(); {29192#true} is VALID [2022-04-28 10:07:55,794 INFO L290 TraceCheckUtils]: 1: Hoare triple {29192#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(10, 2);call #Ultimate.allocInit(12, 3); {29192#true} is VALID [2022-04-28 10:07:55,794 INFO L290 TraceCheckUtils]: 2: Hoare triple {29192#true} assume true; {29192#true} is VALID [2022-04-28 10:07:55,794 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29192#true} {29192#true} #61#return; {29192#true} is VALID [2022-04-28 10:07:55,794 INFO L272 TraceCheckUtils]: 4: Hoare triple {29192#true} call #t~ret11 := main(); {29192#true} is VALID [2022-04-28 10:07:55,794 INFO L290 TraceCheckUtils]: 5: Hoare triple {29192#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {29197#(= main_~y~0 0)} is VALID [2022-04-28 10:07:55,795 INFO L290 TraceCheckUtils]: 6: Hoare triple {29197#(= 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; {29198#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:07:55,795 INFO L290 TraceCheckUtils]: 7: Hoare triple {29198#(and (<= 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; {29199#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:07:55,796 INFO L290 TraceCheckUtils]: 8: Hoare triple {29199#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {29200#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:07:55,796 INFO L290 TraceCheckUtils]: 9: Hoare triple {29200#(and (<= main_~y~0 3) (<= 3 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; {29201#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:07:55,797 INFO L290 TraceCheckUtils]: 10: Hoare triple {29201#(and (<= main_~y~0 4) (<= 4 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; {29202#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:07:55,797 INFO L290 TraceCheckUtils]: 11: Hoare triple {29202#(and (<= 5 main_~y~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; {29203#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:07:55,798 INFO L290 TraceCheckUtils]: 12: Hoare triple {29203#(and (<= main_~y~0 6) (<= 6 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; {29204#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:07:55,798 INFO L290 TraceCheckUtils]: 13: Hoare triple {29204#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {29204#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:07:55,798 INFO L290 TraceCheckUtils]: 14: Hoare triple {29204#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {29257#(and (= main_~z~0 main_~y~0) (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:07:55,799 INFO L290 TraceCheckUtils]: 15: Hoare triple {29257#(and (= main_~z~0 main_~y~0) (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {29261#(and (<= 7 main_~y~0) (<= main_~y~0 7) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-28 10:07:55,799 INFO L290 TraceCheckUtils]: 16: Hoare triple {29261#(and (<= 7 main_~y~0) (<= main_~y~0 7) (= main_~y~0 (+ main_~z~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {29265#(and (<= 7 main_~y~0) (<= main_~y~0 7) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)))} is VALID [2022-04-28 10:07:55,800 INFO L290 TraceCheckUtils]: 17: Hoare triple {29265#(and (<= 7 main_~y~0) (<= main_~y~0 7) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {29269#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:07:55,800 INFO L290 TraceCheckUtils]: 18: Hoare triple {29269#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {29273#(and (= (+ main_~y~0 (- 3)) (+ main_~z~0 1)) (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:07:55,801 INFO L290 TraceCheckUtils]: 19: Hoare triple {29273#(and (= (+ main_~y~0 (- 3)) (+ main_~z~0 1)) (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {29277#(and (<= 7 main_~y~0) (<= main_~y~0 7) (= (+ main_~y~0 (- 3)) (+ main_~z~0 2)))} is VALID [2022-04-28 10:07:55,801 INFO L290 TraceCheckUtils]: 20: Hoare triple {29277#(and (<= 7 main_~y~0) (<= main_~y~0 7) (= (+ main_~y~0 (- 3)) (+ main_~z~0 2)))} assume !(~z~0 % 4294967296 > 0); {29193#false} is VALID [2022-04-28 10:07:55,801 INFO L290 TraceCheckUtils]: 21: Hoare triple {29193#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {29193#false} is VALID [2022-04-28 10:07:55,801 INFO L290 TraceCheckUtils]: 22: Hoare triple {29193#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {29193#false} is VALID [2022-04-28 10:07:55,802 INFO L290 TraceCheckUtils]: 23: Hoare triple {29193#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {29193#false} is VALID [2022-04-28 10:07:55,802 INFO L290 TraceCheckUtils]: 24: Hoare triple {29193#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {29193#false} is VALID [2022-04-28 10:07:55,802 INFO L290 TraceCheckUtils]: 25: Hoare triple {29193#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {29193#false} is VALID [2022-04-28 10:07:55,802 INFO L290 TraceCheckUtils]: 26: Hoare triple {29193#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {29193#false} is VALID [2022-04-28 10:07:55,802 INFO L290 TraceCheckUtils]: 27: Hoare triple {29193#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {29193#false} is VALID [2022-04-28 10:07:55,802 INFO L290 TraceCheckUtils]: 28: Hoare triple {29193#false} assume !(~y~0 % 4294967296 > 0); {29193#false} is VALID [2022-04-28 10:07:55,802 INFO L272 TraceCheckUtils]: 29: Hoare triple {29193#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {29193#false} is VALID [2022-04-28 10:07:55,802 INFO L290 TraceCheckUtils]: 30: Hoare triple {29193#false} ~cond := #in~cond; {29193#false} is VALID [2022-04-28 10:07:55,802 INFO L290 TraceCheckUtils]: 31: Hoare triple {29193#false} assume 0 == ~cond; {29193#false} is VALID [2022-04-28 10:07:55,802 INFO L290 TraceCheckUtils]: 32: Hoare triple {29193#false} assume !false; {29193#false} is VALID [2022-04-28 10:07:55,802 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-28 10:07:55,802 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:07:56,167 INFO L290 TraceCheckUtils]: 32: Hoare triple {29193#false} assume !false; {29193#false} is VALID [2022-04-28 10:07:56,167 INFO L290 TraceCheckUtils]: 31: Hoare triple {29193#false} assume 0 == ~cond; {29193#false} is VALID [2022-04-28 10:07:56,167 INFO L290 TraceCheckUtils]: 30: Hoare triple {29193#false} ~cond := #in~cond; {29193#false} is VALID [2022-04-28 10:07:56,167 INFO L272 TraceCheckUtils]: 29: Hoare triple {29193#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {29193#false} is VALID [2022-04-28 10:07:56,167 INFO L290 TraceCheckUtils]: 28: Hoare triple {29193#false} assume !(~y~0 % 4294967296 > 0); {29193#false} is VALID [2022-04-28 10:07:56,167 INFO L290 TraceCheckUtils]: 27: Hoare triple {29193#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {29193#false} is VALID [2022-04-28 10:07:56,167 INFO L290 TraceCheckUtils]: 26: Hoare triple {29335#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {29193#false} is VALID [2022-04-28 10:07:56,168 INFO L290 TraceCheckUtils]: 25: Hoare triple {29339#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {29335#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:07:56,169 INFO L290 TraceCheckUtils]: 24: Hoare triple {29343#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {29339#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:07:56,170 INFO L290 TraceCheckUtils]: 23: Hoare triple {29347#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {29343#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-28 10:07:56,170 INFO L290 TraceCheckUtils]: 22: Hoare triple {29351#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {29347#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-28 10:07:56,171 INFO L290 TraceCheckUtils]: 21: Hoare triple {29355#(not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {29351#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:07:56,171 INFO L290 TraceCheckUtils]: 20: Hoare triple {29359#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296))) (< 0 (mod main_~z~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {29355#(not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:07:56,173 INFO L290 TraceCheckUtils]: 19: Hoare triple {29363#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {29359#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-28 10:07:56,174 INFO L290 TraceCheckUtils]: 18: Hoare triple {29367#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296))) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {29363#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:07:56,174 INFO L290 TraceCheckUtils]: 17: Hoare triple {29371#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {29367#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296))) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)))} is VALID [2022-04-28 10:07:56,175 INFO L290 TraceCheckUtils]: 16: Hoare triple {29375#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296))) (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {29371#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} is VALID [2022-04-28 10:07:56,176 INFO L290 TraceCheckUtils]: 15: Hoare triple {29379#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296))) (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {29375#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296))) (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)))} is VALID [2022-04-28 10:07:56,176 INFO L290 TraceCheckUtils]: 14: Hoare triple {29192#true} ~z~0 := ~y~0; {29379#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296))) (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)))} is VALID [2022-04-28 10:07:56,176 INFO L290 TraceCheckUtils]: 13: Hoare triple {29192#true} assume !(~x~0 % 4294967296 > 0); {29192#true} is VALID [2022-04-28 10:07:56,176 INFO L290 TraceCheckUtils]: 12: Hoare triple {29192#true} 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; {29192#true} is VALID [2022-04-28 10:07:56,176 INFO L290 TraceCheckUtils]: 11: Hoare triple {29192#true} 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; {29192#true} is VALID [2022-04-28 10:07:56,177 INFO L290 TraceCheckUtils]: 10: Hoare triple {29192#true} 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; {29192#true} is VALID [2022-04-28 10:07:56,177 INFO L290 TraceCheckUtils]: 9: Hoare triple {29192#true} 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; {29192#true} is VALID [2022-04-28 10:07:56,177 INFO L290 TraceCheckUtils]: 8: Hoare triple {29192#true} 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; {29192#true} is VALID [2022-04-28 10:07:56,177 INFO L290 TraceCheckUtils]: 7: Hoare triple {29192#true} 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; {29192#true} is VALID [2022-04-28 10:07:56,177 INFO L290 TraceCheckUtils]: 6: Hoare triple {29192#true} 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; {29192#true} is VALID [2022-04-28 10:07:56,177 INFO L290 TraceCheckUtils]: 5: Hoare triple {29192#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {29192#true} is VALID [2022-04-28 10:07:56,177 INFO L272 TraceCheckUtils]: 4: Hoare triple {29192#true} call #t~ret11 := main(); {29192#true} is VALID [2022-04-28 10:07:56,177 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29192#true} {29192#true} #61#return; {29192#true} is VALID [2022-04-28 10:07:56,177 INFO L290 TraceCheckUtils]: 2: Hoare triple {29192#true} assume true; {29192#true} is VALID [2022-04-28 10:07:56,177 INFO L290 TraceCheckUtils]: 1: Hoare triple {29192#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(10, 2);call #Ultimate.allocInit(12, 3); {29192#true} is VALID [2022-04-28 10:07:56,177 INFO L272 TraceCheckUtils]: 0: Hoare triple {29192#true} call ULTIMATE.init(); {29192#true} is VALID [2022-04-28 10:07:56,177 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 12 proven. 30 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-04-28 10:07:56,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [175844271] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:07:56,177 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:07:56,177 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 14] total 35 [2022-04-28 10:07:56,178 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:07:56,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1690360158] [2022-04-28 10:07:56,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1690360158] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:07:56,178 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:07:56,178 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-28 10:07:56,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708267456] [2022-04-28 10:07:56,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:07:56,178 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 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 33 [2022-04-28 10:07:56,178 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:07:56,178 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 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-28 10:07:56,195 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:07:56,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-28 10:07:56,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:07:56,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-28 10:07:56,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=1022, Unknown=0, NotChecked=0, Total=1190 [2022-04-28 10:07:56,196 INFO L87 Difference]: Start difference. First operand 95 states and 121 transitions. Second operand has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 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-28 10:07:57,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:07:57,034 INFO L93 Difference]: Finished difference Result 118 states and 144 transitions. [2022-04-28 10:07:57,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-28 10:07:57,034 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 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 33 [2022-04-28 10:07:57,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:07:57,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 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-28 10:07:57,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 51 transitions. [2022-04-28 10:07:57,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 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-28 10:07:57,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 51 transitions. [2022-04-28 10:07:57,035 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 51 transitions. [2022-04-28 10:07:57,072 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:07:57,073 INFO L225 Difference]: With dead ends: 118 [2022-04-28 10:07:57,073 INFO L226 Difference]: Without dead ends: 105 [2022-04-28 10:07:57,073 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 354 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=292, Invalid=2060, Unknown=0, NotChecked=0, Total=2352 [2022-04-28 10:07:57,074 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 17 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 10:07:57,074 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 63 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 10:07:57,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-04-28 10:07:57,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 96. [2022-04-28 10:07:57,167 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:07:57,167 INFO L82 GeneralOperation]: Start isEquivalent. First operand 105 states. Second operand has 96 states, 91 states have (on average 1.2967032967032968) internal successors, (118), 91 states have internal predecessors, (118), 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-28 10:07:57,167 INFO L74 IsIncluded]: Start isIncluded. First operand 105 states. Second operand has 96 states, 91 states have (on average 1.2967032967032968) internal successors, (118), 91 states have internal predecessors, (118), 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-28 10:07:57,168 INFO L87 Difference]: Start difference. First operand 105 states. Second operand has 96 states, 91 states have (on average 1.2967032967032968) internal successors, (118), 91 states have internal predecessors, (118), 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-28 10:07:57,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:07:57,168 INFO L93 Difference]: Finished difference Result 105 states and 131 transitions. [2022-04-28 10:07:57,168 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 131 transitions. [2022-04-28 10:07:57,169 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:07:57,169 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:07:57,169 INFO L74 IsIncluded]: Start isIncluded. First operand has 96 states, 91 states have (on average 1.2967032967032968) internal successors, (118), 91 states have internal predecessors, (118), 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 105 states. [2022-04-28 10:07:57,169 INFO L87 Difference]: Start difference. First operand has 96 states, 91 states have (on average 1.2967032967032968) internal successors, (118), 91 states have internal predecessors, (118), 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 105 states. [2022-04-28 10:07:57,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:07:57,170 INFO L93 Difference]: Finished difference Result 105 states and 131 transitions. [2022-04-28 10:07:57,170 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 131 transitions. [2022-04-28 10:07:57,170 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:07:57,170 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:07:57,170 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:07:57,170 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:07:57,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 91 states have (on average 1.2967032967032968) internal successors, (118), 91 states have internal predecessors, (118), 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-28 10:07:57,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 122 transitions. [2022-04-28 10:07:57,171 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 122 transitions. Word has length 33 [2022-04-28 10:07:57,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:07:57,171 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 122 transitions. [2022-04-28 10:07:57,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 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-28 10:07:57,171 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 96 states and 122 transitions. [2022-04-28 10:07:58,436 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:07:58,436 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 122 transitions. [2022-04-28 10:07:58,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-28 10:07:58,436 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:07:58,436 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:07:58,452 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Forceful destruction successful, exit code 0 [2022-04-28 10:07:58,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 48 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2022-04-28 10:07:58,637 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:07:58,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:07:58,637 INFO L85 PathProgramCache]: Analyzing trace with hash -843221009, now seen corresponding path program 59 times [2022-04-28 10:07:58,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:07:58,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [558389416] [2022-04-28 10:07:58,639 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:07:58,639 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:07:58,639 INFO L85 PathProgramCache]: Analyzing trace with hash -843221009, now seen corresponding path program 60 times [2022-04-28 10:07:58,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:07:58,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137107574] [2022-04-28 10:07:58,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:07:58,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:07:58,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:07:58,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:07:58,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:07:58,828 INFO L290 TraceCheckUtils]: 0: Hoare triple {30111#(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(10, 2);call #Ultimate.allocInit(12, 3); {30093#true} is VALID [2022-04-28 10:07:58,828 INFO L290 TraceCheckUtils]: 1: Hoare triple {30093#true} assume true; {30093#true} is VALID [2022-04-28 10:07:58,828 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {30093#true} {30093#true} #61#return; {30093#true} is VALID [2022-04-28 10:07:58,828 INFO L272 TraceCheckUtils]: 0: Hoare triple {30093#true} call ULTIMATE.init(); {30111#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:07:58,828 INFO L290 TraceCheckUtils]: 1: Hoare triple {30111#(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(10, 2);call #Ultimate.allocInit(12, 3); {30093#true} is VALID [2022-04-28 10:07:58,828 INFO L290 TraceCheckUtils]: 2: Hoare triple {30093#true} assume true; {30093#true} is VALID [2022-04-28 10:07:58,829 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30093#true} {30093#true} #61#return; {30093#true} is VALID [2022-04-28 10:07:58,829 INFO L272 TraceCheckUtils]: 4: Hoare triple {30093#true} call #t~ret11 := main(); {30093#true} is VALID [2022-04-28 10:07:58,829 INFO L290 TraceCheckUtils]: 5: Hoare triple {30093#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {30098#(= main_~y~0 0)} is VALID [2022-04-28 10:07:58,829 INFO L290 TraceCheckUtils]: 6: Hoare triple {30098#(= 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; {30099#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:07:58,830 INFO L290 TraceCheckUtils]: 7: Hoare triple {30099#(and (<= 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; {30100#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:07:58,830 INFO L290 TraceCheckUtils]: 8: Hoare triple {30100#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {30101#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:07:58,831 INFO L290 TraceCheckUtils]: 9: Hoare triple {30101#(and (<= main_~y~0 3) (<= 3 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; {30102#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:07:58,831 INFO L290 TraceCheckUtils]: 10: Hoare triple {30102#(and (<= main_~y~0 4) (<= 4 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; {30103#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:07:58,832 INFO L290 TraceCheckUtils]: 11: Hoare triple {30103#(and (<= 5 main_~y~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; {30104#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:07:58,832 INFO L290 TraceCheckUtils]: 12: Hoare triple {30104#(and (<= main_~y~0 6) (<= 6 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; {30105#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:07:58,833 INFO L290 TraceCheckUtils]: 13: Hoare triple {30105#(and (<= 7 main_~y~0) (<= main_~y~0 7))} 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; {30106#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:07:58,833 INFO L290 TraceCheckUtils]: 14: Hoare triple {30106#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {30106#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:07:58,834 INFO L290 TraceCheckUtils]: 15: Hoare triple {30106#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {30107#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:07:58,834 INFO L290 TraceCheckUtils]: 16: Hoare triple {30107#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {30108#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:07:58,835 INFO L290 TraceCheckUtils]: 17: Hoare triple {30108#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {30109#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:07:58,835 INFO L290 TraceCheckUtils]: 18: Hoare triple {30109#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {30110#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:07:58,836 INFO L290 TraceCheckUtils]: 19: Hoare triple {30110#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {30094#false} is VALID [2022-04-28 10:07:58,836 INFO L290 TraceCheckUtils]: 20: Hoare triple {30094#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {30094#false} is VALID [2022-04-28 10:07:58,836 INFO L290 TraceCheckUtils]: 21: Hoare triple {30094#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {30094#false} is VALID [2022-04-28 10:07:58,836 INFO L290 TraceCheckUtils]: 22: Hoare triple {30094#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {30094#false} is VALID [2022-04-28 10:07:58,836 INFO L290 TraceCheckUtils]: 23: Hoare triple {30094#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {30094#false} is VALID [2022-04-28 10:07:58,836 INFO L290 TraceCheckUtils]: 24: Hoare triple {30094#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {30094#false} is VALID [2022-04-28 10:07:58,836 INFO L290 TraceCheckUtils]: 25: Hoare triple {30094#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {30094#false} is VALID [2022-04-28 10:07:58,836 INFO L290 TraceCheckUtils]: 26: Hoare triple {30094#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {30094#false} is VALID [2022-04-28 10:07:58,836 INFO L290 TraceCheckUtils]: 27: Hoare triple {30094#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {30094#false} is VALID [2022-04-28 10:07:58,836 INFO L290 TraceCheckUtils]: 28: Hoare triple {30094#false} assume !(~y~0 % 4294967296 > 0); {30094#false} is VALID [2022-04-28 10:07:58,836 INFO L272 TraceCheckUtils]: 29: Hoare triple {30094#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {30094#false} is VALID [2022-04-28 10:07:58,836 INFO L290 TraceCheckUtils]: 30: Hoare triple {30094#false} ~cond := #in~cond; {30094#false} is VALID [2022-04-28 10:07:58,836 INFO L290 TraceCheckUtils]: 31: Hoare triple {30094#false} assume 0 == ~cond; {30094#false} is VALID [2022-04-28 10:07:58,836 INFO L290 TraceCheckUtils]: 32: Hoare triple {30094#false} assume !false; {30094#false} is VALID [2022-04-28 10:07:58,836 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-28 10:07:58,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:07:58,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137107574] [2022-04-28 10:07:58,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137107574] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:07:58,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [126254044] [2022-04-28 10:07:58,837 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:07:58,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:07:58,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:07:58,838 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:07:58,839 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Waiting until timeout for monitored process [2022-04-28 10:07:58,909 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-28 10:07:58,910 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:07:58,910 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-28 10:07:58,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:07:58,918 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:07:59,133 INFO L272 TraceCheckUtils]: 0: Hoare triple {30093#true} call ULTIMATE.init(); {30093#true} is VALID [2022-04-28 10:07:59,133 INFO L290 TraceCheckUtils]: 1: Hoare triple {30093#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(10, 2);call #Ultimate.allocInit(12, 3); {30093#true} is VALID [2022-04-28 10:07:59,133 INFO L290 TraceCheckUtils]: 2: Hoare triple {30093#true} assume true; {30093#true} is VALID [2022-04-28 10:07:59,133 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30093#true} {30093#true} #61#return; {30093#true} is VALID [2022-04-28 10:07:59,134 INFO L272 TraceCheckUtils]: 4: Hoare triple {30093#true} call #t~ret11 := main(); {30093#true} is VALID [2022-04-28 10:07:59,134 INFO L290 TraceCheckUtils]: 5: Hoare triple {30093#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {30098#(= main_~y~0 0)} is VALID [2022-04-28 10:07:59,134 INFO L290 TraceCheckUtils]: 6: Hoare triple {30098#(= 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; {30099#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:07:59,135 INFO L290 TraceCheckUtils]: 7: Hoare triple {30099#(and (<= 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; {30100#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:07:59,135 INFO L290 TraceCheckUtils]: 8: Hoare triple {30100#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {30101#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:07:59,136 INFO L290 TraceCheckUtils]: 9: Hoare triple {30101#(and (<= main_~y~0 3) (<= 3 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; {30102#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:07:59,136 INFO L290 TraceCheckUtils]: 10: Hoare triple {30102#(and (<= main_~y~0 4) (<= 4 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; {30103#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:07:59,137 INFO L290 TraceCheckUtils]: 11: Hoare triple {30103#(and (<= 5 main_~y~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; {30104#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:07:59,137 INFO L290 TraceCheckUtils]: 12: Hoare triple {30104#(and (<= main_~y~0 6) (<= 6 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; {30105#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:07:59,138 INFO L290 TraceCheckUtils]: 13: Hoare triple {30105#(and (<= 7 main_~y~0) (<= main_~y~0 7))} 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; {30106#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:07:59,138 INFO L290 TraceCheckUtils]: 14: Hoare triple {30106#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {30106#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:07:59,138 INFO L290 TraceCheckUtils]: 15: Hoare triple {30106#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {30107#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:07:59,139 INFO L290 TraceCheckUtils]: 16: Hoare triple {30107#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {30108#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:07:59,139 INFO L290 TraceCheckUtils]: 17: Hoare triple {30108#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {30109#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:07:59,140 INFO L290 TraceCheckUtils]: 18: Hoare triple {30109#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {30169#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:07:59,140 INFO L290 TraceCheckUtils]: 19: Hoare triple {30169#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {30094#false} is VALID [2022-04-28 10:07:59,140 INFO L290 TraceCheckUtils]: 20: Hoare triple {30094#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {30094#false} is VALID [2022-04-28 10:07:59,140 INFO L290 TraceCheckUtils]: 21: Hoare triple {30094#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {30094#false} is VALID [2022-04-28 10:07:59,140 INFO L290 TraceCheckUtils]: 22: Hoare triple {30094#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {30094#false} is VALID [2022-04-28 10:07:59,140 INFO L290 TraceCheckUtils]: 23: Hoare triple {30094#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {30094#false} is VALID [2022-04-28 10:07:59,141 INFO L290 TraceCheckUtils]: 24: Hoare triple {30094#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {30094#false} is VALID [2022-04-28 10:07:59,141 INFO L290 TraceCheckUtils]: 25: Hoare triple {30094#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {30094#false} is VALID [2022-04-28 10:07:59,141 INFO L290 TraceCheckUtils]: 26: Hoare triple {30094#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {30094#false} is VALID [2022-04-28 10:07:59,141 INFO L290 TraceCheckUtils]: 27: Hoare triple {30094#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {30094#false} is VALID [2022-04-28 10:07:59,141 INFO L290 TraceCheckUtils]: 28: Hoare triple {30094#false} assume !(~y~0 % 4294967296 > 0); {30094#false} is VALID [2022-04-28 10:07:59,141 INFO L272 TraceCheckUtils]: 29: Hoare triple {30094#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {30094#false} is VALID [2022-04-28 10:07:59,141 INFO L290 TraceCheckUtils]: 30: Hoare triple {30094#false} ~cond := #in~cond; {30094#false} is VALID [2022-04-28 10:07:59,141 INFO L290 TraceCheckUtils]: 31: Hoare triple {30094#false} assume 0 == ~cond; {30094#false} is VALID [2022-04-28 10:07:59,141 INFO L290 TraceCheckUtils]: 32: Hoare triple {30094#false} assume !false; {30094#false} is VALID [2022-04-28 10:07:59,141 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-28 10:07:59,141 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:07:59,457 INFO L290 TraceCheckUtils]: 32: Hoare triple {30094#false} assume !false; {30094#false} is VALID [2022-04-28 10:07:59,457 INFO L290 TraceCheckUtils]: 31: Hoare triple {30094#false} assume 0 == ~cond; {30094#false} is VALID [2022-04-28 10:07:59,457 INFO L290 TraceCheckUtils]: 30: Hoare triple {30094#false} ~cond := #in~cond; {30094#false} is VALID [2022-04-28 10:07:59,457 INFO L272 TraceCheckUtils]: 29: Hoare triple {30094#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {30094#false} is VALID [2022-04-28 10:07:59,457 INFO L290 TraceCheckUtils]: 28: Hoare triple {30094#false} assume !(~y~0 % 4294967296 > 0); {30094#false} is VALID [2022-04-28 10:07:59,457 INFO L290 TraceCheckUtils]: 27: Hoare triple {30094#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {30094#false} is VALID [2022-04-28 10:07:59,457 INFO L290 TraceCheckUtils]: 26: Hoare triple {30094#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {30094#false} is VALID [2022-04-28 10:07:59,457 INFO L290 TraceCheckUtils]: 25: Hoare triple {30094#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {30094#false} is VALID [2022-04-28 10:07:59,457 INFO L290 TraceCheckUtils]: 24: Hoare triple {30094#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {30094#false} is VALID [2022-04-28 10:07:59,457 INFO L290 TraceCheckUtils]: 23: Hoare triple {30094#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {30094#false} is VALID [2022-04-28 10:07:59,457 INFO L290 TraceCheckUtils]: 22: Hoare triple {30094#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {30094#false} is VALID [2022-04-28 10:07:59,457 INFO L290 TraceCheckUtils]: 21: Hoare triple {30094#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {30094#false} is VALID [2022-04-28 10:07:59,457 INFO L290 TraceCheckUtils]: 20: Hoare triple {30094#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {30094#false} is VALID [2022-04-28 10:07:59,458 INFO L290 TraceCheckUtils]: 19: Hoare triple {30251#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {30094#false} is VALID [2022-04-28 10:07:59,458 INFO L290 TraceCheckUtils]: 18: Hoare triple {30255#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {30251#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:07:59,459 INFO L290 TraceCheckUtils]: 17: Hoare triple {30259#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {30255#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:07:59,460 INFO L290 TraceCheckUtils]: 16: Hoare triple {30263#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {30259#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-28 10:07:59,460 INFO L290 TraceCheckUtils]: 15: Hoare triple {30267#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} ~z~0 := ~y~0; {30263#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-28 10:07:59,460 INFO L290 TraceCheckUtils]: 14: Hoare triple {30267#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !(~x~0 % 4294967296 > 0); {30267#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 10:07:59,461 INFO L290 TraceCheckUtils]: 13: Hoare triple {30274#(< 0 (mod (+ main_~y~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; {30267#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 10:07:59,461 INFO L290 TraceCheckUtils]: 12: Hoare triple {30278#(< 0 (mod (+ main_~y~0 4294967295) 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; {30274#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:07:59,462 INFO L290 TraceCheckUtils]: 11: Hoare triple {30282#(< 0 (mod main_~y~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; {30278#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:07:59,463 INFO L290 TraceCheckUtils]: 10: Hoare triple {30286#(< 0 (mod (+ main_~y~0 1) 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; {30282#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:07:59,464 INFO L290 TraceCheckUtils]: 9: Hoare triple {30290#(< 0 (mod (+ main_~y~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; {30286#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:07:59,464 INFO L290 TraceCheckUtils]: 8: Hoare triple {30294#(< 0 (mod (+ main_~y~0 3) 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; {30290#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:07:59,465 INFO L290 TraceCheckUtils]: 7: Hoare triple {30298#(< 0 (mod (+ main_~y~0 4) 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; {30294#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:07:59,465 INFO L290 TraceCheckUtils]: 6: Hoare triple {30302#(< 0 (mod (+ 5 main_~y~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; {30298#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:07:59,466 INFO L290 TraceCheckUtils]: 5: Hoare triple {30093#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {30302#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:07:59,466 INFO L272 TraceCheckUtils]: 4: Hoare triple {30093#true} call #t~ret11 := main(); {30093#true} is VALID [2022-04-28 10:07:59,466 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30093#true} {30093#true} #61#return; {30093#true} is VALID [2022-04-28 10:07:59,466 INFO L290 TraceCheckUtils]: 2: Hoare triple {30093#true} assume true; {30093#true} is VALID [2022-04-28 10:07:59,466 INFO L290 TraceCheckUtils]: 1: Hoare triple {30093#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(10, 2);call #Ultimate.allocInit(12, 3); {30093#true} is VALID [2022-04-28 10:07:59,466 INFO L272 TraceCheckUtils]: 0: Hoare triple {30093#true} call ULTIMATE.init(); {30093#true} is VALID [2022-04-28 10:07:59,466 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-28 10:07:59,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [126254044] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:07:59,466 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:07:59,466 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 30 [2022-04-28 10:07:59,466 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:07:59,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [558389416] [2022-04-28 10:07:59,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [558389416] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:07:59,467 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:07:59,467 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-28 10:07:59,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200802894] [2022-04-28 10:07:59,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:07:59,467 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 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 33 [2022-04-28 10:07:59,467 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:07:59,467 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 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-28 10:07:59,482 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:07:59,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-28 10:07:59,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:07:59,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-28 10:07:59,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=712, Unknown=0, NotChecked=0, Total=870 [2022-04-28 10:07:59,482 INFO L87 Difference]: Start difference. First operand 96 states and 122 transitions. Second operand has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 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-28 10:08:00,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:00,471 INFO L93 Difference]: Finished difference Result 121 states and 147 transitions. [2022-04-28 10:08:00,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-28 10:08:00,471 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 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 33 [2022-04-28 10:08:00,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:08:00,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 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-28 10:08:00,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 58 transitions. [2022-04-28 10:08:00,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 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-28 10:08:00,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 58 transitions. [2022-04-28 10:08:00,472 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 58 transitions. [2022-04-28 10:08:00,515 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:08:00,516 INFO L225 Difference]: With dead ends: 121 [2022-04-28 10:08:00,516 INFO L226 Difference]: Without dead ends: 107 [2022-04-28 10:08:00,516 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=414, Invalid=1656, Unknown=0, NotChecked=0, Total=2070 [2022-04-28 10:08:00,516 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 23 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 10:08:00,517 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 75 Invalid, 456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 10:08:00,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-04-28 10:08:00,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 97. [2022-04-28 10:08:00,613 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:08:00,613 INFO L82 GeneralOperation]: Start isEquivalent. First operand 107 states. Second operand has 97 states, 92 states have (on average 1.2934782608695652) internal successors, (119), 92 states have internal predecessors, (119), 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-28 10:08:00,613 INFO L74 IsIncluded]: Start isIncluded. First operand 107 states. Second operand has 97 states, 92 states have (on average 1.2934782608695652) internal successors, (119), 92 states have internal predecessors, (119), 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-28 10:08:00,613 INFO L87 Difference]: Start difference. First operand 107 states. Second operand has 97 states, 92 states have (on average 1.2934782608695652) internal successors, (119), 92 states have internal predecessors, (119), 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-28 10:08:00,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:00,614 INFO L93 Difference]: Finished difference Result 107 states and 133 transitions. [2022-04-28 10:08:00,614 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 133 transitions. [2022-04-28 10:08:00,614 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:00,614 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:00,614 INFO L74 IsIncluded]: Start isIncluded. First operand has 97 states, 92 states have (on average 1.2934782608695652) internal successors, (119), 92 states have internal predecessors, (119), 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 107 states. [2022-04-28 10:08:00,614 INFO L87 Difference]: Start difference. First operand has 97 states, 92 states have (on average 1.2934782608695652) internal successors, (119), 92 states have internal predecessors, (119), 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 107 states. [2022-04-28 10:08:00,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:00,615 INFO L93 Difference]: Finished difference Result 107 states and 133 transitions. [2022-04-28 10:08:00,615 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 133 transitions. [2022-04-28 10:08:00,615 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:00,615 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:00,615 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:08:00,615 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:08:00,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 92 states have (on average 1.2934782608695652) internal successors, (119), 92 states have internal predecessors, (119), 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-28 10:08:00,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 123 transitions. [2022-04-28 10:08:00,616 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 123 transitions. Word has length 33 [2022-04-28 10:08:00,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:08:00,616 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 123 transitions. [2022-04-28 10:08:00,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 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-28 10:08:00,617 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 97 states and 123 transitions. [2022-04-28 10:08:01,970 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 123 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:08:01,971 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 123 transitions. [2022-04-28 10:08:01,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-28 10:08:01,971 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:08:01,971 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:08:01,992 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Forceful destruction successful, exit code 0 [2022-04-28 10:08:02,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 49 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2022-04-28 10:08:02,191 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:08:02,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:08:02,192 INFO L85 PathProgramCache]: Analyzing trace with hash -1137014465, now seen corresponding path program 61 times [2022-04-28 10:08:02,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:02,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [410730188] [2022-04-28 10:08:02,194 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:08:02,194 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:08:02,194 INFO L85 PathProgramCache]: Analyzing trace with hash -1137014465, now seen corresponding path program 62 times [2022-04-28 10:08:02,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:08:02,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362939185] [2022-04-28 10:08:02,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:08:02,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:08:02,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:02,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:08:02,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:02,399 INFO L290 TraceCheckUtils]: 0: Hoare triple {31022#(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(10, 2);call #Ultimate.allocInit(12, 3); {31005#true} is VALID [2022-04-28 10:08:02,399 INFO L290 TraceCheckUtils]: 1: Hoare triple {31005#true} assume true; {31005#true} is VALID [2022-04-28 10:08:02,399 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {31005#true} {31005#true} #61#return; {31005#true} is VALID [2022-04-28 10:08:02,400 INFO L272 TraceCheckUtils]: 0: Hoare triple {31005#true} call ULTIMATE.init(); {31022#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:08:02,400 INFO L290 TraceCheckUtils]: 1: Hoare triple {31022#(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(10, 2);call #Ultimate.allocInit(12, 3); {31005#true} is VALID [2022-04-28 10:08:02,400 INFO L290 TraceCheckUtils]: 2: Hoare triple {31005#true} assume true; {31005#true} is VALID [2022-04-28 10:08:02,400 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31005#true} {31005#true} #61#return; {31005#true} is VALID [2022-04-28 10:08:02,400 INFO L272 TraceCheckUtils]: 4: Hoare triple {31005#true} call #t~ret11 := main(); {31005#true} is VALID [2022-04-28 10:08:02,400 INFO L290 TraceCheckUtils]: 5: Hoare triple {31005#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {31010#(= main_~y~0 0)} is VALID [2022-04-28 10:08:02,401 INFO L290 TraceCheckUtils]: 6: Hoare triple {31010#(= 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; {31011#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:08:02,401 INFO L290 TraceCheckUtils]: 7: Hoare triple {31011#(and (<= 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; {31012#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:08:02,402 INFO L290 TraceCheckUtils]: 8: Hoare triple {31012#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {31013#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:08:02,402 INFO L290 TraceCheckUtils]: 9: Hoare triple {31013#(and (<= main_~y~0 3) (<= 3 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; {31014#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:08:02,403 INFO L290 TraceCheckUtils]: 10: Hoare triple {31014#(and (<= main_~y~0 4) (<= 4 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; {31015#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:08:02,403 INFO L290 TraceCheckUtils]: 11: Hoare triple {31015#(and (<= 5 main_~y~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; {31016#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:08:02,403 INFO L290 TraceCheckUtils]: 12: Hoare triple {31016#(and (<= main_~y~0 6) (<= 6 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; {31017#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:08:02,404 INFO L290 TraceCheckUtils]: 13: Hoare triple {31017#(and (<= 7 main_~y~0) (<= main_~y~0 7))} 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; {31018#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:08:02,404 INFO L290 TraceCheckUtils]: 14: Hoare triple {31018#(and (<= main_~y~0 8) (<= 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; {31019#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:08:02,405 INFO L290 TraceCheckUtils]: 15: Hoare triple {31019#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {31019#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:08:02,405 INFO L290 TraceCheckUtils]: 16: Hoare triple {31019#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {31020#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:08:02,405 INFO L290 TraceCheckUtils]: 17: Hoare triple {31020#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {31021#(and (<= 8 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:08:02,406 INFO L290 TraceCheckUtils]: 18: Hoare triple {31021#(and (<= 8 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {31006#false} is VALID [2022-04-28 10:08:02,406 INFO L290 TraceCheckUtils]: 19: Hoare triple {31006#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {31006#false} is VALID [2022-04-28 10:08:02,406 INFO L290 TraceCheckUtils]: 20: Hoare triple {31006#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {31006#false} is VALID [2022-04-28 10:08:02,406 INFO L290 TraceCheckUtils]: 21: Hoare triple {31006#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {31006#false} is VALID [2022-04-28 10:08:02,406 INFO L290 TraceCheckUtils]: 22: Hoare triple {31006#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {31006#false} is VALID [2022-04-28 10:08:02,406 INFO L290 TraceCheckUtils]: 23: Hoare triple {31006#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {31006#false} is VALID [2022-04-28 10:08:02,406 INFO L290 TraceCheckUtils]: 24: Hoare triple {31006#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {31006#false} is VALID [2022-04-28 10:08:02,406 INFO L290 TraceCheckUtils]: 25: Hoare triple {31006#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {31006#false} is VALID [2022-04-28 10:08:02,406 INFO L290 TraceCheckUtils]: 26: Hoare triple {31006#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {31006#false} is VALID [2022-04-28 10:08:02,406 INFO L290 TraceCheckUtils]: 27: Hoare triple {31006#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {31006#false} is VALID [2022-04-28 10:08:02,406 INFO L290 TraceCheckUtils]: 28: Hoare triple {31006#false} assume !(~y~0 % 4294967296 > 0); {31006#false} is VALID [2022-04-28 10:08:02,406 INFO L272 TraceCheckUtils]: 29: Hoare triple {31006#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {31006#false} is VALID [2022-04-28 10:08:02,406 INFO L290 TraceCheckUtils]: 30: Hoare triple {31006#false} ~cond := #in~cond; {31006#false} is VALID [2022-04-28 10:08:02,407 INFO L290 TraceCheckUtils]: 31: Hoare triple {31006#false} assume 0 == ~cond; {31006#false} is VALID [2022-04-28 10:08:02,407 INFO L290 TraceCheckUtils]: 32: Hoare triple {31006#false} assume !false; {31006#false} is VALID [2022-04-28 10:08:02,407 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-04-28 10:08:02,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:08:02,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362939185] [2022-04-28 10:08:02,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362939185] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:08:02,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1922336068] [2022-04-28 10:08:02,407 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:08:02,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:08:02,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:08:02,408 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:08:02,409 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Waiting until timeout for monitored process [2022-04-28 10:08:02,446 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:08:02,447 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:08:02,447 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-28 10:08:02,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:02,453 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:08:02,674 INFO L272 TraceCheckUtils]: 0: Hoare triple {31005#true} call ULTIMATE.init(); {31005#true} is VALID [2022-04-28 10:08:02,674 INFO L290 TraceCheckUtils]: 1: Hoare triple {31005#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(10, 2);call #Ultimate.allocInit(12, 3); {31005#true} is VALID [2022-04-28 10:08:02,674 INFO L290 TraceCheckUtils]: 2: Hoare triple {31005#true} assume true; {31005#true} is VALID [2022-04-28 10:08:02,674 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31005#true} {31005#true} #61#return; {31005#true} is VALID [2022-04-28 10:08:02,674 INFO L272 TraceCheckUtils]: 4: Hoare triple {31005#true} call #t~ret11 := main(); {31005#true} is VALID [2022-04-28 10:08:02,674 INFO L290 TraceCheckUtils]: 5: Hoare triple {31005#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {31010#(= main_~y~0 0)} is VALID [2022-04-28 10:08:02,675 INFO L290 TraceCheckUtils]: 6: Hoare triple {31010#(= 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; {31011#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:08:02,675 INFO L290 TraceCheckUtils]: 7: Hoare triple {31011#(and (<= 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; {31012#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:08:02,676 INFO L290 TraceCheckUtils]: 8: Hoare triple {31012#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {31013#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:08:02,676 INFO L290 TraceCheckUtils]: 9: Hoare triple {31013#(and (<= main_~y~0 3) (<= 3 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; {31014#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:08:02,677 INFO L290 TraceCheckUtils]: 10: Hoare triple {31014#(and (<= main_~y~0 4) (<= 4 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; {31015#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:08:02,677 INFO L290 TraceCheckUtils]: 11: Hoare triple {31015#(and (<= 5 main_~y~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; {31016#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:08:02,678 INFO L290 TraceCheckUtils]: 12: Hoare triple {31016#(and (<= main_~y~0 6) (<= 6 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; {31017#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:08:02,678 INFO L290 TraceCheckUtils]: 13: Hoare triple {31017#(and (<= 7 main_~y~0) (<= main_~y~0 7))} 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; {31018#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:08:02,679 INFO L290 TraceCheckUtils]: 14: Hoare triple {31018#(and (<= main_~y~0 8) (<= 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; {31019#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:08:02,679 INFO L290 TraceCheckUtils]: 15: Hoare triple {31019#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {31019#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:08:02,680 INFO L290 TraceCheckUtils]: 16: Hoare triple {31019#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {31020#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:08:02,680 INFO L290 TraceCheckUtils]: 17: Hoare triple {31020#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {31077#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:08:02,681 INFO L290 TraceCheckUtils]: 18: Hoare triple {31077#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !(~z~0 % 4294967296 > 0); {31006#false} is VALID [2022-04-28 10:08:02,681 INFO L290 TraceCheckUtils]: 19: Hoare triple {31006#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {31006#false} is VALID [2022-04-28 10:08:02,681 INFO L290 TraceCheckUtils]: 20: Hoare triple {31006#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {31006#false} is VALID [2022-04-28 10:08:02,681 INFO L290 TraceCheckUtils]: 21: Hoare triple {31006#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {31006#false} is VALID [2022-04-28 10:08:02,681 INFO L290 TraceCheckUtils]: 22: Hoare triple {31006#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {31006#false} is VALID [2022-04-28 10:08:02,681 INFO L290 TraceCheckUtils]: 23: Hoare triple {31006#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {31006#false} is VALID [2022-04-28 10:08:02,681 INFO L290 TraceCheckUtils]: 24: Hoare triple {31006#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {31006#false} is VALID [2022-04-28 10:08:02,681 INFO L290 TraceCheckUtils]: 25: Hoare triple {31006#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {31006#false} is VALID [2022-04-28 10:08:02,681 INFO L290 TraceCheckUtils]: 26: Hoare triple {31006#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {31006#false} is VALID [2022-04-28 10:08:02,681 INFO L290 TraceCheckUtils]: 27: Hoare triple {31006#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {31006#false} is VALID [2022-04-28 10:08:02,681 INFO L290 TraceCheckUtils]: 28: Hoare triple {31006#false} assume !(~y~0 % 4294967296 > 0); {31006#false} is VALID [2022-04-28 10:08:02,681 INFO L272 TraceCheckUtils]: 29: Hoare triple {31006#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {31006#false} is VALID [2022-04-28 10:08:02,681 INFO L290 TraceCheckUtils]: 30: Hoare triple {31006#false} ~cond := #in~cond; {31006#false} is VALID [2022-04-28 10:08:02,681 INFO L290 TraceCheckUtils]: 31: Hoare triple {31006#false} assume 0 == ~cond; {31006#false} is VALID [2022-04-28 10:08:02,681 INFO L290 TraceCheckUtils]: 32: Hoare triple {31006#false} assume !false; {31006#false} is VALID [2022-04-28 10:08:02,681 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-04-28 10:08:02,681 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:08:03,009 INFO L290 TraceCheckUtils]: 32: Hoare triple {31006#false} assume !false; {31006#false} is VALID [2022-04-28 10:08:03,009 INFO L290 TraceCheckUtils]: 31: Hoare triple {31006#false} assume 0 == ~cond; {31006#false} is VALID [2022-04-28 10:08:03,009 INFO L290 TraceCheckUtils]: 30: Hoare triple {31006#false} ~cond := #in~cond; {31006#false} is VALID [2022-04-28 10:08:03,010 INFO L272 TraceCheckUtils]: 29: Hoare triple {31006#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {31006#false} is VALID [2022-04-28 10:08:03,010 INFO L290 TraceCheckUtils]: 28: Hoare triple {31006#false} assume !(~y~0 % 4294967296 > 0); {31006#false} is VALID [2022-04-28 10:08:03,010 INFO L290 TraceCheckUtils]: 27: Hoare triple {31006#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {31006#false} is VALID [2022-04-28 10:08:03,010 INFO L290 TraceCheckUtils]: 26: Hoare triple {31006#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {31006#false} is VALID [2022-04-28 10:08:03,010 INFO L290 TraceCheckUtils]: 25: Hoare triple {31006#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {31006#false} is VALID [2022-04-28 10:08:03,010 INFO L290 TraceCheckUtils]: 24: Hoare triple {31006#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {31006#false} is VALID [2022-04-28 10:08:03,010 INFO L290 TraceCheckUtils]: 23: Hoare triple {31006#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {31006#false} is VALID [2022-04-28 10:08:03,010 INFO L290 TraceCheckUtils]: 22: Hoare triple {31006#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {31006#false} is VALID [2022-04-28 10:08:03,010 INFO L290 TraceCheckUtils]: 21: Hoare triple {31006#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {31006#false} is VALID [2022-04-28 10:08:03,010 INFO L290 TraceCheckUtils]: 20: Hoare triple {31006#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {31006#false} is VALID [2022-04-28 10:08:03,010 INFO L290 TraceCheckUtils]: 19: Hoare triple {31006#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {31006#false} is VALID [2022-04-28 10:08:03,010 INFO L290 TraceCheckUtils]: 18: Hoare triple {31165#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {31006#false} is VALID [2022-04-28 10:08:03,011 INFO L290 TraceCheckUtils]: 17: Hoare triple {31169#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {31165#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:08:03,011 INFO L290 TraceCheckUtils]: 16: Hoare triple {31173#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} ~z~0 := ~y~0; {31169#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:08:03,012 INFO L290 TraceCheckUtils]: 15: Hoare triple {31173#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {31173#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:08:03,012 INFO L290 TraceCheckUtils]: 14: Hoare triple {31180#(< 0 (mod main_~y~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; {31173#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:08:03,013 INFO L290 TraceCheckUtils]: 13: Hoare triple {31184#(< 0 (mod (+ main_~y~0 1) 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; {31180#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:08:03,014 INFO L290 TraceCheckUtils]: 12: Hoare triple {31188#(< 0 (mod (+ main_~y~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; {31184#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:08:03,014 INFO L290 TraceCheckUtils]: 11: Hoare triple {31192#(< 0 (mod (+ main_~y~0 3) 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; {31188#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:08:03,015 INFO L290 TraceCheckUtils]: 10: Hoare triple {31196#(< 0 (mod (+ main_~y~0 4) 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; {31192#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:08:03,016 INFO L290 TraceCheckUtils]: 9: Hoare triple {31200#(< 0 (mod (+ 5 main_~y~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; {31196#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:08:03,016 INFO L290 TraceCheckUtils]: 8: Hoare triple {31204#(< 0 (mod (+ main_~y~0 6) 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; {31200#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:08:03,017 INFO L290 TraceCheckUtils]: 7: Hoare triple {31208#(< 0 (mod (+ 7 main_~y~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; {31204#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:08:03,018 INFO L290 TraceCheckUtils]: 6: Hoare triple {31212#(< 0 (mod (+ main_~y~0 8) 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; {31208#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:08:03,018 INFO L290 TraceCheckUtils]: 5: Hoare triple {31005#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {31212#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:08:03,018 INFO L272 TraceCheckUtils]: 4: Hoare triple {31005#true} call #t~ret11 := main(); {31005#true} is VALID [2022-04-28 10:08:03,018 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31005#true} {31005#true} #61#return; {31005#true} is VALID [2022-04-28 10:08:03,018 INFO L290 TraceCheckUtils]: 2: Hoare triple {31005#true} assume true; {31005#true} is VALID [2022-04-28 10:08:03,018 INFO L290 TraceCheckUtils]: 1: Hoare triple {31005#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(10, 2);call #Ultimate.allocInit(12, 3); {31005#true} is VALID [2022-04-28 10:08:03,018 INFO L272 TraceCheckUtils]: 0: Hoare triple {31005#true} call ULTIMATE.init(); {31005#true} is VALID [2022-04-28 10:08:03,018 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-04-28 10:08:03,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1922336068] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:08:03,019 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:08:03,019 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 28 [2022-04-28 10:08:03,019 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:08:03,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [410730188] [2022-04-28 10:08:03,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [410730188] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:08:03,019 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:08:03,019 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-28 10:08:03,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331925435] [2022-04-28 10:08:03,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:08:03,020 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 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 33 [2022-04-28 10:08:03,020 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:08:03,020 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 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-28 10:08:03,035 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:08:03,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-28 10:08:03,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:03,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-28 10:08:03,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=597, Unknown=0, NotChecked=0, Total=756 [2022-04-28 10:08:03,035 INFO L87 Difference]: Start difference. First operand 97 states and 123 transitions. Second operand has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 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-28 10:08:03,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:03,921 INFO L93 Difference]: Finished difference Result 124 states and 150 transitions. [2022-04-28 10:08:03,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-28 10:08:03,921 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 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 33 [2022-04-28 10:08:03,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:08:03,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 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-28 10:08:03,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 60 transitions. [2022-04-28 10:08:03,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 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-28 10:08:03,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 60 transitions. [2022-04-28 10:08:03,922 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 60 transitions. [2022-04-28 10:08:03,966 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:08:03,967 INFO L225 Difference]: With dead ends: 124 [2022-04-28 10:08:03,967 INFO L226 Difference]: Without dead ends: 109 [2022-04-28 10:08:03,967 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=353, Invalid=1287, Unknown=0, NotChecked=0, Total=1640 [2022-04-28 10:08:03,967 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 32 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 10:08:03,968 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 76 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 10:08:03,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-04-28 10:08:04,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 98. [2022-04-28 10:08:04,105 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:08:04,105 INFO L82 GeneralOperation]: Start isEquivalent. First operand 109 states. Second operand has 98 states, 93 states have (on average 1.2903225806451613) internal successors, (120), 93 states have internal predecessors, (120), 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-28 10:08:04,105 INFO L74 IsIncluded]: Start isIncluded. First operand 109 states. Second operand has 98 states, 93 states have (on average 1.2903225806451613) internal successors, (120), 93 states have internal predecessors, (120), 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-28 10:08:04,105 INFO L87 Difference]: Start difference. First operand 109 states. Second operand has 98 states, 93 states have (on average 1.2903225806451613) internal successors, (120), 93 states have internal predecessors, (120), 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-28 10:08:04,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:04,106 INFO L93 Difference]: Finished difference Result 109 states and 135 transitions. [2022-04-28 10:08:04,106 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 135 transitions. [2022-04-28 10:08:04,106 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:04,106 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:04,106 INFO L74 IsIncluded]: Start isIncluded. First operand has 98 states, 93 states have (on average 1.2903225806451613) internal successors, (120), 93 states have internal predecessors, (120), 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 109 states. [2022-04-28 10:08:04,106 INFO L87 Difference]: Start difference. First operand has 98 states, 93 states have (on average 1.2903225806451613) internal successors, (120), 93 states have internal predecessors, (120), 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 109 states. [2022-04-28 10:08:04,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:04,107 INFO L93 Difference]: Finished difference Result 109 states and 135 transitions. [2022-04-28 10:08:04,107 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 135 transitions. [2022-04-28 10:08:04,107 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:04,107 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:04,107 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:08:04,107 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:08:04,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 93 states have (on average 1.2903225806451613) internal successors, (120), 93 states have internal predecessors, (120), 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-28 10:08:04,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 124 transitions. [2022-04-28 10:08:04,108 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 124 transitions. Word has length 33 [2022-04-28 10:08:04,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:08:04,108 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 124 transitions. [2022-04-28 10:08:04,108 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 states have internal predecessors, (21), 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-28 10:08:04,108 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 98 states and 124 transitions. [2022-04-28 10:08:06,634 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 124 edges. 123 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 10:08:06,634 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 124 transitions. [2022-04-28 10:08:06,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-28 10:08:06,634 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:08:06,634 INFO L195 NwaCegarLoop]: trace histogram [19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:08:06,651 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Forceful destruction successful, exit code 0 [2022-04-28 10:08:06,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 50 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2022-04-28 10:08:06,835 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:08:06,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:08:06,835 INFO L85 PathProgramCache]: Analyzing trace with hash -396490866, now seen corresponding path program 37 times [2022-04-28 10:08:06,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:06,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1091535246] [2022-04-28 10:08:06,844 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:08:06,845 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:08:06,845 INFO L85 PathProgramCache]: Analyzing trace with hash -396490866, now seen corresponding path program 38 times [2022-04-28 10:08:06,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:08:06,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404418806] [2022-04-28 10:08:06,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:08:06,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:08:06,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:07,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:08:07,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:07,192 INFO L290 TraceCheckUtils]: 0: Hoare triple {31947#(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(10, 2);call #Ultimate.allocInit(12, 3); {31921#true} is VALID [2022-04-28 10:08:07,192 INFO L290 TraceCheckUtils]: 1: Hoare triple {31921#true} assume true; {31921#true} is VALID [2022-04-28 10:08:07,192 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {31921#true} {31921#true} #61#return; {31921#true} is VALID [2022-04-28 10:08:07,192 INFO L272 TraceCheckUtils]: 0: Hoare triple {31921#true} call ULTIMATE.init(); {31947#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:08:07,193 INFO L290 TraceCheckUtils]: 1: Hoare triple {31947#(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(10, 2);call #Ultimate.allocInit(12, 3); {31921#true} is VALID [2022-04-28 10:08:07,193 INFO L290 TraceCheckUtils]: 2: Hoare triple {31921#true} assume true; {31921#true} is VALID [2022-04-28 10:08:07,193 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31921#true} {31921#true} #61#return; {31921#true} is VALID [2022-04-28 10:08:07,193 INFO L272 TraceCheckUtils]: 4: Hoare triple {31921#true} call #t~ret11 := main(); {31921#true} is VALID [2022-04-28 10:08:07,193 INFO L290 TraceCheckUtils]: 5: Hoare triple {31921#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {31926#(= main_~y~0 0)} is VALID [2022-04-28 10:08:07,193 INFO L290 TraceCheckUtils]: 6: Hoare triple {31926#(= 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; {31927#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:08:07,194 INFO L290 TraceCheckUtils]: 7: Hoare triple {31927#(and (<= 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; {31928#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:08:07,194 INFO L290 TraceCheckUtils]: 8: Hoare triple {31928#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {31929#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:08:07,195 INFO L290 TraceCheckUtils]: 9: Hoare triple {31929#(and (<= main_~y~0 3) (<= 3 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; {31930#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:08:07,195 INFO L290 TraceCheckUtils]: 10: Hoare triple {31930#(and (<= main_~y~0 4) (<= 4 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; {31931#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:08:07,196 INFO L290 TraceCheckUtils]: 11: Hoare triple {31931#(and (<= 5 main_~y~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; {31932#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:08:07,197 INFO L290 TraceCheckUtils]: 12: Hoare triple {31932#(and (<= main_~y~0 6) (<= 6 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; {31933#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:08:07,197 INFO L290 TraceCheckUtils]: 13: Hoare triple {31933#(and (<= 7 main_~y~0) (<= main_~y~0 7))} 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; {31934#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:08:07,198 INFO L290 TraceCheckUtils]: 14: Hoare triple {31934#(and (<= main_~y~0 8) (<= 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; {31935#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:08:07,198 INFO L290 TraceCheckUtils]: 15: Hoare triple {31935#(and (<= 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; {31936#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:08:07,199 INFO L290 TraceCheckUtils]: 16: Hoare triple {31936#(and (<= main_~y~0 10) (<= 10 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; {31937#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:08:07,199 INFO L290 TraceCheckUtils]: 17: Hoare triple {31937#(and (<= main_~y~0 11) (<= 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; {31938#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:08:07,200 INFO L290 TraceCheckUtils]: 18: Hoare triple {31938#(and (<= 12 main_~y~0) (<= main_~y~0 12))} 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; {31939#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:08:07,200 INFO L290 TraceCheckUtils]: 19: Hoare triple {31939#(and (<= main_~y~0 13) (<= 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; {31940#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:08:07,201 INFO L290 TraceCheckUtils]: 20: Hoare triple {31940#(and (<= 14 main_~y~0) (<= main_~y~0 14))} 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; {31941#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:08:07,201 INFO L290 TraceCheckUtils]: 21: Hoare triple {31941#(and (<= main_~y~0 15) (<= 15 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; {31942#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:08:07,202 INFO L290 TraceCheckUtils]: 22: Hoare triple {31942#(and (<= 16 main_~y~0) (<= main_~y~0 16))} 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; {31943#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:08:07,202 INFO L290 TraceCheckUtils]: 23: Hoare triple {31943#(and (<= main_~y~0 17) (<= 17 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; {31944#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 10:08:07,203 INFO L290 TraceCheckUtils]: 24: Hoare triple {31944#(and (<= 18 main_~y~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; {31945#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 10:08:07,203 INFO L290 TraceCheckUtils]: 25: Hoare triple {31945#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !(~x~0 % 4294967296 > 0); {31945#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 10:08:07,204 INFO L290 TraceCheckUtils]: 26: Hoare triple {31945#(and (<= 19 main_~y~0) (<= main_~y~0 19))} ~z~0 := ~y~0; {31946#(and (<= 19 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:08:07,204 INFO L290 TraceCheckUtils]: 27: Hoare triple {31946#(and (<= 19 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {31922#false} is VALID [2022-04-28 10:08:07,204 INFO L290 TraceCheckUtils]: 28: Hoare triple {31922#false} assume !(~y~0 % 4294967296 > 0); {31922#false} is VALID [2022-04-28 10:08:07,204 INFO L272 TraceCheckUtils]: 29: Hoare triple {31922#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {31922#false} is VALID [2022-04-28 10:08:07,204 INFO L290 TraceCheckUtils]: 30: Hoare triple {31922#false} ~cond := #in~cond; {31922#false} is VALID [2022-04-28 10:08:07,204 INFO L290 TraceCheckUtils]: 31: Hoare triple {31922#false} assume 0 == ~cond; {31922#false} is VALID [2022-04-28 10:08:07,204 INFO L290 TraceCheckUtils]: 32: Hoare triple {31922#false} assume !false; {31922#false} is VALID [2022-04-28 10:08:07,204 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:08:07,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:08:07,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404418806] [2022-04-28 10:08:07,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404418806] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:08:07,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1849488682] [2022-04-28 10:08:07,205 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:08:07,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:08:07,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:08:07,206 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:08:07,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Waiting until timeout for monitored process [2022-04-28 10:08:07,245 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:08:07,245 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:08:07,246 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 43 conjunts are in the unsatisfiable core [2022-04-28 10:08:07,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:07,254 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:08:07,608 INFO L272 TraceCheckUtils]: 0: Hoare triple {31921#true} call ULTIMATE.init(); {31921#true} is VALID [2022-04-28 10:08:07,608 INFO L290 TraceCheckUtils]: 1: Hoare triple {31921#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(10, 2);call #Ultimate.allocInit(12, 3); {31921#true} is VALID [2022-04-28 10:08:07,608 INFO L290 TraceCheckUtils]: 2: Hoare triple {31921#true} assume true; {31921#true} is VALID [2022-04-28 10:08:07,608 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31921#true} {31921#true} #61#return; {31921#true} is VALID [2022-04-28 10:08:07,608 INFO L272 TraceCheckUtils]: 4: Hoare triple {31921#true} call #t~ret11 := main(); {31921#true} is VALID [2022-04-28 10:08:07,609 INFO L290 TraceCheckUtils]: 5: Hoare triple {31921#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {31926#(= main_~y~0 0)} is VALID [2022-04-28 10:08:07,609 INFO L290 TraceCheckUtils]: 6: Hoare triple {31926#(= 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; {31927#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:08:07,609 INFO L290 TraceCheckUtils]: 7: Hoare triple {31927#(and (<= 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; {31928#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:08:07,610 INFO L290 TraceCheckUtils]: 8: Hoare triple {31928#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {31929#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:08:07,611 INFO L290 TraceCheckUtils]: 9: Hoare triple {31929#(and (<= main_~y~0 3) (<= 3 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; {31930#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:08:07,611 INFO L290 TraceCheckUtils]: 10: Hoare triple {31930#(and (<= main_~y~0 4) (<= 4 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; {31931#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:08:07,612 INFO L290 TraceCheckUtils]: 11: Hoare triple {31931#(and (<= 5 main_~y~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; {31932#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:08:07,612 INFO L290 TraceCheckUtils]: 12: Hoare triple {31932#(and (<= main_~y~0 6) (<= 6 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; {31933#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:08:07,613 INFO L290 TraceCheckUtils]: 13: Hoare triple {31933#(and (<= 7 main_~y~0) (<= main_~y~0 7))} 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; {31934#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:08:07,613 INFO L290 TraceCheckUtils]: 14: Hoare triple {31934#(and (<= main_~y~0 8) (<= 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; {31935#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:08:07,614 INFO L290 TraceCheckUtils]: 15: Hoare triple {31935#(and (<= 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; {31936#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:08:07,614 INFO L290 TraceCheckUtils]: 16: Hoare triple {31936#(and (<= main_~y~0 10) (<= 10 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; {31937#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:08:07,615 INFO L290 TraceCheckUtils]: 17: Hoare triple {31937#(and (<= main_~y~0 11) (<= 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; {31938#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:08:07,615 INFO L290 TraceCheckUtils]: 18: Hoare triple {31938#(and (<= 12 main_~y~0) (<= main_~y~0 12))} 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; {31939#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:08:07,616 INFO L290 TraceCheckUtils]: 19: Hoare triple {31939#(and (<= main_~y~0 13) (<= 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; {31940#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:08:07,616 INFO L290 TraceCheckUtils]: 20: Hoare triple {31940#(and (<= 14 main_~y~0) (<= main_~y~0 14))} 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; {31941#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:08:07,617 INFO L290 TraceCheckUtils]: 21: Hoare triple {31941#(and (<= main_~y~0 15) (<= 15 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; {31942#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:08:07,617 INFO L290 TraceCheckUtils]: 22: Hoare triple {31942#(and (<= 16 main_~y~0) (<= main_~y~0 16))} 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; {31943#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:08:07,618 INFO L290 TraceCheckUtils]: 23: Hoare triple {31943#(and (<= main_~y~0 17) (<= 17 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; {31944#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 10:08:07,618 INFO L290 TraceCheckUtils]: 24: Hoare triple {31944#(and (<= 18 main_~y~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; {31945#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 10:08:07,619 INFO L290 TraceCheckUtils]: 25: Hoare triple {31945#(and (<= 19 main_~y~0) (<= main_~y~0 19))} assume !(~x~0 % 4294967296 > 0); {31945#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 10:08:07,619 INFO L290 TraceCheckUtils]: 26: Hoare triple {31945#(and (<= 19 main_~y~0) (<= main_~y~0 19))} ~z~0 := ~y~0; {32029#(and (<= 19 main_~z~0) (<= main_~z~0 19))} is VALID [2022-04-28 10:08:07,620 INFO L290 TraceCheckUtils]: 27: Hoare triple {32029#(and (<= 19 main_~z~0) (<= main_~z~0 19))} assume !(~z~0 % 4294967296 > 0); {31922#false} is VALID [2022-04-28 10:08:07,620 INFO L290 TraceCheckUtils]: 28: Hoare triple {31922#false} assume !(~y~0 % 4294967296 > 0); {31922#false} is VALID [2022-04-28 10:08:07,620 INFO L272 TraceCheckUtils]: 29: Hoare triple {31922#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {31922#false} is VALID [2022-04-28 10:08:07,620 INFO L290 TraceCheckUtils]: 30: Hoare triple {31922#false} ~cond := #in~cond; {31922#false} is VALID [2022-04-28 10:08:07,620 INFO L290 TraceCheckUtils]: 31: Hoare triple {31922#false} assume 0 == ~cond; {31922#false} is VALID [2022-04-28 10:08:07,620 INFO L290 TraceCheckUtils]: 32: Hoare triple {31922#false} assume !false; {31922#false} is VALID [2022-04-28 10:08:07,620 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:08:07,620 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:08:08,349 INFO L290 TraceCheckUtils]: 32: Hoare triple {31922#false} assume !false; {31922#false} is VALID [2022-04-28 10:08:08,349 INFO L290 TraceCheckUtils]: 31: Hoare triple {31922#false} assume 0 == ~cond; {31922#false} is VALID [2022-04-28 10:08:08,349 INFO L290 TraceCheckUtils]: 30: Hoare triple {31922#false} ~cond := #in~cond; {31922#false} is VALID [2022-04-28 10:08:08,349 INFO L272 TraceCheckUtils]: 29: Hoare triple {31922#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {31922#false} is VALID [2022-04-28 10:08:08,349 INFO L290 TraceCheckUtils]: 28: Hoare triple {31922#false} assume !(~y~0 % 4294967296 > 0); {31922#false} is VALID [2022-04-28 10:08:08,349 INFO L290 TraceCheckUtils]: 27: Hoare triple {32063#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {31922#false} is VALID [2022-04-28 10:08:08,350 INFO L290 TraceCheckUtils]: 26: Hoare triple {32067#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {32063#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:08:08,350 INFO L290 TraceCheckUtils]: 25: Hoare triple {32067#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {32067#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:08:08,351 INFO L290 TraceCheckUtils]: 24: Hoare triple {32074#(< 0 (mod (+ main_~y~0 1) 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; {32067#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:08:08,351 INFO L290 TraceCheckUtils]: 23: Hoare triple {32078#(< 0 (mod (+ main_~y~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; {32074#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:08:08,352 INFO L290 TraceCheckUtils]: 22: Hoare triple {32082#(< 0 (mod (+ main_~y~0 3) 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; {32078#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:08:08,353 INFO L290 TraceCheckUtils]: 21: Hoare triple {32086#(< 0 (mod (+ main_~y~0 4) 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; {32082#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:08:08,353 INFO L290 TraceCheckUtils]: 20: Hoare triple {32090#(< 0 (mod (+ 5 main_~y~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; {32086#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:08:08,354 INFO L290 TraceCheckUtils]: 19: Hoare triple {32094#(< 0 (mod (+ main_~y~0 6) 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; {32090#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:08:08,355 INFO L290 TraceCheckUtils]: 18: Hoare triple {32098#(< 0 (mod (+ 7 main_~y~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; {32094#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:08:08,355 INFO L290 TraceCheckUtils]: 17: Hoare triple {32102#(< 0 (mod (+ main_~y~0 8) 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; {32098#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:08:08,356 INFO L290 TraceCheckUtils]: 16: Hoare triple {32106#(< 0 (mod (+ main_~y~0 9) 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; {32102#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:08:08,357 INFO L290 TraceCheckUtils]: 15: Hoare triple {32110#(< 0 (mod (+ main_~y~0 10) 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; {32106#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:08:08,357 INFO L290 TraceCheckUtils]: 14: Hoare triple {32114#(< 0 (mod (+ main_~y~0 11) 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; {32110#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-28 10:08:08,358 INFO L290 TraceCheckUtils]: 13: Hoare triple {32118#(< 0 (mod (+ main_~y~0 12) 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; {32114#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-28 10:08:08,358 INFO L290 TraceCheckUtils]: 12: Hoare triple {32122#(< 0 (mod (+ main_~y~0 13) 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; {32118#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-28 10:08:08,359 INFO L290 TraceCheckUtils]: 11: Hoare triple {32126#(< 0 (mod (+ main_~y~0 14) 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; {32122#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-28 10:08:08,360 INFO L290 TraceCheckUtils]: 10: Hoare triple {32130#(< 0 (mod (+ main_~y~0 15) 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; {32126#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-28 10:08:08,360 INFO L290 TraceCheckUtils]: 9: Hoare triple {32134#(< 0 (mod (+ main_~y~0 16) 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; {32130#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID [2022-04-28 10:08:08,361 INFO L290 TraceCheckUtils]: 8: Hoare triple {32138#(< 0 (mod (+ main_~y~0 17) 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; {32134#(< 0 (mod (+ main_~y~0 16) 4294967296))} is VALID [2022-04-28 10:08:08,362 INFO L290 TraceCheckUtils]: 7: Hoare triple {32142#(< 0 (mod (+ main_~y~0 18) 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; {32138#(< 0 (mod (+ main_~y~0 17) 4294967296))} is VALID [2022-04-28 10:08:08,362 INFO L290 TraceCheckUtils]: 6: Hoare triple {32146#(< 0 (mod (+ 19 main_~y~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; {32142#(< 0 (mod (+ main_~y~0 18) 4294967296))} is VALID [2022-04-28 10:08:08,362 INFO L290 TraceCheckUtils]: 5: Hoare triple {31921#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {32146#(< 0 (mod (+ 19 main_~y~0) 4294967296))} is VALID [2022-04-28 10:08:08,363 INFO L272 TraceCheckUtils]: 4: Hoare triple {31921#true} call #t~ret11 := main(); {31921#true} is VALID [2022-04-28 10:08:08,363 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31921#true} {31921#true} #61#return; {31921#true} is VALID [2022-04-28 10:08:08,363 INFO L290 TraceCheckUtils]: 2: Hoare triple {31921#true} assume true; {31921#true} is VALID [2022-04-28 10:08:08,363 INFO L290 TraceCheckUtils]: 1: Hoare triple {31921#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(10, 2);call #Ultimate.allocInit(12, 3); {31921#true} is VALID [2022-04-28 10:08:08,363 INFO L272 TraceCheckUtils]: 0: Hoare triple {31921#true} call ULTIMATE.init(); {31921#true} is VALID [2022-04-28 10:08:08,363 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:08:08,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1849488682] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:08:08,363 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:08:08,363 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 23] total 46 [2022-04-28 10:08:08,363 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:08:08,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1091535246] [2022-04-28 10:08:08,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1091535246] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:08:08,363 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:08:08,363 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-04-28 10:08:08,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652400679] [2022-04-28 10:08:08,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:08:08,364 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 23 states have internal predecessors, (29), 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 33 [2022-04-28 10:08:08,364 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:08:08,364 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 24 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 23 states have internal predecessors, (29), 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-28 10:08:08,382 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:08:08,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-28 10:08:08,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:08,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-28 10:08:08,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=491, Invalid=1579, Unknown=0, NotChecked=0, Total=2070 [2022-04-28 10:08:08,383 INFO L87 Difference]: Start difference. First operand 98 states and 124 transitions. Second operand has 24 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 23 states have internal predecessors, (29), 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-28 10:08:11,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:11,532 INFO L93 Difference]: Finished difference Result 129 states and 178 transitions. [2022-04-28 10:08:11,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-28 10:08:11,532 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 23 states have internal predecessors, (29), 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 33 [2022-04-28 10:08:11,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:08:11,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 23 states have internal predecessors, (29), 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-28 10:08:11,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 138 transitions. [2022-04-28 10:08:11,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 23 states have internal predecessors, (29), 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-28 10:08:11,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 138 transitions. [2022-04-28 10:08:11,534 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 138 transitions. [2022-04-28 10:08:11,638 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:08:11,639 INFO L225 Difference]: With dead ends: 129 [2022-04-28 10:08:11,639 INFO L226 Difference]: Without dead ends: 123 [2022-04-28 10:08:11,640 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 271 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=997, Invalid=3425, Unknown=0, NotChecked=0, Total=4422 [2022-04-28 10:08:11,640 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 116 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 2000 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 2083 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 2000 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-04-28 10:08:11,640 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 155 Invalid, 2083 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 2000 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-04-28 10:08:11,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-04-28 10:08:11,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 103. [2022-04-28 10:08:11,770 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:08:11,770 INFO L82 GeneralOperation]: Start isEquivalent. First operand 123 states. Second operand has 103 states, 98 states have (on average 1.2959183673469388) internal successors, (127), 98 states have internal predecessors, (127), 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-28 10:08:11,770 INFO L74 IsIncluded]: Start isIncluded. First operand 123 states. Second operand has 103 states, 98 states have (on average 1.2959183673469388) internal successors, (127), 98 states have internal predecessors, (127), 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-28 10:08:11,770 INFO L87 Difference]: Start difference. First operand 123 states. Second operand has 103 states, 98 states have (on average 1.2959183673469388) internal successors, (127), 98 states have internal predecessors, (127), 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-28 10:08:11,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:11,771 INFO L93 Difference]: Finished difference Result 123 states and 151 transitions. [2022-04-28 10:08:11,771 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 151 transitions. [2022-04-28 10:08:11,771 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:11,771 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:11,771 INFO L74 IsIncluded]: Start isIncluded. First operand has 103 states, 98 states have (on average 1.2959183673469388) internal successors, (127), 98 states have internal predecessors, (127), 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 123 states. [2022-04-28 10:08:11,771 INFO L87 Difference]: Start difference. First operand has 103 states, 98 states have (on average 1.2959183673469388) internal successors, (127), 98 states have internal predecessors, (127), 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 123 states. [2022-04-28 10:08:11,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:11,772 INFO L93 Difference]: Finished difference Result 123 states and 151 transitions. [2022-04-28 10:08:11,772 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 151 transitions. [2022-04-28 10:08:11,772 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:11,773 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:11,773 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:08:11,773 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:08:11,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 98 states have (on average 1.2959183673469388) internal successors, (127), 98 states have internal predecessors, (127), 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-28 10:08:11,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 131 transitions. [2022-04-28 10:08:11,774 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 131 transitions. Word has length 33 [2022-04-28 10:08:11,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:08:11,774 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 131 transitions. [2022-04-28 10:08:11,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 23 states have internal predecessors, (29), 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-28 10:08:11,774 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 103 states and 131 transitions. [2022-04-28 10:08:14,881 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 131 edges. 130 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 10:08:14,881 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 131 transitions. [2022-04-28 10:08:14,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-28 10:08:14,882 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:08:14,882 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:08:14,898 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Forceful destruction successful, exit code 0 [2022-04-28 10:08:15,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 51 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable50 [2022-04-28 10:08:15,086 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:08:15,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:08:15,087 INFO L85 PathProgramCache]: Analyzing trace with hash 1579041151, now seen corresponding path program 63 times [2022-04-28 10:08:15,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:15,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1914663019] [2022-04-28 10:08:15,089 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:08:15,089 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:08:15,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1579041151, now seen corresponding path program 64 times [2022-04-28 10:08:15,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:08:15,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304203157] [2022-04-28 10:08:15,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:08:15,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:08:15,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:15,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:08:15,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:15,322 INFO L290 TraceCheckUtils]: 0: Hoare triple {32939#(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(10, 2);call #Ultimate.allocInit(12, 3); {32919#true} is VALID [2022-04-28 10:08:15,322 INFO L290 TraceCheckUtils]: 1: Hoare triple {32919#true} assume true; {32919#true} is VALID [2022-04-28 10:08:15,322 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32919#true} {32919#true} #61#return; {32919#true} is VALID [2022-04-28 10:08:15,322 INFO L272 TraceCheckUtils]: 0: Hoare triple {32919#true} call ULTIMATE.init(); {32939#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:08:15,322 INFO L290 TraceCheckUtils]: 1: Hoare triple {32939#(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(10, 2);call #Ultimate.allocInit(12, 3); {32919#true} is VALID [2022-04-28 10:08:15,322 INFO L290 TraceCheckUtils]: 2: Hoare triple {32919#true} assume true; {32919#true} is VALID [2022-04-28 10:08:15,322 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32919#true} {32919#true} #61#return; {32919#true} is VALID [2022-04-28 10:08:15,322 INFO L272 TraceCheckUtils]: 4: Hoare triple {32919#true} call #t~ret11 := main(); {32919#true} is VALID [2022-04-28 10:08:15,323 INFO L290 TraceCheckUtils]: 5: Hoare triple {32919#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {32924#(= main_~y~0 0)} is VALID [2022-04-28 10:08:15,323 INFO L290 TraceCheckUtils]: 6: Hoare triple {32924#(= 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; {32925#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:08:15,324 INFO L290 TraceCheckUtils]: 7: Hoare triple {32925#(and (<= 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; {32926#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:08:15,324 INFO L290 TraceCheckUtils]: 8: Hoare triple {32926#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {32927#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:08:15,325 INFO L290 TraceCheckUtils]: 9: Hoare triple {32927#(and (<= main_~y~0 3) (<= 3 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; {32928#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:08:15,325 INFO L290 TraceCheckUtils]: 10: Hoare triple {32928#(and (<= main_~y~0 4) (<= 4 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; {32929#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:08:15,326 INFO L290 TraceCheckUtils]: 11: Hoare triple {32929#(and (<= 5 main_~y~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; {32930#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:08:15,326 INFO L290 TraceCheckUtils]: 12: Hoare triple {32930#(and (<= main_~y~0 6) (<= 6 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; {32931#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:08:15,327 INFO L290 TraceCheckUtils]: 13: Hoare triple {32931#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {32931#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:08:15,327 INFO L290 TraceCheckUtils]: 14: Hoare triple {32931#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {32932#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:08:15,327 INFO L290 TraceCheckUtils]: 15: Hoare triple {32932#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {32933#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:08:15,328 INFO L290 TraceCheckUtils]: 16: Hoare triple {32933#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {32934#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:08:15,329 INFO L290 TraceCheckUtils]: 17: Hoare triple {32934#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {32935#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:08:15,329 INFO L290 TraceCheckUtils]: 18: Hoare triple {32935#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {32936#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:08:15,330 INFO L290 TraceCheckUtils]: 19: Hoare triple {32936#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {32937#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-28 10:08:15,330 INFO L290 TraceCheckUtils]: 20: Hoare triple {32937#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {32938#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-28 10:08:15,331 INFO L290 TraceCheckUtils]: 21: Hoare triple {32938#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {32920#false} is VALID [2022-04-28 10:08:15,331 INFO L290 TraceCheckUtils]: 22: Hoare triple {32920#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {32920#false} is VALID [2022-04-28 10:08:15,331 INFO L290 TraceCheckUtils]: 23: Hoare triple {32920#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {32920#false} is VALID [2022-04-28 10:08:15,331 INFO L290 TraceCheckUtils]: 24: Hoare triple {32920#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {32920#false} is VALID [2022-04-28 10:08:15,331 INFO L290 TraceCheckUtils]: 25: Hoare triple {32920#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {32920#false} is VALID [2022-04-28 10:08:15,331 INFO L290 TraceCheckUtils]: 26: Hoare triple {32920#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {32920#false} is VALID [2022-04-28 10:08:15,331 INFO L290 TraceCheckUtils]: 27: Hoare triple {32920#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {32920#false} is VALID [2022-04-28 10:08:15,331 INFO L290 TraceCheckUtils]: 28: Hoare triple {32920#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {32920#false} is VALID [2022-04-28 10:08:15,331 INFO L290 TraceCheckUtils]: 29: Hoare triple {32920#false} assume !(~y~0 % 4294967296 > 0); {32920#false} is VALID [2022-04-28 10:08:15,331 INFO L272 TraceCheckUtils]: 30: Hoare triple {32920#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {32920#false} is VALID [2022-04-28 10:08:15,331 INFO L290 TraceCheckUtils]: 31: Hoare triple {32920#false} ~cond := #in~cond; {32920#false} is VALID [2022-04-28 10:08:15,331 INFO L290 TraceCheckUtils]: 32: Hoare triple {32920#false} assume 0 == ~cond; {32920#false} is VALID [2022-04-28 10:08:15,331 INFO L290 TraceCheckUtils]: 33: Hoare triple {32920#false} assume !false; {32920#false} is VALID [2022-04-28 10:08:15,331 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-28 10:08:15,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:08:15,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304203157] [2022-04-28 10:08:15,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304203157] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:08:15,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [887352468] [2022-04-28 10:08:15,332 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:08:15,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:08:15,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:08:15,333 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:08:15,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Waiting until timeout for monitored process [2022-04-28 10:08:15,373 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:08:15,374 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:08:15,375 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 44 conjunts are in the unsatisfiable core [2022-04-28 10:08:15,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:15,383 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:08:15,658 INFO L272 TraceCheckUtils]: 0: Hoare triple {32919#true} call ULTIMATE.init(); {32919#true} is VALID [2022-04-28 10:08:15,658 INFO L290 TraceCheckUtils]: 1: Hoare triple {32919#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(10, 2);call #Ultimate.allocInit(12, 3); {32919#true} is VALID [2022-04-28 10:08:15,658 INFO L290 TraceCheckUtils]: 2: Hoare triple {32919#true} assume true; {32919#true} is VALID [2022-04-28 10:08:15,658 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32919#true} {32919#true} #61#return; {32919#true} is VALID [2022-04-28 10:08:15,658 INFO L272 TraceCheckUtils]: 4: Hoare triple {32919#true} call #t~ret11 := main(); {32919#true} is VALID [2022-04-28 10:08:15,658 INFO L290 TraceCheckUtils]: 5: Hoare triple {32919#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {32924#(= main_~y~0 0)} is VALID [2022-04-28 10:08:15,659 INFO L290 TraceCheckUtils]: 6: Hoare triple {32924#(= 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; {32925#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:08:15,659 INFO L290 TraceCheckUtils]: 7: Hoare triple {32925#(and (<= 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; {32926#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:08:15,660 INFO L290 TraceCheckUtils]: 8: Hoare triple {32926#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {32927#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:08:15,660 INFO L290 TraceCheckUtils]: 9: Hoare triple {32927#(and (<= main_~y~0 3) (<= 3 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; {32928#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:08:15,661 INFO L290 TraceCheckUtils]: 10: Hoare triple {32928#(and (<= main_~y~0 4) (<= 4 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; {32929#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:08:15,661 INFO L290 TraceCheckUtils]: 11: Hoare triple {32929#(and (<= 5 main_~y~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; {32930#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:08:15,662 INFO L290 TraceCheckUtils]: 12: Hoare triple {32930#(and (<= main_~y~0 6) (<= 6 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; {32931#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:08:15,662 INFO L290 TraceCheckUtils]: 13: Hoare triple {32931#(and (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~x~0 % 4294967296 > 0); {32931#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:08:15,662 INFO L290 TraceCheckUtils]: 14: Hoare triple {32931#(and (<= 7 main_~y~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {32985#(and (= main_~z~0 main_~y~0) (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:08:15,663 INFO L290 TraceCheckUtils]: 15: Hoare triple {32985#(and (= main_~z~0 main_~y~0) (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {32989#(and (<= 7 main_~y~0) (<= main_~y~0 7) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-28 10:08:15,663 INFO L290 TraceCheckUtils]: 16: Hoare triple {32989#(and (<= 7 main_~y~0) (<= main_~y~0 7) (= main_~y~0 (+ main_~z~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {32993#(and (<= 7 main_~y~0) (<= main_~y~0 7) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)))} is VALID [2022-04-28 10:08:15,664 INFO L290 TraceCheckUtils]: 17: Hoare triple {32993#(and (<= 7 main_~y~0) (<= main_~y~0 7) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {32997#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:08:15,664 INFO L290 TraceCheckUtils]: 18: Hoare triple {32997#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {33001#(and (<= 7 main_~y~0) (<= main_~y~0 7) (= (+ (- 2) main_~y~0) (+ main_~z~0 2)))} is VALID [2022-04-28 10:08:15,665 INFO L290 TraceCheckUtils]: 19: Hoare triple {33001#(and (<= 7 main_~y~0) (<= main_~y~0 7) (= (+ (- 2) main_~y~0) (+ main_~z~0 2)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {33005#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 3)) (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:08:15,666 INFO L290 TraceCheckUtils]: 20: Hoare triple {33005#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 3)) (<= 7 main_~y~0) (<= main_~y~0 7))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {33009#(and (= (+ main_~y~0 (- 5)) (+ main_~z~0 1)) (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:08:15,666 INFO L290 TraceCheckUtils]: 21: Hoare triple {33009#(and (= (+ main_~y~0 (- 5)) (+ main_~z~0 1)) (<= 7 main_~y~0) (<= main_~y~0 7))} assume !(~z~0 % 4294967296 > 0); {32920#false} is VALID [2022-04-28 10:08:15,666 INFO L290 TraceCheckUtils]: 22: Hoare triple {32920#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {32920#false} is VALID [2022-04-28 10:08:15,666 INFO L290 TraceCheckUtils]: 23: Hoare triple {32920#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {32920#false} is VALID [2022-04-28 10:08:15,666 INFO L290 TraceCheckUtils]: 24: Hoare triple {32920#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {32920#false} is VALID [2022-04-28 10:08:15,666 INFO L290 TraceCheckUtils]: 25: Hoare triple {32920#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {32920#false} is VALID [2022-04-28 10:08:15,666 INFO L290 TraceCheckUtils]: 26: Hoare triple {32920#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {32920#false} is VALID [2022-04-28 10:08:15,666 INFO L290 TraceCheckUtils]: 27: Hoare triple {32920#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {32920#false} is VALID [2022-04-28 10:08:15,666 INFO L290 TraceCheckUtils]: 28: Hoare triple {32920#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {32920#false} is VALID [2022-04-28 10:08:15,666 INFO L290 TraceCheckUtils]: 29: Hoare triple {32920#false} assume !(~y~0 % 4294967296 > 0); {32920#false} is VALID [2022-04-28 10:08:15,667 INFO L272 TraceCheckUtils]: 30: Hoare triple {32920#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {32920#false} is VALID [2022-04-28 10:08:15,667 INFO L290 TraceCheckUtils]: 31: Hoare triple {32920#false} ~cond := #in~cond; {32920#false} is VALID [2022-04-28 10:08:15,667 INFO L290 TraceCheckUtils]: 32: Hoare triple {32920#false} assume 0 == ~cond; {32920#false} is VALID [2022-04-28 10:08:15,667 INFO L290 TraceCheckUtils]: 33: Hoare triple {32920#false} assume !false; {32920#false} is VALID [2022-04-28 10:08:15,667 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-28 10:08:15,667 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:08:16,109 INFO L290 TraceCheckUtils]: 33: Hoare triple {32920#false} assume !false; {32920#false} is VALID [2022-04-28 10:08:16,110 INFO L290 TraceCheckUtils]: 32: Hoare triple {32920#false} assume 0 == ~cond; {32920#false} is VALID [2022-04-28 10:08:16,110 INFO L290 TraceCheckUtils]: 31: Hoare triple {32920#false} ~cond := #in~cond; {32920#false} is VALID [2022-04-28 10:08:16,110 INFO L272 TraceCheckUtils]: 30: Hoare triple {32920#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {32920#false} is VALID [2022-04-28 10:08:16,110 INFO L290 TraceCheckUtils]: 29: Hoare triple {32920#false} assume !(~y~0 % 4294967296 > 0); {32920#false} is VALID [2022-04-28 10:08:16,110 INFO L290 TraceCheckUtils]: 28: Hoare triple {33064#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {32920#false} is VALID [2022-04-28 10:08:16,111 INFO L290 TraceCheckUtils]: 27: Hoare triple {33068#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {33064#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:08:16,112 INFO L290 TraceCheckUtils]: 26: Hoare triple {33072#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {33068#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:08:16,112 INFO L290 TraceCheckUtils]: 25: Hoare triple {33076#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {33072#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-28 10:08:16,113 INFO L290 TraceCheckUtils]: 24: Hoare triple {33080#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {33076#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-28 10:08:16,114 INFO L290 TraceCheckUtils]: 23: Hoare triple {33084#(not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {33080#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:08:16,115 INFO L290 TraceCheckUtils]: 22: Hoare triple {33088#(not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {33084#(not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:08:16,115 INFO L290 TraceCheckUtils]: 21: Hoare triple {33092#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {33088#(not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:08:16,116 INFO L290 TraceCheckUtils]: 20: Hoare triple {33096#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {33092#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} is VALID [2022-04-28 10:08:16,117 INFO L290 TraceCheckUtils]: 19: Hoare triple {33100#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {33096#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} is VALID [2022-04-28 10:08:16,118 INFO L290 TraceCheckUtils]: 18: Hoare triple {33104#(or (< 0 (mod (+ main_~z~0 4294967293) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {33100#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} is VALID [2022-04-28 10:08:16,119 INFO L290 TraceCheckUtils]: 17: Hoare triple {33108#(or (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {33104#(or (< 0 (mod (+ main_~z~0 4294967293) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} is VALID [2022-04-28 10:08:16,119 INFO L290 TraceCheckUtils]: 16: Hoare triple {33112#(or (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {33108#(or (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} is VALID [2022-04-28 10:08:16,120 INFO L290 TraceCheckUtils]: 15: Hoare triple {33116#(or (< 0 (mod (+ 4294967290 main_~z~0) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {33112#(or (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} is VALID [2022-04-28 10:08:16,120 INFO L290 TraceCheckUtils]: 14: Hoare triple {32919#true} ~z~0 := ~y~0; {33116#(or (< 0 (mod (+ 4294967290 main_~z~0) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} is VALID [2022-04-28 10:08:16,120 INFO L290 TraceCheckUtils]: 13: Hoare triple {32919#true} assume !(~x~0 % 4294967296 > 0); {32919#true} is VALID [2022-04-28 10:08:16,121 INFO L290 TraceCheckUtils]: 12: Hoare triple {32919#true} 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; {32919#true} is VALID [2022-04-28 10:08:16,121 INFO L290 TraceCheckUtils]: 11: Hoare triple {32919#true} 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; {32919#true} is VALID [2022-04-28 10:08:16,121 INFO L290 TraceCheckUtils]: 10: Hoare triple {32919#true} 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; {32919#true} is VALID [2022-04-28 10:08:16,121 INFO L290 TraceCheckUtils]: 9: Hoare triple {32919#true} 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; {32919#true} is VALID [2022-04-28 10:08:16,121 INFO L290 TraceCheckUtils]: 8: Hoare triple {32919#true} 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; {32919#true} is VALID [2022-04-28 10:08:16,121 INFO L290 TraceCheckUtils]: 7: Hoare triple {32919#true} 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; {32919#true} is VALID [2022-04-28 10:08:16,121 INFO L290 TraceCheckUtils]: 6: Hoare triple {32919#true} 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; {32919#true} is VALID [2022-04-28 10:08:16,121 INFO L290 TraceCheckUtils]: 5: Hoare triple {32919#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {32919#true} is VALID [2022-04-28 10:08:16,121 INFO L272 TraceCheckUtils]: 4: Hoare triple {32919#true} call #t~ret11 := main(); {32919#true} is VALID [2022-04-28 10:08:16,121 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32919#true} {32919#true} #61#return; {32919#true} is VALID [2022-04-28 10:08:16,121 INFO L290 TraceCheckUtils]: 2: Hoare triple {32919#true} assume true; {32919#true} is VALID [2022-04-28 10:08:16,121 INFO L290 TraceCheckUtils]: 1: Hoare triple {32919#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(10, 2);call #Ultimate.allocInit(12, 3); {32919#true} is VALID [2022-04-28 10:08:16,121 INFO L272 TraceCheckUtils]: 0: Hoare triple {32919#true} call ULTIMATE.init(); {32919#true} is VALID [2022-04-28 10:08:16,121 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 7 proven. 42 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-28 10:08:16,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [887352468] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:08:16,121 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:08:16,122 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 16] total 39 [2022-04-28 10:08:16,122 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:08:16,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1914663019] [2022-04-28 10:08:16,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1914663019] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:08:16,122 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:08:16,122 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-28 10:08:16,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814490554] [2022-04-28 10:08:16,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:08:16,122 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 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 34 [2022-04-28 10:08:16,122 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:08:16,122 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 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-28 10:08:16,140 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:08:16,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-28 10:08:16,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:16,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-28 10:08:16,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=1279, Unknown=0, NotChecked=0, Total=1482 [2022-04-28 10:08:16,141 INFO L87 Difference]: Start difference. First operand 103 states and 131 transitions. Second operand has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 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-28 10:08:17,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:17,237 INFO L93 Difference]: Finished difference Result 126 states and 154 transitions. [2022-04-28 10:08:17,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-28 10:08:17,237 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 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 34 [2022-04-28 10:08:17,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:08:17,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 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-28 10:08:17,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 52 transitions. [2022-04-28 10:08:17,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 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-28 10:08:17,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 52 transitions. [2022-04-28 10:08:17,238 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 52 transitions. [2022-04-28 10:08:17,275 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:08:17,276 INFO L225 Difference]: With dead ends: 126 [2022-04-28 10:08:17,276 INFO L226 Difference]: Without dead ends: 113 [2022-04-28 10:08:17,276 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 457 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=347, Invalid=2515, Unknown=0, NotChecked=0, Total=2862 [2022-04-28 10:08:17,277 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 17 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 476 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 508 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 10:08:17,277 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 88 Invalid, 508 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 476 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 10:08:17,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-04-28 10:08:17,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 104. [2022-04-28 10:08:17,383 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:08:17,383 INFO L82 GeneralOperation]: Start isEquivalent. First operand 113 states. Second operand has 104 states, 99 states have (on average 1.292929292929293) internal successors, (128), 99 states have internal predecessors, (128), 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-28 10:08:17,383 INFO L74 IsIncluded]: Start isIncluded. First operand 113 states. Second operand has 104 states, 99 states have (on average 1.292929292929293) internal successors, (128), 99 states have internal predecessors, (128), 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-28 10:08:17,383 INFO L87 Difference]: Start difference. First operand 113 states. Second operand has 104 states, 99 states have (on average 1.292929292929293) internal successors, (128), 99 states have internal predecessors, (128), 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-28 10:08:17,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:17,384 INFO L93 Difference]: Finished difference Result 113 states and 141 transitions. [2022-04-28 10:08:17,384 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 141 transitions. [2022-04-28 10:08:17,384 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:17,384 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:17,385 INFO L74 IsIncluded]: Start isIncluded. First operand has 104 states, 99 states have (on average 1.292929292929293) internal successors, (128), 99 states have internal predecessors, (128), 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 113 states. [2022-04-28 10:08:17,385 INFO L87 Difference]: Start difference. First operand has 104 states, 99 states have (on average 1.292929292929293) internal successors, (128), 99 states have internal predecessors, (128), 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 113 states. [2022-04-28 10:08:17,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:17,385 INFO L93 Difference]: Finished difference Result 113 states and 141 transitions. [2022-04-28 10:08:17,386 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 141 transitions. [2022-04-28 10:08:17,386 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:17,386 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:17,386 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:08:17,386 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:08:17,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 99 states have (on average 1.292929292929293) internal successors, (128), 99 states have internal predecessors, (128), 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-28 10:08:17,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 132 transitions. [2022-04-28 10:08:17,387 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 132 transitions. Word has length 34 [2022-04-28 10:08:17,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:08:17,387 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 132 transitions. [2022-04-28 10:08:17,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 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-28 10:08:17,387 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 104 states and 132 transitions. [2022-04-28 10:08:19,119 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 132 edges. 132 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:08:19,119 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 132 transitions. [2022-04-28 10:08:19,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-28 10:08:19,120 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:08:19,120 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:08:19,136 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Forceful destruction successful, exit code 0 [2022-04-28 10:08:19,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51,52 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:08:19,320 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:08:19,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:08:19,320 INFO L85 PathProgramCache]: Analyzing trace with hash 661878733, now seen corresponding path program 65 times [2022-04-28 10:08:19,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:19,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1777081384] [2022-04-28 10:08:19,322 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:08:19,323 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:08:19,323 INFO L85 PathProgramCache]: Analyzing trace with hash 661878733, now seen corresponding path program 66 times [2022-04-28 10:08:19,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:08:19,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141740531] [2022-04-28 10:08:19,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:08:19,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:08:19,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:19,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:08:19,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:19,524 INFO L290 TraceCheckUtils]: 0: Hoare triple {33899#(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(10, 2);call #Ultimate.allocInit(12, 3); {33880#true} is VALID [2022-04-28 10:08:19,524 INFO L290 TraceCheckUtils]: 1: Hoare triple {33880#true} assume true; {33880#true} is VALID [2022-04-28 10:08:19,524 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {33880#true} {33880#true} #61#return; {33880#true} is VALID [2022-04-28 10:08:19,525 INFO L272 TraceCheckUtils]: 0: Hoare triple {33880#true} call ULTIMATE.init(); {33899#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:08:19,525 INFO L290 TraceCheckUtils]: 1: Hoare triple {33899#(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(10, 2);call #Ultimate.allocInit(12, 3); {33880#true} is VALID [2022-04-28 10:08:19,525 INFO L290 TraceCheckUtils]: 2: Hoare triple {33880#true} assume true; {33880#true} is VALID [2022-04-28 10:08:19,525 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33880#true} {33880#true} #61#return; {33880#true} is VALID [2022-04-28 10:08:19,525 INFO L272 TraceCheckUtils]: 4: Hoare triple {33880#true} call #t~ret11 := main(); {33880#true} is VALID [2022-04-28 10:08:19,525 INFO L290 TraceCheckUtils]: 5: Hoare triple {33880#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {33885#(= main_~y~0 0)} is VALID [2022-04-28 10:08:19,525 INFO L290 TraceCheckUtils]: 6: Hoare triple {33885#(= 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; {33886#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:08:19,526 INFO L290 TraceCheckUtils]: 7: Hoare triple {33886#(and (<= 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; {33887#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:08:19,526 INFO L290 TraceCheckUtils]: 8: Hoare triple {33887#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {33888#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:08:19,527 INFO L290 TraceCheckUtils]: 9: Hoare triple {33888#(and (<= main_~y~0 3) (<= 3 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; {33889#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:08:19,527 INFO L290 TraceCheckUtils]: 10: Hoare triple {33889#(and (<= main_~y~0 4) (<= 4 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; {33890#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:08:19,528 INFO L290 TraceCheckUtils]: 11: Hoare triple {33890#(and (<= 5 main_~y~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; {33891#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:08:19,528 INFO L290 TraceCheckUtils]: 12: Hoare triple {33891#(and (<= main_~y~0 6) (<= 6 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; {33892#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:08:19,529 INFO L290 TraceCheckUtils]: 13: Hoare triple {33892#(and (<= 7 main_~y~0) (<= main_~y~0 7))} 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; {33893#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:08:19,529 INFO L290 TraceCheckUtils]: 14: Hoare triple {33893#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {33893#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:08:19,529 INFO L290 TraceCheckUtils]: 15: Hoare triple {33893#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {33894#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:08:19,530 INFO L290 TraceCheckUtils]: 16: Hoare triple {33894#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {33895#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:08:19,530 INFO L290 TraceCheckUtils]: 17: Hoare triple {33895#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {33896#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:08:19,531 INFO L290 TraceCheckUtils]: 18: Hoare triple {33896#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {33897#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:08:19,532 INFO L290 TraceCheckUtils]: 19: Hoare triple {33897#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {33898#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:08:19,532 INFO L290 TraceCheckUtils]: 20: Hoare triple {33898#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {33881#false} is VALID [2022-04-28 10:08:19,532 INFO L290 TraceCheckUtils]: 21: Hoare triple {33881#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {33881#false} is VALID [2022-04-28 10:08:19,532 INFO L290 TraceCheckUtils]: 22: Hoare triple {33881#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {33881#false} is VALID [2022-04-28 10:08:19,532 INFO L290 TraceCheckUtils]: 23: Hoare triple {33881#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {33881#false} is VALID [2022-04-28 10:08:19,532 INFO L290 TraceCheckUtils]: 24: Hoare triple {33881#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {33881#false} is VALID [2022-04-28 10:08:19,532 INFO L290 TraceCheckUtils]: 25: Hoare triple {33881#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {33881#false} is VALID [2022-04-28 10:08:19,532 INFO L290 TraceCheckUtils]: 26: Hoare triple {33881#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {33881#false} is VALID [2022-04-28 10:08:19,532 INFO L290 TraceCheckUtils]: 27: Hoare triple {33881#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {33881#false} is VALID [2022-04-28 10:08:19,532 INFO L290 TraceCheckUtils]: 28: Hoare triple {33881#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {33881#false} is VALID [2022-04-28 10:08:19,532 INFO L290 TraceCheckUtils]: 29: Hoare triple {33881#false} assume !(~y~0 % 4294967296 > 0); {33881#false} is VALID [2022-04-28 10:08:19,532 INFO L272 TraceCheckUtils]: 30: Hoare triple {33881#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {33881#false} is VALID [2022-04-28 10:08:19,532 INFO L290 TraceCheckUtils]: 31: Hoare triple {33881#false} ~cond := #in~cond; {33881#false} is VALID [2022-04-28 10:08:19,532 INFO L290 TraceCheckUtils]: 32: Hoare triple {33881#false} assume 0 == ~cond; {33881#false} is VALID [2022-04-28 10:08:19,533 INFO L290 TraceCheckUtils]: 33: Hoare triple {33881#false} assume !false; {33881#false} is VALID [2022-04-28 10:08:19,533 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-28 10:08:19,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:08:19,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141740531] [2022-04-28 10:08:19,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141740531] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:08:19,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1253066507] [2022-04-28 10:08:19,533 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:08:19,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:08:19,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:08:19,534 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:08:19,535 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Waiting until timeout for monitored process [2022-04-28 10:08:19,637 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-28 10:08:19,637 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:08:19,638 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-28 10:08:19,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:19,646 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:08:19,880 INFO L272 TraceCheckUtils]: 0: Hoare triple {33880#true} call ULTIMATE.init(); {33880#true} is VALID [2022-04-28 10:08:19,881 INFO L290 TraceCheckUtils]: 1: Hoare triple {33880#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(10, 2);call #Ultimate.allocInit(12, 3); {33880#true} is VALID [2022-04-28 10:08:19,881 INFO L290 TraceCheckUtils]: 2: Hoare triple {33880#true} assume true; {33880#true} is VALID [2022-04-28 10:08:19,881 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33880#true} {33880#true} #61#return; {33880#true} is VALID [2022-04-28 10:08:19,881 INFO L272 TraceCheckUtils]: 4: Hoare triple {33880#true} call #t~ret11 := main(); {33880#true} is VALID [2022-04-28 10:08:19,881 INFO L290 TraceCheckUtils]: 5: Hoare triple {33880#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {33885#(= main_~y~0 0)} is VALID [2022-04-28 10:08:19,881 INFO L290 TraceCheckUtils]: 6: Hoare triple {33885#(= 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; {33886#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:08:19,882 INFO L290 TraceCheckUtils]: 7: Hoare triple {33886#(and (<= 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; {33887#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:08:19,882 INFO L290 TraceCheckUtils]: 8: Hoare triple {33887#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {33888#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:08:19,883 INFO L290 TraceCheckUtils]: 9: Hoare triple {33888#(and (<= main_~y~0 3) (<= 3 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; {33889#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:08:19,884 INFO L290 TraceCheckUtils]: 10: Hoare triple {33889#(and (<= main_~y~0 4) (<= 4 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; {33890#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:08:19,884 INFO L290 TraceCheckUtils]: 11: Hoare triple {33890#(and (<= 5 main_~y~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; {33891#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:08:19,884 INFO L290 TraceCheckUtils]: 12: Hoare triple {33891#(and (<= main_~y~0 6) (<= 6 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; {33892#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:08:19,885 INFO L290 TraceCheckUtils]: 13: Hoare triple {33892#(and (<= 7 main_~y~0) (<= main_~y~0 7))} 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; {33893#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:08:19,885 INFO L290 TraceCheckUtils]: 14: Hoare triple {33893#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {33893#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:08:19,886 INFO L290 TraceCheckUtils]: 15: Hoare triple {33893#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {33894#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:08:19,886 INFO L290 TraceCheckUtils]: 16: Hoare triple {33894#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {33895#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:08:19,887 INFO L290 TraceCheckUtils]: 17: Hoare triple {33895#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {33896#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:08:19,887 INFO L290 TraceCheckUtils]: 18: Hoare triple {33896#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {33897#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:08:19,888 INFO L290 TraceCheckUtils]: 19: Hoare triple {33897#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {33960#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:08:19,888 INFO L290 TraceCheckUtils]: 20: Hoare triple {33960#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !(~z~0 % 4294967296 > 0); {33881#false} is VALID [2022-04-28 10:08:19,888 INFO L290 TraceCheckUtils]: 21: Hoare triple {33881#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {33881#false} is VALID [2022-04-28 10:08:19,888 INFO L290 TraceCheckUtils]: 22: Hoare triple {33881#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {33881#false} is VALID [2022-04-28 10:08:19,888 INFO L290 TraceCheckUtils]: 23: Hoare triple {33881#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {33881#false} is VALID [2022-04-28 10:08:19,888 INFO L290 TraceCheckUtils]: 24: Hoare triple {33881#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {33881#false} is VALID [2022-04-28 10:08:19,888 INFO L290 TraceCheckUtils]: 25: Hoare triple {33881#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {33881#false} is VALID [2022-04-28 10:08:19,888 INFO L290 TraceCheckUtils]: 26: Hoare triple {33881#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {33881#false} is VALID [2022-04-28 10:08:19,888 INFO L290 TraceCheckUtils]: 27: Hoare triple {33881#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {33881#false} is VALID [2022-04-28 10:08:19,888 INFO L290 TraceCheckUtils]: 28: Hoare triple {33881#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {33881#false} is VALID [2022-04-28 10:08:19,889 INFO L290 TraceCheckUtils]: 29: Hoare triple {33881#false} assume !(~y~0 % 4294967296 > 0); {33881#false} is VALID [2022-04-28 10:08:19,889 INFO L272 TraceCheckUtils]: 30: Hoare triple {33881#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {33881#false} is VALID [2022-04-28 10:08:19,889 INFO L290 TraceCheckUtils]: 31: Hoare triple {33881#false} ~cond := #in~cond; {33881#false} is VALID [2022-04-28 10:08:19,889 INFO L290 TraceCheckUtils]: 32: Hoare triple {33881#false} assume 0 == ~cond; {33881#false} is VALID [2022-04-28 10:08:19,889 INFO L290 TraceCheckUtils]: 33: Hoare triple {33881#false} assume !false; {33881#false} is VALID [2022-04-28 10:08:19,889 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-28 10:08:19,889 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:08:20,237 INFO L290 TraceCheckUtils]: 33: Hoare triple {33881#false} assume !false; {33881#false} is VALID [2022-04-28 10:08:20,238 INFO L290 TraceCheckUtils]: 32: Hoare triple {33881#false} assume 0 == ~cond; {33881#false} is VALID [2022-04-28 10:08:20,238 INFO L290 TraceCheckUtils]: 31: Hoare triple {33881#false} ~cond := #in~cond; {33881#false} is VALID [2022-04-28 10:08:20,238 INFO L272 TraceCheckUtils]: 30: Hoare triple {33881#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {33881#false} is VALID [2022-04-28 10:08:20,238 INFO L290 TraceCheckUtils]: 29: Hoare triple {33881#false} assume !(~y~0 % 4294967296 > 0); {33881#false} is VALID [2022-04-28 10:08:20,238 INFO L290 TraceCheckUtils]: 28: Hoare triple {33881#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {33881#false} is VALID [2022-04-28 10:08:20,238 INFO L290 TraceCheckUtils]: 27: Hoare triple {33881#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {33881#false} is VALID [2022-04-28 10:08:20,238 INFO L290 TraceCheckUtils]: 26: Hoare triple {33881#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {33881#false} is VALID [2022-04-28 10:08:20,238 INFO L290 TraceCheckUtils]: 25: Hoare triple {33881#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {33881#false} is VALID [2022-04-28 10:08:20,238 INFO L290 TraceCheckUtils]: 24: Hoare triple {33881#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {33881#false} is VALID [2022-04-28 10:08:20,238 INFO L290 TraceCheckUtils]: 23: Hoare triple {33881#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {33881#false} is VALID [2022-04-28 10:08:20,238 INFO L290 TraceCheckUtils]: 22: Hoare triple {33881#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {33881#false} is VALID [2022-04-28 10:08:20,238 INFO L290 TraceCheckUtils]: 21: Hoare triple {33881#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {33881#false} is VALID [2022-04-28 10:08:20,238 INFO L290 TraceCheckUtils]: 20: Hoare triple {34042#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {33881#false} is VALID [2022-04-28 10:08:20,239 INFO L290 TraceCheckUtils]: 19: Hoare triple {34046#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {34042#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:08:20,240 INFO L290 TraceCheckUtils]: 18: Hoare triple {34050#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {34046#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:08:20,240 INFO L290 TraceCheckUtils]: 17: Hoare triple {34054#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {34050#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-28 10:08:20,241 INFO L290 TraceCheckUtils]: 16: Hoare triple {34058#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {34054#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-28 10:08:20,241 INFO L290 TraceCheckUtils]: 15: Hoare triple {34062#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} ~z~0 := ~y~0; {34058#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID [2022-04-28 10:08:20,242 INFO L290 TraceCheckUtils]: 14: Hoare triple {34062#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {34062#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-28 10:08:20,242 INFO L290 TraceCheckUtils]: 13: Hoare triple {34069#(< 0 (mod (+ main_~y~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; {34062#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-28 10:08:20,243 INFO L290 TraceCheckUtils]: 12: Hoare triple {34073#(< 0 (mod (+ main_~y~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; {34069#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 10:08:20,244 INFO L290 TraceCheckUtils]: 11: Hoare triple {34077#(< 0 (mod (+ main_~y~0 4294967295) 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; {34073#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:08:20,244 INFO L290 TraceCheckUtils]: 10: Hoare triple {34081#(< 0 (mod main_~y~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; {34077#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:08:20,245 INFO L290 TraceCheckUtils]: 9: Hoare triple {34085#(< 0 (mod (+ main_~y~0 1) 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; {34081#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:08:20,246 INFO L290 TraceCheckUtils]: 8: Hoare triple {34089#(< 0 (mod (+ main_~y~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; {34085#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:08:20,246 INFO L290 TraceCheckUtils]: 7: Hoare triple {34093#(< 0 (mod (+ main_~y~0 3) 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; {34089#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:08:20,247 INFO L290 TraceCheckUtils]: 6: Hoare triple {34097#(< 0 (mod (+ main_~y~0 4) 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; {34093#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:08:20,247 INFO L290 TraceCheckUtils]: 5: Hoare triple {33880#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {34097#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:08:20,247 INFO L272 TraceCheckUtils]: 4: Hoare triple {33880#true} call #t~ret11 := main(); {33880#true} is VALID [2022-04-28 10:08:20,247 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33880#true} {33880#true} #61#return; {33880#true} is VALID [2022-04-28 10:08:20,247 INFO L290 TraceCheckUtils]: 2: Hoare triple {33880#true} assume true; {33880#true} is VALID [2022-04-28 10:08:20,248 INFO L290 TraceCheckUtils]: 1: Hoare triple {33880#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(10, 2);call #Ultimate.allocInit(12, 3); {33880#true} is VALID [2022-04-28 10:08:20,248 INFO L272 TraceCheckUtils]: 0: Hoare triple {33880#true} call ULTIMATE.init(); {33880#true} is VALID [2022-04-28 10:08:20,248 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-28 10:08:20,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1253066507] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:08:20,248 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:08:20,248 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 32 [2022-04-28 10:08:20,248 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:08:20,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1777081384] [2022-04-28 10:08:20,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1777081384] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:08:20,248 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:08:20,248 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-28 10:08:20,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554122398] [2022-04-28 10:08:20,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:08:20,249 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 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 34 [2022-04-28 10:08:20,249 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:08:20,249 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 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-28 10:08:20,265 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:08:20,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-28 10:08:20,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:20,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-28 10:08:20,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=822, Unknown=0, NotChecked=0, Total=992 [2022-04-28 10:08:20,266 INFO L87 Difference]: Start difference. First operand 104 states and 132 transitions. Second operand has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 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-28 10:08:21,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:21,312 INFO L93 Difference]: Finished difference Result 129 states and 157 transitions. [2022-04-28 10:08:21,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-28 10:08:21,312 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 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 34 [2022-04-28 10:08:21,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:08:21,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 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-28 10:08:21,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 60 transitions. [2022-04-28 10:08:21,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 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-28 10:08:21,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 60 transitions. [2022-04-28 10:08:21,313 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 60 transitions. [2022-04-28 10:08:21,357 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:08:21,358 INFO L225 Difference]: With dead ends: 129 [2022-04-28 10:08:21,358 INFO L226 Difference]: Without dead ends: 115 [2022-04-28 10:08:21,359 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=474, Invalid=1976, Unknown=0, NotChecked=0, Total=2450 [2022-04-28 10:08:21,359 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 23 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 10:08:21,359 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 75 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 452 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 10:08:21,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-04-28 10:08:21,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 105. [2022-04-28 10:08:21,469 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:08:21,470 INFO L82 GeneralOperation]: Start isEquivalent. First operand 115 states. Second operand has 105 states, 100 states have (on average 1.29) internal successors, (129), 100 states have internal predecessors, (129), 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-28 10:08:21,470 INFO L74 IsIncluded]: Start isIncluded. First operand 115 states. Second operand has 105 states, 100 states have (on average 1.29) internal successors, (129), 100 states have internal predecessors, (129), 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-28 10:08:21,470 INFO L87 Difference]: Start difference. First operand 115 states. Second operand has 105 states, 100 states have (on average 1.29) internal successors, (129), 100 states have internal predecessors, (129), 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-28 10:08:21,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:21,471 INFO L93 Difference]: Finished difference Result 115 states and 143 transitions. [2022-04-28 10:08:21,471 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 143 transitions. [2022-04-28 10:08:21,471 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:21,471 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:21,471 INFO L74 IsIncluded]: Start isIncluded. First operand has 105 states, 100 states have (on average 1.29) internal successors, (129), 100 states have internal predecessors, (129), 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 115 states. [2022-04-28 10:08:21,471 INFO L87 Difference]: Start difference. First operand has 105 states, 100 states have (on average 1.29) internal successors, (129), 100 states have internal predecessors, (129), 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 115 states. [2022-04-28 10:08:21,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:21,472 INFO L93 Difference]: Finished difference Result 115 states and 143 transitions. [2022-04-28 10:08:21,472 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 143 transitions. [2022-04-28 10:08:21,472 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:21,472 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:21,472 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:08:21,472 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:08:21,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 100 states have (on average 1.29) internal successors, (129), 100 states have internal predecessors, (129), 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-28 10:08:21,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 133 transitions. [2022-04-28 10:08:21,473 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 133 transitions. Word has length 34 [2022-04-28 10:08:21,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:08:21,473 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 133 transitions. [2022-04-28 10:08:21,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 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-28 10:08:21,473 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 105 states and 133 transitions. [2022-04-28 10:08:25,697 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 133 edges. 132 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 10:08:25,697 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 133 transitions. [2022-04-28 10:08:25,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-28 10:08:25,697 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:08:25,697 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:08:25,716 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Ended with exit code 0 [2022-04-28 10:08:25,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 53 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable52 [2022-04-28 10:08:25,898 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:08:25,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:08:25,898 INFO L85 PathProgramCache]: Analyzing trace with hash 2379647, now seen corresponding path program 67 times [2022-04-28 10:08:25,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:25,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [18219314] [2022-04-28 10:08:25,900 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:08:25,900 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:08:25,900 INFO L85 PathProgramCache]: Analyzing trace with hash 2379647, now seen corresponding path program 68 times [2022-04-28 10:08:25,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:08:25,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710790690] [2022-04-28 10:08:25,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:08:25,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:08:25,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:26,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:08:26,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:26,073 INFO L290 TraceCheckUtils]: 0: Hoare triple {34870#(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(10, 2);call #Ultimate.allocInit(12, 3); {34852#true} is VALID [2022-04-28 10:08:26,073 INFO L290 TraceCheckUtils]: 1: Hoare triple {34852#true} assume true; {34852#true} is VALID [2022-04-28 10:08:26,073 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {34852#true} {34852#true} #61#return; {34852#true} is VALID [2022-04-28 10:08:26,074 INFO L272 TraceCheckUtils]: 0: Hoare triple {34852#true} call ULTIMATE.init(); {34870#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:08:26,074 INFO L290 TraceCheckUtils]: 1: Hoare triple {34870#(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(10, 2);call #Ultimate.allocInit(12, 3); {34852#true} is VALID [2022-04-28 10:08:26,074 INFO L290 TraceCheckUtils]: 2: Hoare triple {34852#true} assume true; {34852#true} is VALID [2022-04-28 10:08:26,074 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34852#true} {34852#true} #61#return; {34852#true} is VALID [2022-04-28 10:08:26,074 INFO L272 TraceCheckUtils]: 4: Hoare triple {34852#true} call #t~ret11 := main(); {34852#true} is VALID [2022-04-28 10:08:26,074 INFO L290 TraceCheckUtils]: 5: Hoare triple {34852#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {34857#(= main_~y~0 0)} is VALID [2022-04-28 10:08:26,074 INFO L290 TraceCheckUtils]: 6: Hoare triple {34857#(= 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; {34858#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:08:26,075 INFO L290 TraceCheckUtils]: 7: Hoare triple {34858#(and (<= 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; {34859#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:08:26,076 INFO L290 TraceCheckUtils]: 8: Hoare triple {34859#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {34860#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:08:26,076 INFO L290 TraceCheckUtils]: 9: Hoare triple {34860#(and (<= main_~y~0 3) (<= 3 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; {34861#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:08:26,077 INFO L290 TraceCheckUtils]: 10: Hoare triple {34861#(and (<= main_~y~0 4) (<= 4 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; {34862#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:08:26,077 INFO L290 TraceCheckUtils]: 11: Hoare triple {34862#(and (<= 5 main_~y~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; {34863#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:08:26,078 INFO L290 TraceCheckUtils]: 12: Hoare triple {34863#(and (<= main_~y~0 6) (<= 6 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; {34864#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:08:26,078 INFO L290 TraceCheckUtils]: 13: Hoare triple {34864#(and (<= 7 main_~y~0) (<= main_~y~0 7))} 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; {34865#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:08:26,078 INFO L290 TraceCheckUtils]: 14: Hoare triple {34865#(and (<= main_~y~0 8) (<= 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; {34866#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:08:26,079 INFO L290 TraceCheckUtils]: 15: Hoare triple {34866#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {34866#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:08:26,079 INFO L290 TraceCheckUtils]: 16: Hoare triple {34866#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {34867#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:08:26,080 INFO L290 TraceCheckUtils]: 17: Hoare triple {34867#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {34868#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:08:26,080 INFO L290 TraceCheckUtils]: 18: Hoare triple {34868#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {34869#(and (<= 7 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:08:26,081 INFO L290 TraceCheckUtils]: 19: Hoare triple {34869#(and (<= 7 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {34853#false} is VALID [2022-04-28 10:08:26,081 INFO L290 TraceCheckUtils]: 20: Hoare triple {34853#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {34853#false} is VALID [2022-04-28 10:08:26,081 INFO L290 TraceCheckUtils]: 21: Hoare triple {34853#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {34853#false} is VALID [2022-04-28 10:08:26,081 INFO L290 TraceCheckUtils]: 22: Hoare triple {34853#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {34853#false} is VALID [2022-04-28 10:08:26,081 INFO L290 TraceCheckUtils]: 23: Hoare triple {34853#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {34853#false} is VALID [2022-04-28 10:08:26,081 INFO L290 TraceCheckUtils]: 24: Hoare triple {34853#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {34853#false} is VALID [2022-04-28 10:08:26,081 INFO L290 TraceCheckUtils]: 25: Hoare triple {34853#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {34853#false} is VALID [2022-04-28 10:08:26,081 INFO L290 TraceCheckUtils]: 26: Hoare triple {34853#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {34853#false} is VALID [2022-04-28 10:08:26,081 INFO L290 TraceCheckUtils]: 27: Hoare triple {34853#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {34853#false} is VALID [2022-04-28 10:08:26,081 INFO L290 TraceCheckUtils]: 28: Hoare triple {34853#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {34853#false} is VALID [2022-04-28 10:08:26,081 INFO L290 TraceCheckUtils]: 29: Hoare triple {34853#false} assume !(~y~0 % 4294967296 > 0); {34853#false} is VALID [2022-04-28 10:08:26,081 INFO L272 TraceCheckUtils]: 30: Hoare triple {34853#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {34853#false} is VALID [2022-04-28 10:08:26,081 INFO L290 TraceCheckUtils]: 31: Hoare triple {34853#false} ~cond := #in~cond; {34853#false} is VALID [2022-04-28 10:08:26,081 INFO L290 TraceCheckUtils]: 32: Hoare triple {34853#false} assume 0 == ~cond; {34853#false} is VALID [2022-04-28 10:08:26,081 INFO L290 TraceCheckUtils]: 33: Hoare triple {34853#false} assume !false; {34853#false} is VALID [2022-04-28 10:08:26,081 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-04-28 10:08:26,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:08:26,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710790690] [2022-04-28 10:08:26,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710790690] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:08:26,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [836446139] [2022-04-28 10:08:26,082 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:08:26,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:08:26,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:08:26,083 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:08:26,083 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Waiting until timeout for monitored process [2022-04-28 10:08:26,120 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:08:26,120 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:08:26,121 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-28 10:08:26,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:26,128 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:08:26,345 INFO L272 TraceCheckUtils]: 0: Hoare triple {34852#true} call ULTIMATE.init(); {34852#true} is VALID [2022-04-28 10:08:26,345 INFO L290 TraceCheckUtils]: 1: Hoare triple {34852#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(10, 2);call #Ultimate.allocInit(12, 3); {34852#true} is VALID [2022-04-28 10:08:26,345 INFO L290 TraceCheckUtils]: 2: Hoare triple {34852#true} assume true; {34852#true} is VALID [2022-04-28 10:08:26,345 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34852#true} {34852#true} #61#return; {34852#true} is VALID [2022-04-28 10:08:26,345 INFO L272 TraceCheckUtils]: 4: Hoare triple {34852#true} call #t~ret11 := main(); {34852#true} is VALID [2022-04-28 10:08:26,345 INFO L290 TraceCheckUtils]: 5: Hoare triple {34852#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {34857#(= main_~y~0 0)} is VALID [2022-04-28 10:08:26,346 INFO L290 TraceCheckUtils]: 6: Hoare triple {34857#(= 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; {34858#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:08:26,346 INFO L290 TraceCheckUtils]: 7: Hoare triple {34858#(and (<= 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; {34859#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:08:26,347 INFO L290 TraceCheckUtils]: 8: Hoare triple {34859#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {34860#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:08:26,347 INFO L290 TraceCheckUtils]: 9: Hoare triple {34860#(and (<= main_~y~0 3) (<= 3 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; {34861#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:08:26,348 INFO L290 TraceCheckUtils]: 10: Hoare triple {34861#(and (<= main_~y~0 4) (<= 4 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; {34862#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:08:26,348 INFO L290 TraceCheckUtils]: 11: Hoare triple {34862#(and (<= 5 main_~y~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; {34863#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:08:26,349 INFO L290 TraceCheckUtils]: 12: Hoare triple {34863#(and (<= main_~y~0 6) (<= 6 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; {34864#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:08:26,349 INFO L290 TraceCheckUtils]: 13: Hoare triple {34864#(and (<= 7 main_~y~0) (<= main_~y~0 7))} 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; {34865#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:08:26,350 INFO L290 TraceCheckUtils]: 14: Hoare triple {34865#(and (<= main_~y~0 8) (<= 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; {34866#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:08:26,350 INFO L290 TraceCheckUtils]: 15: Hoare triple {34866#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {34866#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:08:26,350 INFO L290 TraceCheckUtils]: 16: Hoare triple {34866#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {34867#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:08:26,351 INFO L290 TraceCheckUtils]: 17: Hoare triple {34867#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {34868#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:08:26,351 INFO L290 TraceCheckUtils]: 18: Hoare triple {34868#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {34928#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:08:26,352 INFO L290 TraceCheckUtils]: 19: Hoare triple {34928#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {34853#false} is VALID [2022-04-28 10:08:26,352 INFO L290 TraceCheckUtils]: 20: Hoare triple {34853#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {34853#false} is VALID [2022-04-28 10:08:26,352 INFO L290 TraceCheckUtils]: 21: Hoare triple {34853#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {34853#false} is VALID [2022-04-28 10:08:26,352 INFO L290 TraceCheckUtils]: 22: Hoare triple {34853#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {34853#false} is VALID [2022-04-28 10:08:26,352 INFO L290 TraceCheckUtils]: 23: Hoare triple {34853#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {34853#false} is VALID [2022-04-28 10:08:26,352 INFO L290 TraceCheckUtils]: 24: Hoare triple {34853#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {34853#false} is VALID [2022-04-28 10:08:26,352 INFO L290 TraceCheckUtils]: 25: Hoare triple {34853#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {34853#false} is VALID [2022-04-28 10:08:26,352 INFO L290 TraceCheckUtils]: 26: Hoare triple {34853#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {34853#false} is VALID [2022-04-28 10:08:26,352 INFO L290 TraceCheckUtils]: 27: Hoare triple {34853#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {34853#false} is VALID [2022-04-28 10:08:26,352 INFO L290 TraceCheckUtils]: 28: Hoare triple {34853#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {34853#false} is VALID [2022-04-28 10:08:26,352 INFO L290 TraceCheckUtils]: 29: Hoare triple {34853#false} assume !(~y~0 % 4294967296 > 0); {34853#false} is VALID [2022-04-28 10:08:26,352 INFO L272 TraceCheckUtils]: 30: Hoare triple {34853#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {34853#false} is VALID [2022-04-28 10:08:26,352 INFO L290 TraceCheckUtils]: 31: Hoare triple {34853#false} ~cond := #in~cond; {34853#false} is VALID [2022-04-28 10:08:26,352 INFO L290 TraceCheckUtils]: 32: Hoare triple {34853#false} assume 0 == ~cond; {34853#false} is VALID [2022-04-28 10:08:26,353 INFO L290 TraceCheckUtils]: 33: Hoare triple {34853#false} assume !false; {34853#false} is VALID [2022-04-28 10:08:26,353 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-04-28 10:08:26,353 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:08:26,670 INFO L290 TraceCheckUtils]: 33: Hoare triple {34853#false} assume !false; {34853#false} is VALID [2022-04-28 10:08:26,671 INFO L290 TraceCheckUtils]: 32: Hoare triple {34853#false} assume 0 == ~cond; {34853#false} is VALID [2022-04-28 10:08:26,671 INFO L290 TraceCheckUtils]: 31: Hoare triple {34853#false} ~cond := #in~cond; {34853#false} is VALID [2022-04-28 10:08:26,671 INFO L272 TraceCheckUtils]: 30: Hoare triple {34853#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {34853#false} is VALID [2022-04-28 10:08:26,671 INFO L290 TraceCheckUtils]: 29: Hoare triple {34853#false} assume !(~y~0 % 4294967296 > 0); {34853#false} is VALID [2022-04-28 10:08:26,671 INFO L290 TraceCheckUtils]: 28: Hoare triple {34853#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {34853#false} is VALID [2022-04-28 10:08:26,671 INFO L290 TraceCheckUtils]: 27: Hoare triple {34853#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {34853#false} is VALID [2022-04-28 10:08:26,671 INFO L290 TraceCheckUtils]: 26: Hoare triple {34853#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {34853#false} is VALID [2022-04-28 10:08:26,671 INFO L290 TraceCheckUtils]: 25: Hoare triple {34853#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {34853#false} is VALID [2022-04-28 10:08:26,671 INFO L290 TraceCheckUtils]: 24: Hoare triple {34853#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {34853#false} is VALID [2022-04-28 10:08:26,671 INFO L290 TraceCheckUtils]: 23: Hoare triple {34853#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {34853#false} is VALID [2022-04-28 10:08:26,671 INFO L290 TraceCheckUtils]: 22: Hoare triple {34853#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {34853#false} is VALID [2022-04-28 10:08:26,671 INFO L290 TraceCheckUtils]: 21: Hoare triple {34853#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {34853#false} is VALID [2022-04-28 10:08:26,671 INFO L290 TraceCheckUtils]: 20: Hoare triple {34853#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {34853#false} is VALID [2022-04-28 10:08:26,672 INFO L290 TraceCheckUtils]: 19: Hoare triple {35016#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {34853#false} is VALID [2022-04-28 10:08:26,673 INFO L290 TraceCheckUtils]: 18: Hoare triple {35020#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {35016#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:08:26,673 INFO L290 TraceCheckUtils]: 17: Hoare triple {35024#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {35020#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:08:26,674 INFO L290 TraceCheckUtils]: 16: Hoare triple {35028#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} ~z~0 := ~y~0; {35024#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-28 10:08:26,674 INFO L290 TraceCheckUtils]: 15: Hoare triple {35028#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !(~x~0 % 4294967296 > 0); {35028#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:08:26,675 INFO L290 TraceCheckUtils]: 14: Hoare triple {35035#(< 0 (mod (+ main_~y~0 4294967295) 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; {35028#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:08:26,675 INFO L290 TraceCheckUtils]: 13: Hoare triple {35039#(< 0 (mod main_~y~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; {35035#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:08:26,676 INFO L290 TraceCheckUtils]: 12: Hoare triple {35043#(< 0 (mod (+ main_~y~0 1) 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; {35039#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:08:26,676 INFO L290 TraceCheckUtils]: 11: Hoare triple {35047#(< 0 (mod (+ main_~y~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; {35043#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:08:26,677 INFO L290 TraceCheckUtils]: 10: Hoare triple {35051#(< 0 (mod (+ main_~y~0 3) 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; {35047#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:08:26,678 INFO L290 TraceCheckUtils]: 9: Hoare triple {35055#(< 0 (mod (+ main_~y~0 4) 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; {35051#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:08:26,678 INFO L290 TraceCheckUtils]: 8: Hoare triple {35059#(< 0 (mod (+ 5 main_~y~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; {35055#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:08:26,679 INFO L290 TraceCheckUtils]: 7: Hoare triple {35063#(< 0 (mod (+ main_~y~0 6) 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; {35059#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:08:26,680 INFO L290 TraceCheckUtils]: 6: Hoare triple {35067#(< 0 (mod (+ 7 main_~y~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; {35063#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:08:26,680 INFO L290 TraceCheckUtils]: 5: Hoare triple {34852#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {35067#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:08:26,680 INFO L272 TraceCheckUtils]: 4: Hoare triple {34852#true} call #t~ret11 := main(); {34852#true} is VALID [2022-04-28 10:08:26,680 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34852#true} {34852#true} #61#return; {34852#true} is VALID [2022-04-28 10:08:26,680 INFO L290 TraceCheckUtils]: 2: Hoare triple {34852#true} assume true; {34852#true} is VALID [2022-04-28 10:08:26,680 INFO L290 TraceCheckUtils]: 1: Hoare triple {34852#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(10, 2);call #Ultimate.allocInit(12, 3); {34852#true} is VALID [2022-04-28 10:08:26,680 INFO L272 TraceCheckUtils]: 0: Hoare triple {34852#true} call ULTIMATE.init(); {34852#true} is VALID [2022-04-28 10:08:26,680 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-04-28 10:08:26,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [836446139] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:08:26,680 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:08:26,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 30 [2022-04-28 10:08:26,681 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:08:26,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [18219314] [2022-04-28 10:08:26,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [18219314] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:08:26,681 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:08:26,681 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-28 10:08:26,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911341939] [2022-04-28 10:08:26,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:08:26,681 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 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 34 [2022-04-28 10:08:26,681 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:08:26,681 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 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-28 10:08:26,697 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:08:26,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-28 10:08:26,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:26,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-28 10:08:26,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=701, Unknown=0, NotChecked=0, Total=870 [2022-04-28 10:08:26,697 INFO L87 Difference]: Start difference. First operand 105 states and 133 transitions. Second operand has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 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-28 10:08:27,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:27,799 INFO L93 Difference]: Finished difference Result 132 states and 160 transitions. [2022-04-28 10:08:27,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-28 10:08:27,799 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 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 34 [2022-04-28 10:08:27,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:08:27,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 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-28 10:08:27,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 63 transitions. [2022-04-28 10:08:27,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 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-28 10:08:27,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 63 transitions. [2022-04-28 10:08:27,800 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 63 transitions. [2022-04-28 10:08:27,848 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:08:27,849 INFO L225 Difference]: With dead ends: 132 [2022-04-28 10:08:27,849 INFO L226 Difference]: Without dead ends: 117 [2022-04-28 10:08:27,849 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=426, Invalid=1644, Unknown=0, NotChecked=0, Total=2070 [2022-04-28 10:08:27,850 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 31 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 10:08:27,850 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 87 Invalid, 571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 535 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 10:08:27,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-04-28 10:08:27,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 106. [2022-04-28 10:08:27,967 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:08:27,967 INFO L82 GeneralOperation]: Start isEquivalent. First operand 117 states. Second operand has 106 states, 101 states have (on average 1.2871287128712872) internal successors, (130), 101 states have internal predecessors, (130), 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-28 10:08:27,967 INFO L74 IsIncluded]: Start isIncluded. First operand 117 states. Second operand has 106 states, 101 states have (on average 1.2871287128712872) internal successors, (130), 101 states have internal predecessors, (130), 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-28 10:08:27,967 INFO L87 Difference]: Start difference. First operand 117 states. Second operand has 106 states, 101 states have (on average 1.2871287128712872) internal successors, (130), 101 states have internal predecessors, (130), 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-28 10:08:27,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:27,971 INFO L93 Difference]: Finished difference Result 117 states and 145 transitions. [2022-04-28 10:08:27,971 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 145 transitions. [2022-04-28 10:08:27,971 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:27,971 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:27,971 INFO L74 IsIncluded]: Start isIncluded. First operand has 106 states, 101 states have (on average 1.2871287128712872) internal successors, (130), 101 states have internal predecessors, (130), 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 117 states. [2022-04-28 10:08:27,972 INFO L87 Difference]: Start difference. First operand has 106 states, 101 states have (on average 1.2871287128712872) internal successors, (130), 101 states have internal predecessors, (130), 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 117 states. [2022-04-28 10:08:27,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:27,972 INFO L93 Difference]: Finished difference Result 117 states and 145 transitions. [2022-04-28 10:08:27,972 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 145 transitions. [2022-04-28 10:08:27,973 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:27,973 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:27,973 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:08:27,973 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:08:27,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 101 states have (on average 1.2871287128712872) internal successors, (130), 101 states have internal predecessors, (130), 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-28 10:08:27,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 134 transitions. [2022-04-28 10:08:27,974 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 134 transitions. Word has length 34 [2022-04-28 10:08:27,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:08:27,974 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 134 transitions. [2022-04-28 10:08:27,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 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-28 10:08:27,974 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 106 states and 134 transitions. [2022-04-28 10:08:32,940 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 134 edges. 132 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-28 10:08:32,940 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 134 transitions. [2022-04-28 10:08:32,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-28 10:08:32,940 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:08:32,940 INFO L195 NwaCegarLoop]: trace histogram [20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:08:32,956 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Forceful destruction successful, exit code 0 [2022-04-28 10:08:33,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53,54 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:08:33,141 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:08:33,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:08:33,141 INFO L85 PathProgramCache]: Analyzing trace with hash 1446540941, now seen corresponding path program 39 times [2022-04-28 10:08:33,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:33,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [478253881] [2022-04-28 10:08:33,143 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:08:33,143 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:08:33,143 INFO L85 PathProgramCache]: Analyzing trace with hash 1446540941, now seen corresponding path program 40 times [2022-04-28 10:08:33,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:08:33,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318464706] [2022-04-28 10:08:33,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:08:33,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:08:33,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:33,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:08:33,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:33,496 INFO L290 TraceCheckUtils]: 0: Hoare triple {35857#(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(10, 2);call #Ultimate.allocInit(12, 3); {35830#true} is VALID [2022-04-28 10:08:33,497 INFO L290 TraceCheckUtils]: 1: Hoare triple {35830#true} assume true; {35830#true} is VALID [2022-04-28 10:08:33,497 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {35830#true} {35830#true} #61#return; {35830#true} is VALID [2022-04-28 10:08:33,497 INFO L272 TraceCheckUtils]: 0: Hoare triple {35830#true} call ULTIMATE.init(); {35857#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:08:33,497 INFO L290 TraceCheckUtils]: 1: Hoare triple {35857#(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(10, 2);call #Ultimate.allocInit(12, 3); {35830#true} is VALID [2022-04-28 10:08:33,497 INFO L290 TraceCheckUtils]: 2: Hoare triple {35830#true} assume true; {35830#true} is VALID [2022-04-28 10:08:33,497 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35830#true} {35830#true} #61#return; {35830#true} is VALID [2022-04-28 10:08:33,497 INFO L272 TraceCheckUtils]: 4: Hoare triple {35830#true} call #t~ret11 := main(); {35830#true} is VALID [2022-04-28 10:08:33,498 INFO L290 TraceCheckUtils]: 5: Hoare triple {35830#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {35835#(= main_~y~0 0)} is VALID [2022-04-28 10:08:33,498 INFO L290 TraceCheckUtils]: 6: Hoare triple {35835#(= 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; {35836#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:08:33,499 INFO L290 TraceCheckUtils]: 7: Hoare triple {35836#(and (<= 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; {35837#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:08:33,499 INFO L290 TraceCheckUtils]: 8: Hoare triple {35837#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {35838#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:08:33,500 INFO L290 TraceCheckUtils]: 9: Hoare triple {35838#(and (<= main_~y~0 3) (<= 3 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; {35839#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:08:33,500 INFO L290 TraceCheckUtils]: 10: Hoare triple {35839#(and (<= main_~y~0 4) (<= 4 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; {35840#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:08:33,501 INFO L290 TraceCheckUtils]: 11: Hoare triple {35840#(and (<= 5 main_~y~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; {35841#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:08:33,502 INFO L290 TraceCheckUtils]: 12: Hoare triple {35841#(and (<= main_~y~0 6) (<= 6 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; {35842#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:08:33,502 INFO L290 TraceCheckUtils]: 13: Hoare triple {35842#(and (<= 7 main_~y~0) (<= main_~y~0 7))} 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; {35843#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:08:33,503 INFO L290 TraceCheckUtils]: 14: Hoare triple {35843#(and (<= main_~y~0 8) (<= 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; {35844#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:08:33,503 INFO L290 TraceCheckUtils]: 15: Hoare triple {35844#(and (<= 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; {35845#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:08:33,504 INFO L290 TraceCheckUtils]: 16: Hoare triple {35845#(and (<= main_~y~0 10) (<= 10 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; {35846#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:08:33,504 INFO L290 TraceCheckUtils]: 17: Hoare triple {35846#(and (<= main_~y~0 11) (<= 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; {35847#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:08:33,505 INFO L290 TraceCheckUtils]: 18: Hoare triple {35847#(and (<= 12 main_~y~0) (<= main_~y~0 12))} 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; {35848#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:08:33,506 INFO L290 TraceCheckUtils]: 19: Hoare triple {35848#(and (<= main_~y~0 13) (<= 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; {35849#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:08:33,506 INFO L290 TraceCheckUtils]: 20: Hoare triple {35849#(and (<= 14 main_~y~0) (<= main_~y~0 14))} 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; {35850#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:08:33,507 INFO L290 TraceCheckUtils]: 21: Hoare triple {35850#(and (<= main_~y~0 15) (<= 15 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; {35851#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:08:33,507 INFO L290 TraceCheckUtils]: 22: Hoare triple {35851#(and (<= 16 main_~y~0) (<= main_~y~0 16))} 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; {35852#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:08:33,508 INFO L290 TraceCheckUtils]: 23: Hoare triple {35852#(and (<= main_~y~0 17) (<= 17 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; {35853#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 10:08:33,508 INFO L290 TraceCheckUtils]: 24: Hoare triple {35853#(and (<= 18 main_~y~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; {35854#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 10:08:33,509 INFO L290 TraceCheckUtils]: 25: Hoare triple {35854#(and (<= 19 main_~y~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; {35855#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 10:08:33,509 INFO L290 TraceCheckUtils]: 26: Hoare triple {35855#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !(~x~0 % 4294967296 > 0); {35855#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 10:08:33,510 INFO L290 TraceCheckUtils]: 27: Hoare triple {35855#(and (<= 20 main_~y~0) (<= main_~y~0 20))} ~z~0 := ~y~0; {35856#(and (<= (div main_~z~0 4294967296) 0) (<= 20 main_~z~0))} is VALID [2022-04-28 10:08:33,510 INFO L290 TraceCheckUtils]: 28: Hoare triple {35856#(and (<= (div main_~z~0 4294967296) 0) (<= 20 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {35831#false} is VALID [2022-04-28 10:08:33,510 INFO L290 TraceCheckUtils]: 29: Hoare triple {35831#false} assume !(~y~0 % 4294967296 > 0); {35831#false} is VALID [2022-04-28 10:08:33,510 INFO L272 TraceCheckUtils]: 30: Hoare triple {35831#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {35831#false} is VALID [2022-04-28 10:08:33,510 INFO L290 TraceCheckUtils]: 31: Hoare triple {35831#false} ~cond := #in~cond; {35831#false} is VALID [2022-04-28 10:08:33,510 INFO L290 TraceCheckUtils]: 32: Hoare triple {35831#false} assume 0 == ~cond; {35831#false} is VALID [2022-04-28 10:08:33,510 INFO L290 TraceCheckUtils]: 33: Hoare triple {35831#false} assume !false; {35831#false} is VALID [2022-04-28 10:08:33,510 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:08:33,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:08:33,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318464706] [2022-04-28 10:08:33,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318464706] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:08:33,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [437693781] [2022-04-28 10:08:33,511 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:08:33,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:08:33,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:08:33,512 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:08:33,513 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Waiting until timeout for monitored process [2022-04-28 10:08:33,549 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:08:33,550 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:08:33,550 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 45 conjunts are in the unsatisfiable core [2022-04-28 10:08:33,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:33,558 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:08:33,863 INFO L272 TraceCheckUtils]: 0: Hoare triple {35830#true} call ULTIMATE.init(); {35830#true} is VALID [2022-04-28 10:08:33,864 INFO L290 TraceCheckUtils]: 1: Hoare triple {35830#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(10, 2);call #Ultimate.allocInit(12, 3); {35830#true} is VALID [2022-04-28 10:08:33,864 INFO L290 TraceCheckUtils]: 2: Hoare triple {35830#true} assume true; {35830#true} is VALID [2022-04-28 10:08:33,864 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35830#true} {35830#true} #61#return; {35830#true} is VALID [2022-04-28 10:08:33,864 INFO L272 TraceCheckUtils]: 4: Hoare triple {35830#true} call #t~ret11 := main(); {35830#true} is VALID [2022-04-28 10:08:33,864 INFO L290 TraceCheckUtils]: 5: Hoare triple {35830#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {35835#(= main_~y~0 0)} is VALID [2022-04-28 10:08:33,864 INFO L290 TraceCheckUtils]: 6: Hoare triple {35835#(= 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; {35836#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:08:33,865 INFO L290 TraceCheckUtils]: 7: Hoare triple {35836#(and (<= 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; {35837#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:08:33,865 INFO L290 TraceCheckUtils]: 8: Hoare triple {35837#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {35838#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:08:33,866 INFO L290 TraceCheckUtils]: 9: Hoare triple {35838#(and (<= main_~y~0 3) (<= 3 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; {35839#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:08:33,866 INFO L290 TraceCheckUtils]: 10: Hoare triple {35839#(and (<= main_~y~0 4) (<= 4 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; {35840#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:08:33,867 INFO L290 TraceCheckUtils]: 11: Hoare triple {35840#(and (<= 5 main_~y~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; {35841#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:08:33,867 INFO L290 TraceCheckUtils]: 12: Hoare triple {35841#(and (<= main_~y~0 6) (<= 6 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; {35842#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:08:33,868 INFO L290 TraceCheckUtils]: 13: Hoare triple {35842#(and (<= 7 main_~y~0) (<= main_~y~0 7))} 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; {35843#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:08:33,868 INFO L290 TraceCheckUtils]: 14: Hoare triple {35843#(and (<= main_~y~0 8) (<= 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; {35844#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:08:33,869 INFO L290 TraceCheckUtils]: 15: Hoare triple {35844#(and (<= 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; {35845#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:08:33,869 INFO L290 TraceCheckUtils]: 16: Hoare triple {35845#(and (<= main_~y~0 10) (<= 10 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; {35846#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:08:33,870 INFO L290 TraceCheckUtils]: 17: Hoare triple {35846#(and (<= main_~y~0 11) (<= 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; {35847#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:08:33,870 INFO L290 TraceCheckUtils]: 18: Hoare triple {35847#(and (<= 12 main_~y~0) (<= main_~y~0 12))} 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; {35848#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:08:33,871 INFO L290 TraceCheckUtils]: 19: Hoare triple {35848#(and (<= main_~y~0 13) (<= 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; {35849#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:08:33,871 INFO L290 TraceCheckUtils]: 20: Hoare triple {35849#(and (<= 14 main_~y~0) (<= main_~y~0 14))} 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; {35850#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:08:33,872 INFO L290 TraceCheckUtils]: 21: Hoare triple {35850#(and (<= main_~y~0 15) (<= 15 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; {35851#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:08:33,872 INFO L290 TraceCheckUtils]: 22: Hoare triple {35851#(and (<= 16 main_~y~0) (<= main_~y~0 16))} 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; {35852#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:08:33,873 INFO L290 TraceCheckUtils]: 23: Hoare triple {35852#(and (<= main_~y~0 17) (<= 17 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; {35853#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 10:08:33,873 INFO L290 TraceCheckUtils]: 24: Hoare triple {35853#(and (<= 18 main_~y~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; {35854#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 10:08:33,874 INFO L290 TraceCheckUtils]: 25: Hoare triple {35854#(and (<= 19 main_~y~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; {35855#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 10:08:33,874 INFO L290 TraceCheckUtils]: 26: Hoare triple {35855#(and (<= 20 main_~y~0) (<= main_~y~0 20))} assume !(~x~0 % 4294967296 > 0); {35855#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 10:08:33,874 INFO L290 TraceCheckUtils]: 27: Hoare triple {35855#(and (<= 20 main_~y~0) (<= main_~y~0 20))} ~z~0 := ~y~0; {35942#(and (<= main_~z~0 20) (<= 20 main_~z~0))} is VALID [2022-04-28 10:08:33,875 INFO L290 TraceCheckUtils]: 28: Hoare triple {35942#(and (<= main_~z~0 20) (<= 20 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {35831#false} is VALID [2022-04-28 10:08:33,875 INFO L290 TraceCheckUtils]: 29: Hoare triple {35831#false} assume !(~y~0 % 4294967296 > 0); {35831#false} is VALID [2022-04-28 10:08:33,875 INFO L272 TraceCheckUtils]: 30: Hoare triple {35831#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {35831#false} is VALID [2022-04-28 10:08:33,875 INFO L290 TraceCheckUtils]: 31: Hoare triple {35831#false} ~cond := #in~cond; {35831#false} is VALID [2022-04-28 10:08:33,875 INFO L290 TraceCheckUtils]: 32: Hoare triple {35831#false} assume 0 == ~cond; {35831#false} is VALID [2022-04-28 10:08:33,875 INFO L290 TraceCheckUtils]: 33: Hoare triple {35831#false} assume !false; {35831#false} is VALID [2022-04-28 10:08:33,875 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:08:33,875 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:08:34,656 INFO L290 TraceCheckUtils]: 33: Hoare triple {35831#false} assume !false; {35831#false} is VALID [2022-04-28 10:08:34,656 INFO L290 TraceCheckUtils]: 32: Hoare triple {35831#false} assume 0 == ~cond; {35831#false} is VALID [2022-04-28 10:08:34,656 INFO L290 TraceCheckUtils]: 31: Hoare triple {35831#false} ~cond := #in~cond; {35831#false} is VALID [2022-04-28 10:08:34,656 INFO L272 TraceCheckUtils]: 30: Hoare triple {35831#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {35831#false} is VALID [2022-04-28 10:08:34,656 INFO L290 TraceCheckUtils]: 29: Hoare triple {35831#false} assume !(~y~0 % 4294967296 > 0); {35831#false} is VALID [2022-04-28 10:08:34,657 INFO L290 TraceCheckUtils]: 28: Hoare triple {35976#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {35831#false} is VALID [2022-04-28 10:08:34,657 INFO L290 TraceCheckUtils]: 27: Hoare triple {35980#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {35976#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:08:34,657 INFO L290 TraceCheckUtils]: 26: Hoare triple {35980#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {35980#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:08:34,658 INFO L290 TraceCheckUtils]: 25: Hoare triple {35987#(< 0 (mod (+ main_~y~0 1) 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; {35980#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:08:34,659 INFO L290 TraceCheckUtils]: 24: Hoare triple {35991#(< 0 (mod (+ main_~y~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; {35987#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:08:34,659 INFO L290 TraceCheckUtils]: 23: Hoare triple {35995#(< 0 (mod (+ main_~y~0 3) 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; {35991#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:08:34,660 INFO L290 TraceCheckUtils]: 22: Hoare triple {35999#(< 0 (mod (+ main_~y~0 4) 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; {35995#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:08:34,660 INFO L290 TraceCheckUtils]: 21: Hoare triple {36003#(< 0 (mod (+ 5 main_~y~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; {35999#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:08:34,661 INFO L290 TraceCheckUtils]: 20: Hoare triple {36007#(< 0 (mod (+ main_~y~0 6) 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; {36003#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:08:34,662 INFO L290 TraceCheckUtils]: 19: Hoare triple {36011#(< 0 (mod (+ 7 main_~y~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; {36007#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:08:34,662 INFO L290 TraceCheckUtils]: 18: Hoare triple {36015#(< 0 (mod (+ main_~y~0 8) 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; {36011#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:08:34,663 INFO L290 TraceCheckUtils]: 17: Hoare triple {36019#(< 0 (mod (+ main_~y~0 9) 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; {36015#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:08:34,664 INFO L290 TraceCheckUtils]: 16: Hoare triple {36023#(< 0 (mod (+ main_~y~0 10) 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; {36019#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:08:34,664 INFO L290 TraceCheckUtils]: 15: Hoare triple {36027#(< 0 (mod (+ main_~y~0 11) 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; {36023#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-28 10:08:34,665 INFO L290 TraceCheckUtils]: 14: Hoare triple {36031#(< 0 (mod (+ main_~y~0 12) 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; {36027#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-28 10:08:34,666 INFO L290 TraceCheckUtils]: 13: Hoare triple {36035#(< 0 (mod (+ main_~y~0 13) 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; {36031#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-28 10:08:34,666 INFO L290 TraceCheckUtils]: 12: Hoare triple {36039#(< 0 (mod (+ main_~y~0 14) 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; {36035#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-28 10:08:34,667 INFO L290 TraceCheckUtils]: 11: Hoare triple {36043#(< 0 (mod (+ main_~y~0 15) 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; {36039#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-28 10:08:34,667 INFO L290 TraceCheckUtils]: 10: Hoare triple {36047#(< 0 (mod (+ main_~y~0 16) 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; {36043#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID [2022-04-28 10:08:34,668 INFO L290 TraceCheckUtils]: 9: Hoare triple {36051#(< 0 (mod (+ main_~y~0 17) 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; {36047#(< 0 (mod (+ main_~y~0 16) 4294967296))} is VALID [2022-04-28 10:08:34,669 INFO L290 TraceCheckUtils]: 8: Hoare triple {36055#(< 0 (mod (+ main_~y~0 18) 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; {36051#(< 0 (mod (+ main_~y~0 17) 4294967296))} is VALID [2022-04-28 10:08:34,669 INFO L290 TraceCheckUtils]: 7: Hoare triple {36059#(< 0 (mod (+ 19 main_~y~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; {36055#(< 0 (mod (+ main_~y~0 18) 4294967296))} is VALID [2022-04-28 10:08:34,670 INFO L290 TraceCheckUtils]: 6: Hoare triple {36063#(< 0 (mod (+ main_~y~0 20) 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; {36059#(< 0 (mod (+ 19 main_~y~0) 4294967296))} is VALID [2022-04-28 10:08:34,670 INFO L290 TraceCheckUtils]: 5: Hoare triple {35830#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {36063#(< 0 (mod (+ main_~y~0 20) 4294967296))} is VALID [2022-04-28 10:08:34,670 INFO L272 TraceCheckUtils]: 4: Hoare triple {35830#true} call #t~ret11 := main(); {35830#true} is VALID [2022-04-28 10:08:34,670 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35830#true} {35830#true} #61#return; {35830#true} is VALID [2022-04-28 10:08:34,671 INFO L290 TraceCheckUtils]: 2: Hoare triple {35830#true} assume true; {35830#true} is VALID [2022-04-28 10:08:34,671 INFO L290 TraceCheckUtils]: 1: Hoare triple {35830#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(10, 2);call #Ultimate.allocInit(12, 3); {35830#true} is VALID [2022-04-28 10:08:34,671 INFO L272 TraceCheckUtils]: 0: Hoare triple {35830#true} call ULTIMATE.init(); {35830#true} is VALID [2022-04-28 10:08:34,671 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:08:34,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [437693781] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:08:34,671 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:08:34,671 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 24] total 48 [2022-04-28 10:08:34,671 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:08:34,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [478253881] [2022-04-28 10:08:34,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [478253881] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:08:34,671 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:08:34,671 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-04-28 10:08:34,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013087627] [2022-04-28 10:08:34,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:08:34,672 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.2) internal successors, (30), 24 states have internal predecessors, (30), 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 34 [2022-04-28 10:08:34,672 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:08:34,672 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 25 states, 25 states have (on average 1.2) internal successors, (30), 24 states have internal predecessors, (30), 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-28 10:08:34,691 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:08:34,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-04-28 10:08:34,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:34,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-04-28 10:08:34,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=536, Invalid=1720, Unknown=0, NotChecked=0, Total=2256 [2022-04-28 10:08:34,691 INFO L87 Difference]: Start difference. First operand 106 states and 134 transitions. Second operand has 25 states, 25 states have (on average 1.2) internal successors, (30), 24 states have internal predecessors, (30), 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-28 10:08:38,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:38,168 INFO L93 Difference]: Finished difference Result 138 states and 190 transitions. [2022-04-28 10:08:38,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-28 10:08:38,168 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.2) internal successors, (30), 24 states have internal predecessors, (30), 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 34 [2022-04-28 10:08:38,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:08:38,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.2) internal successors, (30), 24 states have internal predecessors, (30), 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-28 10:08:38,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 145 transitions. [2022-04-28 10:08:38,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.2) internal successors, (30), 24 states have internal predecessors, (30), 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-28 10:08:38,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 145 transitions. [2022-04-28 10:08:38,169 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 145 transitions. [2022-04-28 10:08:38,293 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 145 edges. 145 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:08:38,294 INFO L225 Difference]: With dead ends: 138 [2022-04-28 10:08:38,295 INFO L226 Difference]: Without dead ends: 132 [2022-04-28 10:08:38,295 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1088, Invalid=3742, Unknown=0, NotChecked=0, Total=4830 [2022-04-28 10:08:38,295 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 124 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 2226 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 2313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 2226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-04-28 10:08:38,295 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 163 Invalid, 2313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 2226 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-04-28 10:08:38,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-04-28 10:08:38,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 111. [2022-04-28 10:08:38,427 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:08:38,427 INFO L82 GeneralOperation]: Start isEquivalent. First operand 132 states. Second operand has 111 states, 106 states have (on average 1.2924528301886793) internal successors, (137), 106 states have internal predecessors, (137), 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-28 10:08:38,428 INFO L74 IsIncluded]: Start isIncluded. First operand 132 states. Second operand has 111 states, 106 states have (on average 1.2924528301886793) internal successors, (137), 106 states have internal predecessors, (137), 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-28 10:08:38,428 INFO L87 Difference]: Start difference. First operand 132 states. Second operand has 111 states, 106 states have (on average 1.2924528301886793) internal successors, (137), 106 states have internal predecessors, (137), 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-28 10:08:38,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:38,429 INFO L93 Difference]: Finished difference Result 132 states and 162 transitions. [2022-04-28 10:08:38,429 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 162 transitions. [2022-04-28 10:08:38,429 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:38,429 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:38,429 INFO L74 IsIncluded]: Start isIncluded. First operand has 111 states, 106 states have (on average 1.2924528301886793) internal successors, (137), 106 states have internal predecessors, (137), 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 132 states. [2022-04-28 10:08:38,429 INFO L87 Difference]: Start difference. First operand has 111 states, 106 states have (on average 1.2924528301886793) internal successors, (137), 106 states have internal predecessors, (137), 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 132 states. [2022-04-28 10:08:38,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:08:38,430 INFO L93 Difference]: Finished difference Result 132 states and 162 transitions. [2022-04-28 10:08:38,430 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 162 transitions. [2022-04-28 10:08:38,430 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:08:38,430 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:08:38,430 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:08:38,430 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:08:38,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 106 states have (on average 1.2924528301886793) internal successors, (137), 106 states have internal predecessors, (137), 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-28 10:08:38,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 141 transitions. [2022-04-28 10:08:38,431 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 141 transitions. Word has length 34 [2022-04-28 10:08:38,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:08:38,431 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 141 transitions. [2022-04-28 10:08:38,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.2) internal successors, (30), 24 states have internal predecessors, (30), 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-28 10:08:38,432 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 111 states and 141 transitions. [2022-04-28 10:08:39,372 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 141 edges. 141 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:08:39,372 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 141 transitions. [2022-04-28 10:08:39,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-28 10:08:39,373 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:08:39,373 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:08:39,388 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Forceful destruction successful, exit code 0 [2022-04-28 10:08:39,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54,55 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:08:39,573 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:08:39,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:08:39,573 INFO L85 PathProgramCache]: Analyzing trace with hash 248285055, now seen corresponding path program 69 times [2022-04-28 10:08:39,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:08:39,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [526411075] [2022-04-28 10:08:39,575 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:08:39,575 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:08:39,575 INFO L85 PathProgramCache]: Analyzing trace with hash 248285055, now seen corresponding path program 70 times [2022-04-28 10:08:39,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:08:39,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253613726] [2022-04-28 10:08:39,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:08:39,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:08:39,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:40,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:08:40,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:40,263 INFO L290 TraceCheckUtils]: 0: Hoare triple {36915#(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(10, 2);call #Ultimate.allocInit(12, 3); {36890#true} is VALID [2022-04-28 10:08:40,263 INFO L290 TraceCheckUtils]: 1: Hoare triple {36890#true} assume true; {36890#true} is VALID [2022-04-28 10:08:40,263 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {36890#true} {36890#true} #61#return; {36890#true} is VALID [2022-04-28 10:08:40,263 INFO L272 TraceCheckUtils]: 0: Hoare triple {36890#true} call ULTIMATE.init(); {36915#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:08:40,263 INFO L290 TraceCheckUtils]: 1: Hoare triple {36915#(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(10, 2);call #Ultimate.allocInit(12, 3); {36890#true} is VALID [2022-04-28 10:08:40,263 INFO L290 TraceCheckUtils]: 2: Hoare triple {36890#true} assume true; {36890#true} is VALID [2022-04-28 10:08:40,263 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36890#true} {36890#true} #61#return; {36890#true} is VALID [2022-04-28 10:08:40,263 INFO L272 TraceCheckUtils]: 4: Hoare triple {36890#true} call #t~ret11 := main(); {36890#true} is VALID [2022-04-28 10:08:40,264 INFO L290 TraceCheckUtils]: 5: Hoare triple {36890#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {36895#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-28 10:08:40,266 INFO L290 TraceCheckUtils]: 6: Hoare triple {36895#(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; {36896#(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-28 10:08:40,286 INFO L290 TraceCheckUtils]: 7: Hoare triple {36896#(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; {36897#(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-28 10:08:40,312 INFO L290 TraceCheckUtils]: 8: Hoare triple {36897#(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; {36898#(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-28 10:08:40,362 INFO L290 TraceCheckUtils]: 9: Hoare triple {36898#(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; {36899#(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-28 10:08:40,365 INFO L290 TraceCheckUtils]: 10: Hoare triple {36899#(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; {36900#(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-28 10:08:40,368 INFO L290 TraceCheckUtils]: 11: Hoare triple {36900#(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; {36901#(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-28 10:08:40,372 INFO L290 TraceCheckUtils]: 12: Hoare triple {36901#(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; {36902#(and (<= (+ 7 (* (div (+ main_~n~0 4294967295 (* (- 1) main_~x~0) (* (- 1) main_~y~0) (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296)) main_~n~0) (<= 7 main_~y~0) (<= main_~y~0 7) (<= main_~n~0 (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) 4294967295)))} is VALID [2022-04-28 10:08:40,373 INFO L290 TraceCheckUtils]: 13: Hoare triple {36902#(and (<= (+ 7 (* (div (+ main_~n~0 4294967295 (* (- 1) main_~x~0) (* (- 1) main_~y~0) (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296)) main_~n~0) (<= 7 main_~y~0) (<= main_~y~0 7) (<= main_~n~0 (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) 4294967295)))} assume !(~x~0 % 4294967296 > 0); {36903#(and (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) 7) main_~n~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:08:40,373 INFO L290 TraceCheckUtils]: 14: Hoare triple {36903#(and (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) 7) main_~n~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {36904#(and (<= main_~z~0 7) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 7) main_~n~0))} is VALID [2022-04-28 10:08:40,374 INFO L290 TraceCheckUtils]: 15: Hoare triple {36904#(and (<= main_~z~0 7) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 7) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {36905#(and (<= main_~z~0 6) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 7) main_~n~0))} is VALID [2022-04-28 10:08:40,375 INFO L290 TraceCheckUtils]: 16: Hoare triple {36905#(and (<= main_~z~0 6) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 7) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {36906#(and (<= main_~z~0 5) (<= (+ 7 (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296))) main_~n~0))} is VALID [2022-04-28 10:08:40,376 INFO L290 TraceCheckUtils]: 17: Hoare triple {36906#(and (<= main_~z~0 5) (<= (+ 7 (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296))) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {36907#(and (<= (+ 7 (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:08:40,377 INFO L290 TraceCheckUtils]: 18: Hoare triple {36907#(and (<= (+ 7 (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {36908#(and (<= main_~z~0 3) (<= (+ 7 (* (div (+ 4294967291 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} is VALID [2022-04-28 10:08:40,378 INFO L290 TraceCheckUtils]: 19: Hoare triple {36908#(and (<= main_~z~0 3) (<= (+ 7 (* (div (+ 4294967291 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {36909#(and (<= (+ 7 (* (div (+ 4294967290 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0) (<= main_~z~0 2))} is VALID [2022-04-28 10:08:40,379 INFO L290 TraceCheckUtils]: 20: Hoare triple {36909#(and (<= (+ 7 (* (div (+ 4294967290 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0) (<= main_~z~0 2))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {36910#(and (<= main_~z~0 1) (<= (+ 7 (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967289) 4294967296) 4294967296)) main_~n~0))} is VALID [2022-04-28 10:08:40,380 INFO L290 TraceCheckUtils]: 21: Hoare triple {36910#(and (<= main_~z~0 1) (<= (+ 7 (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967289) 4294967296) 4294967296)) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {36911#(and (<= main_~z~0 0) (<= (+ 7 (* (div (+ 4294967288 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} is VALID [2022-04-28 10:08:40,380 INFO L290 TraceCheckUtils]: 22: Hoare triple {36911#(and (<= main_~z~0 0) (<= (+ 7 (* (div (+ 4294967288 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} assume !(~z~0 % 4294967296 > 0); {36911#(and (<= main_~z~0 0) (<= (+ 7 (* (div (+ 4294967288 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} is VALID [2022-04-28 10:08:40,381 INFO L290 TraceCheckUtils]: 23: Hoare triple {36911#(and (<= main_~z~0 0) (<= (+ 7 (* (div (+ 4294967288 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {36910#(and (<= main_~z~0 1) (<= (+ 7 (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967289) 4294967296) 4294967296)) main_~n~0))} is VALID [2022-04-28 10:08:40,382 INFO L290 TraceCheckUtils]: 24: Hoare triple {36910#(and (<= main_~z~0 1) (<= (+ 7 (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967289) 4294967296) 4294967296)) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {36909#(and (<= (+ 7 (* (div (+ 4294967290 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0) (<= main_~z~0 2))} is VALID [2022-04-28 10:08:40,383 INFO L290 TraceCheckUtils]: 25: Hoare triple {36909#(and (<= (+ 7 (* (div (+ 4294967290 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0) (<= main_~z~0 2))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {36908#(and (<= main_~z~0 3) (<= (+ 7 (* (div (+ 4294967291 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} is VALID [2022-04-28 10:08:40,384 INFO L290 TraceCheckUtils]: 26: Hoare triple {36908#(and (<= main_~z~0 3) (<= (+ 7 (* (div (+ 4294967291 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {36907#(and (<= (+ 7 (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:08:40,385 INFO L290 TraceCheckUtils]: 27: Hoare triple {36907#(and (<= (+ 7 (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0) (<= main_~z~0 4))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {36906#(and (<= main_~z~0 5) (<= (+ 7 (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296))) main_~n~0))} is VALID [2022-04-28 10:08:40,385 INFO L290 TraceCheckUtils]: 28: Hoare triple {36906#(and (<= main_~z~0 5) (<= (+ 7 (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296))) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {36905#(and (<= main_~z~0 6) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 7) main_~n~0))} is VALID [2022-04-28 10:08:40,388 INFO L290 TraceCheckUtils]: 29: Hoare triple {36905#(and (<= main_~z~0 6) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 7) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {36912#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-28 10:08:40,388 INFO L290 TraceCheckUtils]: 30: Hoare triple {36912#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {36912#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-28 10:08:40,389 INFO L272 TraceCheckUtils]: 31: Hoare triple {36912#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {36913#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:08:40,389 INFO L290 TraceCheckUtils]: 32: Hoare triple {36913#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {36914#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 10:08:40,389 INFO L290 TraceCheckUtils]: 33: Hoare triple {36914#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {36891#false} is VALID [2022-04-28 10:08:40,389 INFO L290 TraceCheckUtils]: 34: Hoare triple {36891#false} assume !false; {36891#false} is VALID [2022-04-28 10:08:40,390 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:08:40,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:08:40,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253613726] [2022-04-28 10:08:40,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253613726] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:08:40,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1949877779] [2022-04-28 10:08:40,390 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:08:40,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:08:40,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:08:40,391 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:08:40,391 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Waiting until timeout for monitored process [2022-04-28 10:08:40,539 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:08:40,539 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:08:40,541 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 67 conjunts are in the unsatisfiable core [2022-04-28 10:08:40,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:08:40,551 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:09:03,454 INFO L272 TraceCheckUtils]: 0: Hoare triple {36890#true} call ULTIMATE.init(); {36890#true} is VALID [2022-04-28 10:09:03,454 INFO L290 TraceCheckUtils]: 1: Hoare triple {36890#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(10, 2);call #Ultimate.allocInit(12, 3); {36890#true} is VALID [2022-04-28 10:09:03,454 INFO L290 TraceCheckUtils]: 2: Hoare triple {36890#true} assume true; {36890#true} is VALID [2022-04-28 10:09:03,454 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36890#true} {36890#true} #61#return; {36890#true} is VALID [2022-04-28 10:09:03,454 INFO L272 TraceCheckUtils]: 4: Hoare triple {36890#true} call #t~ret11 := main(); {36890#true} is VALID [2022-04-28 10:09:03,455 INFO L290 TraceCheckUtils]: 5: Hoare triple {36890#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {36895#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-28 10:09:03,460 INFO L290 TraceCheckUtils]: 6: Hoare triple {36895#(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; {36896#(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-28 10:09:03,461 INFO L290 TraceCheckUtils]: 7: Hoare triple {36896#(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; {36940#(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-28 10:09:03,463 INFO L290 TraceCheckUtils]: 8: Hoare triple {36940#(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; {36944#(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-28 10:09:03,464 INFO L290 TraceCheckUtils]: 9: Hoare triple {36944#(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; {36948#(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-28 10:09:03,465 INFO L290 TraceCheckUtils]: 10: Hoare triple {36948#(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; {36952#(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-28 10:09:03,468 INFO L290 TraceCheckUtils]: 11: Hoare triple {36952#(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; {36956#(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-28 10:09:03,469 INFO L290 TraceCheckUtils]: 12: Hoare triple {36956#(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; {36960#(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-28 10:09:03,471 INFO L290 TraceCheckUtils]: 13: Hoare triple {36960#(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); {36903#(and (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) 7) main_~n~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:09:03,471 INFO L290 TraceCheckUtils]: 14: Hoare triple {36903#(and (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) 7) main_~n~0) (<= main_~y~0 7))} ~z~0 := ~y~0; {36904#(and (<= main_~z~0 7) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 7) main_~n~0))} is VALID [2022-04-28 10:09:03,472 INFO L290 TraceCheckUtils]: 15: Hoare triple {36904#(and (<= main_~z~0 7) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 7) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {36905#(and (<= main_~z~0 6) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 7) main_~n~0))} is VALID [2022-04-28 10:09:03,473 INFO L290 TraceCheckUtils]: 16: Hoare triple {36905#(and (<= main_~z~0 6) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 7) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {36906#(and (<= main_~z~0 5) (<= (+ 7 (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296))) main_~n~0))} is VALID [2022-04-28 10:09:03,474 INFO L290 TraceCheckUtils]: 17: Hoare triple {36906#(and (<= main_~z~0 5) (<= (+ 7 (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296))) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {36907#(and (<= (+ 7 (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:09:03,475 INFO L290 TraceCheckUtils]: 18: Hoare triple {36907#(and (<= (+ 7 (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {36908#(and (<= main_~z~0 3) (<= (+ 7 (* (div (+ 4294967291 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} is VALID [2022-04-28 10:09:03,476 INFO L290 TraceCheckUtils]: 19: Hoare triple {36908#(and (<= main_~z~0 3) (<= (+ 7 (* (div (+ 4294967291 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {36909#(and (<= (+ 7 (* (div (+ 4294967290 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0) (<= main_~z~0 2))} is VALID [2022-04-28 10:09:03,477 INFO L290 TraceCheckUtils]: 20: Hoare triple {36909#(and (<= (+ 7 (* (div (+ 4294967290 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0) (<= main_~z~0 2))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {36910#(and (<= main_~z~0 1) (<= (+ 7 (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967289) 4294967296) 4294967296)) main_~n~0))} is VALID [2022-04-28 10:09:03,478 INFO L290 TraceCheckUtils]: 21: Hoare triple {36910#(and (<= main_~z~0 1) (<= (+ 7 (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967289) 4294967296) 4294967296)) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {36911#(and (<= main_~z~0 0) (<= (+ 7 (* (div (+ 4294967288 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} is VALID [2022-04-28 10:09:03,478 INFO L290 TraceCheckUtils]: 22: Hoare triple {36911#(and (<= main_~z~0 0) (<= (+ 7 (* (div (+ 4294967288 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} assume !(~z~0 % 4294967296 > 0); {36911#(and (<= main_~z~0 0) (<= (+ 7 (* (div (+ 4294967288 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} is VALID [2022-04-28 10:09:03,479 INFO L290 TraceCheckUtils]: 23: Hoare triple {36911#(and (<= main_~z~0 0) (<= (+ 7 (* (div (+ 4294967288 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {36910#(and (<= main_~z~0 1) (<= (+ 7 (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967289) 4294967296) 4294967296)) main_~n~0))} is VALID [2022-04-28 10:09:03,480 INFO L290 TraceCheckUtils]: 24: Hoare triple {36910#(and (<= main_~z~0 1) (<= (+ 7 (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967289) 4294967296) 4294967296)) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {36909#(and (<= (+ 7 (* (div (+ 4294967290 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0) (<= main_~z~0 2))} is VALID [2022-04-28 10:09:03,481 INFO L290 TraceCheckUtils]: 25: Hoare triple {36909#(and (<= (+ 7 (* (div (+ 4294967290 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0) (<= main_~z~0 2))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {36908#(and (<= main_~z~0 3) (<= (+ 7 (* (div (+ 4294967291 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} is VALID [2022-04-28 10:09:03,482 INFO L290 TraceCheckUtils]: 26: Hoare triple {36908#(and (<= main_~z~0 3) (<= (+ 7 (* (div (+ 4294967291 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {36907#(and (<= (+ 7 (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:09:03,483 INFO L290 TraceCheckUtils]: 27: Hoare triple {36907#(and (<= (+ 7 (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0) (<= main_~z~0 4))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {36906#(and (<= main_~z~0 5) (<= (+ 7 (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296))) main_~n~0))} is VALID [2022-04-28 10:09:03,484 INFO L290 TraceCheckUtils]: 28: Hoare triple {36906#(and (<= main_~z~0 5) (<= (+ 7 (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296))) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {36905#(and (<= main_~z~0 6) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 7) main_~n~0))} is VALID [2022-04-28 10:09:03,484 INFO L290 TraceCheckUtils]: 29: Hoare triple {36905#(and (<= main_~z~0 6) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 7) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {36904#(and (<= main_~z~0 7) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 7) main_~n~0))} is VALID [2022-04-28 10:09:03,485 INFO L290 TraceCheckUtils]: 30: Hoare triple {36904#(and (<= main_~z~0 7) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 7) main_~n~0))} assume !(~y~0 % 4294967296 > 0); {36904#(and (<= main_~z~0 7) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 7) main_~n~0))} is VALID [2022-04-28 10:09:03,486 INFO L272 TraceCheckUtils]: 31: Hoare triple {36904#(and (<= main_~z~0 7) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 7) main_~n~0))} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {37018#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:09:03,487 INFO L290 TraceCheckUtils]: 32: Hoare triple {37018#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {37022#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:09:03,487 INFO L290 TraceCheckUtils]: 33: Hoare triple {37022#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {36891#false} is VALID [2022-04-28 10:09:03,487 INFO L290 TraceCheckUtils]: 34: Hoare triple {36891#false} assume !false; {36891#false} is VALID [2022-04-28 10:09:03,487 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:09:03,487 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:09:08,635 INFO L290 TraceCheckUtils]: 34: Hoare triple {36891#false} assume !false; {36891#false} is VALID [2022-04-28 10:09:08,636 INFO L290 TraceCheckUtils]: 33: Hoare triple {37022#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {36891#false} is VALID [2022-04-28 10:09:08,636 INFO L290 TraceCheckUtils]: 32: Hoare triple {37018#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {37022#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:09:08,637 INFO L272 TraceCheckUtils]: 31: Hoare triple {36912#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {37018#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:09:08,637 INFO L290 TraceCheckUtils]: 30: Hoare triple {36912#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {36912#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-28 10:09:08,638 INFO L290 TraceCheckUtils]: 29: Hoare triple {37044#(and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {36912#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-28 10:09:08,639 INFO L290 TraceCheckUtils]: 28: Hoare triple {37048#(and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {37044#(and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-28 10:09:08,640 INFO L290 TraceCheckUtils]: 27: Hoare triple {37052#(and (< (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {37048#(and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-28 10:09:08,641 INFO L290 TraceCheckUtils]: 26: Hoare triple {37056#(and (< (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) main_~n~0) (+ 5 main_~z~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) main_~n~0)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {37052#(and (< (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296))))} is VALID [2022-04-28 10:09:08,642 INFO L290 TraceCheckUtils]: 25: Hoare triple {37060#(and (<= (+ 5 main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ 5 main_~z~0) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ 5 main_~z~0) 4294967296) 4294967296)) (+ main_~z~0 6 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {37056#(and (< (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) main_~n~0) (+ 5 main_~z~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-28 10:09:08,643 INFO L290 TraceCheckUtils]: 24: Hoare triple {37064#(and (< (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) main_~n~0) (+ 7 main_~z~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 6 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) main_~n~0)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {37060#(and (<= (+ 5 main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ 5 main_~z~0) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ 5 main_~z~0) 4294967296) 4294967296)) (+ main_~z~0 6 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-28 10:09:08,644 INFO L290 TraceCheckUtils]: 23: Hoare triple {37068#(and (< (+ main_~n~0 (* (div (+ 7 main_~z~0) 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 8)) (<= (+ 7 main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ 7 main_~z~0) 4294967296) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {37064#(and (< (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) main_~n~0) (+ 7 main_~z~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 6 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-28 10:09:08,644 INFO L290 TraceCheckUtils]: 22: Hoare triple {37068#(and (< (+ main_~n~0 (* (div (+ 7 main_~z~0) 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 8)) (<= (+ 7 main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ 7 main_~z~0) 4294967296) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {37068#(and (< (+ main_~n~0 (* (div (+ 7 main_~z~0) 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 8)) (<= (+ 7 main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ 7 main_~z~0) 4294967296) 4294967296))))} is VALID [2022-04-28 10:09:08,645 INFO L290 TraceCheckUtils]: 21: Hoare triple {37064#(and (< (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) main_~n~0) (+ 7 main_~z~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 6 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) main_~n~0)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {37068#(and (< (+ main_~n~0 (* (div (+ 7 main_~z~0) 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 8)) (<= (+ 7 main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ 7 main_~z~0) 4294967296) 4294967296))))} is VALID [2022-04-28 10:09:08,646 INFO L290 TraceCheckUtils]: 20: Hoare triple {37060#(and (<= (+ 5 main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ 5 main_~z~0) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ 5 main_~z~0) 4294967296) 4294967296)) (+ main_~z~0 6 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {37064#(and (< (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) main_~n~0) (+ 7 main_~z~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 6 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-28 10:09:08,647 INFO L290 TraceCheckUtils]: 19: Hoare triple {37056#(and (< (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) main_~n~0) (+ 5 main_~z~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) main_~n~0)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {37060#(and (<= (+ 5 main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ 5 main_~z~0) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ 5 main_~z~0) 4294967296) 4294967296)) (+ main_~z~0 6 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-28 10:09:08,648 INFO L290 TraceCheckUtils]: 18: Hoare triple {37052#(and (< (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {37056#(and (< (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) main_~n~0) (+ 5 main_~z~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-28 10:09:08,649 INFO L290 TraceCheckUtils]: 17: Hoare triple {37048#(and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {37052#(and (< (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296))))} is VALID [2022-04-28 10:09:08,649 INFO L290 TraceCheckUtils]: 16: Hoare triple {37044#(and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {37048#(and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-28 10:09:08,651 INFO L290 TraceCheckUtils]: 15: Hoare triple {36912#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {37044#(and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-28 10:09:08,651 INFO L290 TraceCheckUtils]: 14: Hoare triple {37096#(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)))} ~z~0 := ~y~0; {36912#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-28 10:09:08,652 INFO L290 TraceCheckUtils]: 13: Hoare triple {37100#(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); {37096#(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-28 10:09:08,653 INFO L290 TraceCheckUtils]: 12: Hoare triple {37104#(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; {37100#(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-28 10:09:08,654 INFO L290 TraceCheckUtils]: 11: Hoare triple {37108#(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; {37104#(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-28 10:09:08,655 INFO L290 TraceCheckUtils]: 10: Hoare triple {37112#(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; {37108#(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-28 10:09:08,657 INFO L290 TraceCheckUtils]: 9: Hoare triple {37116#(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; {37112#(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-28 10:09:08,658 INFO L290 TraceCheckUtils]: 8: Hoare triple {37120#(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; {37116#(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-28 10:09:08,659 INFO L290 TraceCheckUtils]: 7: Hoare triple {37124#(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; {37120#(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-28 10:09:08,660 INFO L290 TraceCheckUtils]: 6: Hoare triple {37128#(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; {37124#(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-28 10:09:08,661 INFO L290 TraceCheckUtils]: 5: Hoare triple {36890#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {37128#(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-28 10:09:08,661 INFO L272 TraceCheckUtils]: 4: Hoare triple {36890#true} call #t~ret11 := main(); {36890#true} is VALID [2022-04-28 10:09:08,661 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36890#true} {36890#true} #61#return; {36890#true} is VALID [2022-04-28 10:09:08,661 INFO L290 TraceCheckUtils]: 2: Hoare triple {36890#true} assume true; {36890#true} is VALID [2022-04-28 10:09:08,662 INFO L290 TraceCheckUtils]: 1: Hoare triple {36890#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(10, 2);call #Ultimate.allocInit(12, 3); {36890#true} is VALID [2022-04-28 10:09:08,662 INFO L272 TraceCheckUtils]: 0: Hoare triple {36890#true} call ULTIMATE.init(); {36890#true} is VALID [2022-04-28 10:09:08,662 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:09:08,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1949877779] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:09:08,662 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:09:08,662 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21, 21] total 47 [2022-04-28 10:09:08,662 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:09:08,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [526411075] [2022-04-28 10:09:08,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [526411075] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:09:08,662 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:09:08,662 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-28 10:09:08,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879026696] [2022-04-28 10:09:08,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:09:08,663 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 21 states have internal predecessors, (31), 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 35 [2022-04-28 10:09:08,664 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:09:08,664 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 23 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 21 states have internal predecessors, (31), 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-28 10:09:11,657 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 34 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:11,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-28 10:09:11,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:11,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-28 10:09:11,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=1947, Unknown=0, NotChecked=0, Total=2162 [2022-04-28 10:09:11,657 INFO L87 Difference]: Start difference. First operand 111 states and 141 transitions. Second operand has 23 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 21 states have internal predecessors, (31), 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-28 10:09:14,410 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-28 10:09:16,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:16,453 INFO L93 Difference]: Finished difference Result 136 states and 166 transitions. [2022-04-28 10:09:16,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-28 10:09:16,454 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 21 states have internal predecessors, (31), 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 35 [2022-04-28 10:09:16,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:09:16,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 21 states have internal predecessors, (31), 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-28 10:09:16,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 55 transitions. [2022-04-28 10:09:16,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 21 states have internal predecessors, (31), 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-28 10:09:16,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 55 transitions. [2022-04-28 10:09:16,455 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 55 transitions. [2022-04-28 10:09:16,588 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:16,589 INFO L225 Difference]: With dead ends: 136 [2022-04-28 10:09:16,589 INFO L226 Difference]: Without dead ends: 102 [2022-04-28 10:09:16,589 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 49 SyntacticMatches, 5 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 651 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=457, Invalid=4799, Unknown=0, NotChecked=0, Total=5256 [2022-04-28 10:09:16,589 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 22 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 591 mSolverCounterSat, 30 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 622 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 591 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-04-28 10:09:16,589 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 104 Invalid, 622 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 591 Invalid, 1 Unknown, 0 Unchecked, 2.8s Time] [2022-04-28 10:09:16,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-04-28 10:09:16,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2022-04-28 10:09:16,687 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:09:16,688 INFO L82 GeneralOperation]: Start isEquivalent. First operand 102 states. Second operand has 102 states, 97 states have (on average 1.2989690721649485) internal successors, (126), 97 states have internal predecessors, (126), 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-28 10:09:16,688 INFO L74 IsIncluded]: Start isIncluded. First operand 102 states. Second operand has 102 states, 97 states have (on average 1.2989690721649485) internal successors, (126), 97 states have internal predecessors, (126), 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-28 10:09:16,688 INFO L87 Difference]: Start difference. First operand 102 states. Second operand has 102 states, 97 states have (on average 1.2989690721649485) internal successors, (126), 97 states have internal predecessors, (126), 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-28 10:09:16,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:16,689 INFO L93 Difference]: Finished difference Result 102 states and 130 transitions. [2022-04-28 10:09:16,689 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 130 transitions. [2022-04-28 10:09:16,689 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:16,689 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:16,689 INFO L74 IsIncluded]: Start isIncluded. First operand has 102 states, 97 states have (on average 1.2989690721649485) internal successors, (126), 97 states have internal predecessors, (126), 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 102 states. [2022-04-28 10:09:16,689 INFO L87 Difference]: Start difference. First operand has 102 states, 97 states have (on average 1.2989690721649485) internal successors, (126), 97 states have internal predecessors, (126), 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 102 states. [2022-04-28 10:09:16,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:16,690 INFO L93 Difference]: Finished difference Result 102 states and 130 transitions. [2022-04-28 10:09:16,690 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 130 transitions. [2022-04-28 10:09:16,690 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:16,690 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:16,690 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:09:16,690 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:09:16,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 97 states have (on average 1.2989690721649485) internal successors, (126), 97 states have internal predecessors, (126), 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-28 10:09:16,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 130 transitions. [2022-04-28 10:09:16,691 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 130 transitions. Word has length 35 [2022-04-28 10:09:16,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:09:16,691 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 130 transitions. [2022-04-28 10:09:16,691 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 21 states have internal predecessors, (31), 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-28 10:09:16,691 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 102 states and 130 transitions. [2022-04-28 10:09:18,546 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 130 edges. 130 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:18,546 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 130 transitions. [2022-04-28 10:09:18,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-28 10:09:18,547 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:09:18,547 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:09:18,563 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Forceful destruction successful, exit code 0 [2022-04-28 10:09:18,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55,56 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:18,747 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:09:18,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:09:18,748 INFO L85 PathProgramCache]: Analyzing trace with hash 75330479, now seen corresponding path program 71 times [2022-04-28 10:09:18,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:18,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [47315278] [2022-04-28 10:09:18,750 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:09:18,750 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:09:18,750 INFO L85 PathProgramCache]: Analyzing trace with hash 75330479, now seen corresponding path program 72 times [2022-04-28 10:09:18,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:09:18,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24268088] [2022-04-28 10:09:18,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:09:18,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:09:18,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:18,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:09:18,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:18,988 INFO L290 TraceCheckUtils]: 0: Hoare triple {37901#(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(10, 2);call #Ultimate.allocInit(12, 3); {37881#true} is VALID [2022-04-28 10:09:18,988 INFO L290 TraceCheckUtils]: 1: Hoare triple {37881#true} assume true; {37881#true} is VALID [2022-04-28 10:09:18,988 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {37881#true} {37881#true} #61#return; {37881#true} is VALID [2022-04-28 10:09:18,988 INFO L272 TraceCheckUtils]: 0: Hoare triple {37881#true} call ULTIMATE.init(); {37901#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:09:18,989 INFO L290 TraceCheckUtils]: 1: Hoare triple {37901#(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(10, 2);call #Ultimate.allocInit(12, 3); {37881#true} is VALID [2022-04-28 10:09:18,989 INFO L290 TraceCheckUtils]: 2: Hoare triple {37881#true} assume true; {37881#true} is VALID [2022-04-28 10:09:18,989 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37881#true} {37881#true} #61#return; {37881#true} is VALID [2022-04-28 10:09:18,989 INFO L272 TraceCheckUtils]: 4: Hoare triple {37881#true} call #t~ret11 := main(); {37881#true} is VALID [2022-04-28 10:09:18,989 INFO L290 TraceCheckUtils]: 5: Hoare triple {37881#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {37886#(= main_~y~0 0)} is VALID [2022-04-28 10:09:18,989 INFO L290 TraceCheckUtils]: 6: Hoare triple {37886#(= 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; {37887#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:18,990 INFO L290 TraceCheckUtils]: 7: Hoare triple {37887#(and (<= 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; {37888#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:18,990 INFO L290 TraceCheckUtils]: 8: Hoare triple {37888#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {37889#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:18,991 INFO L290 TraceCheckUtils]: 9: Hoare triple {37889#(and (<= main_~y~0 3) (<= 3 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; {37890#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:09:18,991 INFO L290 TraceCheckUtils]: 10: Hoare triple {37890#(and (<= main_~y~0 4) (<= 4 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; {37891#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:09:18,992 INFO L290 TraceCheckUtils]: 11: Hoare triple {37891#(and (<= 5 main_~y~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; {37892#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:09:18,993 INFO L290 TraceCheckUtils]: 12: Hoare triple {37892#(and (<= main_~y~0 6) (<= 6 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; {37893#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:09:18,993 INFO L290 TraceCheckUtils]: 13: Hoare triple {37893#(and (<= 7 main_~y~0) (<= main_~y~0 7))} 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; {37894#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:09:18,993 INFO L290 TraceCheckUtils]: 14: Hoare triple {37894#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {37894#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:09:18,994 INFO L290 TraceCheckUtils]: 15: Hoare triple {37894#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {37895#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:09:18,994 INFO L290 TraceCheckUtils]: 16: Hoare triple {37895#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {37896#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:09:18,995 INFO L290 TraceCheckUtils]: 17: Hoare triple {37896#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {37897#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:09:18,995 INFO L290 TraceCheckUtils]: 18: Hoare triple {37897#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {37898#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:09:18,996 INFO L290 TraceCheckUtils]: 19: Hoare triple {37898#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {37899#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:09:18,996 INFO L290 TraceCheckUtils]: 20: Hoare triple {37899#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {37900#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:09:18,997 INFO L290 TraceCheckUtils]: 21: Hoare triple {37900#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {37882#false} is VALID [2022-04-28 10:09:18,997 INFO L290 TraceCheckUtils]: 22: Hoare triple {37882#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {37882#false} is VALID [2022-04-28 10:09:18,997 INFO L290 TraceCheckUtils]: 23: Hoare triple {37882#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {37882#false} is VALID [2022-04-28 10:09:18,997 INFO L290 TraceCheckUtils]: 24: Hoare triple {37882#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {37882#false} is VALID [2022-04-28 10:09:18,997 INFO L290 TraceCheckUtils]: 25: Hoare triple {37882#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {37882#false} is VALID [2022-04-28 10:09:18,997 INFO L290 TraceCheckUtils]: 26: Hoare triple {37882#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {37882#false} is VALID [2022-04-28 10:09:18,997 INFO L290 TraceCheckUtils]: 27: Hoare triple {37882#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {37882#false} is VALID [2022-04-28 10:09:18,997 INFO L290 TraceCheckUtils]: 28: Hoare triple {37882#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {37882#false} is VALID [2022-04-28 10:09:18,997 INFO L290 TraceCheckUtils]: 29: Hoare triple {37882#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {37882#false} is VALID [2022-04-28 10:09:18,997 INFO L290 TraceCheckUtils]: 30: Hoare triple {37882#false} assume !(~y~0 % 4294967296 > 0); {37882#false} is VALID [2022-04-28 10:09:18,997 INFO L272 TraceCheckUtils]: 31: Hoare triple {37882#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {37882#false} is VALID [2022-04-28 10:09:18,997 INFO L290 TraceCheckUtils]: 32: Hoare triple {37882#false} ~cond := #in~cond; {37882#false} is VALID [2022-04-28 10:09:18,997 INFO L290 TraceCheckUtils]: 33: Hoare triple {37882#false} assume 0 == ~cond; {37882#false} is VALID [2022-04-28 10:09:18,997 INFO L290 TraceCheckUtils]: 34: Hoare triple {37882#false} assume !false; {37882#false} is VALID [2022-04-28 10:09:18,998 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-28 10:09:18,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:09:18,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24268088] [2022-04-28 10:09:18,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24268088] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:09:18,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [390487353] [2022-04-28 10:09:18,998 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:09:18,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:18,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:09:18,999 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:09:19,000 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Waiting until timeout for monitored process [2022-04-28 10:09:19,103 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-28 10:09:19,103 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:09:19,104 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 42 conjunts are in the unsatisfiable core [2022-04-28 10:09:19,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:19,114 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:09:19,383 INFO L272 TraceCheckUtils]: 0: Hoare triple {37881#true} call ULTIMATE.init(); {37881#true} is VALID [2022-04-28 10:09:19,384 INFO L290 TraceCheckUtils]: 1: Hoare triple {37881#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(10, 2);call #Ultimate.allocInit(12, 3); {37881#true} is VALID [2022-04-28 10:09:19,384 INFO L290 TraceCheckUtils]: 2: Hoare triple {37881#true} assume true; {37881#true} is VALID [2022-04-28 10:09:19,384 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37881#true} {37881#true} #61#return; {37881#true} is VALID [2022-04-28 10:09:19,384 INFO L272 TraceCheckUtils]: 4: Hoare triple {37881#true} call #t~ret11 := main(); {37881#true} is VALID [2022-04-28 10:09:19,384 INFO L290 TraceCheckUtils]: 5: Hoare triple {37881#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {37886#(= main_~y~0 0)} is VALID [2022-04-28 10:09:19,385 INFO L290 TraceCheckUtils]: 6: Hoare triple {37886#(= 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; {37887#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:19,385 INFO L290 TraceCheckUtils]: 7: Hoare triple {37887#(and (<= 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; {37888#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:19,386 INFO L290 TraceCheckUtils]: 8: Hoare triple {37888#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {37889#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:19,386 INFO L290 TraceCheckUtils]: 9: Hoare triple {37889#(and (<= main_~y~0 3) (<= 3 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; {37890#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:09:19,387 INFO L290 TraceCheckUtils]: 10: Hoare triple {37890#(and (<= main_~y~0 4) (<= 4 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; {37891#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:09:19,387 INFO L290 TraceCheckUtils]: 11: Hoare triple {37891#(and (<= 5 main_~y~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; {37892#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:09:19,388 INFO L290 TraceCheckUtils]: 12: Hoare triple {37892#(and (<= main_~y~0 6) (<= 6 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; {37893#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:09:19,388 INFO L290 TraceCheckUtils]: 13: Hoare triple {37893#(and (<= 7 main_~y~0) (<= main_~y~0 7))} 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; {37894#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:09:19,389 INFO L290 TraceCheckUtils]: 14: Hoare triple {37894#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {37894#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:09:19,389 INFO L290 TraceCheckUtils]: 15: Hoare triple {37894#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {37950#(and (= main_~z~0 main_~y~0) (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:09:19,389 INFO L290 TraceCheckUtils]: 16: Hoare triple {37950#(and (= main_~z~0 main_~y~0) (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {37954#(and (<= main_~y~0 8) (<= 8 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-28 10:09:19,390 INFO L290 TraceCheckUtils]: 17: Hoare triple {37954#(and (<= main_~y~0 8) (<= 8 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {37958#(and (= main_~y~0 (+ main_~z~0 2)) (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:09:19,391 INFO L290 TraceCheckUtils]: 18: Hoare triple {37958#(and (= main_~y~0 (+ main_~z~0 2)) (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {37962#(and (<= main_~y~0 8) (<= 8 main_~y~0) (= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-28 10:09:19,391 INFO L290 TraceCheckUtils]: 19: Hoare triple {37962#(and (<= main_~y~0 8) (<= 8 main_~y~0) (= main_~y~0 (+ main_~z~0 3)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {37966#(and (<= main_~y~0 8) (= main_~y~0 (+ main_~z~0 4)) (<= 8 main_~y~0))} is VALID [2022-04-28 10:09:19,392 INFO L290 TraceCheckUtils]: 20: Hoare triple {37966#(and (<= main_~y~0 8) (= main_~y~0 (+ main_~z~0 4)) (<= 8 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {37970#(and (= (+ main_~y~0 (- 4)) (+ main_~z~0 1)) (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:09:19,392 INFO L290 TraceCheckUtils]: 21: Hoare triple {37970#(and (= (+ main_~y~0 (- 4)) (+ main_~z~0 1)) (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~z~0 % 4294967296 > 0); {37882#false} is VALID [2022-04-28 10:09:19,392 INFO L290 TraceCheckUtils]: 22: Hoare triple {37882#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {37882#false} is VALID [2022-04-28 10:09:19,392 INFO L290 TraceCheckUtils]: 23: Hoare triple {37882#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {37882#false} is VALID [2022-04-28 10:09:19,392 INFO L290 TraceCheckUtils]: 24: Hoare triple {37882#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {37882#false} is VALID [2022-04-28 10:09:19,392 INFO L290 TraceCheckUtils]: 25: Hoare triple {37882#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {37882#false} is VALID [2022-04-28 10:09:19,392 INFO L290 TraceCheckUtils]: 26: Hoare triple {37882#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {37882#false} is VALID [2022-04-28 10:09:19,392 INFO L290 TraceCheckUtils]: 27: Hoare triple {37882#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {37882#false} is VALID [2022-04-28 10:09:19,393 INFO L290 TraceCheckUtils]: 28: Hoare triple {37882#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {37882#false} is VALID [2022-04-28 10:09:19,393 INFO L290 TraceCheckUtils]: 29: Hoare triple {37882#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {37882#false} is VALID [2022-04-28 10:09:19,393 INFO L290 TraceCheckUtils]: 30: Hoare triple {37882#false} assume !(~y~0 % 4294967296 > 0); {37882#false} is VALID [2022-04-28 10:09:19,393 INFO L272 TraceCheckUtils]: 31: Hoare triple {37882#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {37882#false} is VALID [2022-04-28 10:09:19,393 INFO L290 TraceCheckUtils]: 32: Hoare triple {37882#false} ~cond := #in~cond; {37882#false} is VALID [2022-04-28 10:09:19,393 INFO L290 TraceCheckUtils]: 33: Hoare triple {37882#false} assume 0 == ~cond; {37882#false} is VALID [2022-04-28 10:09:19,393 INFO L290 TraceCheckUtils]: 34: Hoare triple {37882#false} assume !false; {37882#false} is VALID [2022-04-28 10:09:19,393 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-28 10:09:19,393 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:09:19,786 INFO L290 TraceCheckUtils]: 34: Hoare triple {37882#false} assume !false; {37882#false} is VALID [2022-04-28 10:09:19,786 INFO L290 TraceCheckUtils]: 33: Hoare triple {37882#false} assume 0 == ~cond; {37882#false} is VALID [2022-04-28 10:09:19,786 INFO L290 TraceCheckUtils]: 32: Hoare triple {37882#false} ~cond := #in~cond; {37882#false} is VALID [2022-04-28 10:09:19,786 INFO L272 TraceCheckUtils]: 31: Hoare triple {37882#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {37882#false} is VALID [2022-04-28 10:09:19,786 INFO L290 TraceCheckUtils]: 30: Hoare triple {37882#false} assume !(~y~0 % 4294967296 > 0); {37882#false} is VALID [2022-04-28 10:09:19,786 INFO L290 TraceCheckUtils]: 29: Hoare triple {37882#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {37882#false} is VALID [2022-04-28 10:09:19,786 INFO L290 TraceCheckUtils]: 28: Hoare triple {37882#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {37882#false} is VALID [2022-04-28 10:09:19,786 INFO L290 TraceCheckUtils]: 27: Hoare triple {38034#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {37882#false} is VALID [2022-04-28 10:09:19,787 INFO L290 TraceCheckUtils]: 26: Hoare triple {38038#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {38034#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:09:19,788 INFO L290 TraceCheckUtils]: 25: Hoare triple {38042#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {38038#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:09:19,789 INFO L290 TraceCheckUtils]: 24: Hoare triple {38046#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {38042#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-28 10:09:19,789 INFO L290 TraceCheckUtils]: 23: Hoare triple {38050#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {38046#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-28 10:09:19,790 INFO L290 TraceCheckUtils]: 22: Hoare triple {38054#(not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {38050#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:09:19,790 INFO L290 TraceCheckUtils]: 21: Hoare triple {38058#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296))) (< 0 (mod main_~z~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {38054#(not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:09:19,791 INFO L290 TraceCheckUtils]: 20: Hoare triple {38062#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {38058#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-28 10:09:19,792 INFO L290 TraceCheckUtils]: 19: Hoare triple {38066#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296))) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {38062#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:09:19,793 INFO L290 TraceCheckUtils]: 18: Hoare triple {38070#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {38066#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296))) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)))} is VALID [2022-04-28 10:09:19,794 INFO L290 TraceCheckUtils]: 17: Hoare triple {38074#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296))) (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {38070#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} is VALID [2022-04-28 10:09:19,794 INFO L290 TraceCheckUtils]: 16: Hoare triple {38078#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296))) (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {38074#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296))) (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)))} is VALID [2022-04-28 10:09:19,795 INFO L290 TraceCheckUtils]: 15: Hoare triple {37881#true} ~z~0 := ~y~0; {38078#(or (not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296))) (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)))} is VALID [2022-04-28 10:09:19,795 INFO L290 TraceCheckUtils]: 14: Hoare triple {37881#true} assume !(~x~0 % 4294967296 > 0); {37881#true} is VALID [2022-04-28 10:09:19,795 INFO L290 TraceCheckUtils]: 13: Hoare triple {37881#true} 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; {37881#true} is VALID [2022-04-28 10:09:19,795 INFO L290 TraceCheckUtils]: 12: Hoare triple {37881#true} 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; {37881#true} is VALID [2022-04-28 10:09:19,795 INFO L290 TraceCheckUtils]: 11: Hoare triple {37881#true} 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; {37881#true} is VALID [2022-04-28 10:09:19,795 INFO L290 TraceCheckUtils]: 10: Hoare triple {37881#true} 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; {37881#true} is VALID [2022-04-28 10:09:19,795 INFO L290 TraceCheckUtils]: 9: Hoare triple {37881#true} 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; {37881#true} is VALID [2022-04-28 10:09:19,795 INFO L290 TraceCheckUtils]: 8: Hoare triple {37881#true} 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; {37881#true} is VALID [2022-04-28 10:09:19,795 INFO L290 TraceCheckUtils]: 7: Hoare triple {37881#true} 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; {37881#true} is VALID [2022-04-28 10:09:19,795 INFO L290 TraceCheckUtils]: 6: Hoare triple {37881#true} 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; {37881#true} is VALID [2022-04-28 10:09:19,795 INFO L290 TraceCheckUtils]: 5: Hoare triple {37881#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {37881#true} is VALID [2022-04-28 10:09:19,795 INFO L272 TraceCheckUtils]: 4: Hoare triple {37881#true} call #t~ret11 := main(); {37881#true} is VALID [2022-04-28 10:09:19,795 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37881#true} {37881#true} #61#return; {37881#true} is VALID [2022-04-28 10:09:19,795 INFO L290 TraceCheckUtils]: 2: Hoare triple {37881#true} assume true; {37881#true} is VALID [2022-04-28 10:09:19,795 INFO L290 TraceCheckUtils]: 1: Hoare triple {37881#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(10, 2);call #Ultimate.allocInit(12, 3); {37881#true} is VALID [2022-04-28 10:09:19,795 INFO L272 TraceCheckUtils]: 0: Hoare triple {37881#true} call ULTIMATE.init(); {37881#true} is VALID [2022-04-28 10:09:19,796 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 18 proven. 30 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-04-28 10:09:19,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [390487353] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:09:19,796 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:09:19,796 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 14] total 36 [2022-04-28 10:09:19,796 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:09:19,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [47315278] [2022-04-28 10:09:19,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [47315278] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:09:19,796 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:09:19,796 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-28 10:09:19,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400673520] [2022-04-28 10:09:19,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:09:19,796 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 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 35 [2022-04-28 10:09:19,796 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:09:19,797 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 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-28 10:09:19,814 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:19,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-28 10:09:19,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:19,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-28 10:09:19,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=1087, Unknown=0, NotChecked=0, Total=1260 [2022-04-28 10:09:19,815 INFO L87 Difference]: Start difference. First operand 102 states and 130 transitions. Second operand has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 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-28 10:09:20,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:20,841 INFO L93 Difference]: Finished difference Result 127 states and 155 transitions. [2022-04-28 10:09:20,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-28 10:09:20,841 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 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 35 [2022-04-28 10:09:20,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:09:20,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 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-28 10:09:20,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 53 transitions. [2022-04-28 10:09:20,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 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-28 10:09:20,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 53 transitions. [2022-04-28 10:09:20,842 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 53 transitions. [2022-04-28 10:09:20,881 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:20,882 INFO L225 Difference]: With dead ends: 127 [2022-04-28 10:09:20,882 INFO L226 Difference]: Without dead ends: 113 [2022-04-28 10:09:20,882 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 373 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=303, Invalid=2247, Unknown=0, NotChecked=0, Total=2550 [2022-04-28 10:09:20,882 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 17 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 433 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 10:09:20,883 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 78 Invalid, 465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 433 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 10:09:20,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-04-28 10:09:20,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 103. [2022-04-28 10:09:20,987 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:09:20,987 INFO L82 GeneralOperation]: Start isEquivalent. First operand 113 states. Second operand has 103 states, 98 states have (on average 1.2959183673469388) internal successors, (127), 98 states have internal predecessors, (127), 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-28 10:09:20,987 INFO L74 IsIncluded]: Start isIncluded. First operand 113 states. Second operand has 103 states, 98 states have (on average 1.2959183673469388) internal successors, (127), 98 states have internal predecessors, (127), 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-28 10:09:20,987 INFO L87 Difference]: Start difference. First operand 113 states. Second operand has 103 states, 98 states have (on average 1.2959183673469388) internal successors, (127), 98 states have internal predecessors, (127), 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-28 10:09:20,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:20,988 INFO L93 Difference]: Finished difference Result 113 states and 141 transitions. [2022-04-28 10:09:20,988 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 141 transitions. [2022-04-28 10:09:20,988 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:20,988 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:20,988 INFO L74 IsIncluded]: Start isIncluded. First operand has 103 states, 98 states have (on average 1.2959183673469388) internal successors, (127), 98 states have internal predecessors, (127), 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 113 states. [2022-04-28 10:09:20,988 INFO L87 Difference]: Start difference. First operand has 103 states, 98 states have (on average 1.2959183673469388) internal successors, (127), 98 states have internal predecessors, (127), 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 113 states. [2022-04-28 10:09:20,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:20,989 INFO L93 Difference]: Finished difference Result 113 states and 141 transitions. [2022-04-28 10:09:20,989 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 141 transitions. [2022-04-28 10:09:20,989 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:20,989 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:20,989 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:09:20,989 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:09:20,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 98 states have (on average 1.2959183673469388) internal successors, (127), 98 states have internal predecessors, (127), 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-28 10:09:20,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 131 transitions. [2022-04-28 10:09:20,990 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 131 transitions. Word has length 35 [2022-04-28 10:09:20,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:09:20,990 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 131 transitions. [2022-04-28 10:09:20,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 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-28 10:09:20,991 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 103 states and 131 transitions. [2022-04-28 10:09:25,444 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 131 edges. 130 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:25,444 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 131 transitions. [2022-04-28 10:09:25,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-28 10:09:25,444 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:09:25,444 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:09:25,460 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Forceful destruction successful, exit code 0 [2022-04-28 10:09:25,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56,57 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:25,645 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:09:25,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:09:25,645 INFO L85 PathProgramCache]: Analyzing trace with hash 963858751, now seen corresponding path program 73 times [2022-04-28 10:09:25,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:25,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [808429888] [2022-04-28 10:09:25,647 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:09:25,647 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:09:25,647 INFO L85 PathProgramCache]: Analyzing trace with hash 963858751, now seen corresponding path program 74 times [2022-04-28 10:09:25,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:09:25,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344599083] [2022-04-28 10:09:25,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:09:25,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:09:25,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:25,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:09:25,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:25,858 INFO L290 TraceCheckUtils]: 0: Hoare triple {38864#(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(10, 2);call #Ultimate.allocInit(12, 3); {38845#true} is VALID [2022-04-28 10:09:25,858 INFO L290 TraceCheckUtils]: 1: Hoare triple {38845#true} assume true; {38845#true} is VALID [2022-04-28 10:09:25,858 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {38845#true} {38845#true} #61#return; {38845#true} is VALID [2022-04-28 10:09:25,859 INFO L272 TraceCheckUtils]: 0: Hoare triple {38845#true} call ULTIMATE.init(); {38864#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:09:25,859 INFO L290 TraceCheckUtils]: 1: Hoare triple {38864#(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(10, 2);call #Ultimate.allocInit(12, 3); {38845#true} is VALID [2022-04-28 10:09:25,859 INFO L290 TraceCheckUtils]: 2: Hoare triple {38845#true} assume true; {38845#true} is VALID [2022-04-28 10:09:25,859 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38845#true} {38845#true} #61#return; {38845#true} is VALID [2022-04-28 10:09:25,859 INFO L272 TraceCheckUtils]: 4: Hoare triple {38845#true} call #t~ret11 := main(); {38845#true} is VALID [2022-04-28 10:09:25,859 INFO L290 TraceCheckUtils]: 5: Hoare triple {38845#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {38850#(= main_~y~0 0)} is VALID [2022-04-28 10:09:25,859 INFO L290 TraceCheckUtils]: 6: Hoare triple {38850#(= 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; {38851#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:25,860 INFO L290 TraceCheckUtils]: 7: Hoare triple {38851#(and (<= 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; {38852#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:25,860 INFO L290 TraceCheckUtils]: 8: Hoare triple {38852#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {38853#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:25,861 INFO L290 TraceCheckUtils]: 9: Hoare triple {38853#(and (<= main_~y~0 3) (<= 3 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; {38854#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:09:25,861 INFO L290 TraceCheckUtils]: 10: Hoare triple {38854#(and (<= main_~y~0 4) (<= 4 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; {38855#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:09:25,862 INFO L290 TraceCheckUtils]: 11: Hoare triple {38855#(and (<= 5 main_~y~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; {38856#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:09:25,862 INFO L290 TraceCheckUtils]: 12: Hoare triple {38856#(and (<= main_~y~0 6) (<= 6 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; {38857#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:09:25,863 INFO L290 TraceCheckUtils]: 13: Hoare triple {38857#(and (<= 7 main_~y~0) (<= main_~y~0 7))} 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; {38858#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:09:25,863 INFO L290 TraceCheckUtils]: 14: Hoare triple {38858#(and (<= main_~y~0 8) (<= 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; {38859#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:09:25,864 INFO L290 TraceCheckUtils]: 15: Hoare triple {38859#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {38859#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:09:25,864 INFO L290 TraceCheckUtils]: 16: Hoare triple {38859#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {38860#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:09:25,864 INFO L290 TraceCheckUtils]: 17: Hoare triple {38860#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {38861#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:09:25,865 INFO L290 TraceCheckUtils]: 18: Hoare triple {38861#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {38862#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:09:25,866 INFO L290 TraceCheckUtils]: 19: Hoare triple {38862#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {38863#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} is VALID [2022-04-28 10:09:25,866 INFO L290 TraceCheckUtils]: 20: Hoare triple {38863#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {38846#false} is VALID [2022-04-28 10:09:25,866 INFO L290 TraceCheckUtils]: 21: Hoare triple {38846#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {38846#false} is VALID [2022-04-28 10:09:25,866 INFO L290 TraceCheckUtils]: 22: Hoare triple {38846#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {38846#false} is VALID [2022-04-28 10:09:25,866 INFO L290 TraceCheckUtils]: 23: Hoare triple {38846#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {38846#false} is VALID [2022-04-28 10:09:25,866 INFO L290 TraceCheckUtils]: 24: Hoare triple {38846#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {38846#false} is VALID [2022-04-28 10:09:25,866 INFO L290 TraceCheckUtils]: 25: Hoare triple {38846#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {38846#false} is VALID [2022-04-28 10:09:25,866 INFO L290 TraceCheckUtils]: 26: Hoare triple {38846#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {38846#false} is VALID [2022-04-28 10:09:25,866 INFO L290 TraceCheckUtils]: 27: Hoare triple {38846#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {38846#false} is VALID [2022-04-28 10:09:25,866 INFO L290 TraceCheckUtils]: 28: Hoare triple {38846#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {38846#false} is VALID [2022-04-28 10:09:25,866 INFO L290 TraceCheckUtils]: 29: Hoare triple {38846#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {38846#false} is VALID [2022-04-28 10:09:25,866 INFO L290 TraceCheckUtils]: 30: Hoare triple {38846#false} assume !(~y~0 % 4294967296 > 0); {38846#false} is VALID [2022-04-28 10:09:25,866 INFO L272 TraceCheckUtils]: 31: Hoare triple {38846#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {38846#false} is VALID [2022-04-28 10:09:25,867 INFO L290 TraceCheckUtils]: 32: Hoare triple {38846#false} ~cond := #in~cond; {38846#false} is VALID [2022-04-28 10:09:25,867 INFO L290 TraceCheckUtils]: 33: Hoare triple {38846#false} assume 0 == ~cond; {38846#false} is VALID [2022-04-28 10:09:25,867 INFO L290 TraceCheckUtils]: 34: Hoare triple {38846#false} assume !false; {38846#false} is VALID [2022-04-28 10:09:25,867 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-04-28 10:09:25,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:09:25,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344599083] [2022-04-28 10:09:25,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344599083] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:09:25,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1260643811] [2022-04-28 10:09:25,867 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:09:25,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:25,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:09:25,868 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:09:25,868 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Waiting until timeout for monitored process [2022-04-28 10:09:25,907 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:09:25,907 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:09:25,908 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-28 10:09:25,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:25,915 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:09:26,145 INFO L272 TraceCheckUtils]: 0: Hoare triple {38845#true} call ULTIMATE.init(); {38845#true} is VALID [2022-04-28 10:09:26,145 INFO L290 TraceCheckUtils]: 1: Hoare triple {38845#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(10, 2);call #Ultimate.allocInit(12, 3); {38845#true} is VALID [2022-04-28 10:09:26,145 INFO L290 TraceCheckUtils]: 2: Hoare triple {38845#true} assume true; {38845#true} is VALID [2022-04-28 10:09:26,145 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38845#true} {38845#true} #61#return; {38845#true} is VALID [2022-04-28 10:09:26,146 INFO L272 TraceCheckUtils]: 4: Hoare triple {38845#true} call #t~ret11 := main(); {38845#true} is VALID [2022-04-28 10:09:26,149 INFO L290 TraceCheckUtils]: 5: Hoare triple {38845#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {38850#(= main_~y~0 0)} is VALID [2022-04-28 10:09:26,150 INFO L290 TraceCheckUtils]: 6: Hoare triple {38850#(= 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; {38851#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:26,150 INFO L290 TraceCheckUtils]: 7: Hoare triple {38851#(and (<= 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; {38852#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:26,151 INFO L290 TraceCheckUtils]: 8: Hoare triple {38852#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {38853#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:26,151 INFO L290 TraceCheckUtils]: 9: Hoare triple {38853#(and (<= main_~y~0 3) (<= 3 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; {38854#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:09:26,152 INFO L290 TraceCheckUtils]: 10: Hoare triple {38854#(and (<= main_~y~0 4) (<= 4 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; {38855#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:09:26,152 INFO L290 TraceCheckUtils]: 11: Hoare triple {38855#(and (<= 5 main_~y~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; {38856#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:09:26,153 INFO L290 TraceCheckUtils]: 12: Hoare triple {38856#(and (<= main_~y~0 6) (<= 6 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; {38857#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:09:26,153 INFO L290 TraceCheckUtils]: 13: Hoare triple {38857#(and (<= 7 main_~y~0) (<= main_~y~0 7))} 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; {38858#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:09:26,154 INFO L290 TraceCheckUtils]: 14: Hoare triple {38858#(and (<= main_~y~0 8) (<= 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; {38859#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:09:26,154 INFO L290 TraceCheckUtils]: 15: Hoare triple {38859#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {38859#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:09:26,154 INFO L290 TraceCheckUtils]: 16: Hoare triple {38859#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {38860#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:09:26,155 INFO L290 TraceCheckUtils]: 17: Hoare triple {38860#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {38861#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:09:26,155 INFO L290 TraceCheckUtils]: 18: Hoare triple {38861#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {38862#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:09:26,156 INFO L290 TraceCheckUtils]: 19: Hoare triple {38862#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {38925#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:09:26,156 INFO L290 TraceCheckUtils]: 20: Hoare triple {38925#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {38846#false} is VALID [2022-04-28 10:09:26,156 INFO L290 TraceCheckUtils]: 21: Hoare triple {38846#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {38846#false} is VALID [2022-04-28 10:09:26,156 INFO L290 TraceCheckUtils]: 22: Hoare triple {38846#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {38846#false} is VALID [2022-04-28 10:09:26,156 INFO L290 TraceCheckUtils]: 23: Hoare triple {38846#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {38846#false} is VALID [2022-04-28 10:09:26,157 INFO L290 TraceCheckUtils]: 24: Hoare triple {38846#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {38846#false} is VALID [2022-04-28 10:09:26,157 INFO L290 TraceCheckUtils]: 25: Hoare triple {38846#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {38846#false} is VALID [2022-04-28 10:09:26,157 INFO L290 TraceCheckUtils]: 26: Hoare triple {38846#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {38846#false} is VALID [2022-04-28 10:09:26,157 INFO L290 TraceCheckUtils]: 27: Hoare triple {38846#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {38846#false} is VALID [2022-04-28 10:09:26,157 INFO L290 TraceCheckUtils]: 28: Hoare triple {38846#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {38846#false} is VALID [2022-04-28 10:09:26,157 INFO L290 TraceCheckUtils]: 29: Hoare triple {38846#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {38846#false} is VALID [2022-04-28 10:09:26,157 INFO L290 TraceCheckUtils]: 30: Hoare triple {38846#false} assume !(~y~0 % 4294967296 > 0); {38846#false} is VALID [2022-04-28 10:09:26,157 INFO L272 TraceCheckUtils]: 31: Hoare triple {38846#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {38846#false} is VALID [2022-04-28 10:09:26,157 INFO L290 TraceCheckUtils]: 32: Hoare triple {38846#false} ~cond := #in~cond; {38846#false} is VALID [2022-04-28 10:09:26,157 INFO L290 TraceCheckUtils]: 33: Hoare triple {38846#false} assume 0 == ~cond; {38846#false} is VALID [2022-04-28 10:09:26,157 INFO L290 TraceCheckUtils]: 34: Hoare triple {38846#false} assume !false; {38846#false} is VALID [2022-04-28 10:09:26,157 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-04-28 10:09:26,157 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:09:26,523 INFO L290 TraceCheckUtils]: 34: Hoare triple {38846#false} assume !false; {38846#false} is VALID [2022-04-28 10:09:26,523 INFO L290 TraceCheckUtils]: 33: Hoare triple {38846#false} assume 0 == ~cond; {38846#false} is VALID [2022-04-28 10:09:26,523 INFO L290 TraceCheckUtils]: 32: Hoare triple {38846#false} ~cond := #in~cond; {38846#false} is VALID [2022-04-28 10:09:26,523 INFO L272 TraceCheckUtils]: 31: Hoare triple {38846#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {38846#false} is VALID [2022-04-28 10:09:26,523 INFO L290 TraceCheckUtils]: 30: Hoare triple {38846#false} assume !(~y~0 % 4294967296 > 0); {38846#false} is VALID [2022-04-28 10:09:26,523 INFO L290 TraceCheckUtils]: 29: Hoare triple {38846#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {38846#false} is VALID [2022-04-28 10:09:26,523 INFO L290 TraceCheckUtils]: 28: Hoare triple {38846#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {38846#false} is VALID [2022-04-28 10:09:26,523 INFO L290 TraceCheckUtils]: 27: Hoare triple {38846#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {38846#false} is VALID [2022-04-28 10:09:26,523 INFO L290 TraceCheckUtils]: 26: Hoare triple {38846#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {38846#false} is VALID [2022-04-28 10:09:26,523 INFO L290 TraceCheckUtils]: 25: Hoare triple {38846#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {38846#false} is VALID [2022-04-28 10:09:26,523 INFO L290 TraceCheckUtils]: 24: Hoare triple {38846#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {38846#false} is VALID [2022-04-28 10:09:26,523 INFO L290 TraceCheckUtils]: 23: Hoare triple {38846#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {38846#false} is VALID [2022-04-28 10:09:26,524 INFO L290 TraceCheckUtils]: 22: Hoare triple {38846#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {38846#false} is VALID [2022-04-28 10:09:26,524 INFO L290 TraceCheckUtils]: 21: Hoare triple {38846#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {38846#false} is VALID [2022-04-28 10:09:26,524 INFO L290 TraceCheckUtils]: 20: Hoare triple {39013#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {38846#false} is VALID [2022-04-28 10:09:26,525 INFO L290 TraceCheckUtils]: 19: Hoare triple {39017#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {39013#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:09:26,525 INFO L290 TraceCheckUtils]: 18: Hoare triple {39021#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {39017#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:09:26,526 INFO L290 TraceCheckUtils]: 17: Hoare triple {39025#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {39021#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-28 10:09:26,526 INFO L290 TraceCheckUtils]: 16: Hoare triple {39029#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} ~z~0 := ~y~0; {39025#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-28 10:09:26,527 INFO L290 TraceCheckUtils]: 15: Hoare triple {39029#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !(~x~0 % 4294967296 > 0); {39029#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 10:09:26,527 INFO L290 TraceCheckUtils]: 14: Hoare triple {39036#(< 0 (mod (+ main_~y~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; {39029#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 10:09:26,528 INFO L290 TraceCheckUtils]: 13: Hoare triple {39040#(< 0 (mod (+ main_~y~0 4294967295) 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; {39036#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:09:26,529 INFO L290 TraceCheckUtils]: 12: Hoare triple {39044#(< 0 (mod main_~y~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; {39040#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:09:26,529 INFO L290 TraceCheckUtils]: 11: Hoare triple {39048#(< 0 (mod (+ main_~y~0 1) 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; {39044#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:09:26,530 INFO L290 TraceCheckUtils]: 10: Hoare triple {39052#(< 0 (mod (+ main_~y~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; {39048#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:09:26,531 INFO L290 TraceCheckUtils]: 9: Hoare triple {39056#(< 0 (mod (+ main_~y~0 3) 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; {39052#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:09:26,531 INFO L290 TraceCheckUtils]: 8: Hoare triple {39060#(< 0 (mod (+ main_~y~0 4) 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; {39056#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:09:26,532 INFO L290 TraceCheckUtils]: 7: Hoare triple {39064#(< 0 (mod (+ 5 main_~y~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; {39060#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:09:26,533 INFO L290 TraceCheckUtils]: 6: Hoare triple {39068#(< 0 (mod (+ main_~y~0 6) 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; {39064#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:09:26,533 INFO L290 TraceCheckUtils]: 5: Hoare triple {38845#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {39068#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:09:26,533 INFO L272 TraceCheckUtils]: 4: Hoare triple {38845#true} call #t~ret11 := main(); {38845#true} is VALID [2022-04-28 10:09:26,533 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38845#true} {38845#true} #61#return; {38845#true} is VALID [2022-04-28 10:09:26,533 INFO L290 TraceCheckUtils]: 2: Hoare triple {38845#true} assume true; {38845#true} is VALID [2022-04-28 10:09:26,533 INFO L290 TraceCheckUtils]: 1: Hoare triple {38845#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(10, 2);call #Ultimate.allocInit(12, 3); {38845#true} is VALID [2022-04-28 10:09:26,533 INFO L272 TraceCheckUtils]: 0: Hoare triple {38845#true} call ULTIMATE.init(); {38845#true} is VALID [2022-04-28 10:09:26,533 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-04-28 10:09:26,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1260643811] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:09:26,534 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:09:26,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 32 [2022-04-28 10:09:26,534 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:09:26,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [808429888] [2022-04-28 10:09:26,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [808429888] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:09:26,534 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:09:26,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-28 10:09:26,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758535540] [2022-04-28 10:09:26,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:09:26,534 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 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 35 [2022-04-28 10:09:26,534 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:09:26,534 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 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-28 10:09:26,551 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:26,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-28 10:09:26,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:26,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-28 10:09:26,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=811, Unknown=0, NotChecked=0, Total=992 [2022-04-28 10:09:26,552 INFO L87 Difference]: Start difference. First operand 103 states and 131 transitions. Second operand has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 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-28 10:09:27,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:27,610 INFO L93 Difference]: Finished difference Result 130 states and 158 transitions. [2022-04-28 10:09:27,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-28 10:09:27,610 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 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 35 [2022-04-28 10:09:27,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:09:27,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 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-28 10:09:27,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 60 transitions. [2022-04-28 10:09:27,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 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-28 10:09:27,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 60 transitions. [2022-04-28 10:09:27,611 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 60 transitions. [2022-04-28 10:09:27,655 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:27,656 INFO L225 Difference]: With dead ends: 130 [2022-04-28 10:09:27,656 INFO L226 Difference]: Without dead ends: 115 [2022-04-28 10:09:27,657 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=467, Invalid=1885, Unknown=0, NotChecked=0, Total=2352 [2022-04-28 10:09:27,657 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 23 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 10:09:27,657 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 80 Invalid, 521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 482 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 10:09:27,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-04-28 10:09:27,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 104. [2022-04-28 10:09:27,766 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:09:27,766 INFO L82 GeneralOperation]: Start isEquivalent. First operand 115 states. Second operand has 104 states, 99 states have (on average 1.292929292929293) internal successors, (128), 99 states have internal predecessors, (128), 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-28 10:09:27,767 INFO L74 IsIncluded]: Start isIncluded. First operand 115 states. Second operand has 104 states, 99 states have (on average 1.292929292929293) internal successors, (128), 99 states have internal predecessors, (128), 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-28 10:09:27,767 INFO L87 Difference]: Start difference. First operand 115 states. Second operand has 104 states, 99 states have (on average 1.292929292929293) internal successors, (128), 99 states have internal predecessors, (128), 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-28 10:09:27,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:27,768 INFO L93 Difference]: Finished difference Result 115 states and 143 transitions. [2022-04-28 10:09:27,768 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 143 transitions. [2022-04-28 10:09:27,768 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:27,768 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:27,768 INFO L74 IsIncluded]: Start isIncluded. First operand has 104 states, 99 states have (on average 1.292929292929293) internal successors, (128), 99 states have internal predecessors, (128), 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 115 states. [2022-04-28 10:09:27,768 INFO L87 Difference]: Start difference. First operand has 104 states, 99 states have (on average 1.292929292929293) internal successors, (128), 99 states have internal predecessors, (128), 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 115 states. [2022-04-28 10:09:27,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:27,769 INFO L93 Difference]: Finished difference Result 115 states and 143 transitions. [2022-04-28 10:09:27,769 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 143 transitions. [2022-04-28 10:09:27,769 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:27,769 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:27,769 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:09:27,769 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:09:27,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 99 states have (on average 1.292929292929293) internal successors, (128), 99 states have internal predecessors, (128), 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-28 10:09:27,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 132 transitions. [2022-04-28 10:09:27,770 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 132 transitions. Word has length 35 [2022-04-28 10:09:27,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:09:27,770 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 132 transitions. [2022-04-28 10:09:27,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 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-28 10:09:27,770 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 104 states and 132 transitions. [2022-04-28 10:09:29,524 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 132 edges. 132 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:29,525 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 132 transitions. [2022-04-28 10:09:29,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-28 10:09:29,525 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:09:29,525 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:09:29,541 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Forceful destruction successful, exit code 0 [2022-04-28 10:09:29,725 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 58 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable57 [2022-04-28 10:09:29,725 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:09:29,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:09:29,725 INFO L85 PathProgramCache]: Analyzing trace with hash 446196207, now seen corresponding path program 75 times [2022-04-28 10:09:29,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:29,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1378146279] [2022-04-28 10:09:29,728 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:09:29,728 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:09:29,728 INFO L85 PathProgramCache]: Analyzing trace with hash 446196207, now seen corresponding path program 76 times [2022-04-28 10:09:29,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:09:29,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509279341] [2022-04-28 10:09:29,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:09:29,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:09:29,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:29,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:09:29,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:29,922 INFO L290 TraceCheckUtils]: 0: Hoare triple {39839#(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(10, 2);call #Ultimate.allocInit(12, 3); {39821#true} is VALID [2022-04-28 10:09:29,922 INFO L290 TraceCheckUtils]: 1: Hoare triple {39821#true} assume true; {39821#true} is VALID [2022-04-28 10:09:29,922 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {39821#true} {39821#true} #61#return; {39821#true} is VALID [2022-04-28 10:09:29,922 INFO L272 TraceCheckUtils]: 0: Hoare triple {39821#true} call ULTIMATE.init(); {39839#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:09:29,922 INFO L290 TraceCheckUtils]: 1: Hoare triple {39839#(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(10, 2);call #Ultimate.allocInit(12, 3); {39821#true} is VALID [2022-04-28 10:09:29,922 INFO L290 TraceCheckUtils]: 2: Hoare triple {39821#true} assume true; {39821#true} is VALID [2022-04-28 10:09:29,923 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39821#true} {39821#true} #61#return; {39821#true} is VALID [2022-04-28 10:09:29,923 INFO L272 TraceCheckUtils]: 4: Hoare triple {39821#true} call #t~ret11 := main(); {39821#true} is VALID [2022-04-28 10:09:29,923 INFO L290 TraceCheckUtils]: 5: Hoare triple {39821#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {39826#(= main_~y~0 0)} is VALID [2022-04-28 10:09:29,923 INFO L290 TraceCheckUtils]: 6: Hoare triple {39826#(= 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; {39827#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:29,924 INFO L290 TraceCheckUtils]: 7: Hoare triple {39827#(and (<= 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; {39828#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:29,924 INFO L290 TraceCheckUtils]: 8: Hoare triple {39828#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {39829#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:29,925 INFO L290 TraceCheckUtils]: 9: Hoare triple {39829#(and (<= main_~y~0 3) (<= 3 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; {39830#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:09:29,925 INFO L290 TraceCheckUtils]: 10: Hoare triple {39830#(and (<= main_~y~0 4) (<= 4 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; {39831#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:09:29,926 INFO L290 TraceCheckUtils]: 11: Hoare triple {39831#(and (<= 5 main_~y~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; {39832#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:09:29,926 INFO L290 TraceCheckUtils]: 12: Hoare triple {39832#(and (<= main_~y~0 6) (<= 6 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; {39833#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:09:29,927 INFO L290 TraceCheckUtils]: 13: Hoare triple {39833#(and (<= 7 main_~y~0) (<= main_~y~0 7))} 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; {39834#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:09:29,928 INFO L290 TraceCheckUtils]: 14: Hoare triple {39834#(and (<= main_~y~0 8) (<= 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; {39835#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:09:29,928 INFO L290 TraceCheckUtils]: 15: Hoare triple {39835#(and (<= 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; {39836#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:09:29,928 INFO L290 TraceCheckUtils]: 16: Hoare triple {39836#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {39836#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:09:29,929 INFO L290 TraceCheckUtils]: 17: Hoare triple {39836#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {39837#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:09:29,929 INFO L290 TraceCheckUtils]: 18: Hoare triple {39837#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {39838#(and (<= 9 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:09:29,930 INFO L290 TraceCheckUtils]: 19: Hoare triple {39838#(and (<= 9 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {39822#false} is VALID [2022-04-28 10:09:29,930 INFO L290 TraceCheckUtils]: 20: Hoare triple {39822#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {39822#false} is VALID [2022-04-28 10:09:29,930 INFO L290 TraceCheckUtils]: 21: Hoare triple {39822#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {39822#false} is VALID [2022-04-28 10:09:29,930 INFO L290 TraceCheckUtils]: 22: Hoare triple {39822#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {39822#false} is VALID [2022-04-28 10:09:29,930 INFO L290 TraceCheckUtils]: 23: Hoare triple {39822#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {39822#false} is VALID [2022-04-28 10:09:29,930 INFO L290 TraceCheckUtils]: 24: Hoare triple {39822#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {39822#false} is VALID [2022-04-28 10:09:29,930 INFO L290 TraceCheckUtils]: 25: Hoare triple {39822#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {39822#false} is VALID [2022-04-28 10:09:29,930 INFO L290 TraceCheckUtils]: 26: Hoare triple {39822#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {39822#false} is VALID [2022-04-28 10:09:29,930 INFO L290 TraceCheckUtils]: 27: Hoare triple {39822#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {39822#false} is VALID [2022-04-28 10:09:29,930 INFO L290 TraceCheckUtils]: 28: Hoare triple {39822#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {39822#false} is VALID [2022-04-28 10:09:29,930 INFO L290 TraceCheckUtils]: 29: Hoare triple {39822#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {39822#false} is VALID [2022-04-28 10:09:29,930 INFO L290 TraceCheckUtils]: 30: Hoare triple {39822#false} assume !(~y~0 % 4294967296 > 0); {39822#false} is VALID [2022-04-28 10:09:29,930 INFO L272 TraceCheckUtils]: 31: Hoare triple {39822#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {39822#false} is VALID [2022-04-28 10:09:29,930 INFO L290 TraceCheckUtils]: 32: Hoare triple {39822#false} ~cond := #in~cond; {39822#false} is VALID [2022-04-28 10:09:29,931 INFO L290 TraceCheckUtils]: 33: Hoare triple {39822#false} assume 0 == ~cond; {39822#false} is VALID [2022-04-28 10:09:29,931 INFO L290 TraceCheckUtils]: 34: Hoare triple {39822#false} assume !false; {39822#false} is VALID [2022-04-28 10:09:29,931 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-04-28 10:09:29,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:09:29,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509279341] [2022-04-28 10:09:29,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509279341] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:09:29,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1821017112] [2022-04-28 10:09:29,931 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:09:29,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:29,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:09:29,932 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:09:29,956 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Waiting until timeout for monitored process [2022-04-28 10:09:29,987 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:09:29,987 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:09:29,988 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-28 10:09:29,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:29,996 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:09:30,235 INFO L272 TraceCheckUtils]: 0: Hoare triple {39821#true} call ULTIMATE.init(); {39821#true} is VALID [2022-04-28 10:09:30,235 INFO L290 TraceCheckUtils]: 1: Hoare triple {39821#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(10, 2);call #Ultimate.allocInit(12, 3); {39821#true} is VALID [2022-04-28 10:09:30,235 INFO L290 TraceCheckUtils]: 2: Hoare triple {39821#true} assume true; {39821#true} is VALID [2022-04-28 10:09:30,235 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39821#true} {39821#true} #61#return; {39821#true} is VALID [2022-04-28 10:09:30,235 INFO L272 TraceCheckUtils]: 4: Hoare triple {39821#true} call #t~ret11 := main(); {39821#true} is VALID [2022-04-28 10:09:30,236 INFO L290 TraceCheckUtils]: 5: Hoare triple {39821#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {39826#(= main_~y~0 0)} is VALID [2022-04-28 10:09:30,236 INFO L290 TraceCheckUtils]: 6: Hoare triple {39826#(= 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; {39827#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:30,236 INFO L290 TraceCheckUtils]: 7: Hoare triple {39827#(and (<= 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; {39828#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:30,237 INFO L290 TraceCheckUtils]: 8: Hoare triple {39828#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {39829#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:30,237 INFO L290 TraceCheckUtils]: 9: Hoare triple {39829#(and (<= main_~y~0 3) (<= 3 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; {39830#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:09:30,238 INFO L290 TraceCheckUtils]: 10: Hoare triple {39830#(and (<= main_~y~0 4) (<= 4 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; {39831#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:09:30,238 INFO L290 TraceCheckUtils]: 11: Hoare triple {39831#(and (<= 5 main_~y~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; {39832#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:09:30,239 INFO L290 TraceCheckUtils]: 12: Hoare triple {39832#(and (<= main_~y~0 6) (<= 6 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; {39833#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:09:30,239 INFO L290 TraceCheckUtils]: 13: Hoare triple {39833#(and (<= 7 main_~y~0) (<= main_~y~0 7))} 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; {39834#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:09:30,240 INFO L290 TraceCheckUtils]: 14: Hoare triple {39834#(and (<= main_~y~0 8) (<= 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; {39835#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:09:30,240 INFO L290 TraceCheckUtils]: 15: Hoare triple {39835#(and (<= 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; {39836#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:09:30,241 INFO L290 TraceCheckUtils]: 16: Hoare triple {39836#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {39836#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:09:30,241 INFO L290 TraceCheckUtils]: 17: Hoare triple {39836#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {39837#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:09:30,241 INFO L290 TraceCheckUtils]: 18: Hoare triple {39837#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {39897#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:09:30,242 INFO L290 TraceCheckUtils]: 19: Hoare triple {39897#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !(~z~0 % 4294967296 > 0); {39822#false} is VALID [2022-04-28 10:09:30,242 INFO L290 TraceCheckUtils]: 20: Hoare triple {39822#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {39822#false} is VALID [2022-04-28 10:09:30,242 INFO L290 TraceCheckUtils]: 21: Hoare triple {39822#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {39822#false} is VALID [2022-04-28 10:09:30,242 INFO L290 TraceCheckUtils]: 22: Hoare triple {39822#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {39822#false} is VALID [2022-04-28 10:09:30,242 INFO L290 TraceCheckUtils]: 23: Hoare triple {39822#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {39822#false} is VALID [2022-04-28 10:09:30,242 INFO L290 TraceCheckUtils]: 24: Hoare triple {39822#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {39822#false} is VALID [2022-04-28 10:09:30,242 INFO L290 TraceCheckUtils]: 25: Hoare triple {39822#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {39822#false} is VALID [2022-04-28 10:09:30,242 INFO L290 TraceCheckUtils]: 26: Hoare triple {39822#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {39822#false} is VALID [2022-04-28 10:09:30,242 INFO L290 TraceCheckUtils]: 27: Hoare triple {39822#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {39822#false} is VALID [2022-04-28 10:09:30,242 INFO L290 TraceCheckUtils]: 28: Hoare triple {39822#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {39822#false} is VALID [2022-04-28 10:09:30,242 INFO L290 TraceCheckUtils]: 29: Hoare triple {39822#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {39822#false} is VALID [2022-04-28 10:09:30,242 INFO L290 TraceCheckUtils]: 30: Hoare triple {39822#false} assume !(~y~0 % 4294967296 > 0); {39822#false} is VALID [2022-04-28 10:09:30,242 INFO L272 TraceCheckUtils]: 31: Hoare triple {39822#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {39822#false} is VALID [2022-04-28 10:09:30,243 INFO L290 TraceCheckUtils]: 32: Hoare triple {39822#false} ~cond := #in~cond; {39822#false} is VALID [2022-04-28 10:09:30,243 INFO L290 TraceCheckUtils]: 33: Hoare triple {39822#false} assume 0 == ~cond; {39822#false} is VALID [2022-04-28 10:09:30,243 INFO L290 TraceCheckUtils]: 34: Hoare triple {39822#false} assume !false; {39822#false} is VALID [2022-04-28 10:09:30,243 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-04-28 10:09:30,243 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:09:30,600 INFO L290 TraceCheckUtils]: 34: Hoare triple {39822#false} assume !false; {39822#false} is VALID [2022-04-28 10:09:30,601 INFO L290 TraceCheckUtils]: 33: Hoare triple {39822#false} assume 0 == ~cond; {39822#false} is VALID [2022-04-28 10:09:30,601 INFO L290 TraceCheckUtils]: 32: Hoare triple {39822#false} ~cond := #in~cond; {39822#false} is VALID [2022-04-28 10:09:30,601 INFO L272 TraceCheckUtils]: 31: Hoare triple {39822#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {39822#false} is VALID [2022-04-28 10:09:30,601 INFO L290 TraceCheckUtils]: 30: Hoare triple {39822#false} assume !(~y~0 % 4294967296 > 0); {39822#false} is VALID [2022-04-28 10:09:30,601 INFO L290 TraceCheckUtils]: 29: Hoare triple {39822#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {39822#false} is VALID [2022-04-28 10:09:30,601 INFO L290 TraceCheckUtils]: 28: Hoare triple {39822#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {39822#false} is VALID [2022-04-28 10:09:30,601 INFO L290 TraceCheckUtils]: 27: Hoare triple {39822#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {39822#false} is VALID [2022-04-28 10:09:30,601 INFO L290 TraceCheckUtils]: 26: Hoare triple {39822#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {39822#false} is VALID [2022-04-28 10:09:30,601 INFO L290 TraceCheckUtils]: 25: Hoare triple {39822#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {39822#false} is VALID [2022-04-28 10:09:30,601 INFO L290 TraceCheckUtils]: 24: Hoare triple {39822#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {39822#false} is VALID [2022-04-28 10:09:30,601 INFO L290 TraceCheckUtils]: 23: Hoare triple {39822#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {39822#false} is VALID [2022-04-28 10:09:30,601 INFO L290 TraceCheckUtils]: 22: Hoare triple {39822#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {39822#false} is VALID [2022-04-28 10:09:30,601 INFO L290 TraceCheckUtils]: 21: Hoare triple {39822#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {39822#false} is VALID [2022-04-28 10:09:30,601 INFO L290 TraceCheckUtils]: 20: Hoare triple {39822#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {39822#false} is VALID [2022-04-28 10:09:30,602 INFO L290 TraceCheckUtils]: 19: Hoare triple {39991#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {39822#false} is VALID [2022-04-28 10:09:30,602 INFO L290 TraceCheckUtils]: 18: Hoare triple {39995#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {39991#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:09:30,603 INFO L290 TraceCheckUtils]: 17: Hoare triple {39999#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} ~z~0 := ~y~0; {39995#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:09:30,603 INFO L290 TraceCheckUtils]: 16: Hoare triple {39999#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {39999#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:09:30,604 INFO L290 TraceCheckUtils]: 15: Hoare triple {40006#(< 0 (mod main_~y~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; {39999#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:09:30,605 INFO L290 TraceCheckUtils]: 14: Hoare triple {40010#(< 0 (mod (+ main_~y~0 1) 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; {40006#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:09:30,605 INFO L290 TraceCheckUtils]: 13: Hoare triple {40014#(< 0 (mod (+ main_~y~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; {40010#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:09:30,606 INFO L290 TraceCheckUtils]: 12: Hoare triple {40018#(< 0 (mod (+ main_~y~0 3) 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; {40014#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:09:30,607 INFO L290 TraceCheckUtils]: 11: Hoare triple {40022#(< 0 (mod (+ main_~y~0 4) 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; {40018#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:09:30,607 INFO L290 TraceCheckUtils]: 10: Hoare triple {40026#(< 0 (mod (+ 5 main_~y~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; {40022#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:09:30,608 INFO L290 TraceCheckUtils]: 9: Hoare triple {40030#(< 0 (mod (+ main_~y~0 6) 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; {40026#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:09:30,609 INFO L290 TraceCheckUtils]: 8: Hoare triple {40034#(< 0 (mod (+ 7 main_~y~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; {40030#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:09:30,609 INFO L290 TraceCheckUtils]: 7: Hoare triple {40038#(< 0 (mod (+ main_~y~0 8) 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; {40034#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:09:30,610 INFO L290 TraceCheckUtils]: 6: Hoare triple {40042#(< 0 (mod (+ main_~y~0 9) 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; {40038#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:09:30,610 INFO L290 TraceCheckUtils]: 5: Hoare triple {39821#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {40042#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:09:30,611 INFO L272 TraceCheckUtils]: 4: Hoare triple {39821#true} call #t~ret11 := main(); {39821#true} is VALID [2022-04-28 10:09:30,611 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39821#true} {39821#true} #61#return; {39821#true} is VALID [2022-04-28 10:09:30,611 INFO L290 TraceCheckUtils]: 2: Hoare triple {39821#true} assume true; {39821#true} is VALID [2022-04-28 10:09:30,611 INFO L290 TraceCheckUtils]: 1: Hoare triple {39821#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(10, 2);call #Ultimate.allocInit(12, 3); {39821#true} is VALID [2022-04-28 10:09:30,611 INFO L272 TraceCheckUtils]: 0: Hoare triple {39821#true} call ULTIMATE.init(); {39821#true} is VALID [2022-04-28 10:09:30,611 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-04-28 10:09:30,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1821017112] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:09:30,611 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:09:30,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 30 [2022-04-28 10:09:30,611 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:09:30,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1378146279] [2022-04-28 10:09:30,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1378146279] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:09:30,611 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:09:30,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-28 10:09:30,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880199971] [2022-04-28 10:09:30,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:09:30,612 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 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 35 [2022-04-28 10:09:30,612 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:09:30,612 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 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-28 10:09:30,628 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:30,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-28 10:09:30,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:30,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-28 10:09:30,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=686, Unknown=0, NotChecked=0, Total=870 [2022-04-28 10:09:30,629 INFO L87 Difference]: Start difference. First operand 104 states and 132 transitions. Second operand has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 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-28 10:09:31,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:31,630 INFO L93 Difference]: Finished difference Result 133 states and 161 transitions. [2022-04-28 10:09:31,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-28 10:09:31,630 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 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 35 [2022-04-28 10:09:31,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:09:31,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 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-28 10:09:31,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 62 transitions. [2022-04-28 10:09:31,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 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-28 10:09:31,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 62 transitions. [2022-04-28 10:09:31,631 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 62 transitions. [2022-04-28 10:09:31,677 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:31,678 INFO L225 Difference]: With dead ends: 133 [2022-04-28 10:09:31,678 INFO L226 Difference]: Without dead ends: 117 [2022-04-28 10:09:31,678 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=406, Invalid=1486, Unknown=0, NotChecked=0, Total=1892 [2022-04-28 10:09:31,679 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 32 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 10:09:31,679 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 81 Invalid, 520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 488 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 10:09:31,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-04-28 10:09:31,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 105. [2022-04-28 10:09:31,799 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:09:31,799 INFO L82 GeneralOperation]: Start isEquivalent. First operand 117 states. Second operand has 105 states, 100 states have (on average 1.29) internal successors, (129), 100 states have internal predecessors, (129), 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-28 10:09:31,799 INFO L74 IsIncluded]: Start isIncluded. First operand 117 states. Second operand has 105 states, 100 states have (on average 1.29) internal successors, (129), 100 states have internal predecessors, (129), 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-28 10:09:31,799 INFO L87 Difference]: Start difference. First operand 117 states. Second operand has 105 states, 100 states have (on average 1.29) internal successors, (129), 100 states have internal predecessors, (129), 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-28 10:09:31,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:31,800 INFO L93 Difference]: Finished difference Result 117 states and 145 transitions. [2022-04-28 10:09:31,800 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 145 transitions. [2022-04-28 10:09:31,800 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:31,800 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:31,800 INFO L74 IsIncluded]: Start isIncluded. First operand has 105 states, 100 states have (on average 1.29) internal successors, (129), 100 states have internal predecessors, (129), 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 117 states. [2022-04-28 10:09:31,800 INFO L87 Difference]: Start difference. First operand has 105 states, 100 states have (on average 1.29) internal successors, (129), 100 states have internal predecessors, (129), 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 117 states. [2022-04-28 10:09:31,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:31,801 INFO L93 Difference]: Finished difference Result 117 states and 145 transitions. [2022-04-28 10:09:31,801 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 145 transitions. [2022-04-28 10:09:31,801 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:31,801 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:31,801 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:09:31,802 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:09:31,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 100 states have (on average 1.29) internal successors, (129), 100 states have internal predecessors, (129), 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-28 10:09:31,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 133 transitions. [2022-04-28 10:09:31,802 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 133 transitions. Word has length 35 [2022-04-28 10:09:31,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:09:31,803 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 133 transitions. [2022-04-28 10:09:31,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.375) internal successors, (22), 15 states have internal predecessors, (22), 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-28 10:09:31,803 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 105 states and 133 transitions. [2022-04-28 10:09:32,228 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 133 edges. 133 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:32,228 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 133 transitions. [2022-04-28 10:09:32,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-28 10:09:32,228 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:09:32,228 INFO L195 NwaCegarLoop]: trace histogram [21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:09:32,244 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Forceful destruction successful, exit code 0 [2022-04-28 10:09:32,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 59 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable58 [2022-04-28 10:09:32,429 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:09:32,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:09:32,429 INFO L85 PathProgramCache]: Analyzing trace with hash -1549015186, now seen corresponding path program 41 times [2022-04-28 10:09:32,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:32,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1255574829] [2022-04-28 10:09:32,431 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:09:32,431 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:09:32,431 INFO L85 PathProgramCache]: Analyzing trace with hash -1549015186, now seen corresponding path program 42 times [2022-04-28 10:09:32,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:09:32,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192367595] [2022-04-28 10:09:32,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:09:32,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:09:32,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:32,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:09:32,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:32,853 INFO L290 TraceCheckUtils]: 0: Hoare triple {40829#(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(10, 2);call #Ultimate.allocInit(12, 3); {40801#true} is VALID [2022-04-28 10:09:32,853 INFO L290 TraceCheckUtils]: 1: Hoare triple {40801#true} assume true; {40801#true} is VALID [2022-04-28 10:09:32,853 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {40801#true} {40801#true} #61#return; {40801#true} is VALID [2022-04-28 10:09:32,853 INFO L272 TraceCheckUtils]: 0: Hoare triple {40801#true} call ULTIMATE.init(); {40829#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:09:32,853 INFO L290 TraceCheckUtils]: 1: Hoare triple {40829#(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(10, 2);call #Ultimate.allocInit(12, 3); {40801#true} is VALID [2022-04-28 10:09:32,854 INFO L290 TraceCheckUtils]: 2: Hoare triple {40801#true} assume true; {40801#true} is VALID [2022-04-28 10:09:32,854 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40801#true} {40801#true} #61#return; {40801#true} is VALID [2022-04-28 10:09:32,854 INFO L272 TraceCheckUtils]: 4: Hoare triple {40801#true} call #t~ret11 := main(); {40801#true} is VALID [2022-04-28 10:09:32,854 INFO L290 TraceCheckUtils]: 5: Hoare triple {40801#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {40806#(= main_~y~0 0)} is VALID [2022-04-28 10:09:32,854 INFO L290 TraceCheckUtils]: 6: Hoare triple {40806#(= 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; {40807#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:32,855 INFO L290 TraceCheckUtils]: 7: Hoare triple {40807#(and (<= 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; {40808#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:32,855 INFO L290 TraceCheckUtils]: 8: Hoare triple {40808#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {40809#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:32,856 INFO L290 TraceCheckUtils]: 9: Hoare triple {40809#(and (<= main_~y~0 3) (<= 3 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; {40810#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:09:32,856 INFO L290 TraceCheckUtils]: 10: Hoare triple {40810#(and (<= main_~y~0 4) (<= 4 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; {40811#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:09:32,857 INFO L290 TraceCheckUtils]: 11: Hoare triple {40811#(and (<= 5 main_~y~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; {40812#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:09:32,857 INFO L290 TraceCheckUtils]: 12: Hoare triple {40812#(and (<= main_~y~0 6) (<= 6 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; {40813#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:09:32,858 INFO L290 TraceCheckUtils]: 13: Hoare triple {40813#(and (<= 7 main_~y~0) (<= main_~y~0 7))} 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; {40814#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:09:32,858 INFO L290 TraceCheckUtils]: 14: Hoare triple {40814#(and (<= main_~y~0 8) (<= 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; {40815#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:09:32,859 INFO L290 TraceCheckUtils]: 15: Hoare triple {40815#(and (<= 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; {40816#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:09:32,859 INFO L290 TraceCheckUtils]: 16: Hoare triple {40816#(and (<= main_~y~0 10) (<= 10 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; {40817#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:09:32,860 INFO L290 TraceCheckUtils]: 17: Hoare triple {40817#(and (<= main_~y~0 11) (<= 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; {40818#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:09:32,860 INFO L290 TraceCheckUtils]: 18: Hoare triple {40818#(and (<= 12 main_~y~0) (<= main_~y~0 12))} 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; {40819#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:09:32,861 INFO L290 TraceCheckUtils]: 19: Hoare triple {40819#(and (<= main_~y~0 13) (<= 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; {40820#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:09:32,861 INFO L290 TraceCheckUtils]: 20: Hoare triple {40820#(and (<= 14 main_~y~0) (<= main_~y~0 14))} 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; {40821#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:09:32,862 INFO L290 TraceCheckUtils]: 21: Hoare triple {40821#(and (<= main_~y~0 15) (<= 15 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; {40822#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:09:32,862 INFO L290 TraceCheckUtils]: 22: Hoare triple {40822#(and (<= 16 main_~y~0) (<= main_~y~0 16))} 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; {40823#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:09:32,863 INFO L290 TraceCheckUtils]: 23: Hoare triple {40823#(and (<= main_~y~0 17) (<= 17 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; {40824#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 10:09:32,863 INFO L290 TraceCheckUtils]: 24: Hoare triple {40824#(and (<= 18 main_~y~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; {40825#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 10:09:32,864 INFO L290 TraceCheckUtils]: 25: Hoare triple {40825#(and (<= 19 main_~y~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; {40826#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 10:09:32,864 INFO L290 TraceCheckUtils]: 26: Hoare triple {40826#(and (<= 20 main_~y~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; {40827#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 10:09:32,864 INFO L290 TraceCheckUtils]: 27: Hoare triple {40827#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {40827#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 10:09:32,865 INFO L290 TraceCheckUtils]: 28: Hoare triple {40827#(and (<= main_~y~0 21) (<= 21 main_~y~0))} ~z~0 := ~y~0; {40828#(and (<= (div main_~z~0 4294967296) 0) (<= 21 main_~z~0))} is VALID [2022-04-28 10:09:32,865 INFO L290 TraceCheckUtils]: 29: Hoare triple {40828#(and (<= (div main_~z~0 4294967296) 0) (<= 21 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {40802#false} is VALID [2022-04-28 10:09:32,865 INFO L290 TraceCheckUtils]: 30: Hoare triple {40802#false} assume !(~y~0 % 4294967296 > 0); {40802#false} is VALID [2022-04-28 10:09:32,865 INFO L272 TraceCheckUtils]: 31: Hoare triple {40802#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {40802#false} is VALID [2022-04-28 10:09:32,865 INFO L290 TraceCheckUtils]: 32: Hoare triple {40802#false} ~cond := #in~cond; {40802#false} is VALID [2022-04-28 10:09:32,865 INFO L290 TraceCheckUtils]: 33: Hoare triple {40802#false} assume 0 == ~cond; {40802#false} is VALID [2022-04-28 10:09:32,865 INFO L290 TraceCheckUtils]: 34: Hoare triple {40802#false} assume !false; {40802#false} is VALID [2022-04-28 10:09:32,866 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:09:32,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:09:32,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192367595] [2022-04-28 10:09:32,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192367595] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:09:32,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1787539901] [2022-04-28 10:09:32,866 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:09:32,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:32,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:09:32,867 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:09:32,867 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Waiting until timeout for monitored process [2022-04-28 10:09:33,252 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) [2022-04-28 10:09:33,252 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:09:33,254 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 47 conjunts are in the unsatisfiable core [2022-04-28 10:09:33,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:33,262 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:09:33,551 INFO L272 TraceCheckUtils]: 0: Hoare triple {40801#true} call ULTIMATE.init(); {40801#true} is VALID [2022-04-28 10:09:33,551 INFO L290 TraceCheckUtils]: 1: Hoare triple {40801#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(10, 2);call #Ultimate.allocInit(12, 3); {40801#true} is VALID [2022-04-28 10:09:33,551 INFO L290 TraceCheckUtils]: 2: Hoare triple {40801#true} assume true; {40801#true} is VALID [2022-04-28 10:09:33,551 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40801#true} {40801#true} #61#return; {40801#true} is VALID [2022-04-28 10:09:33,551 INFO L272 TraceCheckUtils]: 4: Hoare triple {40801#true} call #t~ret11 := main(); {40801#true} is VALID [2022-04-28 10:09:33,551 INFO L290 TraceCheckUtils]: 5: Hoare triple {40801#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {40806#(= main_~y~0 0)} is VALID [2022-04-28 10:09:33,552 INFO L290 TraceCheckUtils]: 6: Hoare triple {40806#(= 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; {40807#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:33,552 INFO L290 TraceCheckUtils]: 7: Hoare triple {40807#(and (<= 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; {40808#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:33,553 INFO L290 TraceCheckUtils]: 8: Hoare triple {40808#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {40809#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:33,553 INFO L290 TraceCheckUtils]: 9: Hoare triple {40809#(and (<= main_~y~0 3) (<= 3 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; {40810#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:09:33,554 INFO L290 TraceCheckUtils]: 10: Hoare triple {40810#(and (<= main_~y~0 4) (<= 4 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; {40811#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:09:33,554 INFO L290 TraceCheckUtils]: 11: Hoare triple {40811#(and (<= 5 main_~y~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; {40812#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:09:33,555 INFO L290 TraceCheckUtils]: 12: Hoare triple {40812#(and (<= main_~y~0 6) (<= 6 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; {40813#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:09:33,555 INFO L290 TraceCheckUtils]: 13: Hoare triple {40813#(and (<= 7 main_~y~0) (<= main_~y~0 7))} 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; {40814#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:09:33,556 INFO L290 TraceCheckUtils]: 14: Hoare triple {40814#(and (<= main_~y~0 8) (<= 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; {40815#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:09:33,556 INFO L290 TraceCheckUtils]: 15: Hoare triple {40815#(and (<= 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; {40816#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:09:33,557 INFO L290 TraceCheckUtils]: 16: Hoare triple {40816#(and (<= main_~y~0 10) (<= 10 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; {40817#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:09:33,557 INFO L290 TraceCheckUtils]: 17: Hoare triple {40817#(and (<= main_~y~0 11) (<= 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; {40818#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:09:33,558 INFO L290 TraceCheckUtils]: 18: Hoare triple {40818#(and (<= 12 main_~y~0) (<= main_~y~0 12))} 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; {40819#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:09:33,558 INFO L290 TraceCheckUtils]: 19: Hoare triple {40819#(and (<= main_~y~0 13) (<= 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; {40820#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:09:33,559 INFO L290 TraceCheckUtils]: 20: Hoare triple {40820#(and (<= 14 main_~y~0) (<= main_~y~0 14))} 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; {40821#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:09:33,559 INFO L290 TraceCheckUtils]: 21: Hoare triple {40821#(and (<= main_~y~0 15) (<= 15 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; {40822#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:09:33,560 INFO L290 TraceCheckUtils]: 22: Hoare triple {40822#(and (<= 16 main_~y~0) (<= main_~y~0 16))} 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; {40823#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:09:33,560 INFO L290 TraceCheckUtils]: 23: Hoare triple {40823#(and (<= main_~y~0 17) (<= 17 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; {40824#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 10:09:33,561 INFO L290 TraceCheckUtils]: 24: Hoare triple {40824#(and (<= 18 main_~y~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; {40825#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 10:09:33,561 INFO L290 TraceCheckUtils]: 25: Hoare triple {40825#(and (<= 19 main_~y~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; {40826#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 10:09:33,562 INFO L290 TraceCheckUtils]: 26: Hoare triple {40826#(and (<= 20 main_~y~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; {40827#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 10:09:33,562 INFO L290 TraceCheckUtils]: 27: Hoare triple {40827#(and (<= main_~y~0 21) (<= 21 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {40827#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 10:09:33,562 INFO L290 TraceCheckUtils]: 28: Hoare triple {40827#(and (<= main_~y~0 21) (<= 21 main_~y~0))} ~z~0 := ~y~0; {40917#(and (<= main_~z~0 21) (<= 21 main_~z~0))} is VALID [2022-04-28 10:09:33,563 INFO L290 TraceCheckUtils]: 29: Hoare triple {40917#(and (<= main_~z~0 21) (<= 21 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {40802#false} is VALID [2022-04-28 10:09:33,563 INFO L290 TraceCheckUtils]: 30: Hoare triple {40802#false} assume !(~y~0 % 4294967296 > 0); {40802#false} is VALID [2022-04-28 10:09:33,563 INFO L272 TraceCheckUtils]: 31: Hoare triple {40802#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {40802#false} is VALID [2022-04-28 10:09:33,563 INFO L290 TraceCheckUtils]: 32: Hoare triple {40802#false} ~cond := #in~cond; {40802#false} is VALID [2022-04-28 10:09:33,563 INFO L290 TraceCheckUtils]: 33: Hoare triple {40802#false} assume 0 == ~cond; {40802#false} is VALID [2022-04-28 10:09:33,563 INFO L290 TraceCheckUtils]: 34: Hoare triple {40802#false} assume !false; {40802#false} is VALID [2022-04-28 10:09:33,563 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:09:33,563 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:09:34,412 INFO L290 TraceCheckUtils]: 34: Hoare triple {40802#false} assume !false; {40802#false} is VALID [2022-04-28 10:09:34,412 INFO L290 TraceCheckUtils]: 33: Hoare triple {40802#false} assume 0 == ~cond; {40802#false} is VALID [2022-04-28 10:09:34,412 INFO L290 TraceCheckUtils]: 32: Hoare triple {40802#false} ~cond := #in~cond; {40802#false} is VALID [2022-04-28 10:09:34,412 INFO L272 TraceCheckUtils]: 31: Hoare triple {40802#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {40802#false} is VALID [2022-04-28 10:09:34,412 INFO L290 TraceCheckUtils]: 30: Hoare triple {40802#false} assume !(~y~0 % 4294967296 > 0); {40802#false} is VALID [2022-04-28 10:09:34,413 INFO L290 TraceCheckUtils]: 29: Hoare triple {40951#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {40802#false} is VALID [2022-04-28 10:09:34,413 INFO L290 TraceCheckUtils]: 28: Hoare triple {40955#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {40951#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:09:34,413 INFO L290 TraceCheckUtils]: 27: Hoare triple {40955#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {40955#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:09:34,414 INFO L290 TraceCheckUtils]: 26: Hoare triple {40962#(< 0 (mod (+ main_~y~0 1) 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; {40955#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:09:34,414 INFO L290 TraceCheckUtils]: 25: Hoare triple {40966#(< 0 (mod (+ main_~y~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; {40962#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:09:34,415 INFO L290 TraceCheckUtils]: 24: Hoare triple {40970#(< 0 (mod (+ main_~y~0 3) 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; {40966#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:09:34,416 INFO L290 TraceCheckUtils]: 23: Hoare triple {40974#(< 0 (mod (+ main_~y~0 4) 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; {40970#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:09:34,416 INFO L290 TraceCheckUtils]: 22: Hoare triple {40978#(< 0 (mod (+ 5 main_~y~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; {40974#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:09:34,417 INFO L290 TraceCheckUtils]: 21: Hoare triple {40982#(< 0 (mod (+ main_~y~0 6) 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; {40978#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:09:34,418 INFO L290 TraceCheckUtils]: 20: Hoare triple {40986#(< 0 (mod (+ 7 main_~y~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; {40982#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:09:34,418 INFO L290 TraceCheckUtils]: 19: Hoare triple {40990#(< 0 (mod (+ main_~y~0 8) 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; {40986#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:09:34,419 INFO L290 TraceCheckUtils]: 18: Hoare triple {40994#(< 0 (mod (+ main_~y~0 9) 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; {40990#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:09:34,419 INFO L290 TraceCheckUtils]: 17: Hoare triple {40998#(< 0 (mod (+ main_~y~0 10) 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; {40994#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:09:34,420 INFO L290 TraceCheckUtils]: 16: Hoare triple {41002#(< 0 (mod (+ main_~y~0 11) 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; {40998#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-28 10:09:34,421 INFO L290 TraceCheckUtils]: 15: Hoare triple {41006#(< 0 (mod (+ main_~y~0 12) 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; {41002#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-28 10:09:34,421 INFO L290 TraceCheckUtils]: 14: Hoare triple {41010#(< 0 (mod (+ main_~y~0 13) 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; {41006#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-28 10:09:34,422 INFO L290 TraceCheckUtils]: 13: Hoare triple {41014#(< 0 (mod (+ main_~y~0 14) 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; {41010#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-28 10:09:34,423 INFO L290 TraceCheckUtils]: 12: Hoare triple {41018#(< 0 (mod (+ main_~y~0 15) 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; {41014#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-28 10:09:34,423 INFO L290 TraceCheckUtils]: 11: Hoare triple {41022#(< 0 (mod (+ main_~y~0 16) 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; {41018#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID [2022-04-28 10:09:34,424 INFO L290 TraceCheckUtils]: 10: Hoare triple {41026#(< 0 (mod (+ main_~y~0 17) 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; {41022#(< 0 (mod (+ main_~y~0 16) 4294967296))} is VALID [2022-04-28 10:09:34,425 INFO L290 TraceCheckUtils]: 9: Hoare triple {41030#(< 0 (mod (+ main_~y~0 18) 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; {41026#(< 0 (mod (+ main_~y~0 17) 4294967296))} is VALID [2022-04-28 10:09:34,425 INFO L290 TraceCheckUtils]: 8: Hoare triple {41034#(< 0 (mod (+ 19 main_~y~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; {41030#(< 0 (mod (+ main_~y~0 18) 4294967296))} is VALID [2022-04-28 10:09:34,426 INFO L290 TraceCheckUtils]: 7: Hoare triple {41038#(< 0 (mod (+ main_~y~0 20) 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; {41034#(< 0 (mod (+ 19 main_~y~0) 4294967296))} is VALID [2022-04-28 10:09:34,426 INFO L290 TraceCheckUtils]: 6: Hoare triple {41042#(< 0 (mod (+ main_~y~0 21) 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; {41038#(< 0 (mod (+ main_~y~0 20) 4294967296))} is VALID [2022-04-28 10:09:34,427 INFO L290 TraceCheckUtils]: 5: Hoare triple {40801#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {41042#(< 0 (mod (+ main_~y~0 21) 4294967296))} is VALID [2022-04-28 10:09:34,427 INFO L272 TraceCheckUtils]: 4: Hoare triple {40801#true} call #t~ret11 := main(); {40801#true} is VALID [2022-04-28 10:09:34,427 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40801#true} {40801#true} #61#return; {40801#true} is VALID [2022-04-28 10:09:34,427 INFO L290 TraceCheckUtils]: 2: Hoare triple {40801#true} assume true; {40801#true} is VALID [2022-04-28 10:09:34,427 INFO L290 TraceCheckUtils]: 1: Hoare triple {40801#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(10, 2);call #Ultimate.allocInit(12, 3); {40801#true} is VALID [2022-04-28 10:09:34,427 INFO L272 TraceCheckUtils]: 0: Hoare triple {40801#true} call ULTIMATE.init(); {40801#true} is VALID [2022-04-28 10:09:34,427 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:09:34,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1787539901] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:09:34,427 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:09:34,427 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25, 25] total 50 [2022-04-28 10:09:34,427 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:09:34,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1255574829] [2022-04-28 10:09:34,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1255574829] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:09:34,428 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:09:34,428 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-04-28 10:09:34,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141333558] [2022-04-28 10:09:34,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:09:34,428 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 25 states have internal predecessors, (31), 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 35 [2022-04-28 10:09:34,428 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:09:34,428 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 26 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 25 states have internal predecessors, (31), 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-28 10:09:34,447 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:34,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-28 10:09:34,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:34,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-28 10:09:34,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=583, Invalid=1867, Unknown=0, NotChecked=0, Total=2450 [2022-04-28 10:09:34,448 INFO L87 Difference]: Start difference. First operand 105 states and 133 transitions. Second operand has 26 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 25 states have internal predecessors, (31), 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-28 10:09:38,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:38,181 INFO L93 Difference]: Finished difference Result 138 states and 191 transitions. [2022-04-28 10:09:38,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-28 10:09:38,181 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 25 states have internal predecessors, (31), 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 35 [2022-04-28 10:09:38,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:09:38,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 25 states have internal predecessors, (31), 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-28 10:09:38,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 148 transitions. [2022-04-28 10:09:38,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 25 states have internal predecessors, (31), 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-28 10:09:38,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 148 transitions. [2022-04-28 10:09:38,183 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 148 transitions. [2022-04-28 10:09:38,293 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 148 edges. 148 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:38,294 INFO L225 Difference]: With dead ends: 138 [2022-04-28 10:09:38,294 INFO L226 Difference]: Without dead ends: 132 [2022-04-28 10:09:38,294 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 320 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1183, Invalid=4073, Unknown=0, NotChecked=0, Total=5256 [2022-04-28 10:09:38,294 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 124 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 2375 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 2466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 2375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-04-28 10:09:38,294 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 168 Invalid, 2466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 2375 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-04-28 10:09:38,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-04-28 10:09:38,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 110. [2022-04-28 10:09:38,406 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:09:38,406 INFO L82 GeneralOperation]: Start isEquivalent. First operand 132 states. Second operand has 110 states, 105 states have (on average 1.2952380952380953) internal successors, (136), 105 states have internal predecessors, (136), 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-28 10:09:38,406 INFO L74 IsIncluded]: Start isIncluded. First operand 132 states. Second operand has 110 states, 105 states have (on average 1.2952380952380953) internal successors, (136), 105 states have internal predecessors, (136), 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-28 10:09:38,406 INFO L87 Difference]: Start difference. First operand 132 states. Second operand has 110 states, 105 states have (on average 1.2952380952380953) internal successors, (136), 105 states have internal predecessors, (136), 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-28 10:09:38,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:38,407 INFO L93 Difference]: Finished difference Result 132 states and 162 transitions. [2022-04-28 10:09:38,407 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 162 transitions. [2022-04-28 10:09:38,407 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:38,407 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:38,407 INFO L74 IsIncluded]: Start isIncluded. First operand has 110 states, 105 states have (on average 1.2952380952380953) internal successors, (136), 105 states have internal predecessors, (136), 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 132 states. [2022-04-28 10:09:38,407 INFO L87 Difference]: Start difference. First operand has 110 states, 105 states have (on average 1.2952380952380953) internal successors, (136), 105 states have internal predecessors, (136), 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 132 states. [2022-04-28 10:09:38,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:38,408 INFO L93 Difference]: Finished difference Result 132 states and 162 transitions. [2022-04-28 10:09:38,408 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 162 transitions. [2022-04-28 10:09:38,409 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:38,409 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:38,409 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:09:38,409 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:09:38,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 105 states have (on average 1.2952380952380953) internal successors, (136), 105 states have internal predecessors, (136), 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-28 10:09:38,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 140 transitions. [2022-04-28 10:09:38,410 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 140 transitions. Word has length 35 [2022-04-28 10:09:38,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:09:38,410 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 140 transitions. [2022-04-28 10:09:38,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 25 states have internal predecessors, (31), 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-28 10:09:38,410 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 110 states and 140 transitions. [2022-04-28 10:09:41,840 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 140 edges. 140 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:41,841 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 140 transitions. [2022-04-28 10:09:41,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-28 10:09:41,841 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:09:41,841 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:09:41,847 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Forceful destruction successful, exit code 0 [2022-04-28 10:09:42,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 60 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable59 [2022-04-28 10:09:42,041 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:09:42,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:09:42,042 INFO L85 PathProgramCache]: Analyzing trace with hash -927796211, now seen corresponding path program 77 times [2022-04-28 10:09:42,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:42,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1957460747] [2022-04-28 10:09:42,044 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:09:42,044 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:09:42,044 INFO L85 PathProgramCache]: Analyzing trace with hash -927796211, now seen corresponding path program 78 times [2022-04-28 10:09:42,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:09:42,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971389349] [2022-04-28 10:09:42,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:09:42,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:09:42,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:42,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:09:42,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:42,319 INFO L290 TraceCheckUtils]: 0: Hoare triple {41890#(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(10, 2);call #Ultimate.allocInit(12, 3); {41869#true} is VALID [2022-04-28 10:09:42,319 INFO L290 TraceCheckUtils]: 1: Hoare triple {41869#true} assume true; {41869#true} is VALID [2022-04-28 10:09:42,319 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {41869#true} {41869#true} #61#return; {41869#true} is VALID [2022-04-28 10:09:42,320 INFO L272 TraceCheckUtils]: 0: Hoare triple {41869#true} call ULTIMATE.init(); {41890#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:09:42,320 INFO L290 TraceCheckUtils]: 1: Hoare triple {41890#(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(10, 2);call #Ultimate.allocInit(12, 3); {41869#true} is VALID [2022-04-28 10:09:42,320 INFO L290 TraceCheckUtils]: 2: Hoare triple {41869#true} assume true; {41869#true} is VALID [2022-04-28 10:09:42,320 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41869#true} {41869#true} #61#return; {41869#true} is VALID [2022-04-28 10:09:42,320 INFO L272 TraceCheckUtils]: 4: Hoare triple {41869#true} call #t~ret11 := main(); {41869#true} is VALID [2022-04-28 10:09:42,320 INFO L290 TraceCheckUtils]: 5: Hoare triple {41869#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {41874#(= main_~y~0 0)} is VALID [2022-04-28 10:09:42,320 INFO L290 TraceCheckUtils]: 6: Hoare triple {41874#(= 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; {41875#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:42,321 INFO L290 TraceCheckUtils]: 7: Hoare triple {41875#(and (<= 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; {41876#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:42,321 INFO L290 TraceCheckUtils]: 8: Hoare triple {41876#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {41877#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:42,322 INFO L290 TraceCheckUtils]: 9: Hoare triple {41877#(and (<= main_~y~0 3) (<= 3 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; {41878#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:09:42,322 INFO L290 TraceCheckUtils]: 10: Hoare triple {41878#(and (<= main_~y~0 4) (<= 4 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; {41879#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:09:42,323 INFO L290 TraceCheckUtils]: 11: Hoare triple {41879#(and (<= 5 main_~y~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; {41880#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:09:42,323 INFO L290 TraceCheckUtils]: 12: Hoare triple {41880#(and (<= main_~y~0 6) (<= 6 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; {41881#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:09:42,324 INFO L290 TraceCheckUtils]: 13: Hoare triple {41881#(and (<= 7 main_~y~0) (<= main_~y~0 7))} 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; {41882#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:09:42,324 INFO L290 TraceCheckUtils]: 14: Hoare triple {41882#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {41882#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:09:42,324 INFO L290 TraceCheckUtils]: 15: Hoare triple {41882#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {41883#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:09:42,325 INFO L290 TraceCheckUtils]: 16: Hoare triple {41883#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {41884#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:09:42,325 INFO L290 TraceCheckUtils]: 17: Hoare triple {41884#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {41885#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:09:42,326 INFO L290 TraceCheckUtils]: 18: Hoare triple {41885#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {41886#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:09:42,326 INFO L290 TraceCheckUtils]: 19: Hoare triple {41886#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {41887#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:09:42,327 INFO L290 TraceCheckUtils]: 20: Hoare triple {41887#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {41888#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:09:42,327 INFO L290 TraceCheckUtils]: 21: Hoare triple {41888#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {41889#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} is VALID [2022-04-28 10:09:42,328 INFO L290 TraceCheckUtils]: 22: Hoare triple {41889#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {41870#false} is VALID [2022-04-28 10:09:42,328 INFO L290 TraceCheckUtils]: 23: Hoare triple {41870#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {41870#false} is VALID [2022-04-28 10:09:42,328 INFO L290 TraceCheckUtils]: 24: Hoare triple {41870#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {41870#false} is VALID [2022-04-28 10:09:42,328 INFO L290 TraceCheckUtils]: 25: Hoare triple {41870#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {41870#false} is VALID [2022-04-28 10:09:42,328 INFO L290 TraceCheckUtils]: 26: Hoare triple {41870#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {41870#false} is VALID [2022-04-28 10:09:42,328 INFO L290 TraceCheckUtils]: 27: Hoare triple {41870#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {41870#false} is VALID [2022-04-28 10:09:42,328 INFO L290 TraceCheckUtils]: 28: Hoare triple {41870#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {41870#false} is VALID [2022-04-28 10:09:42,328 INFO L290 TraceCheckUtils]: 29: Hoare triple {41870#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {41870#false} is VALID [2022-04-28 10:09:42,328 INFO L290 TraceCheckUtils]: 30: Hoare triple {41870#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {41870#false} is VALID [2022-04-28 10:09:42,328 INFO L290 TraceCheckUtils]: 31: Hoare triple {41870#false} assume !(~y~0 % 4294967296 > 0); {41870#false} is VALID [2022-04-28 10:09:42,328 INFO L272 TraceCheckUtils]: 32: Hoare triple {41870#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {41870#false} is VALID [2022-04-28 10:09:42,328 INFO L290 TraceCheckUtils]: 33: Hoare triple {41870#false} ~cond := #in~cond; {41870#false} is VALID [2022-04-28 10:09:42,328 INFO L290 TraceCheckUtils]: 34: Hoare triple {41870#false} assume 0 == ~cond; {41870#false} is VALID [2022-04-28 10:09:42,329 INFO L290 TraceCheckUtils]: 35: Hoare triple {41870#false} assume !false; {41870#false} is VALID [2022-04-28 10:09:42,329 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-28 10:09:42,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:09:42,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971389349] [2022-04-28 10:09:42,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971389349] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:09:42,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [332329623] [2022-04-28 10:09:42,329 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:09:42,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:42,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:09:42,330 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:09:42,330 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Waiting until timeout for monitored process [2022-04-28 10:09:42,423 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-28 10:09:42,423 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:09:42,424 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 46 conjunts are in the unsatisfiable core [2022-04-28 10:09:42,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:42,432 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:09:42,719 INFO L272 TraceCheckUtils]: 0: Hoare triple {41869#true} call ULTIMATE.init(); {41869#true} is VALID [2022-04-28 10:09:42,719 INFO L290 TraceCheckUtils]: 1: Hoare triple {41869#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(10, 2);call #Ultimate.allocInit(12, 3); {41869#true} is VALID [2022-04-28 10:09:42,719 INFO L290 TraceCheckUtils]: 2: Hoare triple {41869#true} assume true; {41869#true} is VALID [2022-04-28 10:09:42,719 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41869#true} {41869#true} #61#return; {41869#true} is VALID [2022-04-28 10:09:42,719 INFO L272 TraceCheckUtils]: 4: Hoare triple {41869#true} call #t~ret11 := main(); {41869#true} is VALID [2022-04-28 10:09:42,720 INFO L290 TraceCheckUtils]: 5: Hoare triple {41869#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {41874#(= main_~y~0 0)} is VALID [2022-04-28 10:09:42,720 INFO L290 TraceCheckUtils]: 6: Hoare triple {41874#(= 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; {41875#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:42,720 INFO L290 TraceCheckUtils]: 7: Hoare triple {41875#(and (<= 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; {41876#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:42,721 INFO L290 TraceCheckUtils]: 8: Hoare triple {41876#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {41877#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:42,721 INFO L290 TraceCheckUtils]: 9: Hoare triple {41877#(and (<= main_~y~0 3) (<= 3 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; {41878#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:09:42,722 INFO L290 TraceCheckUtils]: 10: Hoare triple {41878#(and (<= main_~y~0 4) (<= 4 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; {41879#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:09:42,722 INFO L290 TraceCheckUtils]: 11: Hoare triple {41879#(and (<= 5 main_~y~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; {41880#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:09:42,723 INFO L290 TraceCheckUtils]: 12: Hoare triple {41880#(and (<= main_~y~0 6) (<= 6 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; {41881#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:09:42,723 INFO L290 TraceCheckUtils]: 13: Hoare triple {41881#(and (<= 7 main_~y~0) (<= main_~y~0 7))} 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; {41882#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:09:42,724 INFO L290 TraceCheckUtils]: 14: Hoare triple {41882#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {41882#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:09:42,724 INFO L290 TraceCheckUtils]: 15: Hoare triple {41882#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {41939#(and (= main_~z~0 main_~y~0) (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:09:42,724 INFO L290 TraceCheckUtils]: 16: Hoare triple {41939#(and (= main_~z~0 main_~y~0) (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {41943#(and (<= main_~y~0 8) (<= 8 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-28 10:09:42,725 INFO L290 TraceCheckUtils]: 17: Hoare triple {41943#(and (<= main_~y~0 8) (<= 8 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {41947#(and (<= main_~y~0 8) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)) (<= 8 main_~y~0))} is VALID [2022-04-28 10:09:42,725 INFO L290 TraceCheckUtils]: 18: Hoare triple {41947#(and (<= main_~y~0 8) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)) (<= 8 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {41951#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:09:42,726 INFO L290 TraceCheckUtils]: 19: Hoare triple {41951#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {41955#(and (<= main_~y~0 8) (<= 8 main_~y~0) (= (+ (- 2) main_~y~0) (+ main_~z~0 2)))} is VALID [2022-04-28 10:09:42,727 INFO L290 TraceCheckUtils]: 20: Hoare triple {41955#(and (<= main_~y~0 8) (<= 8 main_~y~0) (= (+ (- 2) main_~y~0) (+ main_~z~0 2)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {41959#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 3)) (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:09:42,727 INFO L290 TraceCheckUtils]: 21: Hoare triple {41959#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 3)) (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {41963#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 4)) (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:09:42,728 INFO L290 TraceCheckUtils]: 22: Hoare triple {41963#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 4)) (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~z~0 % 4294967296 > 0); {41870#false} is VALID [2022-04-28 10:09:42,728 INFO L290 TraceCheckUtils]: 23: Hoare triple {41870#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {41870#false} is VALID [2022-04-28 10:09:42,728 INFO L290 TraceCheckUtils]: 24: Hoare triple {41870#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {41870#false} is VALID [2022-04-28 10:09:42,728 INFO L290 TraceCheckUtils]: 25: Hoare triple {41870#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {41870#false} is VALID [2022-04-28 10:09:42,728 INFO L290 TraceCheckUtils]: 26: Hoare triple {41870#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {41870#false} is VALID [2022-04-28 10:09:42,728 INFO L290 TraceCheckUtils]: 27: Hoare triple {41870#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {41870#false} is VALID [2022-04-28 10:09:42,728 INFO L290 TraceCheckUtils]: 28: Hoare triple {41870#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {41870#false} is VALID [2022-04-28 10:09:42,728 INFO L290 TraceCheckUtils]: 29: Hoare triple {41870#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {41870#false} is VALID [2022-04-28 10:09:42,728 INFO L290 TraceCheckUtils]: 30: Hoare triple {41870#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {41870#false} is VALID [2022-04-28 10:09:42,728 INFO L290 TraceCheckUtils]: 31: Hoare triple {41870#false} assume !(~y~0 % 4294967296 > 0); {41870#false} is VALID [2022-04-28 10:09:42,728 INFO L272 TraceCheckUtils]: 32: Hoare triple {41870#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {41870#false} is VALID [2022-04-28 10:09:42,728 INFO L290 TraceCheckUtils]: 33: Hoare triple {41870#false} ~cond := #in~cond; {41870#false} is VALID [2022-04-28 10:09:42,728 INFO L290 TraceCheckUtils]: 34: Hoare triple {41870#false} assume 0 == ~cond; {41870#false} is VALID [2022-04-28 10:09:42,728 INFO L290 TraceCheckUtils]: 35: Hoare triple {41870#false} assume !false; {41870#false} is VALID [2022-04-28 10:09:42,729 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-28 10:09:42,729 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:09:43,180 INFO L290 TraceCheckUtils]: 35: Hoare triple {41870#false} assume !false; {41870#false} is VALID [2022-04-28 10:09:43,181 INFO L290 TraceCheckUtils]: 34: Hoare triple {41870#false} assume 0 == ~cond; {41870#false} is VALID [2022-04-28 10:09:43,181 INFO L290 TraceCheckUtils]: 33: Hoare triple {41870#false} ~cond := #in~cond; {41870#false} is VALID [2022-04-28 10:09:43,181 INFO L272 TraceCheckUtils]: 32: Hoare triple {41870#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {41870#false} is VALID [2022-04-28 10:09:43,181 INFO L290 TraceCheckUtils]: 31: Hoare triple {41870#false} assume !(~y~0 % 4294967296 > 0); {41870#false} is VALID [2022-04-28 10:09:43,181 INFO L290 TraceCheckUtils]: 30: Hoare triple {41870#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {41870#false} is VALID [2022-04-28 10:09:43,181 INFO L290 TraceCheckUtils]: 29: Hoare triple {42024#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {41870#false} is VALID [2022-04-28 10:09:43,182 INFO L290 TraceCheckUtils]: 28: Hoare triple {42028#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {42024#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:09:43,183 INFO L290 TraceCheckUtils]: 27: Hoare triple {42032#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {42028#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:09:43,184 INFO L290 TraceCheckUtils]: 26: Hoare triple {42036#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {42032#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-28 10:09:43,184 INFO L290 TraceCheckUtils]: 25: Hoare triple {42040#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {42036#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-28 10:09:43,185 INFO L290 TraceCheckUtils]: 24: Hoare triple {42044#(not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {42040#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:09:43,186 INFO L290 TraceCheckUtils]: 23: Hoare triple {42048#(not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {42044#(not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:09:43,186 INFO L290 TraceCheckUtils]: 22: Hoare triple {42052#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {42048#(not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:09:43,187 INFO L290 TraceCheckUtils]: 21: Hoare triple {42056#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {42052#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} is VALID [2022-04-28 10:09:43,188 INFO L290 TraceCheckUtils]: 20: Hoare triple {42060#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {42056#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} is VALID [2022-04-28 10:09:43,188 INFO L290 TraceCheckUtils]: 19: Hoare triple {42064#(or (< 0 (mod (+ main_~z~0 4294967293) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {42060#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} is VALID [2022-04-28 10:09:43,189 INFO L290 TraceCheckUtils]: 18: Hoare triple {42068#(or (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {42064#(or (< 0 (mod (+ main_~z~0 4294967293) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} is VALID [2022-04-28 10:09:43,190 INFO L290 TraceCheckUtils]: 17: Hoare triple {42072#(or (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {42068#(or (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} is VALID [2022-04-28 10:09:43,191 INFO L290 TraceCheckUtils]: 16: Hoare triple {42076#(or (< 0 (mod (+ 4294967290 main_~z~0) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {42072#(or (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} is VALID [2022-04-28 10:09:43,191 INFO L290 TraceCheckUtils]: 15: Hoare triple {41869#true} ~z~0 := ~y~0; {42076#(or (< 0 (mod (+ 4294967290 main_~z~0) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} is VALID [2022-04-28 10:09:43,191 INFO L290 TraceCheckUtils]: 14: Hoare triple {41869#true} assume !(~x~0 % 4294967296 > 0); {41869#true} is VALID [2022-04-28 10:09:43,191 INFO L290 TraceCheckUtils]: 13: Hoare triple {41869#true} 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; {41869#true} is VALID [2022-04-28 10:09:43,191 INFO L290 TraceCheckUtils]: 12: Hoare triple {41869#true} 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; {41869#true} is VALID [2022-04-28 10:09:43,191 INFO L290 TraceCheckUtils]: 11: Hoare triple {41869#true} 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; {41869#true} is VALID [2022-04-28 10:09:43,191 INFO L290 TraceCheckUtils]: 10: Hoare triple {41869#true} 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; {41869#true} is VALID [2022-04-28 10:09:43,191 INFO L290 TraceCheckUtils]: 9: Hoare triple {41869#true} 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; {41869#true} is VALID [2022-04-28 10:09:43,191 INFO L290 TraceCheckUtils]: 8: Hoare triple {41869#true} 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; {41869#true} is VALID [2022-04-28 10:09:43,191 INFO L290 TraceCheckUtils]: 7: Hoare triple {41869#true} 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; {41869#true} is VALID [2022-04-28 10:09:43,192 INFO L290 TraceCheckUtils]: 6: Hoare triple {41869#true} 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; {41869#true} is VALID [2022-04-28 10:09:43,192 INFO L290 TraceCheckUtils]: 5: Hoare triple {41869#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {41869#true} is VALID [2022-04-28 10:09:43,192 INFO L272 TraceCheckUtils]: 4: Hoare triple {41869#true} call #t~ret11 := main(); {41869#true} is VALID [2022-04-28 10:09:43,192 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41869#true} {41869#true} #61#return; {41869#true} is VALID [2022-04-28 10:09:43,192 INFO L290 TraceCheckUtils]: 2: Hoare triple {41869#true} assume true; {41869#true} is VALID [2022-04-28 10:09:43,192 INFO L290 TraceCheckUtils]: 1: Hoare triple {41869#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(10, 2);call #Ultimate.allocInit(12, 3); {41869#true} is VALID [2022-04-28 10:09:43,192 INFO L272 TraceCheckUtils]: 0: Hoare triple {41869#true} call ULTIMATE.init(); {41869#true} is VALID [2022-04-28 10:09:43,192 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 14 proven. 42 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-04-28 10:09:43,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [332329623] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:09:43,192 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:09:43,192 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 16] total 40 [2022-04-28 10:09:43,192 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:09:43,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1957460747] [2022-04-28 10:09:43,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1957460747] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:09:43,192 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:09:43,192 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-28 10:09:43,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950088851] [2022-04-28 10:09:43,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:09:43,193 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 states have internal predecessors, (25), 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 36 [2022-04-28 10:09:43,193 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:09:43,193 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 states have internal predecessors, (25), 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-28 10:09:43,211 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-28 10:09:43,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-28 10:09:43,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:43,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-28 10:09:43,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=1352, Unknown=0, NotChecked=0, Total=1560 [2022-04-28 10:09:43,212 INFO L87 Difference]: Start difference. First operand 110 states and 140 transitions. Second operand has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 states have internal predecessors, (25), 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-28 10:09:44,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:44,261 INFO L93 Difference]: Finished difference Result 135 states and 165 transitions. [2022-04-28 10:09:44,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-28 10:09:44,261 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 states have internal predecessors, (25), 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 36 [2022-04-28 10:09:44,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:09:44,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 states have internal predecessors, (25), 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-28 10:09:44,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 54 transitions. [2022-04-28 10:09:44,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 states have internal predecessors, (25), 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-28 10:09:44,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 54 transitions. [2022-04-28 10:09:44,262 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 54 transitions. [2022-04-28 10:09:44,301 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:44,302 INFO L225 Difference]: With dead ends: 135 [2022-04-28 10:09:44,302 INFO L226 Difference]: Without dead ends: 121 [2022-04-28 10:09:44,302 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 479 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=358, Invalid=2722, Unknown=0, NotChecked=0, Total=3080 [2022-04-28 10:09:44,302 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 17 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 10:09:44,302 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 73 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 10:09:44,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-04-28 10:09:44,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 111. [2022-04-28 10:09:44,412 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:09:44,412 INFO L82 GeneralOperation]: Start isEquivalent. First operand 121 states. Second operand has 111 states, 106 states have (on average 1.2924528301886793) internal successors, (137), 106 states have internal predecessors, (137), 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-28 10:09:44,412 INFO L74 IsIncluded]: Start isIncluded. First operand 121 states. Second operand has 111 states, 106 states have (on average 1.2924528301886793) internal successors, (137), 106 states have internal predecessors, (137), 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-28 10:09:44,412 INFO L87 Difference]: Start difference. First operand 121 states. Second operand has 111 states, 106 states have (on average 1.2924528301886793) internal successors, (137), 106 states have internal predecessors, (137), 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-28 10:09:44,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:44,413 INFO L93 Difference]: Finished difference Result 121 states and 151 transitions. [2022-04-28 10:09:44,413 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 151 transitions. [2022-04-28 10:09:44,414 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:44,414 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:44,414 INFO L74 IsIncluded]: Start isIncluded. First operand has 111 states, 106 states have (on average 1.2924528301886793) internal successors, (137), 106 states have internal predecessors, (137), 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 121 states. [2022-04-28 10:09:44,414 INFO L87 Difference]: Start difference. First operand has 111 states, 106 states have (on average 1.2924528301886793) internal successors, (137), 106 states have internal predecessors, (137), 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 121 states. [2022-04-28 10:09:44,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:44,415 INFO L93 Difference]: Finished difference Result 121 states and 151 transitions. [2022-04-28 10:09:44,415 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 151 transitions. [2022-04-28 10:09:44,415 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:44,415 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:44,415 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:09:44,415 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:09:44,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 106 states have (on average 1.2924528301886793) internal successors, (137), 106 states have internal predecessors, (137), 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-28 10:09:44,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 141 transitions. [2022-04-28 10:09:44,416 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 141 transitions. Word has length 36 [2022-04-28 10:09:44,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:09:44,416 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 141 transitions. [2022-04-28 10:09:44,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 states have internal predecessors, (25), 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-28 10:09:44,416 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 111 states and 141 transitions. [2022-04-28 10:09:46,380 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 141 edges. 141 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:46,380 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 141 transitions. [2022-04-28 10:09:46,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-28 10:09:46,380 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:09:46,380 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:09:46,396 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Forceful destruction successful, exit code 0 [2022-04-28 10:09:46,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60,61 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:46,585 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:09:46,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:09:46,586 INFO L85 PathProgramCache]: Analyzing trace with hash 704939903, now seen corresponding path program 79 times [2022-04-28 10:09:46,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:46,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2085606123] [2022-04-28 10:09:46,588 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:09:46,588 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:09:46,588 INFO L85 PathProgramCache]: Analyzing trace with hash 704939903, now seen corresponding path program 80 times [2022-04-28 10:09:46,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:09:46,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967420188] [2022-04-28 10:09:46,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:09:46,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:09:46,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:46,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:09:46,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:46,796 INFO L290 TraceCheckUtils]: 0: Hoare triple {42913#(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(10, 2);call #Ultimate.allocInit(12, 3); {42893#true} is VALID [2022-04-28 10:09:46,796 INFO L290 TraceCheckUtils]: 1: Hoare triple {42893#true} assume true; {42893#true} is VALID [2022-04-28 10:09:46,796 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {42893#true} {42893#true} #61#return; {42893#true} is VALID [2022-04-28 10:09:46,797 INFO L272 TraceCheckUtils]: 0: Hoare triple {42893#true} call ULTIMATE.init(); {42913#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:09:46,797 INFO L290 TraceCheckUtils]: 1: Hoare triple {42913#(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(10, 2);call #Ultimate.allocInit(12, 3); {42893#true} is VALID [2022-04-28 10:09:46,797 INFO L290 TraceCheckUtils]: 2: Hoare triple {42893#true} assume true; {42893#true} is VALID [2022-04-28 10:09:46,797 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42893#true} {42893#true} #61#return; {42893#true} is VALID [2022-04-28 10:09:46,797 INFO L272 TraceCheckUtils]: 4: Hoare triple {42893#true} call #t~ret11 := main(); {42893#true} is VALID [2022-04-28 10:09:46,797 INFO L290 TraceCheckUtils]: 5: Hoare triple {42893#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {42898#(= main_~y~0 0)} is VALID [2022-04-28 10:09:46,798 INFO L290 TraceCheckUtils]: 6: Hoare triple {42898#(= 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; {42899#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:46,798 INFO L290 TraceCheckUtils]: 7: Hoare triple {42899#(and (<= 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; {42900#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:46,799 INFO L290 TraceCheckUtils]: 8: Hoare triple {42900#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {42901#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:46,799 INFO L290 TraceCheckUtils]: 9: Hoare triple {42901#(and (<= main_~y~0 3) (<= 3 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; {42902#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:09:46,800 INFO L290 TraceCheckUtils]: 10: Hoare triple {42902#(and (<= main_~y~0 4) (<= 4 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; {42903#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:09:46,801 INFO L290 TraceCheckUtils]: 11: Hoare triple {42903#(and (<= 5 main_~y~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; {42904#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:09:46,801 INFO L290 TraceCheckUtils]: 12: Hoare triple {42904#(and (<= main_~y~0 6) (<= 6 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; {42905#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:09:46,802 INFO L290 TraceCheckUtils]: 13: Hoare triple {42905#(and (<= 7 main_~y~0) (<= main_~y~0 7))} 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; {42906#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:09:46,802 INFO L290 TraceCheckUtils]: 14: Hoare triple {42906#(and (<= main_~y~0 8) (<= 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; {42907#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:09:46,803 INFO L290 TraceCheckUtils]: 15: Hoare triple {42907#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {42907#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:09:46,803 INFO L290 TraceCheckUtils]: 16: Hoare triple {42907#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {42908#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:09:46,803 INFO L290 TraceCheckUtils]: 17: Hoare triple {42908#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {42909#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:09:46,804 INFO L290 TraceCheckUtils]: 18: Hoare triple {42909#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {42910#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:09:46,805 INFO L290 TraceCheckUtils]: 19: Hoare triple {42910#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {42911#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:09:46,805 INFO L290 TraceCheckUtils]: 20: Hoare triple {42911#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {42912#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:09:46,806 INFO L290 TraceCheckUtils]: 21: Hoare triple {42912#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {42894#false} is VALID [2022-04-28 10:09:46,806 INFO L290 TraceCheckUtils]: 22: Hoare triple {42894#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {42894#false} is VALID [2022-04-28 10:09:46,806 INFO L290 TraceCheckUtils]: 23: Hoare triple {42894#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {42894#false} is VALID [2022-04-28 10:09:46,806 INFO L290 TraceCheckUtils]: 24: Hoare triple {42894#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {42894#false} is VALID [2022-04-28 10:09:46,806 INFO L290 TraceCheckUtils]: 25: Hoare triple {42894#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {42894#false} is VALID [2022-04-28 10:09:46,806 INFO L290 TraceCheckUtils]: 26: Hoare triple {42894#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {42894#false} is VALID [2022-04-28 10:09:46,806 INFO L290 TraceCheckUtils]: 27: Hoare triple {42894#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {42894#false} is VALID [2022-04-28 10:09:46,806 INFO L290 TraceCheckUtils]: 28: Hoare triple {42894#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {42894#false} is VALID [2022-04-28 10:09:46,806 INFO L290 TraceCheckUtils]: 29: Hoare triple {42894#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {42894#false} is VALID [2022-04-28 10:09:46,806 INFO L290 TraceCheckUtils]: 30: Hoare triple {42894#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {42894#false} is VALID [2022-04-28 10:09:46,806 INFO L290 TraceCheckUtils]: 31: Hoare triple {42894#false} assume !(~y~0 % 4294967296 > 0); {42894#false} is VALID [2022-04-28 10:09:46,806 INFO L272 TraceCheckUtils]: 32: Hoare triple {42894#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {42894#false} is VALID [2022-04-28 10:09:46,806 INFO L290 TraceCheckUtils]: 33: Hoare triple {42894#false} ~cond := #in~cond; {42894#false} is VALID [2022-04-28 10:09:46,806 INFO L290 TraceCheckUtils]: 34: Hoare triple {42894#false} assume 0 == ~cond; {42894#false} is VALID [2022-04-28 10:09:46,806 INFO L290 TraceCheckUtils]: 35: Hoare triple {42894#false} assume !false; {42894#false} is VALID [2022-04-28 10:09:46,806 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-04-28 10:09:46,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:09:46,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967420188] [2022-04-28 10:09:46,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967420188] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:09:46,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [805204528] [2022-04-28 10:09:46,807 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:09:46,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:46,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:09:46,808 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:09:46,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Waiting until timeout for monitored process [2022-04-28 10:09:46,849 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:09:46,849 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:09:46,850 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-28 10:09:46,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:46,858 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:09:47,134 INFO L272 TraceCheckUtils]: 0: Hoare triple {42893#true} call ULTIMATE.init(); {42893#true} is VALID [2022-04-28 10:09:47,134 INFO L290 TraceCheckUtils]: 1: Hoare triple {42893#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(10, 2);call #Ultimate.allocInit(12, 3); {42893#true} is VALID [2022-04-28 10:09:47,134 INFO L290 TraceCheckUtils]: 2: Hoare triple {42893#true} assume true; {42893#true} is VALID [2022-04-28 10:09:47,134 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42893#true} {42893#true} #61#return; {42893#true} is VALID [2022-04-28 10:09:47,134 INFO L272 TraceCheckUtils]: 4: Hoare triple {42893#true} call #t~ret11 := main(); {42893#true} is VALID [2022-04-28 10:09:47,135 INFO L290 TraceCheckUtils]: 5: Hoare triple {42893#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {42898#(= main_~y~0 0)} is VALID [2022-04-28 10:09:47,135 INFO L290 TraceCheckUtils]: 6: Hoare triple {42898#(= 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; {42899#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:47,136 INFO L290 TraceCheckUtils]: 7: Hoare triple {42899#(and (<= 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; {42900#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:47,136 INFO L290 TraceCheckUtils]: 8: Hoare triple {42900#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {42901#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:47,137 INFO L290 TraceCheckUtils]: 9: Hoare triple {42901#(and (<= main_~y~0 3) (<= 3 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; {42902#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:09:47,137 INFO L290 TraceCheckUtils]: 10: Hoare triple {42902#(and (<= main_~y~0 4) (<= 4 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; {42903#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:09:47,138 INFO L290 TraceCheckUtils]: 11: Hoare triple {42903#(and (<= 5 main_~y~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; {42904#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:09:47,138 INFO L290 TraceCheckUtils]: 12: Hoare triple {42904#(and (<= main_~y~0 6) (<= 6 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; {42905#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:09:47,139 INFO L290 TraceCheckUtils]: 13: Hoare triple {42905#(and (<= 7 main_~y~0) (<= main_~y~0 7))} 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; {42906#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:09:47,139 INFO L290 TraceCheckUtils]: 14: Hoare triple {42906#(and (<= main_~y~0 8) (<= 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; {42907#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:09:47,140 INFO L290 TraceCheckUtils]: 15: Hoare triple {42907#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {42907#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:09:47,140 INFO L290 TraceCheckUtils]: 16: Hoare triple {42907#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {42908#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:09:47,140 INFO L290 TraceCheckUtils]: 17: Hoare triple {42908#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {42909#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:09:47,141 INFO L290 TraceCheckUtils]: 18: Hoare triple {42909#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {42910#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:09:47,142 INFO L290 TraceCheckUtils]: 19: Hoare triple {42910#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {42911#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:09:47,142 INFO L290 TraceCheckUtils]: 20: Hoare triple {42911#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {42977#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:09:47,142 INFO L290 TraceCheckUtils]: 21: Hoare triple {42977#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {42894#false} is VALID [2022-04-28 10:09:47,143 INFO L290 TraceCheckUtils]: 22: Hoare triple {42894#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {42894#false} is VALID [2022-04-28 10:09:47,143 INFO L290 TraceCheckUtils]: 23: Hoare triple {42894#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {42894#false} is VALID [2022-04-28 10:09:47,143 INFO L290 TraceCheckUtils]: 24: Hoare triple {42894#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {42894#false} is VALID [2022-04-28 10:09:47,143 INFO L290 TraceCheckUtils]: 25: Hoare triple {42894#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {42894#false} is VALID [2022-04-28 10:09:47,143 INFO L290 TraceCheckUtils]: 26: Hoare triple {42894#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {42894#false} is VALID [2022-04-28 10:09:47,143 INFO L290 TraceCheckUtils]: 27: Hoare triple {42894#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {42894#false} is VALID [2022-04-28 10:09:47,143 INFO L290 TraceCheckUtils]: 28: Hoare triple {42894#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {42894#false} is VALID [2022-04-28 10:09:47,143 INFO L290 TraceCheckUtils]: 29: Hoare triple {42894#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {42894#false} is VALID [2022-04-28 10:09:47,143 INFO L290 TraceCheckUtils]: 30: Hoare triple {42894#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {42894#false} is VALID [2022-04-28 10:09:47,143 INFO L290 TraceCheckUtils]: 31: Hoare triple {42894#false} assume !(~y~0 % 4294967296 > 0); {42894#false} is VALID [2022-04-28 10:09:47,143 INFO L272 TraceCheckUtils]: 32: Hoare triple {42894#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {42894#false} is VALID [2022-04-28 10:09:47,143 INFO L290 TraceCheckUtils]: 33: Hoare triple {42894#false} ~cond := #in~cond; {42894#false} is VALID [2022-04-28 10:09:47,143 INFO L290 TraceCheckUtils]: 34: Hoare triple {42894#false} assume 0 == ~cond; {42894#false} is VALID [2022-04-28 10:09:47,143 INFO L290 TraceCheckUtils]: 35: Hoare triple {42894#false} assume !false; {42894#false} is VALID [2022-04-28 10:09:47,143 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-04-28 10:09:47,143 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:09:47,534 INFO L290 TraceCheckUtils]: 35: Hoare triple {42894#false} assume !false; {42894#false} is VALID [2022-04-28 10:09:47,534 INFO L290 TraceCheckUtils]: 34: Hoare triple {42894#false} assume 0 == ~cond; {42894#false} is VALID [2022-04-28 10:09:47,534 INFO L290 TraceCheckUtils]: 33: Hoare triple {42894#false} ~cond := #in~cond; {42894#false} is VALID [2022-04-28 10:09:47,534 INFO L272 TraceCheckUtils]: 32: Hoare triple {42894#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {42894#false} is VALID [2022-04-28 10:09:47,534 INFO L290 TraceCheckUtils]: 31: Hoare triple {42894#false} assume !(~y~0 % 4294967296 > 0); {42894#false} is VALID [2022-04-28 10:09:47,534 INFO L290 TraceCheckUtils]: 30: Hoare triple {42894#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {42894#false} is VALID [2022-04-28 10:09:47,534 INFO L290 TraceCheckUtils]: 29: Hoare triple {42894#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {42894#false} is VALID [2022-04-28 10:09:47,535 INFO L290 TraceCheckUtils]: 28: Hoare triple {42894#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {42894#false} is VALID [2022-04-28 10:09:47,535 INFO L290 TraceCheckUtils]: 27: Hoare triple {42894#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {42894#false} is VALID [2022-04-28 10:09:47,535 INFO L290 TraceCheckUtils]: 26: Hoare triple {42894#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {42894#false} is VALID [2022-04-28 10:09:47,535 INFO L290 TraceCheckUtils]: 25: Hoare triple {42894#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {42894#false} is VALID [2022-04-28 10:09:47,535 INFO L290 TraceCheckUtils]: 24: Hoare triple {42894#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {42894#false} is VALID [2022-04-28 10:09:47,535 INFO L290 TraceCheckUtils]: 23: Hoare triple {42894#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {42894#false} is VALID [2022-04-28 10:09:47,535 INFO L290 TraceCheckUtils]: 22: Hoare triple {42894#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {42894#false} is VALID [2022-04-28 10:09:47,535 INFO L290 TraceCheckUtils]: 21: Hoare triple {43065#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {42894#false} is VALID [2022-04-28 10:09:47,536 INFO L290 TraceCheckUtils]: 20: Hoare triple {43069#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {43065#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:09:47,536 INFO L290 TraceCheckUtils]: 19: Hoare triple {43073#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {43069#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:09:47,537 INFO L290 TraceCheckUtils]: 18: Hoare triple {43077#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {43073#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-28 10:09:47,538 INFO L290 TraceCheckUtils]: 17: Hoare triple {43081#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {43077#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-28 10:09:47,538 INFO L290 TraceCheckUtils]: 16: Hoare triple {43085#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} ~z~0 := ~y~0; {43081#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID [2022-04-28 10:09:47,538 INFO L290 TraceCheckUtils]: 15: Hoare triple {43085#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {43085#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-28 10:09:47,539 INFO L290 TraceCheckUtils]: 14: Hoare triple {43092#(< 0 (mod (+ main_~y~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; {43085#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-28 10:09:47,540 INFO L290 TraceCheckUtils]: 13: Hoare triple {43096#(< 0 (mod (+ main_~y~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; {43092#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 10:09:47,540 INFO L290 TraceCheckUtils]: 12: Hoare triple {43100#(< 0 (mod (+ main_~y~0 4294967295) 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; {43096#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:09:47,541 INFO L290 TraceCheckUtils]: 11: Hoare triple {43104#(< 0 (mod main_~y~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; {43100#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:09:47,542 INFO L290 TraceCheckUtils]: 10: Hoare triple {43108#(< 0 (mod (+ main_~y~0 1) 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; {43104#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:09:47,542 INFO L290 TraceCheckUtils]: 9: Hoare triple {43112#(< 0 (mod (+ main_~y~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; {43108#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:09:47,543 INFO L290 TraceCheckUtils]: 8: Hoare triple {43116#(< 0 (mod (+ main_~y~0 3) 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; {43112#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:09:47,543 INFO L290 TraceCheckUtils]: 7: Hoare triple {43120#(< 0 (mod (+ main_~y~0 4) 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; {43116#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:09:47,544 INFO L290 TraceCheckUtils]: 6: Hoare triple {43124#(< 0 (mod (+ 5 main_~y~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; {43120#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:09:47,544 INFO L290 TraceCheckUtils]: 5: Hoare triple {42893#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {43124#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:09:47,544 INFO L272 TraceCheckUtils]: 4: Hoare triple {42893#true} call #t~ret11 := main(); {42893#true} is VALID [2022-04-28 10:09:47,544 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42893#true} {42893#true} #61#return; {42893#true} is VALID [2022-04-28 10:09:47,545 INFO L290 TraceCheckUtils]: 2: Hoare triple {42893#true} assume true; {42893#true} is VALID [2022-04-28 10:09:47,545 INFO L290 TraceCheckUtils]: 1: Hoare triple {42893#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(10, 2);call #Ultimate.allocInit(12, 3); {42893#true} is VALID [2022-04-28 10:09:47,545 INFO L272 TraceCheckUtils]: 0: Hoare triple {42893#true} call ULTIMATE.init(); {42893#true} is VALID [2022-04-28 10:09:47,545 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-04-28 10:09:47,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [805204528] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:09:47,545 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:09:47,545 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 34 [2022-04-28 10:09:47,545 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:09:47,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2085606123] [2022-04-28 10:09:47,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2085606123] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:09:47,545 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:09:47,545 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-28 10:09:47,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504442410] [2022-04-28 10:09:47,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:09:47,545 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 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 36 [2022-04-28 10:09:47,546 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:09:47,546 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 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-28 10:09:47,562 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:47,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-28 10:09:47,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:47,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-28 10:09:47,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=927, Unknown=0, NotChecked=0, Total=1122 [2022-04-28 10:09:47,563 INFO L87 Difference]: Start difference. First operand 111 states and 141 transitions. Second operand has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 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-28 10:09:48,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:48,867 INFO L93 Difference]: Finished difference Result 138 states and 168 transitions. [2022-04-28 10:09:48,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-28 10:09:48,867 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 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 36 [2022-04-28 10:09:48,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:09:48,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 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-28 10:09:48,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 62 transitions. [2022-04-28 10:09:48,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 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-28 10:09:48,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 62 transitions. [2022-04-28 10:09:48,868 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 62 transitions. [2022-04-28 10:09:48,914 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:48,915 INFO L225 Difference]: With dead ends: 138 [2022-04-28 10:09:48,915 INFO L226 Difference]: Without dead ends: 123 [2022-04-28 10:09:48,915 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=533, Invalid=2223, Unknown=0, NotChecked=0, Total=2756 [2022-04-28 10:09:48,916 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 23 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 615 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 657 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 10:09:48,916 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 95 Invalid, 657 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 615 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 10:09:48,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-04-28 10:09:49,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 112. [2022-04-28 10:09:49,028 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:09:49,028 INFO L82 GeneralOperation]: Start isEquivalent. First operand 123 states. Second operand has 112 states, 107 states have (on average 1.2897196261682242) internal successors, (138), 107 states have internal predecessors, (138), 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-28 10:09:49,028 INFO L74 IsIncluded]: Start isIncluded. First operand 123 states. Second operand has 112 states, 107 states have (on average 1.2897196261682242) internal successors, (138), 107 states have internal predecessors, (138), 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-28 10:09:49,028 INFO L87 Difference]: Start difference. First operand 123 states. Second operand has 112 states, 107 states have (on average 1.2897196261682242) internal successors, (138), 107 states have internal predecessors, (138), 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-28 10:09:49,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:49,029 INFO L93 Difference]: Finished difference Result 123 states and 153 transitions. [2022-04-28 10:09:49,029 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 153 transitions. [2022-04-28 10:09:49,029 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:49,029 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:49,029 INFO L74 IsIncluded]: Start isIncluded. First operand has 112 states, 107 states have (on average 1.2897196261682242) internal successors, (138), 107 states have internal predecessors, (138), 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 123 states. [2022-04-28 10:09:49,029 INFO L87 Difference]: Start difference. First operand has 112 states, 107 states have (on average 1.2897196261682242) internal successors, (138), 107 states have internal predecessors, (138), 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 123 states. [2022-04-28 10:09:49,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:49,030 INFO L93 Difference]: Finished difference Result 123 states and 153 transitions. [2022-04-28 10:09:49,030 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 153 transitions. [2022-04-28 10:09:49,030 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:49,030 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:49,030 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:09:49,030 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:09:49,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 107 states have (on average 1.2897196261682242) internal successors, (138), 107 states have internal predecessors, (138), 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-28 10:09:49,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 142 transitions. [2022-04-28 10:09:49,032 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 142 transitions. Word has length 36 [2022-04-28 10:09:49,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:09:49,032 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 142 transitions. [2022-04-28 10:09:49,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 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-28 10:09:49,032 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 112 states and 142 transitions. [2022-04-28 10:09:49,918 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 142 edges. 142 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:49,918 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 142 transitions. [2022-04-28 10:09:49,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-28 10:09:49,918 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:09:49,918 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:09:49,934 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Forceful destruction successful, exit code 0 [2022-04-28 10:09:50,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61,62 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:50,119 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:09:50,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:09:50,119 INFO L85 PathProgramCache]: Analyzing trace with hash 1735304717, now seen corresponding path program 81 times [2022-04-28 10:09:50,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:50,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [947417541] [2022-04-28 10:09:50,121 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:09:50,121 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:09:50,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1735304717, now seen corresponding path program 82 times [2022-04-28 10:09:50,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:09:50,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125448405] [2022-04-28 10:09:50,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:09:50,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:09:50,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:50,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:09:50,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:50,326 INFO L290 TraceCheckUtils]: 0: Hoare triple {43948#(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(10, 2);call #Ultimate.allocInit(12, 3); {43929#true} is VALID [2022-04-28 10:09:50,326 INFO L290 TraceCheckUtils]: 1: Hoare triple {43929#true} assume true; {43929#true} is VALID [2022-04-28 10:09:50,326 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {43929#true} {43929#true} #61#return; {43929#true} is VALID [2022-04-28 10:09:50,326 INFO L272 TraceCheckUtils]: 0: Hoare triple {43929#true} call ULTIMATE.init(); {43948#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:09:50,326 INFO L290 TraceCheckUtils]: 1: Hoare triple {43948#(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(10, 2);call #Ultimate.allocInit(12, 3); {43929#true} is VALID [2022-04-28 10:09:50,326 INFO L290 TraceCheckUtils]: 2: Hoare triple {43929#true} assume true; {43929#true} is VALID [2022-04-28 10:09:50,326 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43929#true} {43929#true} #61#return; {43929#true} is VALID [2022-04-28 10:09:50,326 INFO L272 TraceCheckUtils]: 4: Hoare triple {43929#true} call #t~ret11 := main(); {43929#true} is VALID [2022-04-28 10:09:50,327 INFO L290 TraceCheckUtils]: 5: Hoare triple {43929#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {43934#(= main_~y~0 0)} is VALID [2022-04-28 10:09:50,327 INFO L290 TraceCheckUtils]: 6: Hoare triple {43934#(= 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; {43935#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:50,328 INFO L290 TraceCheckUtils]: 7: Hoare triple {43935#(and (<= 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; {43936#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:50,328 INFO L290 TraceCheckUtils]: 8: Hoare triple {43936#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {43937#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:50,329 INFO L290 TraceCheckUtils]: 9: Hoare triple {43937#(and (<= main_~y~0 3) (<= 3 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; {43938#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:09:50,329 INFO L290 TraceCheckUtils]: 10: Hoare triple {43938#(and (<= main_~y~0 4) (<= 4 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; {43939#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:09:50,330 INFO L290 TraceCheckUtils]: 11: Hoare triple {43939#(and (<= 5 main_~y~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; {43940#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:09:50,330 INFO L290 TraceCheckUtils]: 12: Hoare triple {43940#(and (<= main_~y~0 6) (<= 6 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; {43941#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:09:50,331 INFO L290 TraceCheckUtils]: 13: Hoare triple {43941#(and (<= 7 main_~y~0) (<= main_~y~0 7))} 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; {43942#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:09:50,331 INFO L290 TraceCheckUtils]: 14: Hoare triple {43942#(and (<= main_~y~0 8) (<= 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; {43943#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:09:50,332 INFO L290 TraceCheckUtils]: 15: Hoare triple {43943#(and (<= 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; {43944#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:09:50,332 INFO L290 TraceCheckUtils]: 16: Hoare triple {43944#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {43944#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:09:50,332 INFO L290 TraceCheckUtils]: 17: Hoare triple {43944#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {43945#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:09:50,333 INFO L290 TraceCheckUtils]: 18: Hoare triple {43945#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {43946#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:09:50,333 INFO L290 TraceCheckUtils]: 19: Hoare triple {43946#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {43947#(and (<= 8 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:09:50,334 INFO L290 TraceCheckUtils]: 20: Hoare triple {43947#(and (<= 8 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {43930#false} is VALID [2022-04-28 10:09:50,334 INFO L290 TraceCheckUtils]: 21: Hoare triple {43930#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {43930#false} is VALID [2022-04-28 10:09:50,334 INFO L290 TraceCheckUtils]: 22: Hoare triple {43930#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {43930#false} is VALID [2022-04-28 10:09:50,334 INFO L290 TraceCheckUtils]: 23: Hoare triple {43930#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {43930#false} is VALID [2022-04-28 10:09:50,334 INFO L290 TraceCheckUtils]: 24: Hoare triple {43930#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {43930#false} is VALID [2022-04-28 10:09:50,334 INFO L290 TraceCheckUtils]: 25: Hoare triple {43930#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {43930#false} is VALID [2022-04-28 10:09:50,334 INFO L290 TraceCheckUtils]: 26: Hoare triple {43930#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {43930#false} is VALID [2022-04-28 10:09:50,334 INFO L290 TraceCheckUtils]: 27: Hoare triple {43930#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {43930#false} is VALID [2022-04-28 10:09:50,334 INFO L290 TraceCheckUtils]: 28: Hoare triple {43930#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {43930#false} is VALID [2022-04-28 10:09:50,334 INFO L290 TraceCheckUtils]: 29: Hoare triple {43930#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {43930#false} is VALID [2022-04-28 10:09:50,334 INFO L290 TraceCheckUtils]: 30: Hoare triple {43930#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {43930#false} is VALID [2022-04-28 10:09:50,334 INFO L290 TraceCheckUtils]: 31: Hoare triple {43930#false} assume !(~y~0 % 4294967296 > 0); {43930#false} is VALID [2022-04-28 10:09:50,334 INFO L272 TraceCheckUtils]: 32: Hoare triple {43930#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {43930#false} is VALID [2022-04-28 10:09:50,334 INFO L290 TraceCheckUtils]: 33: Hoare triple {43930#false} ~cond := #in~cond; {43930#false} is VALID [2022-04-28 10:09:50,334 INFO L290 TraceCheckUtils]: 34: Hoare triple {43930#false} assume 0 == ~cond; {43930#false} is VALID [2022-04-28 10:09:50,334 INFO L290 TraceCheckUtils]: 35: Hoare triple {43930#false} assume !false; {43930#false} is VALID [2022-04-28 10:09:50,335 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-04-28 10:09:50,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:09:50,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125448405] [2022-04-28 10:09:50,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125448405] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:09:50,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [734009577] [2022-04-28 10:09:50,335 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:09:50,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:50,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:09:50,336 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:09:50,336 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Waiting until timeout for monitored process [2022-04-28 10:09:50,374 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:09:50,374 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:09:50,375 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-28 10:09:50,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:50,384 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:09:50,623 INFO L272 TraceCheckUtils]: 0: Hoare triple {43929#true} call ULTIMATE.init(); {43929#true} is VALID [2022-04-28 10:09:50,623 INFO L290 TraceCheckUtils]: 1: Hoare triple {43929#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(10, 2);call #Ultimate.allocInit(12, 3); {43929#true} is VALID [2022-04-28 10:09:50,623 INFO L290 TraceCheckUtils]: 2: Hoare triple {43929#true} assume true; {43929#true} is VALID [2022-04-28 10:09:50,623 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43929#true} {43929#true} #61#return; {43929#true} is VALID [2022-04-28 10:09:50,623 INFO L272 TraceCheckUtils]: 4: Hoare triple {43929#true} call #t~ret11 := main(); {43929#true} is VALID [2022-04-28 10:09:50,623 INFO L290 TraceCheckUtils]: 5: Hoare triple {43929#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {43934#(= main_~y~0 0)} is VALID [2022-04-28 10:09:50,624 INFO L290 TraceCheckUtils]: 6: Hoare triple {43934#(= 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; {43935#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:50,624 INFO L290 TraceCheckUtils]: 7: Hoare triple {43935#(and (<= 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; {43936#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:50,625 INFO L290 TraceCheckUtils]: 8: Hoare triple {43936#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {43937#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:50,625 INFO L290 TraceCheckUtils]: 9: Hoare triple {43937#(and (<= main_~y~0 3) (<= 3 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; {43938#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:09:50,626 INFO L290 TraceCheckUtils]: 10: Hoare triple {43938#(and (<= main_~y~0 4) (<= 4 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; {43939#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:09:50,626 INFO L290 TraceCheckUtils]: 11: Hoare triple {43939#(and (<= 5 main_~y~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; {43940#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:09:50,627 INFO L290 TraceCheckUtils]: 12: Hoare triple {43940#(and (<= main_~y~0 6) (<= 6 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; {43941#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:09:50,627 INFO L290 TraceCheckUtils]: 13: Hoare triple {43941#(and (<= 7 main_~y~0) (<= main_~y~0 7))} 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; {43942#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:09:50,628 INFO L290 TraceCheckUtils]: 14: Hoare triple {43942#(and (<= main_~y~0 8) (<= 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; {43943#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:09:50,628 INFO L290 TraceCheckUtils]: 15: Hoare triple {43943#(and (<= 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; {43944#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:09:50,629 INFO L290 TraceCheckUtils]: 16: Hoare triple {43944#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {43944#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:09:50,629 INFO L290 TraceCheckUtils]: 17: Hoare triple {43944#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {43945#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:09:50,629 INFO L290 TraceCheckUtils]: 18: Hoare triple {43945#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {43946#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:09:50,630 INFO L290 TraceCheckUtils]: 19: Hoare triple {43946#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {44009#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:09:50,630 INFO L290 TraceCheckUtils]: 20: Hoare triple {44009#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !(~z~0 % 4294967296 > 0); {43930#false} is VALID [2022-04-28 10:09:50,630 INFO L290 TraceCheckUtils]: 21: Hoare triple {43930#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {43930#false} is VALID [2022-04-28 10:09:50,630 INFO L290 TraceCheckUtils]: 22: Hoare triple {43930#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {43930#false} is VALID [2022-04-28 10:09:50,631 INFO L290 TraceCheckUtils]: 23: Hoare triple {43930#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {43930#false} is VALID [2022-04-28 10:09:50,631 INFO L290 TraceCheckUtils]: 24: Hoare triple {43930#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {43930#false} is VALID [2022-04-28 10:09:50,631 INFO L290 TraceCheckUtils]: 25: Hoare triple {43930#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {43930#false} is VALID [2022-04-28 10:09:50,631 INFO L290 TraceCheckUtils]: 26: Hoare triple {43930#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {43930#false} is VALID [2022-04-28 10:09:50,631 INFO L290 TraceCheckUtils]: 27: Hoare triple {43930#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {43930#false} is VALID [2022-04-28 10:09:50,631 INFO L290 TraceCheckUtils]: 28: Hoare triple {43930#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {43930#false} is VALID [2022-04-28 10:09:50,631 INFO L290 TraceCheckUtils]: 29: Hoare triple {43930#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {43930#false} is VALID [2022-04-28 10:09:50,631 INFO L290 TraceCheckUtils]: 30: Hoare triple {43930#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {43930#false} is VALID [2022-04-28 10:09:50,631 INFO L290 TraceCheckUtils]: 31: Hoare triple {43930#false} assume !(~y~0 % 4294967296 > 0); {43930#false} is VALID [2022-04-28 10:09:50,631 INFO L272 TraceCheckUtils]: 32: Hoare triple {43930#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {43930#false} is VALID [2022-04-28 10:09:50,631 INFO L290 TraceCheckUtils]: 33: Hoare triple {43930#false} ~cond := #in~cond; {43930#false} is VALID [2022-04-28 10:09:50,631 INFO L290 TraceCheckUtils]: 34: Hoare triple {43930#false} assume 0 == ~cond; {43930#false} is VALID [2022-04-28 10:09:50,631 INFO L290 TraceCheckUtils]: 35: Hoare triple {43930#false} assume !false; {43930#false} is VALID [2022-04-28 10:09:50,631 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-04-28 10:09:50,631 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:09:50,990 INFO L290 TraceCheckUtils]: 35: Hoare triple {43930#false} assume !false; {43930#false} is VALID [2022-04-28 10:09:50,990 INFO L290 TraceCheckUtils]: 34: Hoare triple {43930#false} assume 0 == ~cond; {43930#false} is VALID [2022-04-28 10:09:50,990 INFO L290 TraceCheckUtils]: 33: Hoare triple {43930#false} ~cond := #in~cond; {43930#false} is VALID [2022-04-28 10:09:50,990 INFO L272 TraceCheckUtils]: 32: Hoare triple {43930#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {43930#false} is VALID [2022-04-28 10:09:50,990 INFO L290 TraceCheckUtils]: 31: Hoare triple {43930#false} assume !(~y~0 % 4294967296 > 0); {43930#false} is VALID [2022-04-28 10:09:50,991 INFO L290 TraceCheckUtils]: 30: Hoare triple {43930#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {43930#false} is VALID [2022-04-28 10:09:50,991 INFO L290 TraceCheckUtils]: 29: Hoare triple {43930#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {43930#false} is VALID [2022-04-28 10:09:50,991 INFO L290 TraceCheckUtils]: 28: Hoare triple {43930#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {43930#false} is VALID [2022-04-28 10:09:50,991 INFO L290 TraceCheckUtils]: 27: Hoare triple {43930#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {43930#false} is VALID [2022-04-28 10:09:50,991 INFO L290 TraceCheckUtils]: 26: Hoare triple {43930#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {43930#false} is VALID [2022-04-28 10:09:50,991 INFO L290 TraceCheckUtils]: 25: Hoare triple {43930#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {43930#false} is VALID [2022-04-28 10:09:50,991 INFO L290 TraceCheckUtils]: 24: Hoare triple {43930#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {43930#false} is VALID [2022-04-28 10:09:50,991 INFO L290 TraceCheckUtils]: 23: Hoare triple {43930#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {43930#false} is VALID [2022-04-28 10:09:50,991 INFO L290 TraceCheckUtils]: 22: Hoare triple {43930#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {43930#false} is VALID [2022-04-28 10:09:50,991 INFO L290 TraceCheckUtils]: 21: Hoare triple {43930#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {43930#false} is VALID [2022-04-28 10:09:50,991 INFO L290 TraceCheckUtils]: 20: Hoare triple {44103#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {43930#false} is VALID [2022-04-28 10:09:50,993 INFO L290 TraceCheckUtils]: 19: Hoare triple {44107#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {44103#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:09:50,994 INFO L290 TraceCheckUtils]: 18: Hoare triple {44111#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {44107#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:09:50,994 INFO L290 TraceCheckUtils]: 17: Hoare triple {44115#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} ~z~0 := ~y~0; {44111#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-28 10:09:50,995 INFO L290 TraceCheckUtils]: 16: Hoare triple {44115#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !(~x~0 % 4294967296 > 0); {44115#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:09:50,995 INFO L290 TraceCheckUtils]: 15: Hoare triple {44122#(< 0 (mod (+ main_~y~0 4294967295) 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; {44115#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:09:50,996 INFO L290 TraceCheckUtils]: 14: Hoare triple {44126#(< 0 (mod main_~y~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; {44122#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:09:50,997 INFO L290 TraceCheckUtils]: 13: Hoare triple {44130#(< 0 (mod (+ main_~y~0 1) 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; {44126#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:09:50,998 INFO L290 TraceCheckUtils]: 12: Hoare triple {44134#(< 0 (mod (+ main_~y~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; {44130#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:09:50,998 INFO L290 TraceCheckUtils]: 11: Hoare triple {44138#(< 0 (mod (+ main_~y~0 3) 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; {44134#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:09:50,999 INFO L290 TraceCheckUtils]: 10: Hoare triple {44142#(< 0 (mod (+ main_~y~0 4) 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; {44138#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:09:50,999 INFO L290 TraceCheckUtils]: 9: Hoare triple {44146#(< 0 (mod (+ 5 main_~y~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; {44142#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:09:51,000 INFO L290 TraceCheckUtils]: 8: Hoare triple {44150#(< 0 (mod (+ main_~y~0 6) 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; {44146#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:09:51,001 INFO L290 TraceCheckUtils]: 7: Hoare triple {44154#(< 0 (mod (+ 7 main_~y~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; {44150#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:09:51,001 INFO L290 TraceCheckUtils]: 6: Hoare triple {44158#(< 0 (mod (+ main_~y~0 8) 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; {44154#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:09:51,002 INFO L290 TraceCheckUtils]: 5: Hoare triple {43929#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {44158#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:09:51,002 INFO L272 TraceCheckUtils]: 4: Hoare triple {43929#true} call #t~ret11 := main(); {43929#true} is VALID [2022-04-28 10:09:51,002 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43929#true} {43929#true} #61#return; {43929#true} is VALID [2022-04-28 10:09:51,002 INFO L290 TraceCheckUtils]: 2: Hoare triple {43929#true} assume true; {43929#true} is VALID [2022-04-28 10:09:51,002 INFO L290 TraceCheckUtils]: 1: Hoare triple {43929#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(10, 2);call #Ultimate.allocInit(12, 3); {43929#true} is VALID [2022-04-28 10:09:51,002 INFO L272 TraceCheckUtils]: 0: Hoare triple {43929#true} call ULTIMATE.init(); {43929#true} is VALID [2022-04-28 10:09:51,002 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-04-28 10:09:51,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [734009577] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:09:51,002 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:09:51,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 32 [2022-04-28 10:09:51,003 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:09:51,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [947417541] [2022-04-28 10:09:51,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [947417541] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:09:51,003 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:09:51,003 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-28 10:09:51,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090435083] [2022-04-28 10:09:51,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:09:51,003 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 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 36 [2022-04-28 10:09:51,003 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:09:51,003 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 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-28 10:09:51,019 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:51,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-28 10:09:51,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:51,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-28 10:09:51,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=798, Unknown=0, NotChecked=0, Total=992 [2022-04-28 10:09:51,020 INFO L87 Difference]: Start difference. First operand 112 states and 142 transitions. Second operand has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 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-28 10:09:52,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:52,194 INFO L93 Difference]: Finished difference Result 141 states and 171 transitions. [2022-04-28 10:09:52,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-28 10:09:52,194 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 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 36 [2022-04-28 10:09:52,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:09:52,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 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-28 10:09:52,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 65 transitions. [2022-04-28 10:09:52,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 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-28 10:09:52,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 65 transitions. [2022-04-28 10:09:52,195 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 65 transitions. [2022-04-28 10:09:52,242 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:52,243 INFO L225 Difference]: With dead ends: 141 [2022-04-28 10:09:52,243 INFO L226 Difference]: Without dead ends: 125 [2022-04-28 10:09:52,244 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=482, Invalid=1870, Unknown=0, NotChecked=0, Total=2352 [2022-04-28 10:09:52,244 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 31 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 567 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 10:09:52,244 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 87 Invalid, 606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 567 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 10:09:52,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-04-28 10:09:52,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 113. [2022-04-28 10:09:52,357 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:09:52,357 INFO L82 GeneralOperation]: Start isEquivalent. First operand 125 states. Second operand has 113 states, 108 states have (on average 1.287037037037037) internal successors, (139), 108 states have internal predecessors, (139), 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-28 10:09:52,357 INFO L74 IsIncluded]: Start isIncluded. First operand 125 states. Second operand has 113 states, 108 states have (on average 1.287037037037037) internal successors, (139), 108 states have internal predecessors, (139), 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-28 10:09:52,357 INFO L87 Difference]: Start difference. First operand 125 states. Second operand has 113 states, 108 states have (on average 1.287037037037037) internal successors, (139), 108 states have internal predecessors, (139), 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-28 10:09:52,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:52,358 INFO L93 Difference]: Finished difference Result 125 states and 155 transitions. [2022-04-28 10:09:52,358 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 155 transitions. [2022-04-28 10:09:52,358 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:52,358 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:52,358 INFO L74 IsIncluded]: Start isIncluded. First operand has 113 states, 108 states have (on average 1.287037037037037) internal successors, (139), 108 states have internal predecessors, (139), 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 125 states. [2022-04-28 10:09:52,358 INFO L87 Difference]: Start difference. First operand has 113 states, 108 states have (on average 1.287037037037037) internal successors, (139), 108 states have internal predecessors, (139), 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 125 states. [2022-04-28 10:09:52,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:09:52,359 INFO L93 Difference]: Finished difference Result 125 states and 155 transitions. [2022-04-28 10:09:52,359 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 155 transitions. [2022-04-28 10:09:52,359 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:09:52,359 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:09:52,359 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:09:52,359 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:09:52,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 108 states have (on average 1.287037037037037) internal successors, (139), 108 states have internal predecessors, (139), 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-28 10:09:52,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 143 transitions. [2022-04-28 10:09:52,361 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 143 transitions. Word has length 36 [2022-04-28 10:09:52,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:09:52,361 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 143 transitions. [2022-04-28 10:09:52,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 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-28 10:09:52,361 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 113 states and 143 transitions. [2022-04-28 10:09:55,622 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 143 edges. 143 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:55,622 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 143 transitions. [2022-04-28 10:09:55,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-28 10:09:55,622 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:09:55,622 INFO L195 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:09:55,640 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Forceful destruction successful, exit code 0 [2022-04-28 10:09:55,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62,63 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:55,835 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:09:55,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:09:55,836 INFO L85 PathProgramCache]: Analyzing trace with hash 78025389, now seen corresponding path program 43 times [2022-04-28 10:09:55,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:55,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1304410771] [2022-04-28 10:09:55,837 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:09:55,838 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:09:55,838 INFO L85 PathProgramCache]: Analyzing trace with hash 78025389, now seen corresponding path program 44 times [2022-04-28 10:09:55,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:09:55,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655651735] [2022-04-28 10:09:55,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:09:55,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:09:55,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:56,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:09:56,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:56,249 INFO L290 TraceCheckUtils]: 0: Hoare triple {45000#(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(10, 2);call #Ultimate.allocInit(12, 3); {44971#true} is VALID [2022-04-28 10:09:56,249 INFO L290 TraceCheckUtils]: 1: Hoare triple {44971#true} assume true; {44971#true} is VALID [2022-04-28 10:09:56,249 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {44971#true} {44971#true} #61#return; {44971#true} is VALID [2022-04-28 10:09:56,250 INFO L272 TraceCheckUtils]: 0: Hoare triple {44971#true} call ULTIMATE.init(); {45000#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:09:56,250 INFO L290 TraceCheckUtils]: 1: Hoare triple {45000#(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(10, 2);call #Ultimate.allocInit(12, 3); {44971#true} is VALID [2022-04-28 10:09:56,250 INFO L290 TraceCheckUtils]: 2: Hoare triple {44971#true} assume true; {44971#true} is VALID [2022-04-28 10:09:56,250 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44971#true} {44971#true} #61#return; {44971#true} is VALID [2022-04-28 10:09:56,250 INFO L272 TraceCheckUtils]: 4: Hoare triple {44971#true} call #t~ret11 := main(); {44971#true} is VALID [2022-04-28 10:09:56,250 INFO L290 TraceCheckUtils]: 5: Hoare triple {44971#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {44976#(= main_~y~0 0)} is VALID [2022-04-28 10:09:56,251 INFO L290 TraceCheckUtils]: 6: Hoare triple {44976#(= 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; {44977#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:56,251 INFO L290 TraceCheckUtils]: 7: Hoare triple {44977#(and (<= 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; {44978#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:56,252 INFO L290 TraceCheckUtils]: 8: Hoare triple {44978#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {44979#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:56,252 INFO L290 TraceCheckUtils]: 9: Hoare triple {44979#(and (<= main_~y~0 3) (<= 3 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; {44980#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:09:56,253 INFO L290 TraceCheckUtils]: 10: Hoare triple {44980#(and (<= main_~y~0 4) (<= 4 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; {44981#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:09:56,253 INFO L290 TraceCheckUtils]: 11: Hoare triple {44981#(and (<= 5 main_~y~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; {44982#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:09:56,254 INFO L290 TraceCheckUtils]: 12: Hoare triple {44982#(and (<= main_~y~0 6) (<= 6 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; {44983#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:09:56,254 INFO L290 TraceCheckUtils]: 13: Hoare triple {44983#(and (<= 7 main_~y~0) (<= main_~y~0 7))} 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; {44984#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:09:56,255 INFO L290 TraceCheckUtils]: 14: Hoare triple {44984#(and (<= main_~y~0 8) (<= 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; {44985#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:09:56,255 INFO L290 TraceCheckUtils]: 15: Hoare triple {44985#(and (<= 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; {44986#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:09:56,256 INFO L290 TraceCheckUtils]: 16: Hoare triple {44986#(and (<= main_~y~0 10) (<= 10 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; {44987#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:09:56,256 INFO L290 TraceCheckUtils]: 17: Hoare triple {44987#(and (<= main_~y~0 11) (<= 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; {44988#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:09:56,257 INFO L290 TraceCheckUtils]: 18: Hoare triple {44988#(and (<= 12 main_~y~0) (<= main_~y~0 12))} 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; {44989#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:09:56,257 INFO L290 TraceCheckUtils]: 19: Hoare triple {44989#(and (<= main_~y~0 13) (<= 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; {44990#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:09:56,258 INFO L290 TraceCheckUtils]: 20: Hoare triple {44990#(and (<= 14 main_~y~0) (<= main_~y~0 14))} 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; {44991#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:09:56,258 INFO L290 TraceCheckUtils]: 21: Hoare triple {44991#(and (<= main_~y~0 15) (<= 15 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; {44992#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:09:56,259 INFO L290 TraceCheckUtils]: 22: Hoare triple {44992#(and (<= 16 main_~y~0) (<= main_~y~0 16))} 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; {44993#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:09:56,259 INFO L290 TraceCheckUtils]: 23: Hoare triple {44993#(and (<= main_~y~0 17) (<= 17 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; {44994#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 10:09:56,260 INFO L290 TraceCheckUtils]: 24: Hoare triple {44994#(and (<= 18 main_~y~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; {44995#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 10:09:56,260 INFO L290 TraceCheckUtils]: 25: Hoare triple {44995#(and (<= 19 main_~y~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; {44996#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 10:09:56,261 INFO L290 TraceCheckUtils]: 26: Hoare triple {44996#(and (<= 20 main_~y~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; {44997#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 10:09:56,261 INFO L290 TraceCheckUtils]: 27: Hoare triple {44997#(and (<= main_~y~0 21) (<= 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; {44998#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 10:09:56,262 INFO L290 TraceCheckUtils]: 28: Hoare triple {44998#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {44998#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 10:09:56,262 INFO L290 TraceCheckUtils]: 29: Hoare triple {44998#(and (<= main_~y~0 22) (<= 22 main_~y~0))} ~z~0 := ~y~0; {44999#(and (<= 22 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:09:56,262 INFO L290 TraceCheckUtils]: 30: Hoare triple {44999#(and (<= 22 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {44972#false} is VALID [2022-04-28 10:09:56,263 INFO L290 TraceCheckUtils]: 31: Hoare triple {44972#false} assume !(~y~0 % 4294967296 > 0); {44972#false} is VALID [2022-04-28 10:09:56,263 INFO L272 TraceCheckUtils]: 32: Hoare triple {44972#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {44972#false} is VALID [2022-04-28 10:09:56,263 INFO L290 TraceCheckUtils]: 33: Hoare triple {44972#false} ~cond := #in~cond; {44972#false} is VALID [2022-04-28 10:09:56,263 INFO L290 TraceCheckUtils]: 34: Hoare triple {44972#false} assume 0 == ~cond; {44972#false} is VALID [2022-04-28 10:09:56,263 INFO L290 TraceCheckUtils]: 35: Hoare triple {44972#false} assume !false; {44972#false} is VALID [2022-04-28 10:09:56,263 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-28 10:09:56,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:09:56,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655651735] [2022-04-28 10:09:56,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655651735] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:09:56,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1926005426] [2022-04-28 10:09:56,263 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:09:56,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:09:56,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:09:56,264 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:09:56,267 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (64)] Waiting until timeout for monitored process [2022-04-28 10:09:56,305 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:09:56,305 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:09:56,306 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 49 conjunts are in the unsatisfiable core [2022-04-28 10:09:56,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:09:56,314 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:09:56,629 INFO L272 TraceCheckUtils]: 0: Hoare triple {44971#true} call ULTIMATE.init(); {44971#true} is VALID [2022-04-28 10:09:56,629 INFO L290 TraceCheckUtils]: 1: Hoare triple {44971#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(10, 2);call #Ultimate.allocInit(12, 3); {44971#true} is VALID [2022-04-28 10:09:56,629 INFO L290 TraceCheckUtils]: 2: Hoare triple {44971#true} assume true; {44971#true} is VALID [2022-04-28 10:09:56,629 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44971#true} {44971#true} #61#return; {44971#true} is VALID [2022-04-28 10:09:56,629 INFO L272 TraceCheckUtils]: 4: Hoare triple {44971#true} call #t~ret11 := main(); {44971#true} is VALID [2022-04-28 10:09:56,630 INFO L290 TraceCheckUtils]: 5: Hoare triple {44971#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {44976#(= main_~y~0 0)} is VALID [2022-04-28 10:09:56,642 INFO L290 TraceCheckUtils]: 6: Hoare triple {44976#(= 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; {44977#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:09:56,642 INFO L290 TraceCheckUtils]: 7: Hoare triple {44977#(and (<= 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; {44978#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:09:56,643 INFO L290 TraceCheckUtils]: 8: Hoare triple {44978#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {44979#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:09:56,643 INFO L290 TraceCheckUtils]: 9: Hoare triple {44979#(and (<= main_~y~0 3) (<= 3 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; {44980#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:09:56,644 INFO L290 TraceCheckUtils]: 10: Hoare triple {44980#(and (<= main_~y~0 4) (<= 4 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; {44981#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:09:56,644 INFO L290 TraceCheckUtils]: 11: Hoare triple {44981#(and (<= 5 main_~y~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; {44982#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:09:56,645 INFO L290 TraceCheckUtils]: 12: Hoare triple {44982#(and (<= main_~y~0 6) (<= 6 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; {44983#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:09:56,645 INFO L290 TraceCheckUtils]: 13: Hoare triple {44983#(and (<= 7 main_~y~0) (<= main_~y~0 7))} 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; {44984#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:09:56,646 INFO L290 TraceCheckUtils]: 14: Hoare triple {44984#(and (<= main_~y~0 8) (<= 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; {44985#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:09:56,646 INFO L290 TraceCheckUtils]: 15: Hoare triple {44985#(and (<= 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; {44986#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:09:56,647 INFO L290 TraceCheckUtils]: 16: Hoare triple {44986#(and (<= main_~y~0 10) (<= 10 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; {44987#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:09:56,648 INFO L290 TraceCheckUtils]: 17: Hoare triple {44987#(and (<= main_~y~0 11) (<= 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; {44988#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:09:56,648 INFO L290 TraceCheckUtils]: 18: Hoare triple {44988#(and (<= 12 main_~y~0) (<= main_~y~0 12))} 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; {44989#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:09:56,649 INFO L290 TraceCheckUtils]: 19: Hoare triple {44989#(and (<= main_~y~0 13) (<= 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; {44990#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:09:56,649 INFO L290 TraceCheckUtils]: 20: Hoare triple {44990#(and (<= 14 main_~y~0) (<= main_~y~0 14))} 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; {44991#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:09:56,650 INFO L290 TraceCheckUtils]: 21: Hoare triple {44991#(and (<= main_~y~0 15) (<= 15 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; {44992#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:09:56,650 INFO L290 TraceCheckUtils]: 22: Hoare triple {44992#(and (<= 16 main_~y~0) (<= main_~y~0 16))} 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; {44993#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:09:56,651 INFO L290 TraceCheckUtils]: 23: Hoare triple {44993#(and (<= main_~y~0 17) (<= 17 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; {44994#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 10:09:56,651 INFO L290 TraceCheckUtils]: 24: Hoare triple {44994#(and (<= 18 main_~y~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; {44995#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 10:09:56,652 INFO L290 TraceCheckUtils]: 25: Hoare triple {44995#(and (<= 19 main_~y~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; {44996#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 10:09:56,652 INFO L290 TraceCheckUtils]: 26: Hoare triple {44996#(and (<= 20 main_~y~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; {44997#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 10:09:56,653 INFO L290 TraceCheckUtils]: 27: Hoare triple {44997#(and (<= main_~y~0 21) (<= 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; {44998#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 10:09:56,653 INFO L290 TraceCheckUtils]: 28: Hoare triple {44998#(and (<= main_~y~0 22) (<= 22 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {44998#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 10:09:56,653 INFO L290 TraceCheckUtils]: 29: Hoare triple {44998#(and (<= main_~y~0 22) (<= 22 main_~y~0))} ~z~0 := ~y~0; {45091#(and (<= 22 main_~z~0) (<= main_~z~0 22))} is VALID [2022-04-28 10:09:56,654 INFO L290 TraceCheckUtils]: 30: Hoare triple {45091#(and (<= 22 main_~z~0) (<= main_~z~0 22))} assume !(~z~0 % 4294967296 > 0); {44972#false} is VALID [2022-04-28 10:09:56,654 INFO L290 TraceCheckUtils]: 31: Hoare triple {44972#false} assume !(~y~0 % 4294967296 > 0); {44972#false} is VALID [2022-04-28 10:09:56,654 INFO L272 TraceCheckUtils]: 32: Hoare triple {44972#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {44972#false} is VALID [2022-04-28 10:09:56,654 INFO L290 TraceCheckUtils]: 33: Hoare triple {44972#false} ~cond := #in~cond; {44972#false} is VALID [2022-04-28 10:09:56,654 INFO L290 TraceCheckUtils]: 34: Hoare triple {44972#false} assume 0 == ~cond; {44972#false} is VALID [2022-04-28 10:09:56,654 INFO L290 TraceCheckUtils]: 35: Hoare triple {44972#false} assume !false; {44972#false} is VALID [2022-04-28 10:09:56,654 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-28 10:09:56,654 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:09:57,564 INFO L290 TraceCheckUtils]: 35: Hoare triple {44972#false} assume !false; {44972#false} is VALID [2022-04-28 10:09:57,564 INFO L290 TraceCheckUtils]: 34: Hoare triple {44972#false} assume 0 == ~cond; {44972#false} is VALID [2022-04-28 10:09:57,565 INFO L290 TraceCheckUtils]: 33: Hoare triple {44972#false} ~cond := #in~cond; {44972#false} is VALID [2022-04-28 10:09:57,565 INFO L272 TraceCheckUtils]: 32: Hoare triple {44972#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {44972#false} is VALID [2022-04-28 10:09:57,565 INFO L290 TraceCheckUtils]: 31: Hoare triple {44972#false} assume !(~y~0 % 4294967296 > 0); {44972#false} is VALID [2022-04-28 10:09:57,565 INFO L290 TraceCheckUtils]: 30: Hoare triple {45125#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {44972#false} is VALID [2022-04-28 10:09:57,565 INFO L290 TraceCheckUtils]: 29: Hoare triple {45129#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {45125#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:09:57,565 INFO L290 TraceCheckUtils]: 28: Hoare triple {45129#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {45129#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:09:57,566 INFO L290 TraceCheckUtils]: 27: Hoare triple {45136#(< 0 (mod (+ main_~y~0 1) 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; {45129#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:09:57,567 INFO L290 TraceCheckUtils]: 26: Hoare triple {45140#(< 0 (mod (+ main_~y~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; {45136#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:09:57,567 INFO L290 TraceCheckUtils]: 25: Hoare triple {45144#(< 0 (mod (+ main_~y~0 3) 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; {45140#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:09:57,568 INFO L290 TraceCheckUtils]: 24: Hoare triple {45148#(< 0 (mod (+ main_~y~0 4) 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; {45144#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:09:57,569 INFO L290 TraceCheckUtils]: 23: Hoare triple {45152#(< 0 (mod (+ 5 main_~y~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; {45148#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:09:57,569 INFO L290 TraceCheckUtils]: 22: Hoare triple {45156#(< 0 (mod (+ main_~y~0 6) 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; {45152#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:09:57,570 INFO L290 TraceCheckUtils]: 21: Hoare triple {45160#(< 0 (mod (+ 7 main_~y~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; {45156#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:09:57,570 INFO L290 TraceCheckUtils]: 20: Hoare triple {45164#(< 0 (mod (+ main_~y~0 8) 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; {45160#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:09:57,571 INFO L290 TraceCheckUtils]: 19: Hoare triple {45168#(< 0 (mod (+ main_~y~0 9) 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; {45164#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:09:57,572 INFO L290 TraceCheckUtils]: 18: Hoare triple {45172#(< 0 (mod (+ main_~y~0 10) 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; {45168#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:09:57,572 INFO L290 TraceCheckUtils]: 17: Hoare triple {45176#(< 0 (mod (+ main_~y~0 11) 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; {45172#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-28 10:09:57,573 INFO L290 TraceCheckUtils]: 16: Hoare triple {45180#(< 0 (mod (+ main_~y~0 12) 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; {45176#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-28 10:09:57,585 INFO L290 TraceCheckUtils]: 15: Hoare triple {45184#(< 0 (mod (+ main_~y~0 13) 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; {45180#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-28 10:09:57,586 INFO L290 TraceCheckUtils]: 14: Hoare triple {45188#(< 0 (mod (+ main_~y~0 14) 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; {45184#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-28 10:09:57,587 INFO L290 TraceCheckUtils]: 13: Hoare triple {45192#(< 0 (mod (+ main_~y~0 15) 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; {45188#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-28 10:09:57,588 INFO L290 TraceCheckUtils]: 12: Hoare triple {45196#(< 0 (mod (+ main_~y~0 16) 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; {45192#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID [2022-04-28 10:09:57,588 INFO L290 TraceCheckUtils]: 11: Hoare triple {45200#(< 0 (mod (+ main_~y~0 17) 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; {45196#(< 0 (mod (+ main_~y~0 16) 4294967296))} is VALID [2022-04-28 10:09:57,589 INFO L290 TraceCheckUtils]: 10: Hoare triple {45204#(< 0 (mod (+ main_~y~0 18) 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; {45200#(< 0 (mod (+ main_~y~0 17) 4294967296))} is VALID [2022-04-28 10:09:57,589 INFO L290 TraceCheckUtils]: 9: Hoare triple {45208#(< 0 (mod (+ 19 main_~y~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; {45204#(< 0 (mod (+ main_~y~0 18) 4294967296))} is VALID [2022-04-28 10:09:57,590 INFO L290 TraceCheckUtils]: 8: Hoare triple {45212#(< 0 (mod (+ main_~y~0 20) 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; {45208#(< 0 (mod (+ 19 main_~y~0) 4294967296))} is VALID [2022-04-28 10:09:57,591 INFO L290 TraceCheckUtils]: 7: Hoare triple {45216#(< 0 (mod (+ main_~y~0 21) 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; {45212#(< 0 (mod (+ main_~y~0 20) 4294967296))} is VALID [2022-04-28 10:09:57,591 INFO L290 TraceCheckUtils]: 6: Hoare triple {45220#(< 0 (mod (+ main_~y~0 22) 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; {45216#(< 0 (mod (+ main_~y~0 21) 4294967296))} is VALID [2022-04-28 10:09:57,592 INFO L290 TraceCheckUtils]: 5: Hoare triple {44971#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {45220#(< 0 (mod (+ main_~y~0 22) 4294967296))} is VALID [2022-04-28 10:09:57,592 INFO L272 TraceCheckUtils]: 4: Hoare triple {44971#true} call #t~ret11 := main(); {44971#true} is VALID [2022-04-28 10:09:57,592 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44971#true} {44971#true} #61#return; {44971#true} is VALID [2022-04-28 10:09:57,592 INFO L290 TraceCheckUtils]: 2: Hoare triple {44971#true} assume true; {44971#true} is VALID [2022-04-28 10:09:57,592 INFO L290 TraceCheckUtils]: 1: Hoare triple {44971#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(10, 2);call #Ultimate.allocInit(12, 3); {44971#true} is VALID [2022-04-28 10:09:57,592 INFO L272 TraceCheckUtils]: 0: Hoare triple {44971#true} call ULTIMATE.init(); {44971#true} is VALID [2022-04-28 10:09:57,592 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-28 10:09:57,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1926005426] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:09:57,592 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:09:57,592 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 26, 26] total 52 [2022-04-28 10:09:57,593 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:09:57,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1304410771] [2022-04-28 10:09:57,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1304410771] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:09:57,593 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:09:57,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-04-28 10:09:57,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886497203] [2022-04-28 10:09:57,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:09:57,593 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 26 states have internal predecessors, (32), 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 36 [2022-04-28 10:09:57,593 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:09:57,593 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 27 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 26 states have internal predecessors, (32), 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-28 10:09:57,618 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:09:57,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-04-28 10:09:57,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:09:57,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-04-28 10:09:57,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=632, Invalid=2020, Unknown=0, NotChecked=0, Total=2652 [2022-04-28 10:09:57,619 INFO L87 Difference]: Start difference. First operand 113 states and 143 transitions. Second operand has 27 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 26 states have internal predecessors, (32), 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-28 10:10:01,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:01,707 INFO L93 Difference]: Finished difference Result 147 states and 203 transitions. [2022-04-28 10:10:01,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-28 10:10:01,708 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 26 states have internal predecessors, (32), 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 36 [2022-04-28 10:10:01,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:10:01,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 26 states have internal predecessors, (32), 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-28 10:10:01,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 155 transitions. [2022-04-28 10:10:01,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 26 states have internal predecessors, (32), 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-28 10:10:01,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 155 transitions. [2022-04-28 10:10:01,709 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 155 transitions. [2022-04-28 10:10:01,824 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 155 edges. 155 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:10:01,826 INFO L225 Difference]: With dead ends: 147 [2022-04-28 10:10:01,826 INFO L226 Difference]: Without dead ends: 141 [2022-04-28 10:10:01,826 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 346 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1282, Invalid=4418, Unknown=0, NotChecked=0, Total=5700 [2022-04-28 10:10:01,826 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 132 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 2621 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 2716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 2621 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-04-28 10:10:01,827 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 176 Invalid, 2716 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 2621 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-04-28 10:10:01,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-04-28 10:10:01,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 118. [2022-04-28 10:10:01,951 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:10:01,951 INFO L82 GeneralOperation]: Start isEquivalent. First operand 141 states. Second operand has 118 states, 113 states have (on average 1.2920353982300885) internal successors, (146), 113 states have internal predecessors, (146), 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-28 10:10:01,952 INFO L74 IsIncluded]: Start isIncluded. First operand 141 states. Second operand has 118 states, 113 states have (on average 1.2920353982300885) internal successors, (146), 113 states have internal predecessors, (146), 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-28 10:10:01,952 INFO L87 Difference]: Start difference. First operand 141 states. Second operand has 118 states, 113 states have (on average 1.2920353982300885) internal successors, (146), 113 states have internal predecessors, (146), 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-28 10:10:01,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:01,953 INFO L93 Difference]: Finished difference Result 141 states and 173 transitions. [2022-04-28 10:10:01,953 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 173 transitions. [2022-04-28 10:10:01,953 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:10:01,953 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:10:01,953 INFO L74 IsIncluded]: Start isIncluded. First operand has 118 states, 113 states have (on average 1.2920353982300885) internal successors, (146), 113 states have internal predecessors, (146), 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 141 states. [2022-04-28 10:10:01,953 INFO L87 Difference]: Start difference. First operand has 118 states, 113 states have (on average 1.2920353982300885) internal successors, (146), 113 states have internal predecessors, (146), 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 141 states. [2022-04-28 10:10:01,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:01,954 INFO L93 Difference]: Finished difference Result 141 states and 173 transitions. [2022-04-28 10:10:01,954 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 173 transitions. [2022-04-28 10:10:01,954 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:10:01,954 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:10:01,955 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:10:01,955 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:10:01,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 113 states have (on average 1.2920353982300885) internal successors, (146), 113 states have internal predecessors, (146), 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-28 10:10:01,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 150 transitions. [2022-04-28 10:10:01,956 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 150 transitions. Word has length 36 [2022-04-28 10:10:01,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:10:01,956 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 150 transitions. [2022-04-28 10:10:01,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 26 states have internal predecessors, (32), 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-28 10:10:01,956 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 118 states and 150 transitions. [2022-04-28 10:10:06,373 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 150 edges. 149 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 10:10:06,373 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 150 transitions. [2022-04-28 10:10:06,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-28 10:10:06,374 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:10:06,374 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:10:06,389 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (64)] Forceful destruction successful, exit code 0 [2022-04-28 10:10:06,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 64 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable63 [2022-04-28 10:10:06,582 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:10:06,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:10:06,582 INFO L85 PathProgramCache]: Analyzing trace with hash -1959952529, now seen corresponding path program 83 times [2022-04-28 10:10:06,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:10:06,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1598568825] [2022-04-28 10:10:06,586 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:10:06,586 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:10:06,586 INFO L85 PathProgramCache]: Analyzing trace with hash -1959952529, now seen corresponding path program 84 times [2022-04-28 10:10:06,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:10:06,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644275612] [2022-04-28 10:10:06,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:10:06,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:10:06,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:06,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:10:06,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:06,859 INFO L290 TraceCheckUtils]: 0: Hoare triple {46123#(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(10, 2);call #Ultimate.allocInit(12, 3); {46101#true} is VALID [2022-04-28 10:10:06,859 INFO L290 TraceCheckUtils]: 1: Hoare triple {46101#true} assume true; {46101#true} is VALID [2022-04-28 10:10:06,860 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {46101#true} {46101#true} #61#return; {46101#true} is VALID [2022-04-28 10:10:06,860 INFO L272 TraceCheckUtils]: 0: Hoare triple {46101#true} call ULTIMATE.init(); {46123#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:10:06,860 INFO L290 TraceCheckUtils]: 1: Hoare triple {46123#(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(10, 2);call #Ultimate.allocInit(12, 3); {46101#true} is VALID [2022-04-28 10:10:06,860 INFO L290 TraceCheckUtils]: 2: Hoare triple {46101#true} assume true; {46101#true} is VALID [2022-04-28 10:10:06,860 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {46101#true} {46101#true} #61#return; {46101#true} is VALID [2022-04-28 10:10:06,860 INFO L272 TraceCheckUtils]: 4: Hoare triple {46101#true} call #t~ret11 := main(); {46101#true} is VALID [2022-04-28 10:10:06,861 INFO L290 TraceCheckUtils]: 5: Hoare triple {46101#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {46106#(= main_~y~0 0)} is VALID [2022-04-28 10:10:06,861 INFO L290 TraceCheckUtils]: 6: Hoare triple {46106#(= 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; {46107#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:10:06,862 INFO L290 TraceCheckUtils]: 7: Hoare triple {46107#(and (<= 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; {46108#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:10:06,862 INFO L290 TraceCheckUtils]: 8: Hoare triple {46108#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {46109#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:10:06,863 INFO L290 TraceCheckUtils]: 9: Hoare triple {46109#(and (<= main_~y~0 3) (<= 3 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; {46110#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:10:06,863 INFO L290 TraceCheckUtils]: 10: Hoare triple {46110#(and (<= main_~y~0 4) (<= 4 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; {46111#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:10:06,864 INFO L290 TraceCheckUtils]: 11: Hoare triple {46111#(and (<= 5 main_~y~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; {46112#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:10:06,864 INFO L290 TraceCheckUtils]: 12: Hoare triple {46112#(and (<= main_~y~0 6) (<= 6 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; {46113#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:10:06,865 INFO L290 TraceCheckUtils]: 13: Hoare triple {46113#(and (<= 7 main_~y~0) (<= main_~y~0 7))} 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; {46114#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:10:06,865 INFO L290 TraceCheckUtils]: 14: Hoare triple {46114#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {46114#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:10:06,865 INFO L290 TraceCheckUtils]: 15: Hoare triple {46114#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {46115#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:10:06,866 INFO L290 TraceCheckUtils]: 16: Hoare triple {46115#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {46116#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:10:06,866 INFO L290 TraceCheckUtils]: 17: Hoare triple {46116#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {46117#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:10:06,867 INFO L290 TraceCheckUtils]: 18: Hoare triple {46117#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {46118#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:10:06,867 INFO L290 TraceCheckUtils]: 19: Hoare triple {46118#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {46119#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:10:06,868 INFO L290 TraceCheckUtils]: 20: Hoare triple {46119#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {46120#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:10:06,868 INFO L290 TraceCheckUtils]: 21: Hoare triple {46120#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {46121#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-28 10:10:06,869 INFO L290 TraceCheckUtils]: 22: Hoare triple {46121#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {46122#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-28 10:10:06,869 INFO L290 TraceCheckUtils]: 23: Hoare triple {46122#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {46102#false} is VALID [2022-04-28 10:10:06,869 INFO L290 TraceCheckUtils]: 24: Hoare triple {46102#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {46102#false} is VALID [2022-04-28 10:10:06,869 INFO L290 TraceCheckUtils]: 25: Hoare triple {46102#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {46102#false} is VALID [2022-04-28 10:10:06,869 INFO L290 TraceCheckUtils]: 26: Hoare triple {46102#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {46102#false} is VALID [2022-04-28 10:10:06,869 INFO L290 TraceCheckUtils]: 27: Hoare triple {46102#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {46102#false} is VALID [2022-04-28 10:10:06,869 INFO L290 TraceCheckUtils]: 28: Hoare triple {46102#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {46102#false} is VALID [2022-04-28 10:10:06,869 INFO L290 TraceCheckUtils]: 29: Hoare triple {46102#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {46102#false} is VALID [2022-04-28 10:10:06,869 INFO L290 TraceCheckUtils]: 30: Hoare triple {46102#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {46102#false} is VALID [2022-04-28 10:10:06,870 INFO L290 TraceCheckUtils]: 31: Hoare triple {46102#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {46102#false} is VALID [2022-04-28 10:10:06,870 INFO L290 TraceCheckUtils]: 32: Hoare triple {46102#false} assume !(~y~0 % 4294967296 > 0); {46102#false} is VALID [2022-04-28 10:10:06,870 INFO L272 TraceCheckUtils]: 33: Hoare triple {46102#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {46102#false} is VALID [2022-04-28 10:10:06,870 INFO L290 TraceCheckUtils]: 34: Hoare triple {46102#false} ~cond := #in~cond; {46102#false} is VALID [2022-04-28 10:10:06,870 INFO L290 TraceCheckUtils]: 35: Hoare triple {46102#false} assume 0 == ~cond; {46102#false} is VALID [2022-04-28 10:10:06,870 INFO L290 TraceCheckUtils]: 36: Hoare triple {46102#false} assume !false; {46102#false} is VALID [2022-04-28 10:10:06,870 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-28 10:10:06,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:10:06,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644275612] [2022-04-28 10:10:06,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644275612] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:10:06,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [301203033] [2022-04-28 10:10:06,870 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:10:06,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:10:06,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:10:06,871 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:10:06,873 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Waiting until timeout for monitored process [2022-04-28 10:10:06,993 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-28 10:10:06,993 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:10:06,994 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 50 conjunts are in the unsatisfiable core [2022-04-28 10:10:07,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:07,003 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:10:07,325 INFO L272 TraceCheckUtils]: 0: Hoare triple {46101#true} call ULTIMATE.init(); {46101#true} is VALID [2022-04-28 10:10:07,325 INFO L290 TraceCheckUtils]: 1: Hoare triple {46101#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(10, 2);call #Ultimate.allocInit(12, 3); {46101#true} is VALID [2022-04-28 10:10:07,325 INFO L290 TraceCheckUtils]: 2: Hoare triple {46101#true} assume true; {46101#true} is VALID [2022-04-28 10:10:07,325 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {46101#true} {46101#true} #61#return; {46101#true} is VALID [2022-04-28 10:10:07,325 INFO L272 TraceCheckUtils]: 4: Hoare triple {46101#true} call #t~ret11 := main(); {46101#true} is VALID [2022-04-28 10:10:07,325 INFO L290 TraceCheckUtils]: 5: Hoare triple {46101#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {46106#(= main_~y~0 0)} is VALID [2022-04-28 10:10:07,326 INFO L290 TraceCheckUtils]: 6: Hoare triple {46106#(= 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; {46107#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:10:07,326 INFO L290 TraceCheckUtils]: 7: Hoare triple {46107#(and (<= 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; {46108#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:10:07,327 INFO L290 TraceCheckUtils]: 8: Hoare triple {46108#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {46109#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:10:07,327 INFO L290 TraceCheckUtils]: 9: Hoare triple {46109#(and (<= main_~y~0 3) (<= 3 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; {46110#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:10:07,328 INFO L290 TraceCheckUtils]: 10: Hoare triple {46110#(and (<= main_~y~0 4) (<= 4 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; {46111#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:10:07,328 INFO L290 TraceCheckUtils]: 11: Hoare triple {46111#(and (<= 5 main_~y~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; {46112#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:10:07,329 INFO L290 TraceCheckUtils]: 12: Hoare triple {46112#(and (<= main_~y~0 6) (<= 6 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; {46113#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:10:07,329 INFO L290 TraceCheckUtils]: 13: Hoare triple {46113#(and (<= 7 main_~y~0) (<= main_~y~0 7))} 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; {46114#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:10:07,329 INFO L290 TraceCheckUtils]: 14: Hoare triple {46114#(and (<= main_~y~0 8) (<= 8 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {46114#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:10:07,330 INFO L290 TraceCheckUtils]: 15: Hoare triple {46114#(and (<= main_~y~0 8) (<= 8 main_~y~0))} ~z~0 := ~y~0; {46172#(and (= main_~z~0 main_~y~0) (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:10:07,330 INFO L290 TraceCheckUtils]: 16: Hoare triple {46172#(and (= main_~z~0 main_~y~0) (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {46176#(and (<= main_~y~0 8) (<= 8 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-28 10:10:07,331 INFO L290 TraceCheckUtils]: 17: Hoare triple {46176#(and (<= main_~y~0 8) (<= 8 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {46180#(and (= main_~y~0 (+ main_~z~0 2)) (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:10:07,340 INFO L290 TraceCheckUtils]: 18: Hoare triple {46180#(and (= main_~y~0 (+ main_~z~0 2)) (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {46184#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:10:07,341 INFO L290 TraceCheckUtils]: 19: Hoare triple {46184#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {46188#(and (= (+ main_~y~0 (- 3)) (+ main_~z~0 1)) (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:10:07,341 INFO L290 TraceCheckUtils]: 20: Hoare triple {46188#(and (= (+ main_~y~0 (- 3)) (+ main_~z~0 1)) (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {46192#(and (= (+ main_~y~0 (- 4)) (+ main_~z~0 1)) (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:10:07,342 INFO L290 TraceCheckUtils]: 21: Hoare triple {46192#(and (= (+ main_~y~0 (- 4)) (+ main_~z~0 1)) (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {46196#(and (= (+ main_~y~0 (- 5)) (+ main_~z~0 1)) (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:10:07,343 INFO L290 TraceCheckUtils]: 22: Hoare triple {46196#(and (= (+ main_~y~0 (- 5)) (+ main_~z~0 1)) (<= main_~y~0 8) (<= 8 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {46200#(and (<= main_~y~0 8) (= (+ main_~z~0 2) (+ main_~y~0 (- 5))) (<= 8 main_~y~0))} is VALID [2022-04-28 10:10:07,343 INFO L290 TraceCheckUtils]: 23: Hoare triple {46200#(and (<= main_~y~0 8) (= (+ main_~z~0 2) (+ main_~y~0 (- 5))) (<= 8 main_~y~0))} assume !(~z~0 % 4294967296 > 0); {46102#false} is VALID [2022-04-28 10:10:07,343 INFO L290 TraceCheckUtils]: 24: Hoare triple {46102#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {46102#false} is VALID [2022-04-28 10:10:07,343 INFO L290 TraceCheckUtils]: 25: Hoare triple {46102#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {46102#false} is VALID [2022-04-28 10:10:07,343 INFO L290 TraceCheckUtils]: 26: Hoare triple {46102#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {46102#false} is VALID [2022-04-28 10:10:07,343 INFO L290 TraceCheckUtils]: 27: Hoare triple {46102#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {46102#false} is VALID [2022-04-28 10:10:07,343 INFO L290 TraceCheckUtils]: 28: Hoare triple {46102#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {46102#false} is VALID [2022-04-28 10:10:07,343 INFO L290 TraceCheckUtils]: 29: Hoare triple {46102#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {46102#false} is VALID [2022-04-28 10:10:07,343 INFO L290 TraceCheckUtils]: 30: Hoare triple {46102#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {46102#false} is VALID [2022-04-28 10:10:07,343 INFO L290 TraceCheckUtils]: 31: Hoare triple {46102#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {46102#false} is VALID [2022-04-28 10:10:07,343 INFO L290 TraceCheckUtils]: 32: Hoare triple {46102#false} assume !(~y~0 % 4294967296 > 0); {46102#false} is VALID [2022-04-28 10:10:07,344 INFO L272 TraceCheckUtils]: 33: Hoare triple {46102#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {46102#false} is VALID [2022-04-28 10:10:07,344 INFO L290 TraceCheckUtils]: 34: Hoare triple {46102#false} ~cond := #in~cond; {46102#false} is VALID [2022-04-28 10:10:07,344 INFO L290 TraceCheckUtils]: 35: Hoare triple {46102#false} assume 0 == ~cond; {46102#false} is VALID [2022-04-28 10:10:07,344 INFO L290 TraceCheckUtils]: 36: Hoare triple {46102#false} assume !false; {46102#false} is VALID [2022-04-28 10:10:07,344 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-28 10:10:07,344 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:10:07,889 INFO L290 TraceCheckUtils]: 36: Hoare triple {46102#false} assume !false; {46102#false} is VALID [2022-04-28 10:10:07,889 INFO L290 TraceCheckUtils]: 35: Hoare triple {46102#false} assume 0 == ~cond; {46102#false} is VALID [2022-04-28 10:10:07,889 INFO L290 TraceCheckUtils]: 34: Hoare triple {46102#false} ~cond := #in~cond; {46102#false} is VALID [2022-04-28 10:10:07,889 INFO L272 TraceCheckUtils]: 33: Hoare triple {46102#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {46102#false} is VALID [2022-04-28 10:10:07,889 INFO L290 TraceCheckUtils]: 32: Hoare triple {46102#false} assume !(~y~0 % 4294967296 > 0); {46102#false} is VALID [2022-04-28 10:10:07,890 INFO L290 TraceCheckUtils]: 31: Hoare triple {46258#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {46102#false} is VALID [2022-04-28 10:10:07,890 INFO L290 TraceCheckUtils]: 30: Hoare triple {46262#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {46258#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:10:07,891 INFO L290 TraceCheckUtils]: 29: Hoare triple {46266#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {46262#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:10:07,892 INFO L290 TraceCheckUtils]: 28: Hoare triple {46270#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {46266#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-28 10:10:07,892 INFO L290 TraceCheckUtils]: 27: Hoare triple {46274#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {46270#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-28 10:10:07,893 INFO L290 TraceCheckUtils]: 26: Hoare triple {46278#(not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {46274#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:10:07,894 INFO L290 TraceCheckUtils]: 25: Hoare triple {46282#(not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {46278#(not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:10:07,894 INFO L290 TraceCheckUtils]: 24: Hoare triple {46286#(not (< 0 (mod (+ main_~y~0 4294967289) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {46282#(not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:10:07,895 INFO L290 TraceCheckUtils]: 23: Hoare triple {46290#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod main_~z~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {46286#(not (< 0 (mod (+ main_~y~0 4294967289) 4294967296)))} is VALID [2022-04-28 10:10:07,896 INFO L290 TraceCheckUtils]: 22: Hoare triple {46294#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {46290#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-28 10:10:07,897 INFO L290 TraceCheckUtils]: 21: Hoare triple {46298#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {46294#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:10:07,897 INFO L290 TraceCheckUtils]: 20: Hoare triple {46302#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {46298#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)))} is VALID [2022-04-28 10:10:07,899 INFO L290 TraceCheckUtils]: 19: Hoare triple {46306#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {46302#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} is VALID [2022-04-28 10:10:07,899 INFO L290 TraceCheckUtils]: 18: Hoare triple {46310#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {46306#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)))} is VALID [2022-04-28 10:10:07,900 INFO L290 TraceCheckUtils]: 17: Hoare triple {46314#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ 4294967290 main_~z~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {46310#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)))} is VALID [2022-04-28 10:10:07,901 INFO L290 TraceCheckUtils]: 16: Hoare triple {46318#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ main_~z~0 4294967289) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {46314#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ 4294967290 main_~z~0) 4294967296)))} is VALID [2022-04-28 10:10:07,901 INFO L290 TraceCheckUtils]: 15: Hoare triple {46101#true} ~z~0 := ~y~0; {46318#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ main_~z~0 4294967289) 4294967296)))} is VALID [2022-04-28 10:10:07,901 INFO L290 TraceCheckUtils]: 14: Hoare triple {46101#true} assume !(~x~0 % 4294967296 > 0); {46101#true} is VALID [2022-04-28 10:10:07,902 INFO L290 TraceCheckUtils]: 13: Hoare triple {46101#true} 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; {46101#true} is VALID [2022-04-28 10:10:07,902 INFO L290 TraceCheckUtils]: 12: Hoare triple {46101#true} 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; {46101#true} is VALID [2022-04-28 10:10:07,902 INFO L290 TraceCheckUtils]: 11: Hoare triple {46101#true} 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; {46101#true} is VALID [2022-04-28 10:10:07,902 INFO L290 TraceCheckUtils]: 10: Hoare triple {46101#true} 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; {46101#true} is VALID [2022-04-28 10:10:07,902 INFO L290 TraceCheckUtils]: 9: Hoare triple {46101#true} 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; {46101#true} is VALID [2022-04-28 10:10:07,902 INFO L290 TraceCheckUtils]: 8: Hoare triple {46101#true} 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; {46101#true} is VALID [2022-04-28 10:10:07,902 INFO L290 TraceCheckUtils]: 7: Hoare triple {46101#true} 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; {46101#true} is VALID [2022-04-28 10:10:07,902 INFO L290 TraceCheckUtils]: 6: Hoare triple {46101#true} 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; {46101#true} is VALID [2022-04-28 10:10:07,902 INFO L290 TraceCheckUtils]: 5: Hoare triple {46101#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {46101#true} is VALID [2022-04-28 10:10:07,902 INFO L272 TraceCheckUtils]: 4: Hoare triple {46101#true} call #t~ret11 := main(); {46101#true} is VALID [2022-04-28 10:10:07,902 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {46101#true} {46101#true} #61#return; {46101#true} is VALID [2022-04-28 10:10:07,902 INFO L290 TraceCheckUtils]: 2: Hoare triple {46101#true} assume true; {46101#true} is VALID [2022-04-28 10:10:07,902 INFO L290 TraceCheckUtils]: 1: Hoare triple {46101#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(10, 2);call #Ultimate.allocInit(12, 3); {46101#true} is VALID [2022-04-28 10:10:07,902 INFO L272 TraceCheckUtils]: 0: Hoare triple {46101#true} call ULTIMATE.init(); {46101#true} is VALID [2022-04-28 10:10:07,902 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 8 proven. 56 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-28 10:10:07,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [301203033] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:10:07,902 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:10:07,902 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 18] total 44 [2022-04-28 10:10:07,903 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:10:07,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1598568825] [2022-04-28 10:10:07,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1598568825] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:10:07,903 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:10:07,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-28 10:10:07,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457570231] [2022-04-28 10:10:07,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:10:07,903 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 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 37 [2022-04-28 10:10:07,903 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:10:07,903 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 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-28 10:10:07,922 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:10:07,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-28 10:10:07,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:10:07,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-28 10:10:07,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=247, Invalid=1645, Unknown=0, NotChecked=0, Total=1892 [2022-04-28 10:10:07,923 INFO L87 Difference]: Start difference. First operand 118 states and 150 transitions. Second operand has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 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-28 10:10:09,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:09,010 INFO L93 Difference]: Finished difference Result 143 states and 175 transitions. [2022-04-28 10:10:09,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-28 10:10:09,010 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 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 37 [2022-04-28 10:10:09,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:10:09,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 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-28 10:10:09,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 55 transitions. [2022-04-28 10:10:09,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 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-28 10:10:09,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 55 transitions. [2022-04-28 10:10:09,011 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 55 transitions. [2022-04-28 10:10:09,053 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:10:09,055 INFO L225 Difference]: With dead ends: 143 [2022-04-28 10:10:09,055 INFO L226 Difference]: Without dead ends: 129 [2022-04-28 10:10:09,055 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 598 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=419, Invalid=3241, Unknown=0, NotChecked=0, Total=3660 [2022-04-28 10:10:09,055 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 17 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 10:10:09,056 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 68 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 10:10:09,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-04-28 10:10:09,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 119. [2022-04-28 10:10:09,195 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:10:09,195 INFO L82 GeneralOperation]: Start isEquivalent. First operand 129 states. Second operand has 119 states, 114 states have (on average 1.2894736842105263) internal successors, (147), 114 states have internal predecessors, (147), 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-28 10:10:09,195 INFO L74 IsIncluded]: Start isIncluded. First operand 129 states. Second operand has 119 states, 114 states have (on average 1.2894736842105263) internal successors, (147), 114 states have internal predecessors, (147), 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-28 10:10:09,195 INFO L87 Difference]: Start difference. First operand 129 states. Second operand has 119 states, 114 states have (on average 1.2894736842105263) internal successors, (147), 114 states have internal predecessors, (147), 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-28 10:10:09,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:09,196 INFO L93 Difference]: Finished difference Result 129 states and 161 transitions. [2022-04-28 10:10:09,196 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 161 transitions. [2022-04-28 10:10:09,197 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:10:09,197 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:10:09,197 INFO L74 IsIncluded]: Start isIncluded. First operand has 119 states, 114 states have (on average 1.2894736842105263) internal successors, (147), 114 states have internal predecessors, (147), 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 129 states. [2022-04-28 10:10:09,197 INFO L87 Difference]: Start difference. First operand has 119 states, 114 states have (on average 1.2894736842105263) internal successors, (147), 114 states have internal predecessors, (147), 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 129 states. [2022-04-28 10:10:09,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:09,198 INFO L93 Difference]: Finished difference Result 129 states and 161 transitions. [2022-04-28 10:10:09,198 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 161 transitions. [2022-04-28 10:10:09,198 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:10:09,204 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:10:09,204 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:10:09,204 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:10:09,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 114 states have (on average 1.2894736842105263) internal successors, (147), 114 states have internal predecessors, (147), 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-28 10:10:09,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 151 transitions. [2022-04-28 10:10:09,206 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 151 transitions. Word has length 37 [2022-04-28 10:10:09,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:10:09,206 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 151 transitions. [2022-04-28 10:10:09,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 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-28 10:10:09,206 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 119 states and 151 transitions. [2022-04-28 10:10:11,730 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 151 edges. 150 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 10:10:11,731 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 151 transitions. [2022-04-28 10:10:11,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-28 10:10:11,731 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:10:11,731 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:10:11,737 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Forceful destruction successful, exit code 0 [2022-04-28 10:10:11,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64,65 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:10:11,934 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:10:11,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:10:11,935 INFO L85 PathProgramCache]: Analyzing trace with hash 1268390207, now seen corresponding path program 85 times [2022-04-28 10:10:11,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:10:11,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [527375262] [2022-04-28 10:10:11,937 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:10:11,937 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:10:11,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1268390207, now seen corresponding path program 86 times [2022-04-28 10:10:11,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:10:11,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139693824] [2022-04-28 10:10:11,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:10:11,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:10:11,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:12,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:10:12,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:12,181 INFO L290 TraceCheckUtils]: 0: Hoare triple {47206#(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(10, 2);call #Ultimate.allocInit(12, 3); {47185#true} is VALID [2022-04-28 10:10:12,181 INFO L290 TraceCheckUtils]: 1: Hoare triple {47185#true} assume true; {47185#true} is VALID [2022-04-28 10:10:12,181 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {47185#true} {47185#true} #61#return; {47185#true} is VALID [2022-04-28 10:10:12,181 INFO L272 TraceCheckUtils]: 0: Hoare triple {47185#true} call ULTIMATE.init(); {47206#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:10:12,181 INFO L290 TraceCheckUtils]: 1: Hoare triple {47206#(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(10, 2);call #Ultimate.allocInit(12, 3); {47185#true} is VALID [2022-04-28 10:10:12,181 INFO L290 TraceCheckUtils]: 2: Hoare triple {47185#true} assume true; {47185#true} is VALID [2022-04-28 10:10:12,181 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {47185#true} {47185#true} #61#return; {47185#true} is VALID [2022-04-28 10:10:12,181 INFO L272 TraceCheckUtils]: 4: Hoare triple {47185#true} call #t~ret11 := main(); {47185#true} is VALID [2022-04-28 10:10:12,182 INFO L290 TraceCheckUtils]: 5: Hoare triple {47185#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {47190#(= main_~y~0 0)} is VALID [2022-04-28 10:10:12,182 INFO L290 TraceCheckUtils]: 6: Hoare triple {47190#(= 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; {47191#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:10:12,182 INFO L290 TraceCheckUtils]: 7: Hoare triple {47191#(and (<= 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; {47192#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:10:12,183 INFO L290 TraceCheckUtils]: 8: Hoare triple {47192#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {47193#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:10:12,183 INFO L290 TraceCheckUtils]: 9: Hoare triple {47193#(and (<= main_~y~0 3) (<= 3 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; {47194#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:10:12,184 INFO L290 TraceCheckUtils]: 10: Hoare triple {47194#(and (<= main_~y~0 4) (<= 4 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; {47195#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:10:12,184 INFO L290 TraceCheckUtils]: 11: Hoare triple {47195#(and (<= 5 main_~y~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; {47196#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:10:12,185 INFO L290 TraceCheckUtils]: 12: Hoare triple {47196#(and (<= main_~y~0 6) (<= 6 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; {47197#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:10:12,185 INFO L290 TraceCheckUtils]: 13: Hoare triple {47197#(and (<= 7 main_~y~0) (<= main_~y~0 7))} 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; {47198#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:10:12,186 INFO L290 TraceCheckUtils]: 14: Hoare triple {47198#(and (<= main_~y~0 8) (<= 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; {47199#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:10:12,186 INFO L290 TraceCheckUtils]: 15: Hoare triple {47199#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {47199#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:10:12,186 INFO L290 TraceCheckUtils]: 16: Hoare triple {47199#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {47200#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:10:12,187 INFO L290 TraceCheckUtils]: 17: Hoare triple {47200#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {47201#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:10:12,187 INFO L290 TraceCheckUtils]: 18: Hoare triple {47201#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {47202#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:10:12,188 INFO L290 TraceCheckUtils]: 19: Hoare triple {47202#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {47203#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:10:12,188 INFO L290 TraceCheckUtils]: 20: Hoare triple {47203#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {47204#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:10:12,189 INFO L290 TraceCheckUtils]: 21: Hoare triple {47204#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {47205#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:10:12,189 INFO L290 TraceCheckUtils]: 22: Hoare triple {47205#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {47186#false} is VALID [2022-04-28 10:10:12,189 INFO L290 TraceCheckUtils]: 23: Hoare triple {47186#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {47186#false} is VALID [2022-04-28 10:10:12,189 INFO L290 TraceCheckUtils]: 24: Hoare triple {47186#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {47186#false} is VALID [2022-04-28 10:10:12,190 INFO L290 TraceCheckUtils]: 25: Hoare triple {47186#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {47186#false} is VALID [2022-04-28 10:10:12,190 INFO L290 TraceCheckUtils]: 26: Hoare triple {47186#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {47186#false} is VALID [2022-04-28 10:10:12,190 INFO L290 TraceCheckUtils]: 27: Hoare triple {47186#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {47186#false} is VALID [2022-04-28 10:10:12,190 INFO L290 TraceCheckUtils]: 28: Hoare triple {47186#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {47186#false} is VALID [2022-04-28 10:10:12,190 INFO L290 TraceCheckUtils]: 29: Hoare triple {47186#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {47186#false} is VALID [2022-04-28 10:10:12,190 INFO L290 TraceCheckUtils]: 30: Hoare triple {47186#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {47186#false} is VALID [2022-04-28 10:10:12,190 INFO L290 TraceCheckUtils]: 31: Hoare triple {47186#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {47186#false} is VALID [2022-04-28 10:10:12,190 INFO L290 TraceCheckUtils]: 32: Hoare triple {47186#false} assume !(~y~0 % 4294967296 > 0); {47186#false} is VALID [2022-04-28 10:10:12,190 INFO L272 TraceCheckUtils]: 33: Hoare triple {47186#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {47186#false} is VALID [2022-04-28 10:10:12,190 INFO L290 TraceCheckUtils]: 34: Hoare triple {47186#false} ~cond := #in~cond; {47186#false} is VALID [2022-04-28 10:10:12,190 INFO L290 TraceCheckUtils]: 35: Hoare triple {47186#false} assume 0 == ~cond; {47186#false} is VALID [2022-04-28 10:10:12,190 INFO L290 TraceCheckUtils]: 36: Hoare triple {47186#false} assume !false; {47186#false} is VALID [2022-04-28 10:10:12,190 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-04-28 10:10:12,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:10:12,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139693824] [2022-04-28 10:10:12,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139693824] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:10:12,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2058348406] [2022-04-28 10:10:12,190 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:10:12,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:10:12,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:10:12,191 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:10:12,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (66)] Waiting until timeout for monitored process [2022-04-28 10:10:12,231 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:10:12,231 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:10:12,232 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-28 10:10:12,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:12,240 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:10:12,483 INFO L272 TraceCheckUtils]: 0: Hoare triple {47185#true} call ULTIMATE.init(); {47185#true} is VALID [2022-04-28 10:10:12,484 INFO L290 TraceCheckUtils]: 1: Hoare triple {47185#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(10, 2);call #Ultimate.allocInit(12, 3); {47185#true} is VALID [2022-04-28 10:10:12,484 INFO L290 TraceCheckUtils]: 2: Hoare triple {47185#true} assume true; {47185#true} is VALID [2022-04-28 10:10:12,484 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {47185#true} {47185#true} #61#return; {47185#true} is VALID [2022-04-28 10:10:12,484 INFO L272 TraceCheckUtils]: 4: Hoare triple {47185#true} call #t~ret11 := main(); {47185#true} is VALID [2022-04-28 10:10:12,484 INFO L290 TraceCheckUtils]: 5: Hoare triple {47185#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {47190#(= main_~y~0 0)} is VALID [2022-04-28 10:10:12,484 INFO L290 TraceCheckUtils]: 6: Hoare triple {47190#(= 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; {47191#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:10:12,485 INFO L290 TraceCheckUtils]: 7: Hoare triple {47191#(and (<= 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; {47192#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:10:12,485 INFO L290 TraceCheckUtils]: 8: Hoare triple {47192#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {47193#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:10:12,486 INFO L290 TraceCheckUtils]: 9: Hoare triple {47193#(and (<= main_~y~0 3) (<= 3 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; {47194#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:10:12,486 INFO L290 TraceCheckUtils]: 10: Hoare triple {47194#(and (<= main_~y~0 4) (<= 4 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; {47195#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:10:12,487 INFO L290 TraceCheckUtils]: 11: Hoare triple {47195#(and (<= 5 main_~y~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; {47196#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:10:12,487 INFO L290 TraceCheckUtils]: 12: Hoare triple {47196#(and (<= main_~y~0 6) (<= 6 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; {47197#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:10:12,488 INFO L290 TraceCheckUtils]: 13: Hoare triple {47197#(and (<= 7 main_~y~0) (<= main_~y~0 7))} 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; {47198#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:10:12,488 INFO L290 TraceCheckUtils]: 14: Hoare triple {47198#(and (<= main_~y~0 8) (<= 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; {47199#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:10:12,489 INFO L290 TraceCheckUtils]: 15: Hoare triple {47199#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {47199#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:10:12,489 INFO L290 TraceCheckUtils]: 16: Hoare triple {47199#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {47200#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:10:12,489 INFO L290 TraceCheckUtils]: 17: Hoare triple {47200#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {47201#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:10:12,490 INFO L290 TraceCheckUtils]: 18: Hoare triple {47201#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {47202#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:10:12,490 INFO L290 TraceCheckUtils]: 19: Hoare triple {47202#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {47203#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:10:12,491 INFO L290 TraceCheckUtils]: 20: Hoare triple {47203#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {47204#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:10:12,491 INFO L290 TraceCheckUtils]: 21: Hoare triple {47204#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {47273#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:10:12,492 INFO L290 TraceCheckUtils]: 22: Hoare triple {47273#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !(~z~0 % 4294967296 > 0); {47186#false} is VALID [2022-04-28 10:10:12,492 INFO L290 TraceCheckUtils]: 23: Hoare triple {47186#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {47186#false} is VALID [2022-04-28 10:10:12,492 INFO L290 TraceCheckUtils]: 24: Hoare triple {47186#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {47186#false} is VALID [2022-04-28 10:10:12,492 INFO L290 TraceCheckUtils]: 25: Hoare triple {47186#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {47186#false} is VALID [2022-04-28 10:10:12,492 INFO L290 TraceCheckUtils]: 26: Hoare triple {47186#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {47186#false} is VALID [2022-04-28 10:10:12,492 INFO L290 TraceCheckUtils]: 27: Hoare triple {47186#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {47186#false} is VALID [2022-04-28 10:10:12,492 INFO L290 TraceCheckUtils]: 28: Hoare triple {47186#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {47186#false} is VALID [2022-04-28 10:10:12,492 INFO L290 TraceCheckUtils]: 29: Hoare triple {47186#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {47186#false} is VALID [2022-04-28 10:10:12,492 INFO L290 TraceCheckUtils]: 30: Hoare triple {47186#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {47186#false} is VALID [2022-04-28 10:10:12,492 INFO L290 TraceCheckUtils]: 31: Hoare triple {47186#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {47186#false} is VALID [2022-04-28 10:10:12,492 INFO L290 TraceCheckUtils]: 32: Hoare triple {47186#false} assume !(~y~0 % 4294967296 > 0); {47186#false} is VALID [2022-04-28 10:10:12,492 INFO L272 TraceCheckUtils]: 33: Hoare triple {47186#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {47186#false} is VALID [2022-04-28 10:10:12,492 INFO L290 TraceCheckUtils]: 34: Hoare triple {47186#false} ~cond := #in~cond; {47186#false} is VALID [2022-04-28 10:10:12,492 INFO L290 TraceCheckUtils]: 35: Hoare triple {47186#false} assume 0 == ~cond; {47186#false} is VALID [2022-04-28 10:10:12,492 INFO L290 TraceCheckUtils]: 36: Hoare triple {47186#false} assume !false; {47186#false} is VALID [2022-04-28 10:10:12,493 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-04-28 10:10:12,493 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:10:12,920 INFO L290 TraceCheckUtils]: 36: Hoare triple {47186#false} assume !false; {47186#false} is VALID [2022-04-28 10:10:12,920 INFO L290 TraceCheckUtils]: 35: Hoare triple {47186#false} assume 0 == ~cond; {47186#false} is VALID [2022-04-28 10:10:12,920 INFO L290 TraceCheckUtils]: 34: Hoare triple {47186#false} ~cond := #in~cond; {47186#false} is VALID [2022-04-28 10:10:12,920 INFO L272 TraceCheckUtils]: 33: Hoare triple {47186#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {47186#false} is VALID [2022-04-28 10:10:12,920 INFO L290 TraceCheckUtils]: 32: Hoare triple {47186#false} assume !(~y~0 % 4294967296 > 0); {47186#false} is VALID [2022-04-28 10:10:12,920 INFO L290 TraceCheckUtils]: 31: Hoare triple {47186#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {47186#false} is VALID [2022-04-28 10:10:12,920 INFO L290 TraceCheckUtils]: 30: Hoare triple {47186#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {47186#false} is VALID [2022-04-28 10:10:12,920 INFO L290 TraceCheckUtils]: 29: Hoare triple {47186#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {47186#false} is VALID [2022-04-28 10:10:12,920 INFO L290 TraceCheckUtils]: 28: Hoare triple {47186#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {47186#false} is VALID [2022-04-28 10:10:12,920 INFO L290 TraceCheckUtils]: 27: Hoare triple {47186#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {47186#false} is VALID [2022-04-28 10:10:12,920 INFO L290 TraceCheckUtils]: 26: Hoare triple {47186#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {47186#false} is VALID [2022-04-28 10:10:12,921 INFO L290 TraceCheckUtils]: 25: Hoare triple {47186#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {47186#false} is VALID [2022-04-28 10:10:12,921 INFO L290 TraceCheckUtils]: 24: Hoare triple {47186#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {47186#false} is VALID [2022-04-28 10:10:12,921 INFO L290 TraceCheckUtils]: 23: Hoare triple {47186#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {47186#false} is VALID [2022-04-28 10:10:12,921 INFO L290 TraceCheckUtils]: 22: Hoare triple {47361#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {47186#false} is VALID [2022-04-28 10:10:12,922 INFO L290 TraceCheckUtils]: 21: Hoare triple {47365#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {47361#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:10:12,922 INFO L290 TraceCheckUtils]: 20: Hoare triple {47369#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {47365#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:10:12,923 INFO L290 TraceCheckUtils]: 19: Hoare triple {47373#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {47369#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-28 10:10:12,924 INFO L290 TraceCheckUtils]: 18: Hoare triple {47377#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {47373#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-28 10:10:12,924 INFO L290 TraceCheckUtils]: 17: Hoare triple {47381#(< 0 (mod (+ 4294967291 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {47377#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID [2022-04-28 10:10:12,924 INFO L290 TraceCheckUtils]: 16: Hoare triple {47385#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} ~z~0 := ~y~0; {47381#(< 0 (mod (+ 4294967291 main_~z~0) 4294967296))} is VALID [2022-04-28 10:10:12,925 INFO L290 TraceCheckUtils]: 15: Hoare triple {47385#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {47385#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-28 10:10:12,925 INFO L290 TraceCheckUtils]: 14: Hoare triple {47392#(< 0 (mod (+ 4294967292 main_~y~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; {47385#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-28 10:10:12,926 INFO L290 TraceCheckUtils]: 13: Hoare triple {47396#(< 0 (mod (+ main_~y~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; {47392#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-28 10:10:12,927 INFO L290 TraceCheckUtils]: 12: Hoare triple {47400#(< 0 (mod (+ main_~y~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; {47396#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 10:10:12,927 INFO L290 TraceCheckUtils]: 11: Hoare triple {47404#(< 0 (mod (+ main_~y~0 4294967295) 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; {47400#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:10:12,928 INFO L290 TraceCheckUtils]: 10: Hoare triple {47408#(< 0 (mod main_~y~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; {47404#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:10:12,928 INFO L290 TraceCheckUtils]: 9: Hoare triple {47412#(< 0 (mod (+ main_~y~0 1) 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; {47408#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:10:12,929 INFO L290 TraceCheckUtils]: 8: Hoare triple {47416#(< 0 (mod (+ main_~y~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; {47412#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:10:12,930 INFO L290 TraceCheckUtils]: 7: Hoare triple {47420#(< 0 (mod (+ main_~y~0 3) 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; {47416#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:10:12,930 INFO L290 TraceCheckUtils]: 6: Hoare triple {47424#(< 0 (mod (+ main_~y~0 4) 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; {47420#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:10:12,931 INFO L290 TraceCheckUtils]: 5: Hoare triple {47185#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {47424#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:10:12,931 INFO L272 TraceCheckUtils]: 4: Hoare triple {47185#true} call #t~ret11 := main(); {47185#true} is VALID [2022-04-28 10:10:12,931 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {47185#true} {47185#true} #61#return; {47185#true} is VALID [2022-04-28 10:10:12,931 INFO L290 TraceCheckUtils]: 2: Hoare triple {47185#true} assume true; {47185#true} is VALID [2022-04-28 10:10:12,931 INFO L290 TraceCheckUtils]: 1: Hoare triple {47185#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(10, 2);call #Ultimate.allocInit(12, 3); {47185#true} is VALID [2022-04-28 10:10:12,931 INFO L272 TraceCheckUtils]: 0: Hoare triple {47185#true} call ULTIMATE.init(); {47185#true} is VALID [2022-04-28 10:10:12,931 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-04-28 10:10:12,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2058348406] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:10:12,931 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:10:12,931 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 36 [2022-04-28 10:10:12,931 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:10:12,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [527375262] [2022-04-28 10:10:12,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [527375262] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:10:12,932 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:10:12,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-28 10:10:12,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844424422] [2022-04-28 10:10:12,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:10:12,932 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 states have internal predecessors, (25), 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 37 [2022-04-28 10:10:12,932 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:10:12,932 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 states have internal predecessors, (25), 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-28 10:10:12,965 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-28 10:10:12,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-28 10:10:12,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:10:12,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-28 10:10:12,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=1053, Unknown=0, NotChecked=0, Total=1260 [2022-04-28 10:10:12,966 INFO L87 Difference]: Start difference. First operand 119 states and 151 transitions. Second operand has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 states have internal predecessors, (25), 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-28 10:10:14,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:14,420 INFO L93 Difference]: Finished difference Result 146 states and 178 transitions. [2022-04-28 10:10:14,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-28 10:10:14,421 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 states have internal predecessors, (25), 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 37 [2022-04-28 10:10:14,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:10:14,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 states have internal predecessors, (25), 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-28 10:10:14,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 64 transitions. [2022-04-28 10:10:14,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 states have internal predecessors, (25), 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-28 10:10:14,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 64 transitions. [2022-04-28 10:10:14,422 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 64 transitions. [2022-04-28 10:10:14,469 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:10:14,470 INFO L225 Difference]: With dead ends: 146 [2022-04-28 10:10:14,470 INFO L226 Difference]: Without dead ends: 131 [2022-04-28 10:10:14,470 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 326 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=595, Invalid=2597, Unknown=0, NotChecked=0, Total=3192 [2022-04-28 10:10:14,470 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 23 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 685 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 685 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 10:10:14,471 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 100 Invalid, 731 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 685 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 10:10:14,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-04-28 10:10:14,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 120. [2022-04-28 10:10:14,615 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:10:14,615 INFO L82 GeneralOperation]: Start isEquivalent. First operand 131 states. Second operand has 120 states, 115 states have (on average 1.2869565217391303) internal successors, (148), 115 states have internal predecessors, (148), 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-28 10:10:14,615 INFO L74 IsIncluded]: Start isIncluded. First operand 131 states. Second operand has 120 states, 115 states have (on average 1.2869565217391303) internal successors, (148), 115 states have internal predecessors, (148), 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-28 10:10:14,615 INFO L87 Difference]: Start difference. First operand 131 states. Second operand has 120 states, 115 states have (on average 1.2869565217391303) internal successors, (148), 115 states have internal predecessors, (148), 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-28 10:10:14,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:14,616 INFO L93 Difference]: Finished difference Result 131 states and 163 transitions. [2022-04-28 10:10:14,616 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 163 transitions. [2022-04-28 10:10:14,616 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:10:14,616 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:10:14,617 INFO L74 IsIncluded]: Start isIncluded. First operand has 120 states, 115 states have (on average 1.2869565217391303) internal successors, (148), 115 states have internal predecessors, (148), 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 131 states. [2022-04-28 10:10:14,617 INFO L87 Difference]: Start difference. First operand has 120 states, 115 states have (on average 1.2869565217391303) internal successors, (148), 115 states have internal predecessors, (148), 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 131 states. [2022-04-28 10:10:14,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:14,618 INFO L93 Difference]: Finished difference Result 131 states and 163 transitions. [2022-04-28 10:10:14,618 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 163 transitions. [2022-04-28 10:10:14,618 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:10:14,618 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:10:14,618 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:10:14,618 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:10:14,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 115 states have (on average 1.2869565217391303) internal successors, (148), 115 states have internal predecessors, (148), 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-28 10:10:14,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 152 transitions. [2022-04-28 10:10:14,619 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 152 transitions. Word has length 37 [2022-04-28 10:10:14,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:10:14,619 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 152 transitions. [2022-04-28 10:10:14,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 states have internal predecessors, (25), 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-28 10:10:14,619 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 120 states and 152 transitions. [2022-04-28 10:10:15,599 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 152 edges. 152 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:10:15,599 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 152 transitions. [2022-04-28 10:10:15,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-28 10:10:15,599 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:10:15,599 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:10:15,615 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (66)] Forceful destruction successful, exit code 0 [2022-04-28 10:10:15,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 66 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable65 [2022-04-28 10:10:15,800 INFO L420 AbstractCegarLoop]: === Iteration 67 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:10:15,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:10:15,800 INFO L85 PathProgramCache]: Analyzing trace with hash -1252004433, now seen corresponding path program 87 times [2022-04-28 10:10:15,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:10:15,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1861881242] [2022-04-28 10:10:15,802 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:10:15,802 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:10:15,802 INFO L85 PathProgramCache]: Analyzing trace with hash -1252004433, now seen corresponding path program 88 times [2022-04-28 10:10:15,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:10:15,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099235549] [2022-04-28 10:10:15,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:10:15,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:10:15,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:16,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:10:16,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:16,042 INFO L290 TraceCheckUtils]: 0: Hoare triple {48301#(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(10, 2);call #Ultimate.allocInit(12, 3); {48281#true} is VALID [2022-04-28 10:10:16,042 INFO L290 TraceCheckUtils]: 1: Hoare triple {48281#true} assume true; {48281#true} is VALID [2022-04-28 10:10:16,042 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {48281#true} {48281#true} #61#return; {48281#true} is VALID [2022-04-28 10:10:16,042 INFO L272 TraceCheckUtils]: 0: Hoare triple {48281#true} call ULTIMATE.init(); {48301#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:10:16,043 INFO L290 TraceCheckUtils]: 1: Hoare triple {48301#(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(10, 2);call #Ultimate.allocInit(12, 3); {48281#true} is VALID [2022-04-28 10:10:16,043 INFO L290 TraceCheckUtils]: 2: Hoare triple {48281#true} assume true; {48281#true} is VALID [2022-04-28 10:10:16,043 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48281#true} {48281#true} #61#return; {48281#true} is VALID [2022-04-28 10:10:16,043 INFO L272 TraceCheckUtils]: 4: Hoare triple {48281#true} call #t~ret11 := main(); {48281#true} is VALID [2022-04-28 10:10:16,043 INFO L290 TraceCheckUtils]: 5: Hoare triple {48281#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {48286#(= main_~y~0 0)} is VALID [2022-04-28 10:10:16,043 INFO L290 TraceCheckUtils]: 6: Hoare triple {48286#(= 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; {48287#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:10:16,044 INFO L290 TraceCheckUtils]: 7: Hoare triple {48287#(and (<= 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; {48288#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:10:16,044 INFO L290 TraceCheckUtils]: 8: Hoare triple {48288#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {48289#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:10:16,045 INFO L290 TraceCheckUtils]: 9: Hoare triple {48289#(and (<= main_~y~0 3) (<= 3 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; {48290#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:10:16,045 INFO L290 TraceCheckUtils]: 10: Hoare triple {48290#(and (<= main_~y~0 4) (<= 4 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; {48291#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:10:16,046 INFO L290 TraceCheckUtils]: 11: Hoare triple {48291#(and (<= 5 main_~y~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; {48292#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:10:16,046 INFO L290 TraceCheckUtils]: 12: Hoare triple {48292#(and (<= main_~y~0 6) (<= 6 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; {48293#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:10:16,047 INFO L290 TraceCheckUtils]: 13: Hoare triple {48293#(and (<= 7 main_~y~0) (<= main_~y~0 7))} 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; {48294#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:10:16,047 INFO L290 TraceCheckUtils]: 14: Hoare triple {48294#(and (<= main_~y~0 8) (<= 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; {48295#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:10:16,048 INFO L290 TraceCheckUtils]: 15: Hoare triple {48295#(and (<= 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; {48296#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:10:16,048 INFO L290 TraceCheckUtils]: 16: Hoare triple {48296#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {48296#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:10:16,048 INFO L290 TraceCheckUtils]: 17: Hoare triple {48296#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {48297#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:10:16,049 INFO L290 TraceCheckUtils]: 18: Hoare triple {48297#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {48298#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:10:16,049 INFO L290 TraceCheckUtils]: 19: Hoare triple {48298#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {48299#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:10:16,050 INFO L290 TraceCheckUtils]: 20: Hoare triple {48299#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {48300#(and (<= 7 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:10:16,050 INFO L290 TraceCheckUtils]: 21: Hoare triple {48300#(and (<= 7 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {48282#false} is VALID [2022-04-28 10:10:16,050 INFO L290 TraceCheckUtils]: 22: Hoare triple {48282#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {48282#false} is VALID [2022-04-28 10:10:16,050 INFO L290 TraceCheckUtils]: 23: Hoare triple {48282#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {48282#false} is VALID [2022-04-28 10:10:16,050 INFO L290 TraceCheckUtils]: 24: Hoare triple {48282#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {48282#false} is VALID [2022-04-28 10:10:16,050 INFO L290 TraceCheckUtils]: 25: Hoare triple {48282#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {48282#false} is VALID [2022-04-28 10:10:16,050 INFO L290 TraceCheckUtils]: 26: Hoare triple {48282#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {48282#false} is VALID [2022-04-28 10:10:16,050 INFO L290 TraceCheckUtils]: 27: Hoare triple {48282#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {48282#false} is VALID [2022-04-28 10:10:16,050 INFO L290 TraceCheckUtils]: 28: Hoare triple {48282#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {48282#false} is VALID [2022-04-28 10:10:16,051 INFO L290 TraceCheckUtils]: 29: Hoare triple {48282#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {48282#false} is VALID [2022-04-28 10:10:16,051 INFO L290 TraceCheckUtils]: 30: Hoare triple {48282#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {48282#false} is VALID [2022-04-28 10:10:16,051 INFO L290 TraceCheckUtils]: 31: Hoare triple {48282#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {48282#false} is VALID [2022-04-28 10:10:16,051 INFO L290 TraceCheckUtils]: 32: Hoare triple {48282#false} assume !(~y~0 % 4294967296 > 0); {48282#false} is VALID [2022-04-28 10:10:16,051 INFO L272 TraceCheckUtils]: 33: Hoare triple {48282#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {48282#false} is VALID [2022-04-28 10:10:16,051 INFO L290 TraceCheckUtils]: 34: Hoare triple {48282#false} ~cond := #in~cond; {48282#false} is VALID [2022-04-28 10:10:16,051 INFO L290 TraceCheckUtils]: 35: Hoare triple {48282#false} assume 0 == ~cond; {48282#false} is VALID [2022-04-28 10:10:16,051 INFO L290 TraceCheckUtils]: 36: Hoare triple {48282#false} assume !false; {48282#false} is VALID [2022-04-28 10:10:16,051 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 61 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-04-28 10:10:16,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:10:16,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099235549] [2022-04-28 10:10:16,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099235549] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:10:16,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [208172502] [2022-04-28 10:10:16,051 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:10:16,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:10:16,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:10:16,052 INFO L229 MonitoredProcess]: Starting monitored process 67 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:10:16,054 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (67)] Waiting until timeout for monitored process [2022-04-28 10:10:16,092 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:10:16,092 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:10:16,093 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-28 10:10:16,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:16,100 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:10:16,330 INFO L272 TraceCheckUtils]: 0: Hoare triple {48281#true} call ULTIMATE.init(); {48281#true} is VALID [2022-04-28 10:10:16,330 INFO L290 TraceCheckUtils]: 1: Hoare triple {48281#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(10, 2);call #Ultimate.allocInit(12, 3); {48281#true} is VALID [2022-04-28 10:10:16,330 INFO L290 TraceCheckUtils]: 2: Hoare triple {48281#true} assume true; {48281#true} is VALID [2022-04-28 10:10:16,330 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48281#true} {48281#true} #61#return; {48281#true} is VALID [2022-04-28 10:10:16,331 INFO L272 TraceCheckUtils]: 4: Hoare triple {48281#true} call #t~ret11 := main(); {48281#true} is VALID [2022-04-28 10:10:16,331 INFO L290 TraceCheckUtils]: 5: Hoare triple {48281#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {48286#(= main_~y~0 0)} is VALID [2022-04-28 10:10:16,331 INFO L290 TraceCheckUtils]: 6: Hoare triple {48286#(= 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; {48287#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:10:16,332 INFO L290 TraceCheckUtils]: 7: Hoare triple {48287#(and (<= 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; {48288#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:10:16,332 INFO L290 TraceCheckUtils]: 8: Hoare triple {48288#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {48289#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:10:16,333 INFO L290 TraceCheckUtils]: 9: Hoare triple {48289#(and (<= main_~y~0 3) (<= 3 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; {48290#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:10:16,333 INFO L290 TraceCheckUtils]: 10: Hoare triple {48290#(and (<= main_~y~0 4) (<= 4 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; {48291#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:10:16,334 INFO L290 TraceCheckUtils]: 11: Hoare triple {48291#(and (<= 5 main_~y~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; {48292#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:10:16,334 INFO L290 TraceCheckUtils]: 12: Hoare triple {48292#(and (<= main_~y~0 6) (<= 6 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; {48293#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:10:16,335 INFO L290 TraceCheckUtils]: 13: Hoare triple {48293#(and (<= 7 main_~y~0) (<= main_~y~0 7))} 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; {48294#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:10:16,335 INFO L290 TraceCheckUtils]: 14: Hoare triple {48294#(and (<= main_~y~0 8) (<= 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; {48295#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:10:16,336 INFO L290 TraceCheckUtils]: 15: Hoare triple {48295#(and (<= 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; {48296#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:10:16,336 INFO L290 TraceCheckUtils]: 16: Hoare triple {48296#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {48296#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:10:16,336 INFO L290 TraceCheckUtils]: 17: Hoare triple {48296#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {48297#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:10:16,337 INFO L290 TraceCheckUtils]: 18: Hoare triple {48297#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {48298#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:10:16,337 INFO L290 TraceCheckUtils]: 19: Hoare triple {48298#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {48299#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:10:16,338 INFO L290 TraceCheckUtils]: 20: Hoare triple {48299#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {48365#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:10:16,338 INFO L290 TraceCheckUtils]: 21: Hoare triple {48365#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {48282#false} is VALID [2022-04-28 10:10:16,338 INFO L290 TraceCheckUtils]: 22: Hoare triple {48282#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {48282#false} is VALID [2022-04-28 10:10:16,338 INFO L290 TraceCheckUtils]: 23: Hoare triple {48282#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {48282#false} is VALID [2022-04-28 10:10:16,338 INFO L290 TraceCheckUtils]: 24: Hoare triple {48282#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {48282#false} is VALID [2022-04-28 10:10:16,338 INFO L290 TraceCheckUtils]: 25: Hoare triple {48282#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {48282#false} is VALID [2022-04-28 10:10:16,338 INFO L290 TraceCheckUtils]: 26: Hoare triple {48282#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {48282#false} is VALID [2022-04-28 10:10:16,338 INFO L290 TraceCheckUtils]: 27: Hoare triple {48282#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {48282#false} is VALID [2022-04-28 10:10:16,338 INFO L290 TraceCheckUtils]: 28: Hoare triple {48282#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {48282#false} is VALID [2022-04-28 10:10:16,338 INFO L290 TraceCheckUtils]: 29: Hoare triple {48282#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {48282#false} is VALID [2022-04-28 10:10:16,339 INFO L290 TraceCheckUtils]: 30: Hoare triple {48282#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {48282#false} is VALID [2022-04-28 10:10:16,339 INFO L290 TraceCheckUtils]: 31: Hoare triple {48282#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {48282#false} is VALID [2022-04-28 10:10:16,339 INFO L290 TraceCheckUtils]: 32: Hoare triple {48282#false} assume !(~y~0 % 4294967296 > 0); {48282#false} is VALID [2022-04-28 10:10:16,339 INFO L272 TraceCheckUtils]: 33: Hoare triple {48282#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {48282#false} is VALID [2022-04-28 10:10:16,339 INFO L290 TraceCheckUtils]: 34: Hoare triple {48282#false} ~cond := #in~cond; {48282#false} is VALID [2022-04-28 10:10:16,339 INFO L290 TraceCheckUtils]: 35: Hoare triple {48282#false} assume 0 == ~cond; {48282#false} is VALID [2022-04-28 10:10:16,339 INFO L290 TraceCheckUtils]: 36: Hoare triple {48282#false} assume !false; {48282#false} is VALID [2022-04-28 10:10:16,339 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 61 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-04-28 10:10:16,339 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:10:16,735 INFO L290 TraceCheckUtils]: 36: Hoare triple {48282#false} assume !false; {48282#false} is VALID [2022-04-28 10:10:16,735 INFO L290 TraceCheckUtils]: 35: Hoare triple {48282#false} assume 0 == ~cond; {48282#false} is VALID [2022-04-28 10:10:16,735 INFO L290 TraceCheckUtils]: 34: Hoare triple {48282#false} ~cond := #in~cond; {48282#false} is VALID [2022-04-28 10:10:16,735 INFO L272 TraceCheckUtils]: 33: Hoare triple {48282#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {48282#false} is VALID [2022-04-28 10:10:16,735 INFO L290 TraceCheckUtils]: 32: Hoare triple {48282#false} assume !(~y~0 % 4294967296 > 0); {48282#false} is VALID [2022-04-28 10:10:16,735 INFO L290 TraceCheckUtils]: 31: Hoare triple {48282#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {48282#false} is VALID [2022-04-28 10:10:16,735 INFO L290 TraceCheckUtils]: 30: Hoare triple {48282#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {48282#false} is VALID [2022-04-28 10:10:16,735 INFO L290 TraceCheckUtils]: 29: Hoare triple {48282#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {48282#false} is VALID [2022-04-28 10:10:16,736 INFO L290 TraceCheckUtils]: 28: Hoare triple {48282#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {48282#false} is VALID [2022-04-28 10:10:16,736 INFO L290 TraceCheckUtils]: 27: Hoare triple {48282#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {48282#false} is VALID [2022-04-28 10:10:16,736 INFO L290 TraceCheckUtils]: 26: Hoare triple {48282#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {48282#false} is VALID [2022-04-28 10:10:16,736 INFO L290 TraceCheckUtils]: 25: Hoare triple {48282#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {48282#false} is VALID [2022-04-28 10:10:16,736 INFO L290 TraceCheckUtils]: 24: Hoare triple {48282#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {48282#false} is VALID [2022-04-28 10:10:16,736 INFO L290 TraceCheckUtils]: 23: Hoare triple {48282#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {48282#false} is VALID [2022-04-28 10:10:16,736 INFO L290 TraceCheckUtils]: 22: Hoare triple {48282#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {48282#false} is VALID [2022-04-28 10:10:16,736 INFO L290 TraceCheckUtils]: 21: Hoare triple {48459#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {48282#false} is VALID [2022-04-28 10:10:16,737 INFO L290 TraceCheckUtils]: 20: Hoare triple {48463#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {48459#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:10:16,738 INFO L290 TraceCheckUtils]: 19: Hoare triple {48467#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {48463#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:10:16,738 INFO L290 TraceCheckUtils]: 18: Hoare triple {48471#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {48467#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-28 10:10:16,739 INFO L290 TraceCheckUtils]: 17: Hoare triple {48475#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} ~z~0 := ~y~0; {48471#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-28 10:10:16,739 INFO L290 TraceCheckUtils]: 16: Hoare triple {48475#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !(~x~0 % 4294967296 > 0); {48475#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 10:10:16,739 INFO L290 TraceCheckUtils]: 15: Hoare triple {48482#(< 0 (mod (+ main_~y~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; {48475#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 10:10:16,740 INFO L290 TraceCheckUtils]: 14: Hoare triple {48486#(< 0 (mod (+ main_~y~0 4294967295) 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; {48482#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:10:16,741 INFO L290 TraceCheckUtils]: 13: Hoare triple {48490#(< 0 (mod main_~y~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; {48486#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:10:16,741 INFO L290 TraceCheckUtils]: 12: Hoare triple {48494#(< 0 (mod (+ main_~y~0 1) 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; {48490#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:10:16,742 INFO L290 TraceCheckUtils]: 11: Hoare triple {48498#(< 0 (mod (+ main_~y~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; {48494#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:10:16,743 INFO L290 TraceCheckUtils]: 10: Hoare triple {48502#(< 0 (mod (+ main_~y~0 3) 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; {48498#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:10:16,743 INFO L290 TraceCheckUtils]: 9: Hoare triple {48506#(< 0 (mod (+ main_~y~0 4) 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; {48502#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:10:16,744 INFO L290 TraceCheckUtils]: 8: Hoare triple {48510#(< 0 (mod (+ 5 main_~y~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; {48506#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:10:16,744 INFO L290 TraceCheckUtils]: 7: Hoare triple {48514#(< 0 (mod (+ main_~y~0 6) 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; {48510#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:10:16,745 INFO L290 TraceCheckUtils]: 6: Hoare triple {48518#(< 0 (mod (+ 7 main_~y~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; {48514#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:10:16,745 INFO L290 TraceCheckUtils]: 5: Hoare triple {48281#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {48518#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:10:16,745 INFO L272 TraceCheckUtils]: 4: Hoare triple {48281#true} call #t~ret11 := main(); {48281#true} is VALID [2022-04-28 10:10:16,746 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48281#true} {48281#true} #61#return; {48281#true} is VALID [2022-04-28 10:10:16,746 INFO L290 TraceCheckUtils]: 2: Hoare triple {48281#true} assume true; {48281#true} is VALID [2022-04-28 10:10:16,746 INFO L290 TraceCheckUtils]: 1: Hoare triple {48281#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(10, 2);call #Ultimate.allocInit(12, 3); {48281#true} is VALID [2022-04-28 10:10:16,746 INFO L272 TraceCheckUtils]: 0: Hoare triple {48281#true} call ULTIMATE.init(); {48281#true} is VALID [2022-04-28 10:10:16,746 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 61 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-04-28 10:10:16,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [208172502] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:10:16,746 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:10:16,746 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 34 [2022-04-28 10:10:16,746 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:10:16,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1861881242] [2022-04-28 10:10:16,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1861881242] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:10:16,746 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:10:16,746 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-28 10:10:16,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115037104] [2022-04-28 10:10:16,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:10:16,747 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 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 37 [2022-04-28 10:10:16,747 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:10:16,747 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 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-28 10:10:16,763 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:10:16,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-28 10:10:16,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:10:16,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-28 10:10:16,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=916, Unknown=0, NotChecked=0, Total=1122 [2022-04-28 10:10:16,764 INFO L87 Difference]: Start difference. First operand 120 states and 152 transitions. Second operand has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 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-28 10:10:18,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:18,014 INFO L93 Difference]: Finished difference Result 149 states and 181 transitions. [2022-04-28 10:10:18,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-28 10:10:18,015 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 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 37 [2022-04-28 10:10:18,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:10:18,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 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-28 10:10:18,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 68 transitions. [2022-04-28 10:10:18,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 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-28 10:10:18,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 68 transitions. [2022-04-28 10:10:18,016 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 68 transitions. [2022-04-28 10:10:18,067 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:10:18,068 INFO L225 Difference]: With dead ends: 149 [2022-04-28 10:10:18,068 INFO L226 Difference]: Without dead ends: 133 [2022-04-28 10:10:18,068 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=568, Invalid=2294, Unknown=0, NotChecked=0, Total=2862 [2022-04-28 10:10:18,068 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 30 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 563 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 563 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 10:10:18,068 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 82 Invalid, 610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 563 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 10:10:18,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-04-28 10:10:18,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 121. [2022-04-28 10:10:18,193 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:10:18,193 INFO L82 GeneralOperation]: Start isEquivalent. First operand 133 states. Second operand has 121 states, 116 states have (on average 1.2844827586206897) internal successors, (149), 116 states have internal predecessors, (149), 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-28 10:10:18,193 INFO L74 IsIncluded]: Start isIncluded. First operand 133 states. Second operand has 121 states, 116 states have (on average 1.2844827586206897) internal successors, (149), 116 states have internal predecessors, (149), 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-28 10:10:18,193 INFO L87 Difference]: Start difference. First operand 133 states. Second operand has 121 states, 116 states have (on average 1.2844827586206897) internal successors, (149), 116 states have internal predecessors, (149), 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-28 10:10:18,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:18,195 INFO L93 Difference]: Finished difference Result 133 states and 165 transitions. [2022-04-28 10:10:18,195 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 165 transitions. [2022-04-28 10:10:18,195 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:10:18,195 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:10:18,195 INFO L74 IsIncluded]: Start isIncluded. First operand has 121 states, 116 states have (on average 1.2844827586206897) internal successors, (149), 116 states have internal predecessors, (149), 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 133 states. [2022-04-28 10:10:18,195 INFO L87 Difference]: Start difference. First operand has 121 states, 116 states have (on average 1.2844827586206897) internal successors, (149), 116 states have internal predecessors, (149), 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 133 states. [2022-04-28 10:10:18,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:18,196 INFO L93 Difference]: Finished difference Result 133 states and 165 transitions. [2022-04-28 10:10:18,196 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 165 transitions. [2022-04-28 10:10:18,196 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:10:18,196 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:10:18,196 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:10:18,196 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:10:18,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 116 states have (on average 1.2844827586206897) internal successors, (149), 116 states have internal predecessors, (149), 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-28 10:10:18,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 153 transitions. [2022-04-28 10:10:18,197 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 153 transitions. Word has length 37 [2022-04-28 10:10:18,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:10:18,197 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 153 transitions. [2022-04-28 10:10:18,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 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-28 10:10:18,197 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 121 states and 153 transitions. [2022-04-28 10:10:21,008 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 153 edges. 153 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:10:21,008 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 153 transitions. [2022-04-28 10:10:21,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-28 10:10:21,008 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:10:21,008 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:10:21,025 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (67)] Forceful destruction successful, exit code 0 [2022-04-28 10:10:21,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 67 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable66 [2022-04-28 10:10:21,212 INFO L420 AbstractCegarLoop]: === Iteration 68 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:10:21,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:10:21,213 INFO L85 PathProgramCache]: Analyzing trace with hash -119674113, now seen corresponding path program 89 times [2022-04-28 10:10:21,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:10:21,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1144915752] [2022-04-28 10:10:21,214 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:10:21,215 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:10:21,215 INFO L85 PathProgramCache]: Analyzing trace with hash -119674113, now seen corresponding path program 90 times [2022-04-28 10:10:21,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:10:21,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356107526] [2022-04-28 10:10:21,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:10:21,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:10:21,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:21,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:10:21,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:21,416 INFO L290 TraceCheckUtils]: 0: Hoare triple {49404#(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(10, 2);call #Ultimate.allocInit(12, 3); {49385#true} is VALID [2022-04-28 10:10:21,416 INFO L290 TraceCheckUtils]: 1: Hoare triple {49385#true} assume true; {49385#true} is VALID [2022-04-28 10:10:21,416 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {49385#true} {49385#true} #61#return; {49385#true} is VALID [2022-04-28 10:10:21,417 INFO L272 TraceCheckUtils]: 0: Hoare triple {49385#true} call ULTIMATE.init(); {49404#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:10:21,417 INFO L290 TraceCheckUtils]: 1: Hoare triple {49404#(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(10, 2);call #Ultimate.allocInit(12, 3); {49385#true} is VALID [2022-04-28 10:10:21,417 INFO L290 TraceCheckUtils]: 2: Hoare triple {49385#true} assume true; {49385#true} is VALID [2022-04-28 10:10:21,417 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {49385#true} {49385#true} #61#return; {49385#true} is VALID [2022-04-28 10:10:21,417 INFO L272 TraceCheckUtils]: 4: Hoare triple {49385#true} call #t~ret11 := main(); {49385#true} is VALID [2022-04-28 10:10:21,417 INFO L290 TraceCheckUtils]: 5: Hoare triple {49385#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {49390#(= main_~y~0 0)} is VALID [2022-04-28 10:10:21,418 INFO L290 TraceCheckUtils]: 6: Hoare triple {49390#(= 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; {49391#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:10:21,418 INFO L290 TraceCheckUtils]: 7: Hoare triple {49391#(and (<= 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; {49392#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:10:21,419 INFO L290 TraceCheckUtils]: 8: Hoare triple {49392#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {49393#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:10:21,419 INFO L290 TraceCheckUtils]: 9: Hoare triple {49393#(and (<= main_~y~0 3) (<= 3 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; {49394#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:10:21,420 INFO L290 TraceCheckUtils]: 10: Hoare triple {49394#(and (<= main_~y~0 4) (<= 4 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; {49395#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:10:21,420 INFO L290 TraceCheckUtils]: 11: Hoare triple {49395#(and (<= 5 main_~y~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; {49396#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:10:21,421 INFO L290 TraceCheckUtils]: 12: Hoare triple {49396#(and (<= main_~y~0 6) (<= 6 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; {49397#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:10:21,421 INFO L290 TraceCheckUtils]: 13: Hoare triple {49397#(and (<= 7 main_~y~0) (<= main_~y~0 7))} 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; {49398#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:10:21,422 INFO L290 TraceCheckUtils]: 14: Hoare triple {49398#(and (<= main_~y~0 8) (<= 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; {49399#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:10:21,422 INFO L290 TraceCheckUtils]: 15: Hoare triple {49399#(and (<= 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; {49400#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:10:21,423 INFO L290 TraceCheckUtils]: 16: Hoare triple {49400#(and (<= main_~y~0 10) (<= 10 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; {49401#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:10:21,423 INFO L290 TraceCheckUtils]: 17: Hoare triple {49401#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {49401#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:10:21,423 INFO L290 TraceCheckUtils]: 18: Hoare triple {49401#(and (<= main_~y~0 11) (<= 11 main_~y~0))} ~z~0 := ~y~0; {49402#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-28 10:10:21,424 INFO L290 TraceCheckUtils]: 19: Hoare triple {49402#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {49403#(and (<= 10 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:10:21,424 INFO L290 TraceCheckUtils]: 20: Hoare triple {49403#(and (<= 10 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {49386#false} is VALID [2022-04-28 10:10:21,424 INFO L290 TraceCheckUtils]: 21: Hoare triple {49386#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {49386#false} is VALID [2022-04-28 10:10:21,424 INFO L290 TraceCheckUtils]: 22: Hoare triple {49386#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {49386#false} is VALID [2022-04-28 10:10:21,424 INFO L290 TraceCheckUtils]: 23: Hoare triple {49386#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {49386#false} is VALID [2022-04-28 10:10:21,424 INFO L290 TraceCheckUtils]: 24: Hoare triple {49386#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {49386#false} is VALID [2022-04-28 10:10:21,424 INFO L290 TraceCheckUtils]: 25: Hoare triple {49386#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {49386#false} is VALID [2022-04-28 10:10:21,424 INFO L290 TraceCheckUtils]: 26: Hoare triple {49386#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {49386#false} is VALID [2022-04-28 10:10:21,424 INFO L290 TraceCheckUtils]: 27: Hoare triple {49386#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {49386#false} is VALID [2022-04-28 10:10:21,424 INFO L290 TraceCheckUtils]: 28: Hoare triple {49386#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {49386#false} is VALID [2022-04-28 10:10:21,425 INFO L290 TraceCheckUtils]: 29: Hoare triple {49386#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {49386#false} is VALID [2022-04-28 10:10:21,425 INFO L290 TraceCheckUtils]: 30: Hoare triple {49386#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {49386#false} is VALID [2022-04-28 10:10:21,425 INFO L290 TraceCheckUtils]: 31: Hoare triple {49386#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {49386#false} is VALID [2022-04-28 10:10:21,425 INFO L290 TraceCheckUtils]: 32: Hoare triple {49386#false} assume !(~y~0 % 4294967296 > 0); {49386#false} is VALID [2022-04-28 10:10:21,425 INFO L272 TraceCheckUtils]: 33: Hoare triple {49386#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {49386#false} is VALID [2022-04-28 10:10:21,425 INFO L290 TraceCheckUtils]: 34: Hoare triple {49386#false} ~cond := #in~cond; {49386#false} is VALID [2022-04-28 10:10:21,425 INFO L290 TraceCheckUtils]: 35: Hoare triple {49386#false} assume 0 == ~cond; {49386#false} is VALID [2022-04-28 10:10:21,425 INFO L290 TraceCheckUtils]: 36: Hoare triple {49386#false} assume !false; {49386#false} is VALID [2022-04-28 10:10:21,425 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 67 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-04-28 10:10:21,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:10:21,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356107526] [2022-04-28 10:10:21,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356107526] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:10:21,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1311284940] [2022-04-28 10:10:21,425 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:10:21,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:10:21,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:10:21,426 INFO L229 MonitoredProcess]: Starting monitored process 68 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:10:21,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (68)] Waiting until timeout for monitored process [2022-04-28 10:10:21,480 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-28 10:10:21,480 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:10:21,481 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-28 10:10:21,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:21,489 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:10:21,602 INFO L272 TraceCheckUtils]: 0: Hoare triple {49385#true} call ULTIMATE.init(); {49385#true} is VALID [2022-04-28 10:10:21,602 INFO L290 TraceCheckUtils]: 1: Hoare triple {49385#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(10, 2);call #Ultimate.allocInit(12, 3); {49385#true} is VALID [2022-04-28 10:10:21,602 INFO L290 TraceCheckUtils]: 2: Hoare triple {49385#true} assume true; {49385#true} is VALID [2022-04-28 10:10:21,602 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {49385#true} {49385#true} #61#return; {49385#true} is VALID [2022-04-28 10:10:21,602 INFO L272 TraceCheckUtils]: 4: Hoare triple {49385#true} call #t~ret11 := main(); {49385#true} is VALID [2022-04-28 10:10:21,602 INFO L290 TraceCheckUtils]: 5: Hoare triple {49385#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {49385#true} is VALID [2022-04-28 10:10:21,602 INFO L290 TraceCheckUtils]: 6: Hoare triple {49385#true} 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; {49385#true} is VALID [2022-04-28 10:10:21,602 INFO L290 TraceCheckUtils]: 7: Hoare triple {49385#true} 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; {49385#true} is VALID [2022-04-28 10:10:21,602 INFO L290 TraceCheckUtils]: 8: Hoare triple {49385#true} 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; {49385#true} is VALID [2022-04-28 10:10:21,602 INFO L290 TraceCheckUtils]: 9: Hoare triple {49385#true} 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; {49385#true} is VALID [2022-04-28 10:10:21,603 INFO L290 TraceCheckUtils]: 10: Hoare triple {49385#true} 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; {49385#true} is VALID [2022-04-28 10:10:21,603 INFO L290 TraceCheckUtils]: 11: Hoare triple {49385#true} 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; {49385#true} is VALID [2022-04-28 10:10:21,603 INFO L290 TraceCheckUtils]: 12: Hoare triple {49385#true} 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; {49385#true} is VALID [2022-04-28 10:10:21,603 INFO L290 TraceCheckUtils]: 13: Hoare triple {49385#true} 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; {49385#true} is VALID [2022-04-28 10:10:21,603 INFO L290 TraceCheckUtils]: 14: Hoare triple {49385#true} 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; {49385#true} is VALID [2022-04-28 10:10:21,603 INFO L290 TraceCheckUtils]: 15: Hoare triple {49385#true} 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; {49385#true} is VALID [2022-04-28 10:10:21,603 INFO L290 TraceCheckUtils]: 16: Hoare triple {49385#true} 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; {49385#true} is VALID [2022-04-28 10:10:21,603 INFO L290 TraceCheckUtils]: 17: Hoare triple {49385#true} assume !(~x~0 % 4294967296 > 0); {49385#true} is VALID [2022-04-28 10:10:21,603 INFO L290 TraceCheckUtils]: 18: Hoare triple {49385#true} ~z~0 := ~y~0; {49462#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 10:10:21,603 INFO L290 TraceCheckUtils]: 19: Hoare triple {49462#(= main_~z~0 main_~y~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {49466#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-28 10:10:21,604 INFO L290 TraceCheckUtils]: 20: Hoare triple {49466#(= main_~y~0 (+ main_~z~0 1))} assume !(~z~0 % 4294967296 > 0); {49470#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:10:21,605 INFO L290 TraceCheckUtils]: 21: Hoare triple {49470#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {49474#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:10:21,605 INFO L290 TraceCheckUtils]: 22: Hoare triple {49474#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {49386#false} is VALID [2022-04-28 10:10:21,605 INFO L290 TraceCheckUtils]: 23: Hoare triple {49386#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {49386#false} is VALID [2022-04-28 10:10:21,605 INFO L290 TraceCheckUtils]: 24: Hoare triple {49386#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {49386#false} is VALID [2022-04-28 10:10:21,605 INFO L290 TraceCheckUtils]: 25: Hoare triple {49386#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {49386#false} is VALID [2022-04-28 10:10:21,605 INFO L290 TraceCheckUtils]: 26: Hoare triple {49386#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {49386#false} is VALID [2022-04-28 10:10:21,605 INFO L290 TraceCheckUtils]: 27: Hoare triple {49386#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {49386#false} is VALID [2022-04-28 10:10:21,605 INFO L290 TraceCheckUtils]: 28: Hoare triple {49386#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {49386#false} is VALID [2022-04-28 10:10:21,605 INFO L290 TraceCheckUtils]: 29: Hoare triple {49386#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {49386#false} is VALID [2022-04-28 10:10:21,606 INFO L290 TraceCheckUtils]: 30: Hoare triple {49386#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {49386#false} is VALID [2022-04-28 10:10:21,606 INFO L290 TraceCheckUtils]: 31: Hoare triple {49386#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {49386#false} is VALID [2022-04-28 10:10:21,606 INFO L290 TraceCheckUtils]: 32: Hoare triple {49386#false} assume !(~y~0 % 4294967296 > 0); {49386#false} is VALID [2022-04-28 10:10:21,606 INFO L272 TraceCheckUtils]: 33: Hoare triple {49386#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {49386#false} is VALID [2022-04-28 10:10:21,606 INFO L290 TraceCheckUtils]: 34: Hoare triple {49386#false} ~cond := #in~cond; {49386#false} is VALID [2022-04-28 10:10:21,606 INFO L290 TraceCheckUtils]: 35: Hoare triple {49386#false} assume 0 == ~cond; {49386#false} is VALID [2022-04-28 10:10:21,606 INFO L290 TraceCheckUtils]: 36: Hoare triple {49386#false} assume !false; {49386#false} is VALID [2022-04-28 10:10:21,606 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2022-04-28 10:10:21,606 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:10:21,723 INFO L290 TraceCheckUtils]: 36: Hoare triple {49386#false} assume !false; {49386#false} is VALID [2022-04-28 10:10:21,724 INFO L290 TraceCheckUtils]: 35: Hoare triple {49386#false} assume 0 == ~cond; {49386#false} is VALID [2022-04-28 10:10:21,724 INFO L290 TraceCheckUtils]: 34: Hoare triple {49386#false} ~cond := #in~cond; {49386#false} is VALID [2022-04-28 10:10:21,724 INFO L272 TraceCheckUtils]: 33: Hoare triple {49386#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {49386#false} is VALID [2022-04-28 10:10:21,724 INFO L290 TraceCheckUtils]: 32: Hoare triple {49386#false} assume !(~y~0 % 4294967296 > 0); {49386#false} is VALID [2022-04-28 10:10:21,724 INFO L290 TraceCheckUtils]: 31: Hoare triple {49386#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {49386#false} is VALID [2022-04-28 10:10:21,724 INFO L290 TraceCheckUtils]: 30: Hoare triple {49386#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {49386#false} is VALID [2022-04-28 10:10:21,724 INFO L290 TraceCheckUtils]: 29: Hoare triple {49386#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {49386#false} is VALID [2022-04-28 10:10:21,724 INFO L290 TraceCheckUtils]: 28: Hoare triple {49386#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {49386#false} is VALID [2022-04-28 10:10:21,724 INFO L290 TraceCheckUtils]: 27: Hoare triple {49386#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {49386#false} is VALID [2022-04-28 10:10:21,724 INFO L290 TraceCheckUtils]: 26: Hoare triple {49386#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {49386#false} is VALID [2022-04-28 10:10:21,724 INFO L290 TraceCheckUtils]: 25: Hoare triple {49386#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {49386#false} is VALID [2022-04-28 10:10:21,724 INFO L290 TraceCheckUtils]: 24: Hoare triple {49386#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {49386#false} is VALID [2022-04-28 10:10:21,724 INFO L290 TraceCheckUtils]: 23: Hoare triple {49386#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {49386#false} is VALID [2022-04-28 10:10:21,724 INFO L290 TraceCheckUtils]: 22: Hoare triple {49474#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {49386#false} is VALID [2022-04-28 10:10:21,725 INFO L290 TraceCheckUtils]: 21: Hoare triple {49470#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {49474#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:10:21,725 INFO L290 TraceCheckUtils]: 20: Hoare triple {49568#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {49470#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:10:21,727 INFO L290 TraceCheckUtils]: 19: Hoare triple {49572#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {49568#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-28 10:10:21,727 INFO L290 TraceCheckUtils]: 18: Hoare triple {49385#true} ~z~0 := ~y~0; {49572#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-28 10:10:21,727 INFO L290 TraceCheckUtils]: 17: Hoare triple {49385#true} assume !(~x~0 % 4294967296 > 0); {49385#true} is VALID [2022-04-28 10:10:21,727 INFO L290 TraceCheckUtils]: 16: Hoare triple {49385#true} 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; {49385#true} is VALID [2022-04-28 10:10:21,727 INFO L290 TraceCheckUtils]: 15: Hoare triple {49385#true} 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; {49385#true} is VALID [2022-04-28 10:10:21,727 INFO L290 TraceCheckUtils]: 14: Hoare triple {49385#true} 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; {49385#true} is VALID [2022-04-28 10:10:21,727 INFO L290 TraceCheckUtils]: 13: Hoare triple {49385#true} 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; {49385#true} is VALID [2022-04-28 10:10:21,727 INFO L290 TraceCheckUtils]: 12: Hoare triple {49385#true} 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; {49385#true} is VALID [2022-04-28 10:10:21,727 INFO L290 TraceCheckUtils]: 11: Hoare triple {49385#true} 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; {49385#true} is VALID [2022-04-28 10:10:21,727 INFO L290 TraceCheckUtils]: 10: Hoare triple {49385#true} 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; {49385#true} is VALID [2022-04-28 10:10:21,727 INFO L290 TraceCheckUtils]: 9: Hoare triple {49385#true} 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; {49385#true} is VALID [2022-04-28 10:10:21,728 INFO L290 TraceCheckUtils]: 8: Hoare triple {49385#true} 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; {49385#true} is VALID [2022-04-28 10:10:21,728 INFO L290 TraceCheckUtils]: 7: Hoare triple {49385#true} 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; {49385#true} is VALID [2022-04-28 10:10:21,728 INFO L290 TraceCheckUtils]: 6: Hoare triple {49385#true} 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; {49385#true} is VALID [2022-04-28 10:10:21,728 INFO L290 TraceCheckUtils]: 5: Hoare triple {49385#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {49385#true} is VALID [2022-04-28 10:10:21,728 INFO L272 TraceCheckUtils]: 4: Hoare triple {49385#true} call #t~ret11 := main(); {49385#true} is VALID [2022-04-28 10:10:21,728 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {49385#true} {49385#true} #61#return; {49385#true} is VALID [2022-04-28 10:10:21,728 INFO L290 TraceCheckUtils]: 2: Hoare triple {49385#true} assume true; {49385#true} is VALID [2022-04-28 10:10:21,728 INFO L290 TraceCheckUtils]: 1: Hoare triple {49385#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(10, 2);call #Ultimate.allocInit(12, 3); {49385#true} is VALID [2022-04-28 10:10:21,728 INFO L272 TraceCheckUtils]: 0: Hoare triple {49385#true} call ULTIMATE.init(); {49385#true} is VALID [2022-04-28 10:10:21,728 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2022-04-28 10:10:21,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1311284940] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:10:21,728 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:10:21,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 6, 6] total 23 [2022-04-28 10:10:21,728 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:10:21,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1144915752] [2022-04-28 10:10:21,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1144915752] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:10:21,728 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:10:21,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-28 10:10:21,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960655521] [2022-04-28 10:10:21,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:10:21,729 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 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 37 [2022-04-28 10:10:21,729 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:10:21,729 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 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-28 10:10:21,745 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:10:21,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-28 10:10:21,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:10:21,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-28 10:10:21,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=450, Unknown=0, NotChecked=0, Total=506 [2022-04-28 10:10:21,745 INFO L87 Difference]: Start difference. First operand 121 states and 153 transitions. Second operand has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 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-28 10:10:22,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:22,956 INFO L93 Difference]: Finished difference Result 152 states and 184 transitions. [2022-04-28 10:10:22,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-28 10:10:22,956 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 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 37 [2022-04-28 10:10:22,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:10:22,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 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-28 10:10:22,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 68 transitions. [2022-04-28 10:10:22,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 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-28 10:10:22,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 68 transitions. [2022-04-28 10:10:22,958 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 68 transitions. [2022-04-28 10:10:23,008 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:10:23,009 INFO L225 Difference]: With dead ends: 152 [2022-04-28 10:10:23,009 INFO L226 Difference]: Without dead ends: 135 [2022-04-28 10:10:23,009 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=135, Invalid=1271, Unknown=0, NotChecked=0, Total=1406 [2022-04-28 10:10:23,010 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 39 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 604 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 10:10:23,010 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 89 Invalid, 638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 604 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 10:10:23,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-04-28 10:10:23,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 122. [2022-04-28 10:10:23,136 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:10:23,137 INFO L82 GeneralOperation]: Start isEquivalent. First operand 135 states. Second operand has 122 states, 117 states have (on average 1.2820512820512822) internal successors, (150), 117 states have internal predecessors, (150), 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-28 10:10:23,137 INFO L74 IsIncluded]: Start isIncluded. First operand 135 states. Second operand has 122 states, 117 states have (on average 1.2820512820512822) internal successors, (150), 117 states have internal predecessors, (150), 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-28 10:10:23,137 INFO L87 Difference]: Start difference. First operand 135 states. Second operand has 122 states, 117 states have (on average 1.2820512820512822) internal successors, (150), 117 states have internal predecessors, (150), 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-28 10:10:23,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:23,138 INFO L93 Difference]: Finished difference Result 135 states and 167 transitions. [2022-04-28 10:10:23,138 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 167 transitions. [2022-04-28 10:10:23,138 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:10:23,138 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:10:23,138 INFO L74 IsIncluded]: Start isIncluded. First operand has 122 states, 117 states have (on average 1.2820512820512822) internal successors, (150), 117 states have internal predecessors, (150), 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 135 states. [2022-04-28 10:10:23,138 INFO L87 Difference]: Start difference. First operand has 122 states, 117 states have (on average 1.2820512820512822) internal successors, (150), 117 states have internal predecessors, (150), 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 135 states. [2022-04-28 10:10:23,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:23,139 INFO L93 Difference]: Finished difference Result 135 states and 167 transitions. [2022-04-28 10:10:23,139 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 167 transitions. [2022-04-28 10:10:23,139 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:10:23,139 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:10:23,139 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:10:23,140 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:10:23,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 117 states have (on average 1.2820512820512822) internal successors, (150), 117 states have internal predecessors, (150), 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-28 10:10:23,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 154 transitions. [2022-04-28 10:10:23,141 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 154 transitions. Word has length 37 [2022-04-28 10:10:23,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:10:23,141 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 154 transitions. [2022-04-28 10:10:23,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 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-28 10:10:23,141 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 122 states and 154 transitions. [2022-04-28 10:10:25,758 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 154 edges. 154 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:10:25,759 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 154 transitions. [2022-04-28 10:10:25,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-28 10:10:25,759 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:10:25,759 INFO L195 NwaCegarLoop]: trace histogram [23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:10:25,775 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (68)] Forceful destruction successful, exit code 0 [2022-04-28 10:10:25,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 68 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable67 [2022-04-28 10:10:25,971 INFO L420 AbstractCegarLoop]: === Iteration 69 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:10:25,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:10:25,971 INFO L85 PathProgramCache]: Analyzing trace with hash -1023324338, now seen corresponding path program 45 times [2022-04-28 10:10:25,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:10:25,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1832415583] [2022-04-28 10:10:25,974 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:10:25,974 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:10:25,974 INFO L85 PathProgramCache]: Analyzing trace with hash -1023324338, now seen corresponding path program 46 times [2022-04-28 10:10:25,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:10:25,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312106390] [2022-04-28 10:10:25,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:10:25,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:10:25,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:26,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:10:26,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:26,441 INFO L290 TraceCheckUtils]: 0: Hoare triple {50510#(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(10, 2);call #Ultimate.allocInit(12, 3); {50480#true} is VALID [2022-04-28 10:10:26,441 INFO L290 TraceCheckUtils]: 1: Hoare triple {50480#true} assume true; {50480#true} is VALID [2022-04-28 10:10:26,441 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {50480#true} {50480#true} #61#return; {50480#true} is VALID [2022-04-28 10:10:26,442 INFO L272 TraceCheckUtils]: 0: Hoare triple {50480#true} call ULTIMATE.init(); {50510#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:10:26,442 INFO L290 TraceCheckUtils]: 1: Hoare triple {50510#(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(10, 2);call #Ultimate.allocInit(12, 3); {50480#true} is VALID [2022-04-28 10:10:26,442 INFO L290 TraceCheckUtils]: 2: Hoare triple {50480#true} assume true; {50480#true} is VALID [2022-04-28 10:10:26,442 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {50480#true} {50480#true} #61#return; {50480#true} is VALID [2022-04-28 10:10:26,442 INFO L272 TraceCheckUtils]: 4: Hoare triple {50480#true} call #t~ret11 := main(); {50480#true} is VALID [2022-04-28 10:10:26,442 INFO L290 TraceCheckUtils]: 5: Hoare triple {50480#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {50485#(= main_~y~0 0)} is VALID [2022-04-28 10:10:26,443 INFO L290 TraceCheckUtils]: 6: Hoare triple {50485#(= 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; {50486#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:10:26,443 INFO L290 TraceCheckUtils]: 7: Hoare triple {50486#(and (<= 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; {50487#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:10:26,444 INFO L290 TraceCheckUtils]: 8: Hoare triple {50487#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {50488#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:10:26,444 INFO L290 TraceCheckUtils]: 9: Hoare triple {50488#(and (<= main_~y~0 3) (<= 3 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; {50489#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:10:26,445 INFO L290 TraceCheckUtils]: 10: Hoare triple {50489#(and (<= main_~y~0 4) (<= 4 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; {50490#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:10:26,445 INFO L290 TraceCheckUtils]: 11: Hoare triple {50490#(and (<= 5 main_~y~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; {50491#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:10:26,446 INFO L290 TraceCheckUtils]: 12: Hoare triple {50491#(and (<= main_~y~0 6) (<= 6 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; {50492#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:10:26,446 INFO L290 TraceCheckUtils]: 13: Hoare triple {50492#(and (<= 7 main_~y~0) (<= main_~y~0 7))} 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; {50493#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:10:26,447 INFO L290 TraceCheckUtils]: 14: Hoare triple {50493#(and (<= main_~y~0 8) (<= 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; {50494#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:10:26,447 INFO L290 TraceCheckUtils]: 15: Hoare triple {50494#(and (<= 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; {50495#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:10:26,448 INFO L290 TraceCheckUtils]: 16: Hoare triple {50495#(and (<= main_~y~0 10) (<= 10 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; {50496#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:10:26,448 INFO L290 TraceCheckUtils]: 17: Hoare triple {50496#(and (<= main_~y~0 11) (<= 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; {50497#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:10:26,448 INFO L290 TraceCheckUtils]: 18: Hoare triple {50497#(and (<= 12 main_~y~0) (<= main_~y~0 12))} 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; {50498#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:10:26,449 INFO L290 TraceCheckUtils]: 19: Hoare triple {50498#(and (<= main_~y~0 13) (<= 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; {50499#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:10:26,449 INFO L290 TraceCheckUtils]: 20: Hoare triple {50499#(and (<= 14 main_~y~0) (<= main_~y~0 14))} 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; {50500#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:10:26,450 INFO L290 TraceCheckUtils]: 21: Hoare triple {50500#(and (<= main_~y~0 15) (<= 15 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; {50501#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:10:26,450 INFO L290 TraceCheckUtils]: 22: Hoare triple {50501#(and (<= 16 main_~y~0) (<= main_~y~0 16))} 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; {50502#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:10:26,451 INFO L290 TraceCheckUtils]: 23: Hoare triple {50502#(and (<= main_~y~0 17) (<= 17 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; {50503#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 10:10:26,451 INFO L290 TraceCheckUtils]: 24: Hoare triple {50503#(and (<= 18 main_~y~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; {50504#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 10:10:26,452 INFO L290 TraceCheckUtils]: 25: Hoare triple {50504#(and (<= 19 main_~y~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; {50505#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 10:10:26,452 INFO L290 TraceCheckUtils]: 26: Hoare triple {50505#(and (<= 20 main_~y~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; {50506#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 10:10:26,453 INFO L290 TraceCheckUtils]: 27: Hoare triple {50506#(and (<= main_~y~0 21) (<= 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; {50507#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 10:10:26,453 INFO L290 TraceCheckUtils]: 28: Hoare triple {50507#(and (<= main_~y~0 22) (<= 22 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; {50508#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 10:10:26,454 INFO L290 TraceCheckUtils]: 29: Hoare triple {50508#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {50508#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 10:10:26,454 INFO L290 TraceCheckUtils]: 30: Hoare triple {50508#(and (<= main_~y~0 23) (<= 23 main_~y~0))} ~z~0 := ~y~0; {50509#(and (<= (div main_~z~0 4294967296) 0) (<= 23 main_~z~0))} is VALID [2022-04-28 10:10:26,454 INFO L290 TraceCheckUtils]: 31: Hoare triple {50509#(and (<= (div main_~z~0 4294967296) 0) (<= 23 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {50481#false} is VALID [2022-04-28 10:10:26,455 INFO L290 TraceCheckUtils]: 32: Hoare triple {50481#false} assume !(~y~0 % 4294967296 > 0); {50481#false} is VALID [2022-04-28 10:10:26,455 INFO L272 TraceCheckUtils]: 33: Hoare triple {50481#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {50481#false} is VALID [2022-04-28 10:10:26,455 INFO L290 TraceCheckUtils]: 34: Hoare triple {50481#false} ~cond := #in~cond; {50481#false} is VALID [2022-04-28 10:10:26,455 INFO L290 TraceCheckUtils]: 35: Hoare triple {50481#false} assume 0 == ~cond; {50481#false} is VALID [2022-04-28 10:10:26,455 INFO L290 TraceCheckUtils]: 36: Hoare triple {50481#false} assume !false; {50481#false} is VALID [2022-04-28 10:10:26,455 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:10:26,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:10:26,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312106390] [2022-04-28 10:10:26,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312106390] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:10:26,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1865993113] [2022-04-28 10:10:26,455 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:10:26,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:10:26,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:10:26,456 INFO L229 MonitoredProcess]: Starting monitored process 69 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:10:26,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (69)] Waiting until timeout for monitored process [2022-04-28 10:10:26,495 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:10:26,496 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:10:26,496 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 51 conjunts are in the unsatisfiable core [2022-04-28 10:10:26,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:26,505 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:10:26,817 INFO L272 TraceCheckUtils]: 0: Hoare triple {50480#true} call ULTIMATE.init(); {50480#true} is VALID [2022-04-28 10:10:26,817 INFO L290 TraceCheckUtils]: 1: Hoare triple {50480#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(10, 2);call #Ultimate.allocInit(12, 3); {50480#true} is VALID [2022-04-28 10:10:26,817 INFO L290 TraceCheckUtils]: 2: Hoare triple {50480#true} assume true; {50480#true} is VALID [2022-04-28 10:10:26,817 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {50480#true} {50480#true} #61#return; {50480#true} is VALID [2022-04-28 10:10:26,817 INFO L272 TraceCheckUtils]: 4: Hoare triple {50480#true} call #t~ret11 := main(); {50480#true} is VALID [2022-04-28 10:10:26,817 INFO L290 TraceCheckUtils]: 5: Hoare triple {50480#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {50485#(= main_~y~0 0)} is VALID [2022-04-28 10:10:26,818 INFO L290 TraceCheckUtils]: 6: Hoare triple {50485#(= 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; {50486#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:10:26,818 INFO L290 TraceCheckUtils]: 7: Hoare triple {50486#(and (<= 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; {50487#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:10:26,819 INFO L290 TraceCheckUtils]: 8: Hoare triple {50487#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {50488#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:10:26,819 INFO L290 TraceCheckUtils]: 9: Hoare triple {50488#(and (<= main_~y~0 3) (<= 3 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; {50489#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:10:26,820 INFO L290 TraceCheckUtils]: 10: Hoare triple {50489#(and (<= main_~y~0 4) (<= 4 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; {50490#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:10:26,820 INFO L290 TraceCheckUtils]: 11: Hoare triple {50490#(and (<= 5 main_~y~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; {50491#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:10:26,821 INFO L290 TraceCheckUtils]: 12: Hoare triple {50491#(and (<= main_~y~0 6) (<= 6 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; {50492#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:10:26,821 INFO L290 TraceCheckUtils]: 13: Hoare triple {50492#(and (<= 7 main_~y~0) (<= main_~y~0 7))} 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; {50493#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:10:26,822 INFO L290 TraceCheckUtils]: 14: Hoare triple {50493#(and (<= main_~y~0 8) (<= 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; {50494#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:10:26,822 INFO L290 TraceCheckUtils]: 15: Hoare triple {50494#(and (<= 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; {50495#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:10:26,823 INFO L290 TraceCheckUtils]: 16: Hoare triple {50495#(and (<= main_~y~0 10) (<= 10 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; {50496#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:10:26,823 INFO L290 TraceCheckUtils]: 17: Hoare triple {50496#(and (<= main_~y~0 11) (<= 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; {50497#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:10:26,824 INFO L290 TraceCheckUtils]: 18: Hoare triple {50497#(and (<= 12 main_~y~0) (<= main_~y~0 12))} 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; {50498#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:10:26,824 INFO L290 TraceCheckUtils]: 19: Hoare triple {50498#(and (<= main_~y~0 13) (<= 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; {50499#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:10:26,825 INFO L290 TraceCheckUtils]: 20: Hoare triple {50499#(and (<= 14 main_~y~0) (<= main_~y~0 14))} 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; {50500#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:10:26,825 INFO L290 TraceCheckUtils]: 21: Hoare triple {50500#(and (<= main_~y~0 15) (<= 15 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; {50501#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:10:26,826 INFO L290 TraceCheckUtils]: 22: Hoare triple {50501#(and (<= 16 main_~y~0) (<= main_~y~0 16))} 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; {50502#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:10:26,826 INFO L290 TraceCheckUtils]: 23: Hoare triple {50502#(and (<= main_~y~0 17) (<= 17 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; {50503#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 10:10:26,827 INFO L290 TraceCheckUtils]: 24: Hoare triple {50503#(and (<= 18 main_~y~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; {50504#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 10:10:26,827 INFO L290 TraceCheckUtils]: 25: Hoare triple {50504#(and (<= 19 main_~y~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; {50505#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 10:10:26,828 INFO L290 TraceCheckUtils]: 26: Hoare triple {50505#(and (<= 20 main_~y~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; {50506#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 10:10:26,828 INFO L290 TraceCheckUtils]: 27: Hoare triple {50506#(and (<= main_~y~0 21) (<= 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; {50507#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 10:10:26,829 INFO L290 TraceCheckUtils]: 28: Hoare triple {50507#(and (<= main_~y~0 22) (<= 22 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; {50508#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 10:10:26,829 INFO L290 TraceCheckUtils]: 29: Hoare triple {50508#(and (<= main_~y~0 23) (<= 23 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {50508#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 10:10:26,829 INFO L290 TraceCheckUtils]: 30: Hoare triple {50508#(and (<= main_~y~0 23) (<= 23 main_~y~0))} ~z~0 := ~y~0; {50604#(and (<= 23 main_~z~0) (<= main_~z~0 23))} is VALID [2022-04-28 10:10:26,830 INFO L290 TraceCheckUtils]: 31: Hoare triple {50604#(and (<= 23 main_~z~0) (<= main_~z~0 23))} assume !(~z~0 % 4294967296 > 0); {50481#false} is VALID [2022-04-28 10:10:26,830 INFO L290 TraceCheckUtils]: 32: Hoare triple {50481#false} assume !(~y~0 % 4294967296 > 0); {50481#false} is VALID [2022-04-28 10:10:26,830 INFO L272 TraceCheckUtils]: 33: Hoare triple {50481#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {50481#false} is VALID [2022-04-28 10:10:26,830 INFO L290 TraceCheckUtils]: 34: Hoare triple {50481#false} ~cond := #in~cond; {50481#false} is VALID [2022-04-28 10:10:26,830 INFO L290 TraceCheckUtils]: 35: Hoare triple {50481#false} assume 0 == ~cond; {50481#false} is VALID [2022-04-28 10:10:26,830 INFO L290 TraceCheckUtils]: 36: Hoare triple {50481#false} assume !false; {50481#false} is VALID [2022-04-28 10:10:26,830 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:10:26,830 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:10:27,796 INFO L290 TraceCheckUtils]: 36: Hoare triple {50481#false} assume !false; {50481#false} is VALID [2022-04-28 10:10:27,796 INFO L290 TraceCheckUtils]: 35: Hoare triple {50481#false} assume 0 == ~cond; {50481#false} is VALID [2022-04-28 10:10:27,796 INFO L290 TraceCheckUtils]: 34: Hoare triple {50481#false} ~cond := #in~cond; {50481#false} is VALID [2022-04-28 10:10:27,796 INFO L272 TraceCheckUtils]: 33: Hoare triple {50481#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {50481#false} is VALID [2022-04-28 10:10:27,796 INFO L290 TraceCheckUtils]: 32: Hoare triple {50481#false} assume !(~y~0 % 4294967296 > 0); {50481#false} is VALID [2022-04-28 10:10:27,797 INFO L290 TraceCheckUtils]: 31: Hoare triple {50638#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {50481#false} is VALID [2022-04-28 10:10:27,797 INFO L290 TraceCheckUtils]: 30: Hoare triple {50642#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {50638#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:10:27,797 INFO L290 TraceCheckUtils]: 29: Hoare triple {50642#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {50642#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:10:27,798 INFO L290 TraceCheckUtils]: 28: Hoare triple {50649#(< 0 (mod (+ main_~y~0 1) 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; {50642#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:10:27,798 INFO L290 TraceCheckUtils]: 27: Hoare triple {50653#(< 0 (mod (+ main_~y~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; {50649#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:10:27,799 INFO L290 TraceCheckUtils]: 26: Hoare triple {50657#(< 0 (mod (+ main_~y~0 3) 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; {50653#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:10:27,800 INFO L290 TraceCheckUtils]: 25: Hoare triple {50661#(< 0 (mod (+ main_~y~0 4) 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; {50657#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:10:27,800 INFO L290 TraceCheckUtils]: 24: Hoare triple {50665#(< 0 (mod (+ 5 main_~y~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; {50661#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:10:27,801 INFO L290 TraceCheckUtils]: 23: Hoare triple {50669#(< 0 (mod (+ main_~y~0 6) 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; {50665#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:10:27,802 INFO L290 TraceCheckUtils]: 22: Hoare triple {50673#(< 0 (mod (+ 7 main_~y~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; {50669#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:10:27,802 INFO L290 TraceCheckUtils]: 21: Hoare triple {50677#(< 0 (mod (+ main_~y~0 8) 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; {50673#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:10:27,803 INFO L290 TraceCheckUtils]: 20: Hoare triple {50681#(< 0 (mod (+ main_~y~0 9) 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; {50677#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:10:27,803 INFO L290 TraceCheckUtils]: 19: Hoare triple {50685#(< 0 (mod (+ main_~y~0 10) 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; {50681#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:10:27,804 INFO L290 TraceCheckUtils]: 18: Hoare triple {50689#(< 0 (mod (+ main_~y~0 11) 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; {50685#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-28 10:10:27,805 INFO L290 TraceCheckUtils]: 17: Hoare triple {50693#(< 0 (mod (+ main_~y~0 12) 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; {50689#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-28 10:10:27,805 INFO L290 TraceCheckUtils]: 16: Hoare triple {50697#(< 0 (mod (+ main_~y~0 13) 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; {50693#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-28 10:10:27,806 INFO L290 TraceCheckUtils]: 15: Hoare triple {50701#(< 0 (mod (+ main_~y~0 14) 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; {50697#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-28 10:10:27,807 INFO L290 TraceCheckUtils]: 14: Hoare triple {50705#(< 0 (mod (+ main_~y~0 15) 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; {50701#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-28 10:10:27,807 INFO L290 TraceCheckUtils]: 13: Hoare triple {50709#(< 0 (mod (+ main_~y~0 16) 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; {50705#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID [2022-04-28 10:10:27,808 INFO L290 TraceCheckUtils]: 12: Hoare triple {50713#(< 0 (mod (+ main_~y~0 17) 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; {50709#(< 0 (mod (+ main_~y~0 16) 4294967296))} is VALID [2022-04-28 10:10:27,808 INFO L290 TraceCheckUtils]: 11: Hoare triple {50717#(< 0 (mod (+ main_~y~0 18) 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; {50713#(< 0 (mod (+ main_~y~0 17) 4294967296))} is VALID [2022-04-28 10:10:27,809 INFO L290 TraceCheckUtils]: 10: Hoare triple {50721#(< 0 (mod (+ 19 main_~y~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; {50717#(< 0 (mod (+ main_~y~0 18) 4294967296))} is VALID [2022-04-28 10:10:27,810 INFO L290 TraceCheckUtils]: 9: Hoare triple {50725#(< 0 (mod (+ main_~y~0 20) 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; {50721#(< 0 (mod (+ 19 main_~y~0) 4294967296))} is VALID [2022-04-28 10:10:27,810 INFO L290 TraceCheckUtils]: 8: Hoare triple {50729#(< 0 (mod (+ main_~y~0 21) 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; {50725#(< 0 (mod (+ main_~y~0 20) 4294967296))} is VALID [2022-04-28 10:10:27,811 INFO L290 TraceCheckUtils]: 7: Hoare triple {50733#(< 0 (mod (+ main_~y~0 22) 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; {50729#(< 0 (mod (+ main_~y~0 21) 4294967296))} is VALID [2022-04-28 10:10:27,812 INFO L290 TraceCheckUtils]: 6: Hoare triple {50737#(< 0 (mod (+ 23 main_~y~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; {50733#(< 0 (mod (+ main_~y~0 22) 4294967296))} is VALID [2022-04-28 10:10:27,812 INFO L290 TraceCheckUtils]: 5: Hoare triple {50480#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {50737#(< 0 (mod (+ 23 main_~y~0) 4294967296))} is VALID [2022-04-28 10:10:27,812 INFO L272 TraceCheckUtils]: 4: Hoare triple {50480#true} call #t~ret11 := main(); {50480#true} is VALID [2022-04-28 10:10:27,812 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {50480#true} {50480#true} #61#return; {50480#true} is VALID [2022-04-28 10:10:27,812 INFO L290 TraceCheckUtils]: 2: Hoare triple {50480#true} assume true; {50480#true} is VALID [2022-04-28 10:10:27,812 INFO L290 TraceCheckUtils]: 1: Hoare triple {50480#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(10, 2);call #Ultimate.allocInit(12, 3); {50480#true} is VALID [2022-04-28 10:10:27,812 INFO L272 TraceCheckUtils]: 0: Hoare triple {50480#true} call ULTIMATE.init(); {50480#true} is VALID [2022-04-28 10:10:27,812 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:10:27,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1865993113] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:10:27,812 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:10:27,813 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27, 27] total 54 [2022-04-28 10:10:27,813 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:10:27,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1832415583] [2022-04-28 10:10:27,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1832415583] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:10:27,813 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:10:27,813 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-04-28 10:10:27,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495641274] [2022-04-28 10:10:27,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:10:27,813 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 27 states have internal predecessors, (33), 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 37 [2022-04-28 10:10:27,813 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:10:27,813 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 28 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 27 states have internal predecessors, (33), 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-28 10:10:27,833 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:10:27,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-04-28 10:10:27,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:10:27,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-04-28 10:10:27,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=683, Invalid=2179, Unknown=0, NotChecked=0, Total=2862 [2022-04-28 10:10:27,834 INFO L87 Difference]: Start difference. First operand 122 states and 154 transitions. Second operand has 28 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 27 states have internal predecessors, (33), 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-28 10:10:32,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:32,281 INFO L93 Difference]: Finished difference Result 157 states and 216 transitions. [2022-04-28 10:10:32,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-28 10:10:32,281 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 27 states have internal predecessors, (33), 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 37 [2022-04-28 10:10:32,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:10:32,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 27 states have internal predecessors, (33), 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-28 10:10:32,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 162 transitions. [2022-04-28 10:10:32,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 27 states have internal predecessors, (33), 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-28 10:10:32,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 162 transitions. [2022-04-28 10:10:32,283 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 162 transitions. [2022-04-28 10:10:32,412 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 162 edges. 162 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:10:32,413 INFO L225 Difference]: With dead ends: 157 [2022-04-28 10:10:32,413 INFO L226 Difference]: Without dead ends: 151 [2022-04-28 10:10:32,414 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 373 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1385, Invalid=4777, Unknown=0, NotChecked=0, Total=6162 [2022-04-28 10:10:32,414 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 140 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 2879 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 2978 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 2879 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:10:32,414 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 184 Invalid, 2978 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 2879 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-04-28 10:10:32,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-04-28 10:10:32,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 127. [2022-04-28 10:10:32,552 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:10:32,552 INFO L82 GeneralOperation]: Start isEquivalent. First operand 151 states. Second operand has 127 states, 122 states have (on average 1.2868852459016393) internal successors, (157), 122 states have internal predecessors, (157), 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-28 10:10:32,552 INFO L74 IsIncluded]: Start isIncluded. First operand 151 states. Second operand has 127 states, 122 states have (on average 1.2868852459016393) internal successors, (157), 122 states have internal predecessors, (157), 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-28 10:10:32,552 INFO L87 Difference]: Start difference. First operand 151 states. Second operand has 127 states, 122 states have (on average 1.2868852459016393) internal successors, (157), 122 states have internal predecessors, (157), 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-28 10:10:32,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:32,553 INFO L93 Difference]: Finished difference Result 151 states and 185 transitions. [2022-04-28 10:10:32,553 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 185 transitions. [2022-04-28 10:10:32,553 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:10:32,554 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:10:32,554 INFO L74 IsIncluded]: Start isIncluded. First operand has 127 states, 122 states have (on average 1.2868852459016393) internal successors, (157), 122 states have internal predecessors, (157), 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 151 states. [2022-04-28 10:10:32,554 INFO L87 Difference]: Start difference. First operand has 127 states, 122 states have (on average 1.2868852459016393) internal successors, (157), 122 states have internal predecessors, (157), 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 151 states. [2022-04-28 10:10:32,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:10:32,555 INFO L93 Difference]: Finished difference Result 151 states and 185 transitions. [2022-04-28 10:10:32,555 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 185 transitions. [2022-04-28 10:10:32,555 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:10:32,555 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:10:32,555 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:10:32,555 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:10:32,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 122 states have (on average 1.2868852459016393) internal successors, (157), 122 states have internal predecessors, (157), 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-28 10:10:32,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 161 transitions. [2022-04-28 10:10:32,556 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 161 transitions. Word has length 37 [2022-04-28 10:10:32,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:10:32,556 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 161 transitions. [2022-04-28 10:10:32,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 27 states have internal predecessors, (33), 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-28 10:10:32,557 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 127 states and 161 transitions. [2022-04-28 10:10:33,165 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 161 edges. 161 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:10:33,165 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 161 transitions. [2022-04-28 10:10:33,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-28 10:10:33,165 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:10:33,165 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:10:33,180 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (69)] Forceful destruction successful, exit code 0 [2022-04-28 10:10:33,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 69 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable68 [2022-04-28 10:10:33,366 INFO L420 AbstractCegarLoop]: === Iteration 70 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:10:33,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:10:33,366 INFO L85 PathProgramCache]: Analyzing trace with hash 402939981, now seen corresponding path program 91 times [2022-04-28 10:10:33,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:10:33,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1414447582] [2022-04-28 10:10:33,368 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:10:33,368 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:10:33,368 INFO L85 PathProgramCache]: Analyzing trace with hash 402939981, now seen corresponding path program 92 times [2022-04-28 10:10:33,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:10:33,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590469529] [2022-04-28 10:10:33,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:10:33,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:10:33,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:34,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:10:34,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:34,187 INFO L290 TraceCheckUtils]: 0: Hoare triple {51705#(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(10, 2);call #Ultimate.allocInit(12, 3); {51678#true} is VALID [2022-04-28 10:10:34,187 INFO L290 TraceCheckUtils]: 1: Hoare triple {51678#true} assume true; {51678#true} is VALID [2022-04-28 10:10:34,187 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {51678#true} {51678#true} #61#return; {51678#true} is VALID [2022-04-28 10:10:34,188 INFO L272 TraceCheckUtils]: 0: Hoare triple {51678#true} call ULTIMATE.init(); {51705#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:10:34,188 INFO L290 TraceCheckUtils]: 1: Hoare triple {51705#(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(10, 2);call #Ultimate.allocInit(12, 3); {51678#true} is VALID [2022-04-28 10:10:34,188 INFO L290 TraceCheckUtils]: 2: Hoare triple {51678#true} assume true; {51678#true} is VALID [2022-04-28 10:10:34,188 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {51678#true} {51678#true} #61#return; {51678#true} is VALID [2022-04-28 10:10:34,188 INFO L272 TraceCheckUtils]: 4: Hoare triple {51678#true} call #t~ret11 := main(); {51678#true} is VALID [2022-04-28 10:10:34,188 INFO L290 TraceCheckUtils]: 5: Hoare triple {51678#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {51683#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-28 10:10:34,190 INFO L290 TraceCheckUtils]: 6: Hoare triple {51683#(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; {51684#(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-28 10:10:34,228 INFO L290 TraceCheckUtils]: 7: Hoare triple {51684#(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; {51685#(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-28 10:10:34,232 INFO L290 TraceCheckUtils]: 8: Hoare triple {51685#(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; {51686#(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-28 10:10:34,239 INFO L290 TraceCheckUtils]: 9: Hoare triple {51686#(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; {51687#(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-28 10:10:34,240 INFO L290 TraceCheckUtils]: 10: Hoare triple {51687#(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; {51688#(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-28 10:10:34,248 INFO L290 TraceCheckUtils]: 11: Hoare triple {51688#(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; {51689#(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-28 10:10:34,250 INFO L290 TraceCheckUtils]: 12: Hoare triple {51689#(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; {51690#(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-28 10:10:34,254 INFO L290 TraceCheckUtils]: 13: Hoare triple {51690#(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; {51691#(and (<= main_~y~0 8) (<= main_~n~0 (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) 4294967295)) (<= 8 main_~y~0) (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~x~0) (* (- 1) main_~y~0) (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296) 8) main_~n~0))} is VALID [2022-04-28 10:10:34,255 INFO L290 TraceCheckUtils]: 14: Hoare triple {51691#(and (<= main_~y~0 8) (<= main_~n~0 (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) 4294967295)) (<= 8 main_~y~0) (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~x~0) (* (- 1) main_~y~0) (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296) 8) main_~n~0))} assume !(~x~0 % 4294967296 > 0); {51692#(and (<= main_~y~0 8) (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) 8) main_~n~0))} is VALID [2022-04-28 10:10:34,256 INFO L290 TraceCheckUtils]: 15: Hoare triple {51692#(and (<= main_~y~0 8) (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) 8) main_~n~0))} ~z~0 := ~y~0; {51693#(and (<= main_~z~0 8) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 8) main_~n~0))} is VALID [2022-04-28 10:10:34,256 INFO L290 TraceCheckUtils]: 16: Hoare triple {51693#(and (<= main_~z~0 8) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 8) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {51694#(and (<= main_~z~0 7) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 8) main_~n~0))} is VALID [2022-04-28 10:10:34,257 INFO L290 TraceCheckUtils]: 17: Hoare triple {51694#(and (<= main_~z~0 7) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 8) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {51695#(and (<= main_~z~0 6) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 8) main_~n~0))} is VALID [2022-04-28 10:10:34,258 INFO L290 TraceCheckUtils]: 18: Hoare triple {51695#(and (<= main_~z~0 6) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 8) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {51696#(and (<= main_~z~0 5) (<= (+ (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 8) main_~n~0))} is VALID [2022-04-28 10:10:34,259 INFO L290 TraceCheckUtils]: 19: Hoare triple {51696#(and (<= main_~z~0 5) (<= (+ (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 8) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {51697#(and (<= main_~z~0 4) (<= (+ (* (div (+ 4294967291 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 8) main_~n~0))} is VALID [2022-04-28 10:10:34,260 INFO L290 TraceCheckUtils]: 20: Hoare triple {51697#(and (<= main_~z~0 4) (<= (+ (* (div (+ 4294967291 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 8) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {51698#(and (<= (+ 8 (* (div (+ 4294967290 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0) (<= main_~z~0 3))} is VALID [2022-04-28 10:10:34,261 INFO L290 TraceCheckUtils]: 21: Hoare triple {51698#(and (<= (+ 8 (* (div (+ 4294967290 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0) (<= main_~z~0 3))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {51699#(and (<= main_~z~0 2) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967289) 4294967296) 4294967296) 8) main_~n~0))} is VALID [2022-04-28 10:10:34,262 INFO L290 TraceCheckUtils]: 22: Hoare triple {51699#(and (<= main_~z~0 2) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967289) 4294967296) 4294967296) 8) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {51700#(and (<= main_~z~0 1) (<= (+ (* (div (+ 4294967288 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 8) main_~n~0))} is VALID [2022-04-28 10:10:34,263 INFO L290 TraceCheckUtils]: 23: Hoare triple {51700#(and (<= main_~z~0 1) (<= (+ (* (div (+ 4294967288 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 8) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {51701#(and (<= main_~z~0 0) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967287) 4294967296) 4294967296) 8) main_~n~0))} is VALID [2022-04-28 10:10:34,264 INFO L290 TraceCheckUtils]: 24: Hoare triple {51701#(and (<= main_~z~0 0) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967287) 4294967296) 4294967296) 8) main_~n~0))} assume !(~z~0 % 4294967296 > 0); {51701#(and (<= main_~z~0 0) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967287) 4294967296) 4294967296) 8) main_~n~0))} is VALID [2022-04-28 10:10:34,264 INFO L290 TraceCheckUtils]: 25: Hoare triple {51701#(and (<= main_~z~0 0) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967287) 4294967296) 4294967296) 8) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {51700#(and (<= main_~z~0 1) (<= (+ (* (div (+ 4294967288 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 8) main_~n~0))} is VALID [2022-04-28 10:10:34,265 INFO L290 TraceCheckUtils]: 26: Hoare triple {51700#(and (<= main_~z~0 1) (<= (+ (* (div (+ 4294967288 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 8) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {51699#(and (<= main_~z~0 2) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967289) 4294967296) 4294967296) 8) main_~n~0))} is VALID [2022-04-28 10:10:34,266 INFO L290 TraceCheckUtils]: 27: Hoare triple {51699#(and (<= main_~z~0 2) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967289) 4294967296) 4294967296) 8) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {51698#(and (<= (+ 8 (* (div (+ 4294967290 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0) (<= main_~z~0 3))} is VALID [2022-04-28 10:10:34,267 INFO L290 TraceCheckUtils]: 28: Hoare triple {51698#(and (<= (+ 8 (* (div (+ 4294967290 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0) (<= main_~z~0 3))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {51697#(and (<= main_~z~0 4) (<= (+ (* (div (+ 4294967291 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 8) main_~n~0))} is VALID [2022-04-28 10:10:34,268 INFO L290 TraceCheckUtils]: 29: Hoare triple {51697#(and (<= main_~z~0 4) (<= (+ (* (div (+ 4294967291 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 8) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {51696#(and (<= main_~z~0 5) (<= (+ (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 8) main_~n~0))} is VALID [2022-04-28 10:10:34,269 INFO L290 TraceCheckUtils]: 30: Hoare triple {51696#(and (<= main_~z~0 5) (<= (+ (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 8) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {51695#(and (<= main_~z~0 6) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 8) main_~n~0))} is VALID [2022-04-28 10:10:34,269 INFO L290 TraceCheckUtils]: 31: Hoare triple {51695#(and (<= main_~z~0 6) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 8) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {51694#(and (<= main_~z~0 7) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 8) main_~n~0))} is VALID [2022-04-28 10:10:34,272 INFO L290 TraceCheckUtils]: 32: Hoare triple {51694#(and (<= main_~z~0 7) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 8) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {51702#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-28 10:10:34,272 INFO L290 TraceCheckUtils]: 33: Hoare triple {51702#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {51702#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-28 10:10:34,273 INFO L272 TraceCheckUtils]: 34: Hoare triple {51702#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {51703#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:10:34,273 INFO L290 TraceCheckUtils]: 35: Hoare triple {51703#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {51704#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 10:10:34,273 INFO L290 TraceCheckUtils]: 36: Hoare triple {51704#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {51679#false} is VALID [2022-04-28 10:10:34,274 INFO L290 TraceCheckUtils]: 37: Hoare triple {51679#false} assume !false; {51679#false} is VALID [2022-04-28 10:10:34,274 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:10:34,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:10:34,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590469529] [2022-04-28 10:10:34,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590469529] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:10:34,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1817613663] [2022-04-28 10:10:34,274 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:10:34,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:10:34,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:10:34,276 INFO L229 MonitoredProcess]: Starting monitored process 70 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:10:34,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (70)] Waiting until timeout for monitored process [2022-04-28 10:10:34,585 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:10:34,585 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:10:34,587 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 76 conjunts are in the unsatisfiable core [2022-04-28 10:10:34,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:10:34,606 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:11:00,283 INFO L272 TraceCheckUtils]: 0: Hoare triple {51678#true} call ULTIMATE.init(); {51678#true} is VALID [2022-04-28 10:11:00,283 INFO L290 TraceCheckUtils]: 1: Hoare triple {51678#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(10, 2);call #Ultimate.allocInit(12, 3); {51678#true} is VALID [2022-04-28 10:11:00,283 INFO L290 TraceCheckUtils]: 2: Hoare triple {51678#true} assume true; {51678#true} is VALID [2022-04-28 10:11:00,283 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {51678#true} {51678#true} #61#return; {51678#true} is VALID [2022-04-28 10:11:00,283 INFO L272 TraceCheckUtils]: 4: Hoare triple {51678#true} call #t~ret11 := main(); {51678#true} is VALID [2022-04-28 10:11:00,283 INFO L290 TraceCheckUtils]: 5: Hoare triple {51678#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {51683#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-28 10:11:00,284 INFO L290 TraceCheckUtils]: 6: Hoare triple {51683#(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; {51727#(and (= (+ main_~x~0 1) main_~n~0) (= (+ (- 1) main_~y~0) 0))} is VALID [2022-04-28 10:11:00,285 INFO L290 TraceCheckUtils]: 7: Hoare triple {51727#(and (= (+ main_~x~0 1) main_~n~0) (= (+ (- 1) 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; {51731#(and (= main_~y~0 2) (= (+ main_~x~0 1) (+ (- 1) main_~n~0)))} is VALID [2022-04-28 10:11:00,285 INFO L290 TraceCheckUtils]: 8: Hoare triple {51731#(and (= main_~y~0 2) (= (+ main_~x~0 1) (+ (- 1) 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; {51735#(and (= (+ (- 2) main_~n~0) (+ main_~x~0 1)) (= main_~y~0 3))} is VALID [2022-04-28 10:11:00,286 INFO L290 TraceCheckUtils]: 9: Hoare triple {51735#(and (= (+ (- 2) main_~n~0) (+ main_~x~0 1)) (= main_~y~0 3))} 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; {51739#(and (= main_~y~0 4) (= (+ main_~n~0 (- 3)) (+ main_~x~0 1)) (< 0 (mod (+ main_~n~0 4294967293) 4294967296)))} is VALID [2022-04-28 10:11:00,287 INFO L290 TraceCheckUtils]: 10: Hoare triple {51739#(and (= main_~y~0 4) (= (+ main_~n~0 (- 3)) (+ main_~x~0 1)) (< 0 (mod (+ main_~n~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; {51743#(and (= (+ main_~x~0 1) (+ main_~n~0 (- 4))) (= 5 main_~y~0) (< 0 (mod (+ 4294967292 main_~n~0) 4294967296)) (< 0 (mod (+ main_~n~0 4294967293) 4294967296)))} is VALID [2022-04-28 10:11:00,288 INFO L290 TraceCheckUtils]: 11: Hoare triple {51743#(and (= (+ main_~x~0 1) (+ main_~n~0 (- 4))) (= 5 main_~y~0) (< 0 (mod (+ 4294967292 main_~n~0) 4294967296)) (< 0 (mod (+ main_~n~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; {51747#(and (= main_~y~0 6) (= (+ main_~x~0 2) (+ main_~n~0 (- 4))) (< 0 (mod (+ 4294967292 main_~n~0) 4294967296)) (< 0 (mod (+ main_~n~0 4294967293) 4294967296)))} is VALID [2022-04-28 10:11:00,288 INFO L290 TraceCheckUtils]: 12: Hoare triple {51747#(and (= main_~y~0 6) (= (+ main_~x~0 2) (+ main_~n~0 (- 4))) (< 0 (mod (+ 4294967292 main_~n~0) 4294967296)) (< 0 (mod (+ main_~n~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; {51751#(and (= (+ main_~x~0 1) (+ main_~n~0 (- 6))) (= 7 main_~y~0) (< 0 (mod (+ 4294967292 main_~n~0) 4294967296)) (< 0 (mod (+ main_~n~0 4294967293) 4294967296)))} is VALID [2022-04-28 10:11:00,289 INFO L290 TraceCheckUtils]: 13: Hoare triple {51751#(and (= (+ main_~x~0 1) (+ main_~n~0 (- 6))) (= 7 main_~y~0) (< 0 (mod (+ 4294967292 main_~n~0) 4294967296)) (< 0 (mod (+ main_~n~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; {51755#(and (= (+ main_~n~0 (- 6)) (+ main_~x~0 2)) (= 7 (+ (- 1) main_~y~0)) (< 0 (mod (+ 4294967292 main_~n~0) 4294967296)) (< 0 (mod (+ main_~n~0 4294967293) 4294967296)))} is VALID [2022-04-28 10:11:00,291 INFO L290 TraceCheckUtils]: 14: Hoare triple {51755#(and (= (+ main_~n~0 (- 6)) (+ main_~x~0 2)) (= 7 (+ (- 1) main_~y~0)) (< 0 (mod (+ 4294967292 main_~n~0) 4294967296)) (< 0 (mod (+ main_~n~0 4294967293) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {51692#(and (<= main_~y~0 8) (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) 8) main_~n~0))} is VALID [2022-04-28 10:11:00,291 INFO L290 TraceCheckUtils]: 15: Hoare triple {51692#(and (<= main_~y~0 8) (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) 8) main_~n~0))} ~z~0 := ~y~0; {51693#(and (<= main_~z~0 8) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 8) main_~n~0))} is VALID [2022-04-28 10:11:00,292 INFO L290 TraceCheckUtils]: 16: Hoare triple {51693#(and (<= main_~z~0 8) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 8) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {51694#(and (<= main_~z~0 7) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 8) main_~n~0))} is VALID [2022-04-28 10:11:00,293 INFO L290 TraceCheckUtils]: 17: Hoare triple {51694#(and (<= main_~z~0 7) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 8) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {51695#(and (<= main_~z~0 6) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 8) main_~n~0))} is VALID [2022-04-28 10:11:00,294 INFO L290 TraceCheckUtils]: 18: Hoare triple {51695#(and (<= main_~z~0 6) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 8) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {51696#(and (<= main_~z~0 5) (<= (+ (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 8) main_~n~0))} is VALID [2022-04-28 10:11:00,295 INFO L290 TraceCheckUtils]: 19: Hoare triple {51696#(and (<= main_~z~0 5) (<= (+ (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 8) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {51697#(and (<= main_~z~0 4) (<= (+ (* (div (+ 4294967291 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 8) main_~n~0))} is VALID [2022-04-28 10:11:00,296 INFO L290 TraceCheckUtils]: 20: Hoare triple {51697#(and (<= main_~z~0 4) (<= (+ (* (div (+ 4294967291 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 8) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {51698#(and (<= (+ 8 (* (div (+ 4294967290 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0) (<= main_~z~0 3))} is VALID [2022-04-28 10:11:00,297 INFO L290 TraceCheckUtils]: 21: Hoare triple {51698#(and (<= (+ 8 (* (div (+ 4294967290 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0) (<= main_~z~0 3))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {51699#(and (<= main_~z~0 2) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967289) 4294967296) 4294967296) 8) main_~n~0))} is VALID [2022-04-28 10:11:00,298 INFO L290 TraceCheckUtils]: 22: Hoare triple {51699#(and (<= main_~z~0 2) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967289) 4294967296) 4294967296) 8) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {51700#(and (<= main_~z~0 1) (<= (+ (* (div (+ 4294967288 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 8) main_~n~0))} is VALID [2022-04-28 10:11:00,299 INFO L290 TraceCheckUtils]: 23: Hoare triple {51700#(and (<= main_~z~0 1) (<= (+ (* (div (+ 4294967288 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 8) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {51701#(and (<= main_~z~0 0) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967287) 4294967296) 4294967296) 8) main_~n~0))} is VALID [2022-04-28 10:11:00,300 INFO L290 TraceCheckUtils]: 24: Hoare triple {51701#(and (<= main_~z~0 0) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967287) 4294967296) 4294967296) 8) main_~n~0))} assume !(~z~0 % 4294967296 > 0); {51701#(and (<= main_~z~0 0) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967287) 4294967296) 4294967296) 8) main_~n~0))} is VALID [2022-04-28 10:11:00,300 INFO L290 TraceCheckUtils]: 25: Hoare triple {51701#(and (<= main_~z~0 0) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967287) 4294967296) 4294967296) 8) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {51700#(and (<= main_~z~0 1) (<= (+ (* (div (+ 4294967288 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 8) main_~n~0))} is VALID [2022-04-28 10:11:00,301 INFO L290 TraceCheckUtils]: 26: Hoare triple {51700#(and (<= main_~z~0 1) (<= (+ (* (div (+ 4294967288 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 8) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {51699#(and (<= main_~z~0 2) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967289) 4294967296) 4294967296) 8) main_~n~0))} is VALID [2022-04-28 10:11:00,302 INFO L290 TraceCheckUtils]: 27: Hoare triple {51699#(and (<= main_~z~0 2) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967289) 4294967296) 4294967296) 8) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {51698#(and (<= (+ 8 (* (div (+ 4294967290 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0) (<= main_~z~0 3))} is VALID [2022-04-28 10:11:00,303 INFO L290 TraceCheckUtils]: 28: Hoare triple {51698#(and (<= (+ 8 (* (div (+ 4294967290 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0) (<= main_~z~0 3))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {51697#(and (<= main_~z~0 4) (<= (+ (* (div (+ 4294967291 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 8) main_~n~0))} is VALID [2022-04-28 10:11:00,304 INFO L290 TraceCheckUtils]: 29: Hoare triple {51697#(and (<= main_~z~0 4) (<= (+ (* (div (+ 4294967291 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 8) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {51696#(and (<= main_~z~0 5) (<= (+ (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 8) main_~n~0))} is VALID [2022-04-28 10:11:00,305 INFO L290 TraceCheckUtils]: 30: Hoare triple {51696#(and (<= main_~z~0 5) (<= (+ (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 8) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {51695#(and (<= main_~z~0 6) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 8) main_~n~0))} is VALID [2022-04-28 10:11:00,306 INFO L290 TraceCheckUtils]: 31: Hoare triple {51695#(and (<= main_~z~0 6) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 8) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {51694#(and (<= main_~z~0 7) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 8) main_~n~0))} is VALID [2022-04-28 10:11:00,306 INFO L290 TraceCheckUtils]: 32: Hoare triple {51694#(and (<= main_~z~0 7) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 8) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {51693#(and (<= main_~z~0 8) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 8) main_~n~0))} is VALID [2022-04-28 10:11:00,307 INFO L290 TraceCheckUtils]: 33: Hoare triple {51693#(and (<= main_~z~0 8) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 8) main_~n~0))} assume !(~y~0 % 4294967296 > 0); {51693#(and (<= main_~z~0 8) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 8) main_~n~0))} is VALID [2022-04-28 10:11:00,308 INFO L272 TraceCheckUtils]: 34: Hoare triple {51693#(and (<= main_~z~0 8) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 8) main_~n~0))} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {51819#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:11:00,308 INFO L290 TraceCheckUtils]: 35: Hoare triple {51819#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {51823#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:11:00,309 INFO L290 TraceCheckUtils]: 36: Hoare triple {51823#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {51679#false} is VALID [2022-04-28 10:11:00,309 INFO L290 TraceCheckUtils]: 37: Hoare triple {51679#false} assume !false; {51679#false} is VALID [2022-04-28 10:11:00,309 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:11:00,309 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:11:04,307 INFO L290 TraceCheckUtils]: 37: Hoare triple {51679#false} assume !false; {51679#false} is VALID [2022-04-28 10:11:04,307 INFO L290 TraceCheckUtils]: 36: Hoare triple {51823#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {51679#false} is VALID [2022-04-28 10:11:04,307 INFO L290 TraceCheckUtils]: 35: Hoare triple {51819#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {51823#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:11:04,308 INFO L272 TraceCheckUtils]: 34: Hoare triple {51702#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {51819#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:11:04,309 INFO L290 TraceCheckUtils]: 33: Hoare triple {51702#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {51702#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-28 10:11:04,309 INFO L290 TraceCheckUtils]: 32: Hoare triple {51845#(and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {51702#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-28 10:11:04,310 INFO L290 TraceCheckUtils]: 31: Hoare triple {51849#(and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {51845#(and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-28 10:11:04,311 INFO L290 TraceCheckUtils]: 30: Hoare triple {51853#(and (< (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {51849#(and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-28 10:11:04,312 INFO L290 TraceCheckUtils]: 29: Hoare triple {51857#(and (< (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) main_~n~0) (+ 5 main_~z~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) main_~n~0)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {51853#(and (< (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296))))} is VALID [2022-04-28 10:11:04,313 INFO L290 TraceCheckUtils]: 28: Hoare triple {51861#(and (<= (+ 5 main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ 5 main_~z~0) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ 5 main_~z~0) 4294967296) 4294967296)) (+ main_~z~0 6 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {51857#(and (< (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) main_~n~0) (+ 5 main_~z~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-28 10:11:04,314 INFO L290 TraceCheckUtils]: 27: Hoare triple {51865#(and (< (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) main_~n~0) (+ 7 main_~z~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 6 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) main_~n~0)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {51861#(and (<= (+ 5 main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ 5 main_~z~0) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ 5 main_~z~0) 4294967296) 4294967296)) (+ main_~z~0 6 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-28 10:11:04,315 INFO L290 TraceCheckUtils]: 26: Hoare triple {51869#(and (< (+ main_~n~0 (* (div (+ 7 main_~z~0) 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 8)) (<= (+ 7 main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ 7 main_~z~0) 4294967296) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {51865#(and (< (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) main_~n~0) (+ 7 main_~z~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 6 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-28 10:11:04,315 INFO L290 TraceCheckUtils]: 25: Hoare triple {51873#(and (< (+ main_~n~0 (* (div (+ main_~z~0 8) 4294967296) 4294967296)) (+ main_~z~0 9 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 8) (+ main_~n~0 (* (div (+ main_~z~0 8) 4294967296) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {51869#(and (< (+ main_~n~0 (* (div (+ 7 main_~z~0) 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 8)) (<= (+ 7 main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ 7 main_~z~0) 4294967296) 4294967296))))} is VALID [2022-04-28 10:11:04,316 INFO L290 TraceCheckUtils]: 24: Hoare triple {51873#(and (< (+ main_~n~0 (* (div (+ main_~z~0 8) 4294967296) 4294967296)) (+ main_~z~0 9 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 8) (+ main_~n~0 (* (div (+ main_~z~0 8) 4294967296) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {51873#(and (< (+ main_~n~0 (* (div (+ main_~z~0 8) 4294967296) 4294967296)) (+ main_~z~0 9 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 8) (+ main_~n~0 (* (div (+ main_~z~0 8) 4294967296) 4294967296))))} is VALID [2022-04-28 10:11:04,317 INFO L290 TraceCheckUtils]: 23: Hoare triple {51869#(and (< (+ main_~n~0 (* (div (+ 7 main_~z~0) 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 8)) (<= (+ 7 main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ 7 main_~z~0) 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {51873#(and (< (+ main_~n~0 (* (div (+ main_~z~0 8) 4294967296) 4294967296)) (+ main_~z~0 9 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 8) (+ main_~n~0 (* (div (+ main_~z~0 8) 4294967296) 4294967296))))} is VALID [2022-04-28 10:11:04,318 INFO L290 TraceCheckUtils]: 22: Hoare triple {51865#(and (< (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) main_~n~0) (+ 7 main_~z~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 6 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) main_~n~0)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {51869#(and (< (+ main_~n~0 (* (div (+ 7 main_~z~0) 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 8)) (<= (+ 7 main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ 7 main_~z~0) 4294967296) 4294967296))))} is VALID [2022-04-28 10:11:04,318 INFO L290 TraceCheckUtils]: 21: Hoare triple {51861#(and (<= (+ 5 main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ 5 main_~z~0) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ 5 main_~z~0) 4294967296) 4294967296)) (+ main_~z~0 6 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {51865#(and (< (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) main_~n~0) (+ 7 main_~z~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 6 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-28 10:11:04,319 INFO L290 TraceCheckUtils]: 20: Hoare triple {51857#(and (< (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) main_~n~0) (+ 5 main_~z~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) main_~n~0)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {51861#(and (<= (+ 5 main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ 5 main_~z~0) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ 5 main_~z~0) 4294967296) 4294967296)) (+ main_~z~0 6 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-28 10:11:04,320 INFO L290 TraceCheckUtils]: 19: Hoare triple {51853#(and (< (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {51857#(and (< (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) main_~n~0) (+ 5 main_~z~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-28 10:11:04,321 INFO L290 TraceCheckUtils]: 18: Hoare triple {51849#(and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {51853#(and (< (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296))))} is VALID [2022-04-28 10:11:04,322 INFO L290 TraceCheckUtils]: 17: Hoare triple {51845#(and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {51849#(and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-28 10:11:04,323 INFO L290 TraceCheckUtils]: 16: Hoare triple {51702#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {51845#(and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-28 10:11:04,323 INFO L290 TraceCheckUtils]: 15: Hoare triple {51904#(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)))} ~z~0 := ~y~0; {51702#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-28 10:11:04,324 INFO L290 TraceCheckUtils]: 14: Hoare triple {51908#(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); {51904#(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-28 10:11:04,325 INFO L290 TraceCheckUtils]: 13: Hoare triple {51912#(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; {51908#(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-28 10:11:04,326 INFO L290 TraceCheckUtils]: 12: Hoare triple {51916#(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; {51912#(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-28 10:11:04,327 INFO L290 TraceCheckUtils]: 11: Hoare triple {51920#(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; {51916#(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-28 10:11:04,329 INFO L290 TraceCheckUtils]: 10: Hoare triple {51924#(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; {51920#(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-28 10:11:04,330 INFO L290 TraceCheckUtils]: 9: Hoare triple {51928#(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; {51924#(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-28 10:11:04,331 INFO L290 TraceCheckUtils]: 8: Hoare triple {51932#(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; {51928#(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-28 10:11:04,332 INFO L290 TraceCheckUtils]: 7: Hoare triple {51936#(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; {51932#(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-28 10:11:04,333 INFO L290 TraceCheckUtils]: 6: Hoare triple {51940#(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; {51936#(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-28 10:11:04,334 INFO L290 TraceCheckUtils]: 5: Hoare triple {51678#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {51940#(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-28 10:11:04,334 INFO L272 TraceCheckUtils]: 4: Hoare triple {51678#true} call #t~ret11 := main(); {51678#true} is VALID [2022-04-28 10:11:04,334 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {51678#true} {51678#true} #61#return; {51678#true} is VALID [2022-04-28 10:11:04,335 INFO L290 TraceCheckUtils]: 2: Hoare triple {51678#true} assume true; {51678#true} is VALID [2022-04-28 10:11:04,335 INFO L290 TraceCheckUtils]: 1: Hoare triple {51678#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(10, 2);call #Ultimate.allocInit(12, 3); {51678#true} is VALID [2022-04-28 10:11:04,335 INFO L272 TraceCheckUtils]: 0: Hoare triple {51678#true} call ULTIMATE.init(); {51678#true} is VALID [2022-04-28 10:11:04,335 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:11:04,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1817613663] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:11:04,335 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:11:04,335 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 23, 23] total 53 [2022-04-28 10:11:04,335 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:11:04,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1414447582] [2022-04-28 10:11:04,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1414447582] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:11:04,335 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:11:04,335 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-04-28 10:11:04,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196075740] [2022-04-28 10:11:04,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:11:04,336 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.36) internal successors, (34), 23 states have internal predecessors, (34), 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 38 [2022-04-28 10:11:04,336 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:11:04,336 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 25 states, 25 states have (on average 1.36) internal successors, (34), 23 states have internal predecessors, (34), 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-28 10:11:04,429 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:11:04,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-04-28 10:11:04,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:11:04,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-04-28 10:11:04,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=270, Invalid=2486, Unknown=0, NotChecked=0, Total=2756 [2022-04-28 10:11:04,429 INFO L87 Difference]: Start difference. First operand 127 states and 161 transitions. Second operand has 25 states, 25 states have (on average 1.36) internal successors, (34), 23 states have internal predecessors, (34), 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-28 10:11:08,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:08,030 INFO L93 Difference]: Finished difference Result 154 states and 188 transitions. [2022-04-28 10:11:08,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-04-28 10:11:08,030 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.36) internal successors, (34), 23 states have internal predecessors, (34), 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 38 [2022-04-28 10:11:08,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:11:08,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.36) internal successors, (34), 23 states have internal predecessors, (34), 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-28 10:11:08,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 58 transitions. [2022-04-28 10:11:08,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.36) internal successors, (34), 23 states have internal predecessors, (34), 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-28 10:11:08,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 58 transitions. [2022-04-28 10:11:08,031 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 58 transitions. [2022-04-28 10:11:08,598 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:11:08,599 INFO L225 Difference]: With dead ends: 154 [2022-04-28 10:11:08,599 INFO L226 Difference]: Without dead ends: 117 [2022-04-28 10:11:08,599 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 53 SyntacticMatches, 4 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 823 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=551, Invalid=6091, Unknown=0, NotChecked=0, Total=6642 [2022-04-28 10:11:08,600 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 20 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 779 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 804 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 779 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-04-28 10:11:08,600 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 124 Invalid, 804 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 779 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-04-28 10:11:08,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-04-28 10:11:08,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2022-04-28 10:11:08,769 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:11:08,769 INFO L82 GeneralOperation]: Start isEquivalent. First operand 117 states. Second operand has 117 states, 112 states have (on average 1.2946428571428572) internal successors, (145), 112 states have internal predecessors, (145), 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-28 10:11:08,769 INFO L74 IsIncluded]: Start isIncluded. First operand 117 states. Second operand has 117 states, 112 states have (on average 1.2946428571428572) internal successors, (145), 112 states have internal predecessors, (145), 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-28 10:11:08,769 INFO L87 Difference]: Start difference. First operand 117 states. Second operand has 117 states, 112 states have (on average 1.2946428571428572) internal successors, (145), 112 states have internal predecessors, (145), 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-28 10:11:08,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:08,770 INFO L93 Difference]: Finished difference Result 117 states and 149 transitions. [2022-04-28 10:11:08,770 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 149 transitions. [2022-04-28 10:11:08,771 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:11:08,771 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:11:08,771 INFO L74 IsIncluded]: Start isIncluded. First operand has 117 states, 112 states have (on average 1.2946428571428572) internal successors, (145), 112 states have internal predecessors, (145), 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 117 states. [2022-04-28 10:11:08,771 INFO L87 Difference]: Start difference. First operand has 117 states, 112 states have (on average 1.2946428571428572) internal successors, (145), 112 states have internal predecessors, (145), 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 117 states. [2022-04-28 10:11:08,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:08,772 INFO L93 Difference]: Finished difference Result 117 states and 149 transitions. [2022-04-28 10:11:08,772 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 149 transitions. [2022-04-28 10:11:08,772 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:11:08,772 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:11:08,772 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:11:08,772 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:11:08,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 112 states have (on average 1.2946428571428572) internal successors, (145), 112 states have internal predecessors, (145), 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-28 10:11:08,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 149 transitions. [2022-04-28 10:11:08,773 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 149 transitions. Word has length 38 [2022-04-28 10:11:08,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:11:08,773 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 149 transitions. [2022-04-28 10:11:08,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.36) internal successors, (34), 23 states have internal predecessors, (34), 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-28 10:11:08,773 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 117 states and 149 transitions. [2022-04-28 10:11:13,401 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 149 edges. 149 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:11:13,401 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 149 transitions. [2022-04-28 10:11:13,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-28 10:11:13,401 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:11:13,401 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:11:13,407 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (70)] Forceful destruction successful, exit code 0 [2022-04-28 10:11:13,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69,70 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:11:13,602 INFO L420 AbstractCegarLoop]: === Iteration 71 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:11:13,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:11:13,602 INFO L85 PathProgramCache]: Analyzing trace with hash 1555480447, now seen corresponding path program 93 times [2022-04-28 10:11:13,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:11:13,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [825276002] [2022-04-28 10:11:13,604 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:11:13,604 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:11:13,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1555480447, now seen corresponding path program 94 times [2022-04-28 10:11:13,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:11:13,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144495653] [2022-04-28 10:11:13,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:11:13,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:11:13,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:13,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:11:13,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:13,847 INFO L290 TraceCheckUtils]: 0: Hoare triple {52817#(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(10, 2);call #Ultimate.allocInit(12, 3); {52795#true} is VALID [2022-04-28 10:11:13,847 INFO L290 TraceCheckUtils]: 1: Hoare triple {52795#true} assume true; {52795#true} is VALID [2022-04-28 10:11:13,847 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {52795#true} {52795#true} #61#return; {52795#true} is VALID [2022-04-28 10:11:13,847 INFO L272 TraceCheckUtils]: 0: Hoare triple {52795#true} call ULTIMATE.init(); {52817#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:11:13,847 INFO L290 TraceCheckUtils]: 1: Hoare triple {52817#(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(10, 2);call #Ultimate.allocInit(12, 3); {52795#true} is VALID [2022-04-28 10:11:13,847 INFO L290 TraceCheckUtils]: 2: Hoare triple {52795#true} assume true; {52795#true} is VALID [2022-04-28 10:11:13,847 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52795#true} {52795#true} #61#return; {52795#true} is VALID [2022-04-28 10:11:13,848 INFO L272 TraceCheckUtils]: 4: Hoare triple {52795#true} call #t~ret11 := main(); {52795#true} is VALID [2022-04-28 10:11:13,848 INFO L290 TraceCheckUtils]: 5: Hoare triple {52795#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {52800#(= main_~y~0 0)} is VALID [2022-04-28 10:11:13,848 INFO L290 TraceCheckUtils]: 6: Hoare triple {52800#(= 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; {52801#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:11:13,849 INFO L290 TraceCheckUtils]: 7: Hoare triple {52801#(and (<= 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; {52802#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:11:13,849 INFO L290 TraceCheckUtils]: 8: Hoare triple {52802#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {52803#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:11:13,850 INFO L290 TraceCheckUtils]: 9: Hoare triple {52803#(and (<= main_~y~0 3) (<= 3 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; {52804#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:11:13,850 INFO L290 TraceCheckUtils]: 10: Hoare triple {52804#(and (<= main_~y~0 4) (<= 4 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; {52805#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:11:13,851 INFO L290 TraceCheckUtils]: 11: Hoare triple {52805#(and (<= 5 main_~y~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; {52806#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:11:13,851 INFO L290 TraceCheckUtils]: 12: Hoare triple {52806#(and (<= main_~y~0 6) (<= 6 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; {52807#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:11:13,852 INFO L290 TraceCheckUtils]: 13: Hoare triple {52807#(and (<= 7 main_~y~0) (<= main_~y~0 7))} 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; {52808#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:11:13,852 INFO L290 TraceCheckUtils]: 14: Hoare triple {52808#(and (<= main_~y~0 8) (<= 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; {52809#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:11:13,852 INFO L290 TraceCheckUtils]: 15: Hoare triple {52809#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {52809#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:11:13,853 INFO L290 TraceCheckUtils]: 16: Hoare triple {52809#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {52810#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:11:13,853 INFO L290 TraceCheckUtils]: 17: Hoare triple {52810#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {52811#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:11:13,854 INFO L290 TraceCheckUtils]: 18: Hoare triple {52811#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {52812#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:11:13,854 INFO L290 TraceCheckUtils]: 19: Hoare triple {52812#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {52813#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:11:13,855 INFO L290 TraceCheckUtils]: 20: Hoare triple {52813#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {52814#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:11:13,855 INFO L290 TraceCheckUtils]: 21: Hoare triple {52814#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {52815#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:11:13,856 INFO L290 TraceCheckUtils]: 22: Hoare triple {52815#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {52816#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:11:13,856 INFO L290 TraceCheckUtils]: 23: Hoare triple {52816#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {52796#false} is VALID [2022-04-28 10:11:13,856 INFO L290 TraceCheckUtils]: 24: Hoare triple {52796#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {52796#false} is VALID [2022-04-28 10:11:13,856 INFO L290 TraceCheckUtils]: 25: Hoare triple {52796#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {52796#false} is VALID [2022-04-28 10:11:13,856 INFO L290 TraceCheckUtils]: 26: Hoare triple {52796#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {52796#false} is VALID [2022-04-28 10:11:13,856 INFO L290 TraceCheckUtils]: 27: Hoare triple {52796#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {52796#false} is VALID [2022-04-28 10:11:13,856 INFO L290 TraceCheckUtils]: 28: Hoare triple {52796#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {52796#false} is VALID [2022-04-28 10:11:13,856 INFO L290 TraceCheckUtils]: 29: Hoare triple {52796#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {52796#false} is VALID [2022-04-28 10:11:13,856 INFO L290 TraceCheckUtils]: 30: Hoare triple {52796#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {52796#false} is VALID [2022-04-28 10:11:13,856 INFO L290 TraceCheckUtils]: 31: Hoare triple {52796#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {52796#false} is VALID [2022-04-28 10:11:13,856 INFO L290 TraceCheckUtils]: 32: Hoare triple {52796#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {52796#false} is VALID [2022-04-28 10:11:13,856 INFO L290 TraceCheckUtils]: 33: Hoare triple {52796#false} assume !(~y~0 % 4294967296 > 0); {52796#false} is VALID [2022-04-28 10:11:13,857 INFO L272 TraceCheckUtils]: 34: Hoare triple {52796#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {52796#false} is VALID [2022-04-28 10:11:13,857 INFO L290 TraceCheckUtils]: 35: Hoare triple {52796#false} ~cond := #in~cond; {52796#false} is VALID [2022-04-28 10:11:13,857 INFO L290 TraceCheckUtils]: 36: Hoare triple {52796#false} assume 0 == ~cond; {52796#false} is VALID [2022-04-28 10:11:13,857 INFO L290 TraceCheckUtils]: 37: Hoare triple {52796#false} assume !false; {52796#false} is VALID [2022-04-28 10:11:13,857 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-04-28 10:11:13,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:11:13,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144495653] [2022-04-28 10:11:13,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144495653] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:11:13,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1419892125] [2022-04-28 10:11:13,857 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:11:13,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:11:13,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:11:13,858 INFO L229 MonitoredProcess]: Starting monitored process 71 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:11:13,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (71)] Waiting until timeout for monitored process [2022-04-28 10:11:13,900 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:11:13,900 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:11:13,901 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 48 conjunts are in the unsatisfiable core [2022-04-28 10:11:13,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:13,910 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:11:14,225 INFO L272 TraceCheckUtils]: 0: Hoare triple {52795#true} call ULTIMATE.init(); {52795#true} is VALID [2022-04-28 10:11:14,226 INFO L290 TraceCheckUtils]: 1: Hoare triple {52795#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(10, 2);call #Ultimate.allocInit(12, 3); {52795#true} is VALID [2022-04-28 10:11:14,226 INFO L290 TraceCheckUtils]: 2: Hoare triple {52795#true} assume true; {52795#true} is VALID [2022-04-28 10:11:14,226 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52795#true} {52795#true} #61#return; {52795#true} is VALID [2022-04-28 10:11:14,226 INFO L272 TraceCheckUtils]: 4: Hoare triple {52795#true} call #t~ret11 := main(); {52795#true} is VALID [2022-04-28 10:11:14,226 INFO L290 TraceCheckUtils]: 5: Hoare triple {52795#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {52800#(= main_~y~0 0)} is VALID [2022-04-28 10:11:14,226 INFO L290 TraceCheckUtils]: 6: Hoare triple {52800#(= 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; {52801#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:11:14,227 INFO L290 TraceCheckUtils]: 7: Hoare triple {52801#(and (<= 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; {52802#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:11:14,228 INFO L290 TraceCheckUtils]: 8: Hoare triple {52802#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {52803#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:11:14,228 INFO L290 TraceCheckUtils]: 9: Hoare triple {52803#(and (<= main_~y~0 3) (<= 3 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; {52804#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:11:14,229 INFO L290 TraceCheckUtils]: 10: Hoare triple {52804#(and (<= main_~y~0 4) (<= 4 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; {52805#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:11:14,229 INFO L290 TraceCheckUtils]: 11: Hoare triple {52805#(and (<= 5 main_~y~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; {52806#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:11:14,230 INFO L290 TraceCheckUtils]: 12: Hoare triple {52806#(and (<= main_~y~0 6) (<= 6 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; {52807#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:11:14,230 INFO L290 TraceCheckUtils]: 13: Hoare triple {52807#(and (<= 7 main_~y~0) (<= main_~y~0 7))} 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; {52808#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:11:14,231 INFO L290 TraceCheckUtils]: 14: Hoare triple {52808#(and (<= main_~y~0 8) (<= 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; {52809#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:11:14,231 INFO L290 TraceCheckUtils]: 15: Hoare triple {52809#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {52809#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:11:14,231 INFO L290 TraceCheckUtils]: 16: Hoare triple {52809#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {52869#(and (= main_~z~0 main_~y~0) (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:11:14,232 INFO L290 TraceCheckUtils]: 17: Hoare triple {52869#(and (= main_~z~0 main_~y~0) (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {52873#(and (<= 9 main_~y~0) (<= main_~y~0 9) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-28 10:11:14,232 INFO L290 TraceCheckUtils]: 18: Hoare triple {52873#(and (<= 9 main_~y~0) (<= main_~y~0 9) (= main_~y~0 (+ main_~z~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {52877#(and (= main_~y~0 (+ main_~z~0 2)) (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:11:14,233 INFO L290 TraceCheckUtils]: 19: Hoare triple {52877#(and (= main_~y~0 (+ main_~z~0 2)) (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {52881#(and (<= 9 main_~y~0) (<= main_~y~0 9) (= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-28 10:11:14,233 INFO L290 TraceCheckUtils]: 20: Hoare triple {52881#(and (<= 9 main_~y~0) (<= main_~y~0 9) (= main_~y~0 (+ main_~z~0 3)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {52885#(and (= main_~y~0 (+ main_~z~0 4)) (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:11:14,234 INFO L290 TraceCheckUtils]: 21: Hoare triple {52885#(and (= main_~y~0 (+ main_~z~0 4)) (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {52889#(and (= (+ 5 main_~z~0) main_~y~0) (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:11:14,235 INFO L290 TraceCheckUtils]: 22: Hoare triple {52889#(and (= (+ 5 main_~z~0) main_~y~0) (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {52893#(and (= main_~y~0 (+ main_~z~0 6)) (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:11:14,235 INFO L290 TraceCheckUtils]: 23: Hoare triple {52893#(and (= main_~y~0 (+ main_~z~0 6)) (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~z~0 % 4294967296 > 0); {52796#false} is VALID [2022-04-28 10:11:14,235 INFO L290 TraceCheckUtils]: 24: Hoare triple {52796#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {52796#false} is VALID [2022-04-28 10:11:14,235 INFO L290 TraceCheckUtils]: 25: Hoare triple {52796#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {52796#false} is VALID [2022-04-28 10:11:14,235 INFO L290 TraceCheckUtils]: 26: Hoare triple {52796#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {52796#false} is VALID [2022-04-28 10:11:14,235 INFO L290 TraceCheckUtils]: 27: Hoare triple {52796#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {52796#false} is VALID [2022-04-28 10:11:14,235 INFO L290 TraceCheckUtils]: 28: Hoare triple {52796#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {52796#false} is VALID [2022-04-28 10:11:14,235 INFO L290 TraceCheckUtils]: 29: Hoare triple {52796#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {52796#false} is VALID [2022-04-28 10:11:14,235 INFO L290 TraceCheckUtils]: 30: Hoare triple {52796#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {52796#false} is VALID [2022-04-28 10:11:14,235 INFO L290 TraceCheckUtils]: 31: Hoare triple {52796#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {52796#false} is VALID [2022-04-28 10:11:14,235 INFO L290 TraceCheckUtils]: 32: Hoare triple {52796#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {52796#false} is VALID [2022-04-28 10:11:14,236 INFO L290 TraceCheckUtils]: 33: Hoare triple {52796#false} assume !(~y~0 % 4294967296 > 0); {52796#false} is VALID [2022-04-28 10:11:14,236 INFO L272 TraceCheckUtils]: 34: Hoare triple {52796#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {52796#false} is VALID [2022-04-28 10:11:14,236 INFO L290 TraceCheckUtils]: 35: Hoare triple {52796#false} ~cond := #in~cond; {52796#false} is VALID [2022-04-28 10:11:14,236 INFO L290 TraceCheckUtils]: 36: Hoare triple {52796#false} assume 0 == ~cond; {52796#false} is VALID [2022-04-28 10:11:14,236 INFO L290 TraceCheckUtils]: 37: Hoare triple {52796#false} assume !false; {52796#false} is VALID [2022-04-28 10:11:14,236 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-04-28 10:11:14,236 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:11:14,707 INFO L290 TraceCheckUtils]: 37: Hoare triple {52796#false} assume !false; {52796#false} is VALID [2022-04-28 10:11:14,707 INFO L290 TraceCheckUtils]: 36: Hoare triple {52796#false} assume 0 == ~cond; {52796#false} is VALID [2022-04-28 10:11:14,707 INFO L290 TraceCheckUtils]: 35: Hoare triple {52796#false} ~cond := #in~cond; {52796#false} is VALID [2022-04-28 10:11:14,708 INFO L272 TraceCheckUtils]: 34: Hoare triple {52796#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {52796#false} is VALID [2022-04-28 10:11:14,708 INFO L290 TraceCheckUtils]: 33: Hoare triple {52796#false} assume !(~y~0 % 4294967296 > 0); {52796#false} is VALID [2022-04-28 10:11:14,708 INFO L290 TraceCheckUtils]: 32: Hoare triple {52796#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {52796#false} is VALID [2022-04-28 10:11:14,708 INFO L290 TraceCheckUtils]: 31: Hoare triple {52796#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {52796#false} is VALID [2022-04-28 10:11:14,708 INFO L290 TraceCheckUtils]: 30: Hoare triple {52960#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {52796#false} is VALID [2022-04-28 10:11:14,710 INFO L290 TraceCheckUtils]: 29: Hoare triple {52964#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {52960#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:11:14,711 INFO L290 TraceCheckUtils]: 28: Hoare triple {52968#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {52964#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:11:14,711 INFO L290 TraceCheckUtils]: 27: Hoare triple {52972#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {52968#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-28 10:11:14,712 INFO L290 TraceCheckUtils]: 26: Hoare triple {52976#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {52972#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-28 10:11:14,713 INFO L290 TraceCheckUtils]: 25: Hoare triple {52980#(not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {52976#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:11:14,713 INFO L290 TraceCheckUtils]: 24: Hoare triple {52984#(not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {52980#(not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:11:14,714 INFO L290 TraceCheckUtils]: 23: Hoare triple {52988#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {52984#(not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:11:14,715 INFO L290 TraceCheckUtils]: 22: Hoare triple {52992#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {52988#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} is VALID [2022-04-28 10:11:14,715 INFO L290 TraceCheckUtils]: 21: Hoare triple {52996#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {52992#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} is VALID [2022-04-28 10:11:14,716 INFO L290 TraceCheckUtils]: 20: Hoare triple {53000#(or (< 0 (mod (+ main_~z~0 4294967293) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {52996#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} is VALID [2022-04-28 10:11:14,717 INFO L290 TraceCheckUtils]: 19: Hoare triple {53004#(or (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {53000#(or (< 0 (mod (+ main_~z~0 4294967293) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} is VALID [2022-04-28 10:11:14,718 INFO L290 TraceCheckUtils]: 18: Hoare triple {53008#(or (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {53004#(or (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} is VALID [2022-04-28 10:11:14,718 INFO L290 TraceCheckUtils]: 17: Hoare triple {53012#(or (< 0 (mod (+ 4294967290 main_~z~0) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {53008#(or (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} is VALID [2022-04-28 10:11:14,719 INFO L290 TraceCheckUtils]: 16: Hoare triple {52795#true} ~z~0 := ~y~0; {53012#(or (< 0 (mod (+ 4294967290 main_~z~0) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296))))} is VALID [2022-04-28 10:11:14,719 INFO L290 TraceCheckUtils]: 15: Hoare triple {52795#true} assume !(~x~0 % 4294967296 > 0); {52795#true} is VALID [2022-04-28 10:11:14,719 INFO L290 TraceCheckUtils]: 14: Hoare triple {52795#true} 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; {52795#true} is VALID [2022-04-28 10:11:14,719 INFO L290 TraceCheckUtils]: 13: Hoare triple {52795#true} 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; {52795#true} is VALID [2022-04-28 10:11:14,719 INFO L290 TraceCheckUtils]: 12: Hoare triple {52795#true} 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; {52795#true} is VALID [2022-04-28 10:11:14,719 INFO L290 TraceCheckUtils]: 11: Hoare triple {52795#true} 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; {52795#true} is VALID [2022-04-28 10:11:14,719 INFO L290 TraceCheckUtils]: 10: Hoare triple {52795#true} 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; {52795#true} is VALID [2022-04-28 10:11:14,719 INFO L290 TraceCheckUtils]: 9: Hoare triple {52795#true} 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; {52795#true} is VALID [2022-04-28 10:11:14,719 INFO L290 TraceCheckUtils]: 8: Hoare triple {52795#true} 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; {52795#true} is VALID [2022-04-28 10:11:14,719 INFO L290 TraceCheckUtils]: 7: Hoare triple {52795#true} 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; {52795#true} is VALID [2022-04-28 10:11:14,719 INFO L290 TraceCheckUtils]: 6: Hoare triple {52795#true} 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; {52795#true} is VALID [2022-04-28 10:11:14,719 INFO L290 TraceCheckUtils]: 5: Hoare triple {52795#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {52795#true} is VALID [2022-04-28 10:11:14,719 INFO L272 TraceCheckUtils]: 4: Hoare triple {52795#true} call #t~ret11 := main(); {52795#true} is VALID [2022-04-28 10:11:14,719 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52795#true} {52795#true} #61#return; {52795#true} is VALID [2022-04-28 10:11:14,719 INFO L290 TraceCheckUtils]: 2: Hoare triple {52795#true} assume true; {52795#true} is VALID [2022-04-28 10:11:14,719 INFO L290 TraceCheckUtils]: 1: Hoare triple {52795#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(10, 2);call #Ultimate.allocInit(12, 3); {52795#true} is VALID [2022-04-28 10:11:14,719 INFO L272 TraceCheckUtils]: 0: Hoare triple {52795#true} call ULTIMATE.init(); {52795#true} is VALID [2022-04-28 10:11:14,720 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 21 proven. 42 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-04-28 10:11:14,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1419892125] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:11:14,720 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:11:14,720 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 16] total 41 [2022-04-28 10:11:14,720 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:11:14,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [825276002] [2022-04-28 10:11:14,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [825276002] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:11:14,720 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:11:14,720 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-28 10:11:14,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821044032] [2022-04-28 10:11:14,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:11:14,720 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 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 38 [2022-04-28 10:11:14,720 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:11:14,720 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 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-28 10:11:14,739 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:11:14,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-28 10:11:14,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:11:14,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-28 10:11:14,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=1427, Unknown=0, NotChecked=0, Total=1640 [2022-04-28 10:11:14,739 INFO L87 Difference]: Start difference. First operand 117 states and 149 transitions. Second operand has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 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-28 10:11:16,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:16,142 INFO L93 Difference]: Finished difference Result 144 states and 176 transitions. [2022-04-28 10:11:16,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-28 10:11:16,142 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 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 38 [2022-04-28 10:11:16,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:11:16,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 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-28 10:11:16,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 56 transitions. [2022-04-28 10:11:16,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 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-28 10:11:16,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 56 transitions. [2022-04-28 10:11:16,143 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 56 transitions. [2022-04-28 10:11:16,184 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:11:16,185 INFO L225 Difference]: With dead ends: 144 [2022-04-28 10:11:16,185 INFO L226 Difference]: Without dead ends: 129 [2022-04-28 10:11:16,185 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 501 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=369, Invalid=2937, Unknown=0, NotChecked=0, Total=3306 [2022-04-28 10:11:16,186 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 17 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 639 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 675 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 639 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 10:11:16,186 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 103 Invalid, 675 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 639 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 10:11:16,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-04-28 10:11:16,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 118. [2022-04-28 10:11:16,322 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:11:16,323 INFO L82 GeneralOperation]: Start isEquivalent. First operand 129 states. Second operand has 118 states, 113 states have (on average 1.2920353982300885) internal successors, (146), 113 states have internal predecessors, (146), 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-28 10:11:16,323 INFO L74 IsIncluded]: Start isIncluded. First operand 129 states. Second operand has 118 states, 113 states have (on average 1.2920353982300885) internal successors, (146), 113 states have internal predecessors, (146), 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-28 10:11:16,323 INFO L87 Difference]: Start difference. First operand 129 states. Second operand has 118 states, 113 states have (on average 1.2920353982300885) internal successors, (146), 113 states have internal predecessors, (146), 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-28 10:11:16,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:16,324 INFO L93 Difference]: Finished difference Result 129 states and 161 transitions. [2022-04-28 10:11:16,324 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 161 transitions. [2022-04-28 10:11:16,324 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:11:16,324 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:11:16,324 INFO L74 IsIncluded]: Start isIncluded. First operand has 118 states, 113 states have (on average 1.2920353982300885) internal successors, (146), 113 states have internal predecessors, (146), 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 129 states. [2022-04-28 10:11:16,324 INFO L87 Difference]: Start difference. First operand has 118 states, 113 states have (on average 1.2920353982300885) internal successors, (146), 113 states have internal predecessors, (146), 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 129 states. [2022-04-28 10:11:16,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:16,325 INFO L93 Difference]: Finished difference Result 129 states and 161 transitions. [2022-04-28 10:11:16,325 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 161 transitions. [2022-04-28 10:11:16,325 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:11:16,325 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:11:16,325 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:11:16,326 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:11:16,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 113 states have (on average 1.2920353982300885) internal successors, (146), 113 states have internal predecessors, (146), 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-28 10:11:16,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 150 transitions. [2022-04-28 10:11:16,327 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 150 transitions. Word has length 38 [2022-04-28 10:11:16,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:11:16,327 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 150 transitions. [2022-04-28 10:11:16,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 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-28 10:11:16,327 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 118 states and 150 transitions. [2022-04-28 10:11:21,050 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 150 edges. 148 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-28 10:11:21,050 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 150 transitions. [2022-04-28 10:11:21,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-28 10:11:21,051 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:11:21,051 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:11:21,068 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (71)] Forceful destruction successful, exit code 0 [2022-04-28 10:11:21,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70,71 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:11:21,251 INFO L420 AbstractCegarLoop]: === Iteration 72 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:11:21,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:11:21,251 INFO L85 PathProgramCache]: Analyzing trace with hash 630692429, now seen corresponding path program 95 times [2022-04-28 10:11:21,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:11:21,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [294532284] [2022-04-28 10:11:21,253 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:11:21,253 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:11:21,253 INFO L85 PathProgramCache]: Analyzing trace with hash 630692429, now seen corresponding path program 96 times [2022-04-28 10:11:21,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:11:21,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62027201] [2022-04-28 10:11:21,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:11:21,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:11:21,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:21,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:11:21,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:21,486 INFO L290 TraceCheckUtils]: 0: Hoare triple {53903#(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(10, 2);call #Ultimate.allocInit(12, 3); {53882#true} is VALID [2022-04-28 10:11:21,486 INFO L290 TraceCheckUtils]: 1: Hoare triple {53882#true} assume true; {53882#true} is VALID [2022-04-28 10:11:21,486 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {53882#true} {53882#true} #61#return; {53882#true} is VALID [2022-04-28 10:11:21,486 INFO L272 TraceCheckUtils]: 0: Hoare triple {53882#true} call ULTIMATE.init(); {53903#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:11:21,487 INFO L290 TraceCheckUtils]: 1: Hoare triple {53903#(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(10, 2);call #Ultimate.allocInit(12, 3); {53882#true} is VALID [2022-04-28 10:11:21,487 INFO L290 TraceCheckUtils]: 2: Hoare triple {53882#true} assume true; {53882#true} is VALID [2022-04-28 10:11:21,487 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {53882#true} {53882#true} #61#return; {53882#true} is VALID [2022-04-28 10:11:21,487 INFO L272 TraceCheckUtils]: 4: Hoare triple {53882#true} call #t~ret11 := main(); {53882#true} is VALID [2022-04-28 10:11:21,487 INFO L290 TraceCheckUtils]: 5: Hoare triple {53882#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {53887#(= main_~y~0 0)} is VALID [2022-04-28 10:11:21,487 INFO L290 TraceCheckUtils]: 6: Hoare triple {53887#(= 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; {53888#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:11:21,488 INFO L290 TraceCheckUtils]: 7: Hoare triple {53888#(and (<= 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; {53889#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:11:21,488 INFO L290 TraceCheckUtils]: 8: Hoare triple {53889#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {53890#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:11:21,489 INFO L290 TraceCheckUtils]: 9: Hoare triple {53890#(and (<= main_~y~0 3) (<= 3 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; {53891#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:11:21,489 INFO L290 TraceCheckUtils]: 10: Hoare triple {53891#(and (<= main_~y~0 4) (<= 4 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; {53892#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:11:21,490 INFO L290 TraceCheckUtils]: 11: Hoare triple {53892#(and (<= 5 main_~y~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; {53893#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:11:21,490 INFO L290 TraceCheckUtils]: 12: Hoare triple {53893#(and (<= main_~y~0 6) (<= 6 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; {53894#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:11:21,491 INFO L290 TraceCheckUtils]: 13: Hoare triple {53894#(and (<= 7 main_~y~0) (<= main_~y~0 7))} 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; {53895#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:11:21,491 INFO L290 TraceCheckUtils]: 14: Hoare triple {53895#(and (<= main_~y~0 8) (<= 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; {53896#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:11:21,492 INFO L290 TraceCheckUtils]: 15: Hoare triple {53896#(and (<= 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; {53897#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:11:21,492 INFO L290 TraceCheckUtils]: 16: Hoare triple {53897#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {53897#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:11:21,492 INFO L290 TraceCheckUtils]: 17: Hoare triple {53897#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {53898#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:11:21,493 INFO L290 TraceCheckUtils]: 18: Hoare triple {53898#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {53899#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:11:21,493 INFO L290 TraceCheckUtils]: 19: Hoare triple {53899#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {53900#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:11:21,494 INFO L290 TraceCheckUtils]: 20: Hoare triple {53900#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {53901#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:11:21,494 INFO L290 TraceCheckUtils]: 21: Hoare triple {53901#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {53902#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} is VALID [2022-04-28 10:11:21,495 INFO L290 TraceCheckUtils]: 22: Hoare triple {53902#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {53883#false} is VALID [2022-04-28 10:11:21,495 INFO L290 TraceCheckUtils]: 23: Hoare triple {53883#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {53883#false} is VALID [2022-04-28 10:11:21,495 INFO L290 TraceCheckUtils]: 24: Hoare triple {53883#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {53883#false} is VALID [2022-04-28 10:11:21,495 INFO L290 TraceCheckUtils]: 25: Hoare triple {53883#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {53883#false} is VALID [2022-04-28 10:11:21,495 INFO L290 TraceCheckUtils]: 26: Hoare triple {53883#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {53883#false} is VALID [2022-04-28 10:11:21,495 INFO L290 TraceCheckUtils]: 27: Hoare triple {53883#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {53883#false} is VALID [2022-04-28 10:11:21,495 INFO L290 TraceCheckUtils]: 28: Hoare triple {53883#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {53883#false} is VALID [2022-04-28 10:11:21,495 INFO L290 TraceCheckUtils]: 29: Hoare triple {53883#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {53883#false} is VALID [2022-04-28 10:11:21,495 INFO L290 TraceCheckUtils]: 30: Hoare triple {53883#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {53883#false} is VALID [2022-04-28 10:11:21,495 INFO L290 TraceCheckUtils]: 31: Hoare triple {53883#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {53883#false} is VALID [2022-04-28 10:11:21,495 INFO L290 TraceCheckUtils]: 32: Hoare triple {53883#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {53883#false} is VALID [2022-04-28 10:11:21,495 INFO L290 TraceCheckUtils]: 33: Hoare triple {53883#false} assume !(~y~0 % 4294967296 > 0); {53883#false} is VALID [2022-04-28 10:11:21,495 INFO L272 TraceCheckUtils]: 34: Hoare triple {53883#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {53883#false} is VALID [2022-04-28 10:11:21,495 INFO L290 TraceCheckUtils]: 35: Hoare triple {53883#false} ~cond := #in~cond; {53883#false} is VALID [2022-04-28 10:11:21,495 INFO L290 TraceCheckUtils]: 36: Hoare triple {53883#false} assume 0 == ~cond; {53883#false} is VALID [2022-04-28 10:11:21,495 INFO L290 TraceCheckUtils]: 37: Hoare triple {53883#false} assume !false; {53883#false} is VALID [2022-04-28 10:11:21,496 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-04-28 10:11:21,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:11:21,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62027201] [2022-04-28 10:11:21,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62027201] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:11:21,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1474226509] [2022-04-28 10:11:21,496 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:11:21,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:11:21,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:11:21,497 INFO L229 MonitoredProcess]: Starting monitored process 72 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:11:21,497 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (72)] Waiting until timeout for monitored process [2022-04-28 10:11:21,714 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-04-28 10:11:21,715 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:11:21,716 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-28 10:11:21,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:21,724 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:11:21,967 INFO L272 TraceCheckUtils]: 0: Hoare triple {53882#true} call ULTIMATE.init(); {53882#true} is VALID [2022-04-28 10:11:21,967 INFO L290 TraceCheckUtils]: 1: Hoare triple {53882#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(10, 2);call #Ultimate.allocInit(12, 3); {53882#true} is VALID [2022-04-28 10:11:21,967 INFO L290 TraceCheckUtils]: 2: Hoare triple {53882#true} assume true; {53882#true} is VALID [2022-04-28 10:11:21,967 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {53882#true} {53882#true} #61#return; {53882#true} is VALID [2022-04-28 10:11:21,967 INFO L272 TraceCheckUtils]: 4: Hoare triple {53882#true} call #t~ret11 := main(); {53882#true} is VALID [2022-04-28 10:11:21,968 INFO L290 TraceCheckUtils]: 5: Hoare triple {53882#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {53887#(= main_~y~0 0)} is VALID [2022-04-28 10:11:21,968 INFO L290 TraceCheckUtils]: 6: Hoare triple {53887#(= 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; {53888#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:11:21,968 INFO L290 TraceCheckUtils]: 7: Hoare triple {53888#(and (<= 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; {53889#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:11:21,969 INFO L290 TraceCheckUtils]: 8: Hoare triple {53889#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {53890#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:11:21,969 INFO L290 TraceCheckUtils]: 9: Hoare triple {53890#(and (<= main_~y~0 3) (<= 3 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; {53891#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:11:21,970 INFO L290 TraceCheckUtils]: 10: Hoare triple {53891#(and (<= main_~y~0 4) (<= 4 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; {53892#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:11:21,970 INFO L290 TraceCheckUtils]: 11: Hoare triple {53892#(and (<= 5 main_~y~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; {53893#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:11:21,971 INFO L290 TraceCheckUtils]: 12: Hoare triple {53893#(and (<= main_~y~0 6) (<= 6 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; {53894#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:11:21,971 INFO L290 TraceCheckUtils]: 13: Hoare triple {53894#(and (<= 7 main_~y~0) (<= main_~y~0 7))} 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; {53895#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:11:21,972 INFO L290 TraceCheckUtils]: 14: Hoare triple {53895#(and (<= main_~y~0 8) (<= 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; {53896#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:11:21,972 INFO L290 TraceCheckUtils]: 15: Hoare triple {53896#(and (<= 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; {53897#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:11:21,973 INFO L290 TraceCheckUtils]: 16: Hoare triple {53897#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {53897#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:11:21,973 INFO L290 TraceCheckUtils]: 17: Hoare triple {53897#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {53898#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:11:21,974 INFO L290 TraceCheckUtils]: 18: Hoare triple {53898#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {53899#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:11:21,975 INFO L290 TraceCheckUtils]: 19: Hoare triple {53899#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {53900#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:11:21,975 INFO L290 TraceCheckUtils]: 20: Hoare triple {53900#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {53901#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:11:21,976 INFO L290 TraceCheckUtils]: 21: Hoare triple {53901#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {53970#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:11:21,976 INFO L290 TraceCheckUtils]: 22: Hoare triple {53970#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {53883#false} is VALID [2022-04-28 10:11:21,976 INFO L290 TraceCheckUtils]: 23: Hoare triple {53883#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {53883#false} is VALID [2022-04-28 10:11:21,976 INFO L290 TraceCheckUtils]: 24: Hoare triple {53883#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {53883#false} is VALID [2022-04-28 10:11:21,976 INFO L290 TraceCheckUtils]: 25: Hoare triple {53883#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {53883#false} is VALID [2022-04-28 10:11:21,976 INFO L290 TraceCheckUtils]: 26: Hoare triple {53883#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {53883#false} is VALID [2022-04-28 10:11:21,977 INFO L290 TraceCheckUtils]: 27: Hoare triple {53883#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {53883#false} is VALID [2022-04-28 10:11:21,977 INFO L290 TraceCheckUtils]: 28: Hoare triple {53883#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {53883#false} is VALID [2022-04-28 10:11:21,977 INFO L290 TraceCheckUtils]: 29: Hoare triple {53883#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {53883#false} is VALID [2022-04-28 10:11:21,977 INFO L290 TraceCheckUtils]: 30: Hoare triple {53883#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {53883#false} is VALID [2022-04-28 10:11:21,977 INFO L290 TraceCheckUtils]: 31: Hoare triple {53883#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {53883#false} is VALID [2022-04-28 10:11:21,977 INFO L290 TraceCheckUtils]: 32: Hoare triple {53883#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {53883#false} is VALID [2022-04-28 10:11:21,977 INFO L290 TraceCheckUtils]: 33: Hoare triple {53883#false} assume !(~y~0 % 4294967296 > 0); {53883#false} is VALID [2022-04-28 10:11:21,977 INFO L272 TraceCheckUtils]: 34: Hoare triple {53883#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {53883#false} is VALID [2022-04-28 10:11:21,977 INFO L290 TraceCheckUtils]: 35: Hoare triple {53883#false} ~cond := #in~cond; {53883#false} is VALID [2022-04-28 10:11:21,977 INFO L290 TraceCheckUtils]: 36: Hoare triple {53883#false} assume 0 == ~cond; {53883#false} is VALID [2022-04-28 10:11:21,977 INFO L290 TraceCheckUtils]: 37: Hoare triple {53883#false} assume !false; {53883#false} is VALID [2022-04-28 10:11:21,977 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-04-28 10:11:21,977 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:11:22,416 INFO L290 TraceCheckUtils]: 37: Hoare triple {53883#false} assume !false; {53883#false} is VALID [2022-04-28 10:11:22,416 INFO L290 TraceCheckUtils]: 36: Hoare triple {53883#false} assume 0 == ~cond; {53883#false} is VALID [2022-04-28 10:11:22,416 INFO L290 TraceCheckUtils]: 35: Hoare triple {53883#false} ~cond := #in~cond; {53883#false} is VALID [2022-04-28 10:11:22,416 INFO L272 TraceCheckUtils]: 34: Hoare triple {53883#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {53883#false} is VALID [2022-04-28 10:11:22,416 INFO L290 TraceCheckUtils]: 33: Hoare triple {53883#false} assume !(~y~0 % 4294967296 > 0); {53883#false} is VALID [2022-04-28 10:11:22,416 INFO L290 TraceCheckUtils]: 32: Hoare triple {53883#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {53883#false} is VALID [2022-04-28 10:11:22,417 INFO L290 TraceCheckUtils]: 31: Hoare triple {53883#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {53883#false} is VALID [2022-04-28 10:11:22,417 INFO L290 TraceCheckUtils]: 30: Hoare triple {53883#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {53883#false} is VALID [2022-04-28 10:11:22,417 INFO L290 TraceCheckUtils]: 29: Hoare triple {53883#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {53883#false} is VALID [2022-04-28 10:11:22,417 INFO L290 TraceCheckUtils]: 28: Hoare triple {53883#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {53883#false} is VALID [2022-04-28 10:11:22,417 INFO L290 TraceCheckUtils]: 27: Hoare triple {53883#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {53883#false} is VALID [2022-04-28 10:11:22,417 INFO L290 TraceCheckUtils]: 26: Hoare triple {53883#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {53883#false} is VALID [2022-04-28 10:11:22,417 INFO L290 TraceCheckUtils]: 25: Hoare triple {53883#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {53883#false} is VALID [2022-04-28 10:11:22,417 INFO L290 TraceCheckUtils]: 24: Hoare triple {53883#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {53883#false} is VALID [2022-04-28 10:11:22,417 INFO L290 TraceCheckUtils]: 23: Hoare triple {53883#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {53883#false} is VALID [2022-04-28 10:11:22,417 INFO L290 TraceCheckUtils]: 22: Hoare triple {54064#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {53883#false} is VALID [2022-04-28 10:11:22,418 INFO L290 TraceCheckUtils]: 21: Hoare triple {54068#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {54064#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:11:22,419 INFO L290 TraceCheckUtils]: 20: Hoare triple {54072#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {54068#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:11:22,420 INFO L290 TraceCheckUtils]: 19: Hoare triple {54076#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {54072#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-28 10:11:22,420 INFO L290 TraceCheckUtils]: 18: Hoare triple {54080#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {54076#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-28 10:11:22,421 INFO L290 TraceCheckUtils]: 17: Hoare triple {54084#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} ~z~0 := ~y~0; {54080#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID [2022-04-28 10:11:22,421 INFO L290 TraceCheckUtils]: 16: Hoare triple {54084#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {54084#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-28 10:11:22,421 INFO L290 TraceCheckUtils]: 15: Hoare triple {54091#(< 0 (mod (+ main_~y~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; {54084#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-28 10:11:22,422 INFO L290 TraceCheckUtils]: 14: Hoare triple {54095#(< 0 (mod (+ main_~y~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; {54091#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 10:11:22,423 INFO L290 TraceCheckUtils]: 13: Hoare triple {54099#(< 0 (mod (+ main_~y~0 4294967295) 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; {54095#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:11:22,423 INFO L290 TraceCheckUtils]: 12: Hoare triple {54103#(< 0 (mod main_~y~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; {54099#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:11:22,424 INFO L290 TraceCheckUtils]: 11: Hoare triple {54107#(< 0 (mod (+ main_~y~0 1) 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; {54103#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:11:22,425 INFO L290 TraceCheckUtils]: 10: Hoare triple {54111#(< 0 (mod (+ main_~y~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; {54107#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:11:22,425 INFO L290 TraceCheckUtils]: 9: Hoare triple {54115#(< 0 (mod (+ main_~y~0 3) 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; {54111#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:11:22,426 INFO L290 TraceCheckUtils]: 8: Hoare triple {54119#(< 0 (mod (+ main_~y~0 4) 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; {54115#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:11:22,426 INFO L290 TraceCheckUtils]: 7: Hoare triple {54123#(< 0 (mod (+ 5 main_~y~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; {54119#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:11:22,427 INFO L290 TraceCheckUtils]: 6: Hoare triple {54127#(< 0 (mod (+ main_~y~0 6) 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; {54123#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:11:22,428 INFO L290 TraceCheckUtils]: 5: Hoare triple {53882#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {54127#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:11:22,428 INFO L272 TraceCheckUtils]: 4: Hoare triple {53882#true} call #t~ret11 := main(); {53882#true} is VALID [2022-04-28 10:11:22,428 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {53882#true} {53882#true} #61#return; {53882#true} is VALID [2022-04-28 10:11:22,428 INFO L290 TraceCheckUtils]: 2: Hoare triple {53882#true} assume true; {53882#true} is VALID [2022-04-28 10:11:22,428 INFO L290 TraceCheckUtils]: 1: Hoare triple {53882#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(10, 2);call #Ultimate.allocInit(12, 3); {53882#true} is VALID [2022-04-28 10:11:22,428 INFO L272 TraceCheckUtils]: 0: Hoare triple {53882#true} call ULTIMATE.init(); {53882#true} is VALID [2022-04-28 10:11:22,428 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-04-28 10:11:22,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1474226509] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:11:22,428 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:11:22,428 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 36 [2022-04-28 10:11:22,428 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:11:22,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [294532284] [2022-04-28 10:11:22,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [294532284] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:11:22,428 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:11:22,428 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-28 10:11:22,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357393375] [2022-04-28 10:11:22,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:11:22,429 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 states have internal predecessors, (25), 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 38 [2022-04-28 10:11:22,429 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:11:22,429 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 states have internal predecessors, (25), 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-28 10:11:22,446 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-28 10:11:22,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-28 10:11:22,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:11:22,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-28 10:11:22,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=220, Invalid=1040, Unknown=0, NotChecked=0, Total=1260 [2022-04-28 10:11:22,447 INFO L87 Difference]: Start difference. First operand 118 states and 150 transitions. Second operand has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 states have internal predecessors, (25), 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-28 10:11:23,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:23,689 INFO L93 Difference]: Finished difference Result 147 states and 179 transitions. [2022-04-28 10:11:23,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-28 10:11:23,689 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 states have internal predecessors, (25), 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 38 [2022-04-28 10:11:23,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:11:23,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 states have internal predecessors, (25), 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-28 10:11:23,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 64 transitions. [2022-04-28 10:11:23,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 states have internal predecessors, (25), 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-28 10:11:23,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 64 transitions. [2022-04-28 10:11:23,690 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 64 transitions. [2022-04-28 10:11:23,738 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:11:23,739 INFO L225 Difference]: With dead ends: 147 [2022-04-28 10:11:23,739 INFO L226 Difference]: Without dead ends: 131 [2022-04-28 10:11:23,739 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 291 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=592, Invalid=2488, Unknown=0, NotChecked=0, Total=3080 [2022-04-28 10:11:23,740 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 23 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 549 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 10:11:23,740 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 80 Invalid, 594 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 549 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 10:11:23,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-04-28 10:11:23,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 119. [2022-04-28 10:11:23,872 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:11:23,872 INFO L82 GeneralOperation]: Start isEquivalent. First operand 131 states. Second operand has 119 states, 114 states have (on average 1.2894736842105263) internal successors, (147), 114 states have internal predecessors, (147), 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-28 10:11:23,872 INFO L74 IsIncluded]: Start isIncluded. First operand 131 states. Second operand has 119 states, 114 states have (on average 1.2894736842105263) internal successors, (147), 114 states have internal predecessors, (147), 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-28 10:11:23,872 INFO L87 Difference]: Start difference. First operand 131 states. Second operand has 119 states, 114 states have (on average 1.2894736842105263) internal successors, (147), 114 states have internal predecessors, (147), 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-28 10:11:23,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:23,873 INFO L93 Difference]: Finished difference Result 131 states and 163 transitions. [2022-04-28 10:11:23,873 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 163 transitions. [2022-04-28 10:11:23,873 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:11:23,873 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:11:23,873 INFO L74 IsIncluded]: Start isIncluded. First operand has 119 states, 114 states have (on average 1.2894736842105263) internal successors, (147), 114 states have internal predecessors, (147), 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 131 states. [2022-04-28 10:11:23,874 INFO L87 Difference]: Start difference. First operand has 119 states, 114 states have (on average 1.2894736842105263) internal successors, (147), 114 states have internal predecessors, (147), 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 131 states. [2022-04-28 10:11:23,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:23,874 INFO L93 Difference]: Finished difference Result 131 states and 163 transitions. [2022-04-28 10:11:23,874 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 163 transitions. [2022-04-28 10:11:23,875 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:11:23,875 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:11:23,875 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:11:23,875 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:11:23,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 114 states have (on average 1.2894736842105263) internal successors, (147), 114 states have internal predecessors, (147), 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-28 10:11:23,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 151 transitions. [2022-04-28 10:11:23,876 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 151 transitions. Word has length 38 [2022-04-28 10:11:23,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:11:23,876 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 151 transitions. [2022-04-28 10:11:23,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 states have internal predecessors, (25), 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-28 10:11:23,876 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 119 states and 151 transitions. [2022-04-28 10:11:24,934 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 151 edges. 151 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:11:24,935 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 151 transitions. [2022-04-28 10:11:24,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-28 10:11:24,935 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:11:24,935 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:11:24,940 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (72)] Forceful destruction successful, exit code 0 [2022-04-28 10:11:25,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71,72 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:11:25,135 INFO L420 AbstractCegarLoop]: === Iteration 73 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:11:25,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:11:25,136 INFO L85 PathProgramCache]: Analyzing trace with hash -1787736705, now seen corresponding path program 97 times [2022-04-28 10:11:25,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:11:25,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1641911767] [2022-04-28 10:11:25,137 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:11:25,138 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:11:25,138 INFO L85 PathProgramCache]: Analyzing trace with hash -1787736705, now seen corresponding path program 98 times [2022-04-28 10:11:25,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:11:25,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486527406] [2022-04-28 10:11:25,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:11:25,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:11:25,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:25,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:11:25,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:25,349 INFO L290 TraceCheckUtils]: 0: Hoare triple {55002#(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(10, 2);call #Ultimate.allocInit(12, 3); {54982#true} is VALID [2022-04-28 10:11:25,349 INFO L290 TraceCheckUtils]: 1: Hoare triple {54982#true} assume true; {54982#true} is VALID [2022-04-28 10:11:25,349 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {54982#true} {54982#true} #61#return; {54982#true} is VALID [2022-04-28 10:11:25,350 INFO L272 TraceCheckUtils]: 0: Hoare triple {54982#true} call ULTIMATE.init(); {55002#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:11:25,350 INFO L290 TraceCheckUtils]: 1: Hoare triple {55002#(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(10, 2);call #Ultimate.allocInit(12, 3); {54982#true} is VALID [2022-04-28 10:11:25,350 INFO L290 TraceCheckUtils]: 2: Hoare triple {54982#true} assume true; {54982#true} is VALID [2022-04-28 10:11:25,350 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {54982#true} {54982#true} #61#return; {54982#true} is VALID [2022-04-28 10:11:25,350 INFO L272 TraceCheckUtils]: 4: Hoare triple {54982#true} call #t~ret11 := main(); {54982#true} is VALID [2022-04-28 10:11:25,350 INFO L290 TraceCheckUtils]: 5: Hoare triple {54982#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {54987#(= main_~y~0 0)} is VALID [2022-04-28 10:11:25,351 INFO L290 TraceCheckUtils]: 6: Hoare triple {54987#(= 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; {54988#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:11:25,351 INFO L290 TraceCheckUtils]: 7: Hoare triple {54988#(and (<= 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; {54989#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:11:25,352 INFO L290 TraceCheckUtils]: 8: Hoare triple {54989#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {54990#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:11:25,352 INFO L290 TraceCheckUtils]: 9: Hoare triple {54990#(and (<= main_~y~0 3) (<= 3 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; {54991#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:11:25,353 INFO L290 TraceCheckUtils]: 10: Hoare triple {54991#(and (<= main_~y~0 4) (<= 4 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; {54992#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:11:25,353 INFO L290 TraceCheckUtils]: 11: Hoare triple {54992#(and (<= 5 main_~y~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; {54993#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:11:25,354 INFO L290 TraceCheckUtils]: 12: Hoare triple {54993#(and (<= main_~y~0 6) (<= 6 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; {54994#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:11:25,354 INFO L290 TraceCheckUtils]: 13: Hoare triple {54994#(and (<= 7 main_~y~0) (<= main_~y~0 7))} 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; {54995#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:11:25,355 INFO L290 TraceCheckUtils]: 14: Hoare triple {54995#(and (<= main_~y~0 8) (<= 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; {54996#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:11:25,355 INFO L290 TraceCheckUtils]: 15: Hoare triple {54996#(and (<= 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; {54997#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:11:25,356 INFO L290 TraceCheckUtils]: 16: Hoare triple {54997#(and (<= main_~y~0 10) (<= 10 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; {54998#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:11:25,356 INFO L290 TraceCheckUtils]: 17: Hoare triple {54998#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {54998#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:11:25,356 INFO L290 TraceCheckUtils]: 18: Hoare triple {54998#(and (<= main_~y~0 11) (<= 11 main_~y~0))} ~z~0 := ~y~0; {54999#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-28 10:11:25,357 INFO L290 TraceCheckUtils]: 19: Hoare triple {54999#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {55000#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:11:25,357 INFO L290 TraceCheckUtils]: 20: Hoare triple {55000#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {55001#(and (<= 9 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:11:25,358 INFO L290 TraceCheckUtils]: 21: Hoare triple {55001#(and (<= 9 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {54983#false} is VALID [2022-04-28 10:11:25,358 INFO L290 TraceCheckUtils]: 22: Hoare triple {54983#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {54983#false} is VALID [2022-04-28 10:11:25,358 INFO L290 TraceCheckUtils]: 23: Hoare triple {54983#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {54983#false} is VALID [2022-04-28 10:11:25,358 INFO L290 TraceCheckUtils]: 24: Hoare triple {54983#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {54983#false} is VALID [2022-04-28 10:11:25,358 INFO L290 TraceCheckUtils]: 25: Hoare triple {54983#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {54983#false} is VALID [2022-04-28 10:11:25,358 INFO L290 TraceCheckUtils]: 26: Hoare triple {54983#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {54983#false} is VALID [2022-04-28 10:11:25,358 INFO L290 TraceCheckUtils]: 27: Hoare triple {54983#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {54983#false} is VALID [2022-04-28 10:11:25,358 INFO L290 TraceCheckUtils]: 28: Hoare triple {54983#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {54983#false} is VALID [2022-04-28 10:11:25,358 INFO L290 TraceCheckUtils]: 29: Hoare triple {54983#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {54983#false} is VALID [2022-04-28 10:11:25,358 INFO L290 TraceCheckUtils]: 30: Hoare triple {54983#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {54983#false} is VALID [2022-04-28 10:11:25,358 INFO L290 TraceCheckUtils]: 31: Hoare triple {54983#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {54983#false} is VALID [2022-04-28 10:11:25,358 INFO L290 TraceCheckUtils]: 32: Hoare triple {54983#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {54983#false} is VALID [2022-04-28 10:11:25,358 INFO L290 TraceCheckUtils]: 33: Hoare triple {54983#false} assume !(~y~0 % 4294967296 > 0); {54983#false} is VALID [2022-04-28 10:11:25,358 INFO L272 TraceCheckUtils]: 34: Hoare triple {54983#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {54983#false} is VALID [2022-04-28 10:11:25,358 INFO L290 TraceCheckUtils]: 35: Hoare triple {54983#false} ~cond := #in~cond; {54983#false} is VALID [2022-04-28 10:11:25,358 INFO L290 TraceCheckUtils]: 36: Hoare triple {54983#false} assume 0 == ~cond; {54983#false} is VALID [2022-04-28 10:11:25,358 INFO L290 TraceCheckUtils]: 37: Hoare triple {54983#false} assume !false; {54983#false} is VALID [2022-04-28 10:11:25,358 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-04-28 10:11:25,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:11:25,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486527406] [2022-04-28 10:11:25,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486527406] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:11:25,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1276050611] [2022-04-28 10:11:25,359 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:11:25,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:11:25,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:11:25,360 INFO L229 MonitoredProcess]: Starting monitored process 73 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:11:25,361 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (73)] Waiting until timeout for monitored process [2022-04-28 10:11:25,400 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:11:25,400 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:11:25,401 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-28 10:11:25,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:25,409 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:11:25,649 INFO L272 TraceCheckUtils]: 0: Hoare triple {54982#true} call ULTIMATE.init(); {54982#true} is VALID [2022-04-28 10:11:25,649 INFO L290 TraceCheckUtils]: 1: Hoare triple {54982#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(10, 2);call #Ultimate.allocInit(12, 3); {54982#true} is VALID [2022-04-28 10:11:25,649 INFO L290 TraceCheckUtils]: 2: Hoare triple {54982#true} assume true; {54982#true} is VALID [2022-04-28 10:11:25,649 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {54982#true} {54982#true} #61#return; {54982#true} is VALID [2022-04-28 10:11:25,649 INFO L272 TraceCheckUtils]: 4: Hoare triple {54982#true} call #t~ret11 := main(); {54982#true} is VALID [2022-04-28 10:11:25,649 INFO L290 TraceCheckUtils]: 5: Hoare triple {54982#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {54987#(= main_~y~0 0)} is VALID [2022-04-28 10:11:25,650 INFO L290 TraceCheckUtils]: 6: Hoare triple {54987#(= 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; {54988#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:11:25,650 INFO L290 TraceCheckUtils]: 7: Hoare triple {54988#(and (<= 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; {54989#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:11:25,651 INFO L290 TraceCheckUtils]: 8: Hoare triple {54989#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {54990#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:11:25,651 INFO L290 TraceCheckUtils]: 9: Hoare triple {54990#(and (<= main_~y~0 3) (<= 3 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; {54991#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:11:25,652 INFO L290 TraceCheckUtils]: 10: Hoare triple {54991#(and (<= main_~y~0 4) (<= 4 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; {54992#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:11:25,652 INFO L290 TraceCheckUtils]: 11: Hoare triple {54992#(and (<= 5 main_~y~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; {54993#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:11:25,653 INFO L290 TraceCheckUtils]: 12: Hoare triple {54993#(and (<= main_~y~0 6) (<= 6 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; {54994#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:11:25,653 INFO L290 TraceCheckUtils]: 13: Hoare triple {54994#(and (<= 7 main_~y~0) (<= main_~y~0 7))} 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; {54995#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:11:25,654 INFO L290 TraceCheckUtils]: 14: Hoare triple {54995#(and (<= main_~y~0 8) (<= 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; {54996#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:11:25,654 INFO L290 TraceCheckUtils]: 15: Hoare triple {54996#(and (<= 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; {54997#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:11:25,655 INFO L290 TraceCheckUtils]: 16: Hoare triple {54997#(and (<= main_~y~0 10) (<= 10 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; {54998#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:11:25,655 INFO L290 TraceCheckUtils]: 17: Hoare triple {54998#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {54998#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:11:25,655 INFO L290 TraceCheckUtils]: 18: Hoare triple {54998#(and (<= main_~y~0 11) (<= 11 main_~y~0))} ~z~0 := ~y~0; {54999#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-28 10:11:25,656 INFO L290 TraceCheckUtils]: 19: Hoare triple {54999#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {55000#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:11:25,656 INFO L290 TraceCheckUtils]: 20: Hoare triple {55000#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {55066#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:11:25,657 INFO L290 TraceCheckUtils]: 21: Hoare triple {55066#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !(~z~0 % 4294967296 > 0); {54983#false} is VALID [2022-04-28 10:11:25,657 INFO L290 TraceCheckUtils]: 22: Hoare triple {54983#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {54983#false} is VALID [2022-04-28 10:11:25,657 INFO L290 TraceCheckUtils]: 23: Hoare triple {54983#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {54983#false} is VALID [2022-04-28 10:11:25,657 INFO L290 TraceCheckUtils]: 24: Hoare triple {54983#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {54983#false} is VALID [2022-04-28 10:11:25,657 INFO L290 TraceCheckUtils]: 25: Hoare triple {54983#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {54983#false} is VALID [2022-04-28 10:11:25,657 INFO L290 TraceCheckUtils]: 26: Hoare triple {54983#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {54983#false} is VALID [2022-04-28 10:11:25,657 INFO L290 TraceCheckUtils]: 27: Hoare triple {54983#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {54983#false} is VALID [2022-04-28 10:11:25,657 INFO L290 TraceCheckUtils]: 28: Hoare triple {54983#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {54983#false} is VALID [2022-04-28 10:11:25,657 INFO L290 TraceCheckUtils]: 29: Hoare triple {54983#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {54983#false} is VALID [2022-04-28 10:11:25,657 INFO L290 TraceCheckUtils]: 30: Hoare triple {54983#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {54983#false} is VALID [2022-04-28 10:11:25,657 INFO L290 TraceCheckUtils]: 31: Hoare triple {54983#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {54983#false} is VALID [2022-04-28 10:11:25,657 INFO L290 TraceCheckUtils]: 32: Hoare triple {54983#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {54983#false} is VALID [2022-04-28 10:11:25,657 INFO L290 TraceCheckUtils]: 33: Hoare triple {54983#false} assume !(~y~0 % 4294967296 > 0); {54983#false} is VALID [2022-04-28 10:11:25,657 INFO L272 TraceCheckUtils]: 34: Hoare triple {54983#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {54983#false} is VALID [2022-04-28 10:11:25,657 INFO L290 TraceCheckUtils]: 35: Hoare triple {54983#false} ~cond := #in~cond; {54983#false} is VALID [2022-04-28 10:11:25,657 INFO L290 TraceCheckUtils]: 36: Hoare triple {54983#false} assume 0 == ~cond; {54983#false} is VALID [2022-04-28 10:11:25,658 INFO L290 TraceCheckUtils]: 37: Hoare triple {54983#false} assume !false; {54983#false} is VALID [2022-04-28 10:11:25,658 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-04-28 10:11:25,658 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:11:26,076 INFO L290 TraceCheckUtils]: 37: Hoare triple {54983#false} assume !false; {54983#false} is VALID [2022-04-28 10:11:26,076 INFO L290 TraceCheckUtils]: 36: Hoare triple {54983#false} assume 0 == ~cond; {54983#false} is VALID [2022-04-28 10:11:26,077 INFO L290 TraceCheckUtils]: 35: Hoare triple {54983#false} ~cond := #in~cond; {54983#false} is VALID [2022-04-28 10:11:26,077 INFO L272 TraceCheckUtils]: 34: Hoare triple {54983#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {54983#false} is VALID [2022-04-28 10:11:26,077 INFO L290 TraceCheckUtils]: 33: Hoare triple {54983#false} assume !(~y~0 % 4294967296 > 0); {54983#false} is VALID [2022-04-28 10:11:26,077 INFO L290 TraceCheckUtils]: 32: Hoare triple {54983#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {54983#false} is VALID [2022-04-28 10:11:26,077 INFO L290 TraceCheckUtils]: 31: Hoare triple {54983#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {54983#false} is VALID [2022-04-28 10:11:26,077 INFO L290 TraceCheckUtils]: 30: Hoare triple {54983#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {54983#false} is VALID [2022-04-28 10:11:26,077 INFO L290 TraceCheckUtils]: 29: Hoare triple {54983#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {54983#false} is VALID [2022-04-28 10:11:26,077 INFO L290 TraceCheckUtils]: 28: Hoare triple {54983#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {54983#false} is VALID [2022-04-28 10:11:26,077 INFO L290 TraceCheckUtils]: 27: Hoare triple {54983#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {54983#false} is VALID [2022-04-28 10:11:26,077 INFO L290 TraceCheckUtils]: 26: Hoare triple {54983#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {54983#false} is VALID [2022-04-28 10:11:26,077 INFO L290 TraceCheckUtils]: 25: Hoare triple {54983#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {54983#false} is VALID [2022-04-28 10:11:26,077 INFO L290 TraceCheckUtils]: 24: Hoare triple {54983#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {54983#false} is VALID [2022-04-28 10:11:26,077 INFO L290 TraceCheckUtils]: 23: Hoare triple {54983#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {54983#false} is VALID [2022-04-28 10:11:26,077 INFO L290 TraceCheckUtils]: 22: Hoare triple {54983#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {54983#false} is VALID [2022-04-28 10:11:26,077 INFO L290 TraceCheckUtils]: 21: Hoare triple {55166#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {54983#false} is VALID [2022-04-28 10:11:26,078 INFO L290 TraceCheckUtils]: 20: Hoare triple {55170#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {55166#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:11:26,079 INFO L290 TraceCheckUtils]: 19: Hoare triple {55174#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {55170#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:11:26,079 INFO L290 TraceCheckUtils]: 18: Hoare triple {55178#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} ~z~0 := ~y~0; {55174#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-28 10:11:26,080 INFO L290 TraceCheckUtils]: 17: Hoare triple {55178#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !(~x~0 % 4294967296 > 0); {55178#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:11:26,080 INFO L290 TraceCheckUtils]: 16: Hoare triple {55185#(< 0 (mod (+ main_~y~0 4294967295) 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; {55178#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:11:26,081 INFO L290 TraceCheckUtils]: 15: Hoare triple {55189#(< 0 (mod main_~y~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; {55185#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:11:26,082 INFO L290 TraceCheckUtils]: 14: Hoare triple {55193#(< 0 (mod (+ main_~y~0 1) 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; {55189#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:11:26,082 INFO L290 TraceCheckUtils]: 13: Hoare triple {55197#(< 0 (mod (+ main_~y~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; {55193#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:11:26,083 INFO L290 TraceCheckUtils]: 12: Hoare triple {55201#(< 0 (mod (+ main_~y~0 3) 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; {55197#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:11:26,084 INFO L290 TraceCheckUtils]: 11: Hoare triple {55205#(< 0 (mod (+ main_~y~0 4) 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; {55201#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:11:26,084 INFO L290 TraceCheckUtils]: 10: Hoare triple {55209#(< 0 (mod (+ 5 main_~y~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; {55205#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:11:26,085 INFO L290 TraceCheckUtils]: 9: Hoare triple {55213#(< 0 (mod (+ main_~y~0 6) 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; {55209#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:11:26,086 INFO L290 TraceCheckUtils]: 8: Hoare triple {55217#(< 0 (mod (+ 7 main_~y~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; {55213#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:11:26,086 INFO L290 TraceCheckUtils]: 7: Hoare triple {55221#(< 0 (mod (+ main_~y~0 8) 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; {55217#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:11:26,087 INFO L290 TraceCheckUtils]: 6: Hoare triple {55225#(< 0 (mod (+ main_~y~0 9) 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; {55221#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:11:26,087 INFO L290 TraceCheckUtils]: 5: Hoare triple {54982#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {55225#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:11:26,087 INFO L272 TraceCheckUtils]: 4: Hoare triple {54982#true} call #t~ret11 := main(); {54982#true} is VALID [2022-04-28 10:11:26,087 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {54982#true} {54982#true} #61#return; {54982#true} is VALID [2022-04-28 10:11:26,087 INFO L290 TraceCheckUtils]: 2: Hoare triple {54982#true} assume true; {54982#true} is VALID [2022-04-28 10:11:26,087 INFO L290 TraceCheckUtils]: 1: Hoare triple {54982#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(10, 2);call #Ultimate.allocInit(12, 3); {54982#true} is VALID [2022-04-28 10:11:26,088 INFO L272 TraceCheckUtils]: 0: Hoare triple {54982#true} call ULTIMATE.init(); {54982#true} is VALID [2022-04-28 10:11:26,088 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 0 proven. 69 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-04-28 10:11:26,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1276050611] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:11:26,088 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:11:26,088 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 34 [2022-04-28 10:11:26,088 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:11:26,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1641911767] [2022-04-28 10:11:26,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1641911767] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:11:26,088 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:11:26,088 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-28 10:11:26,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698165765] [2022-04-28 10:11:26,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:11:26,088 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 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 38 [2022-04-28 10:11:26,089 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:11:26,089 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 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-28 10:11:26,107 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:11:26,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-28 10:11:26,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:11:26,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-28 10:11:26,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=901, Unknown=0, NotChecked=0, Total=1122 [2022-04-28 10:11:26,107 INFO L87 Difference]: Start difference. First operand 119 states and 151 transitions. Second operand has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 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-28 10:11:27,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:27,373 INFO L93 Difference]: Finished difference Result 150 states and 182 transitions. [2022-04-28 10:11:27,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-28 10:11:27,373 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 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 38 [2022-04-28 10:11:27,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:11:27,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 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-28 10:11:27,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 67 transitions. [2022-04-28 10:11:27,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 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-28 10:11:27,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 67 transitions. [2022-04-28 10:11:27,374 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 67 transitions. [2022-04-28 10:11:27,431 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:11:27,432 INFO L225 Difference]: With dead ends: 150 [2022-04-28 10:11:27,432 INFO L226 Difference]: Without dead ends: 133 [2022-04-28 10:11:27,432 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=542, Invalid=2110, Unknown=0, NotChecked=0, Total=2652 [2022-04-28 10:11:27,432 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 31 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 599 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 640 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 10:11:27,432 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 87 Invalid, 640 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 599 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 10:11:27,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-04-28 10:11:27,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 120. [2022-04-28 10:11:27,563 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:11:27,563 INFO L82 GeneralOperation]: Start isEquivalent. First operand 133 states. Second operand has 120 states, 115 states have (on average 1.2869565217391303) internal successors, (148), 115 states have internal predecessors, (148), 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-28 10:11:27,563 INFO L74 IsIncluded]: Start isIncluded. First operand 133 states. Second operand has 120 states, 115 states have (on average 1.2869565217391303) internal successors, (148), 115 states have internal predecessors, (148), 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-28 10:11:27,563 INFO L87 Difference]: Start difference. First operand 133 states. Second operand has 120 states, 115 states have (on average 1.2869565217391303) internal successors, (148), 115 states have internal predecessors, (148), 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-28 10:11:27,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:27,564 INFO L93 Difference]: Finished difference Result 133 states and 165 transitions. [2022-04-28 10:11:27,564 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 165 transitions. [2022-04-28 10:11:27,564 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:11:27,564 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:11:27,565 INFO L74 IsIncluded]: Start isIncluded. First operand has 120 states, 115 states have (on average 1.2869565217391303) internal successors, (148), 115 states have internal predecessors, (148), 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 133 states. [2022-04-28 10:11:27,565 INFO L87 Difference]: Start difference. First operand has 120 states, 115 states have (on average 1.2869565217391303) internal successors, (148), 115 states have internal predecessors, (148), 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 133 states. [2022-04-28 10:11:27,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:27,566 INFO L93 Difference]: Finished difference Result 133 states and 165 transitions. [2022-04-28 10:11:27,566 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 165 transitions. [2022-04-28 10:11:27,566 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:11:27,566 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:11:27,566 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:11:27,566 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:11:27,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 115 states have (on average 1.2869565217391303) internal successors, (148), 115 states have internal predecessors, (148), 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-28 10:11:27,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 152 transitions. [2022-04-28 10:11:27,567 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 152 transitions. Word has length 38 [2022-04-28 10:11:27,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:11:27,567 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 152 transitions. [2022-04-28 10:11:27,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 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-28 10:11:27,567 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 120 states and 152 transitions. [2022-04-28 10:11:33,143 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 152 edges. 150 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-28 10:11:33,143 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 152 transitions. [2022-04-28 10:11:33,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-28 10:11:33,144 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:11:33,144 INFO L195 NwaCegarLoop]: trace histogram [24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:11:33,159 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (73)] Forceful destruction successful, exit code 0 [2022-04-28 10:11:33,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 73 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable72 [2022-04-28 10:11:33,344 INFO L420 AbstractCegarLoop]: === Iteration 74 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:11:33,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:11:33,345 INFO L85 PathProgramCache]: Analyzing trace with hash -805427507, now seen corresponding path program 47 times [2022-04-28 10:11:33,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:11:33,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1888659445] [2022-04-28 10:11:33,347 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:11:33,347 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:11:33,347 INFO L85 PathProgramCache]: Analyzing trace with hash -805427507, now seen corresponding path program 48 times [2022-04-28 10:11:33,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:11:33,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332897871] [2022-04-28 10:11:33,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:11:33,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:11:33,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:33,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:11:33,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:33,796 INFO L290 TraceCheckUtils]: 0: Hoare triple {56119#(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(10, 2);call #Ultimate.allocInit(12, 3); {56088#true} is VALID [2022-04-28 10:11:33,796 INFO L290 TraceCheckUtils]: 1: Hoare triple {56088#true} assume true; {56088#true} is VALID [2022-04-28 10:11:33,796 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {56088#true} {56088#true} #61#return; {56088#true} is VALID [2022-04-28 10:11:33,796 INFO L272 TraceCheckUtils]: 0: Hoare triple {56088#true} call ULTIMATE.init(); {56119#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:11:33,797 INFO L290 TraceCheckUtils]: 1: Hoare triple {56119#(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(10, 2);call #Ultimate.allocInit(12, 3); {56088#true} is VALID [2022-04-28 10:11:33,797 INFO L290 TraceCheckUtils]: 2: Hoare triple {56088#true} assume true; {56088#true} is VALID [2022-04-28 10:11:33,797 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {56088#true} {56088#true} #61#return; {56088#true} is VALID [2022-04-28 10:11:33,797 INFO L272 TraceCheckUtils]: 4: Hoare triple {56088#true} call #t~ret11 := main(); {56088#true} is VALID [2022-04-28 10:11:33,797 INFO L290 TraceCheckUtils]: 5: Hoare triple {56088#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {56093#(= main_~y~0 0)} is VALID [2022-04-28 10:11:33,797 INFO L290 TraceCheckUtils]: 6: Hoare triple {56093#(= 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; {56094#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:11:33,798 INFO L290 TraceCheckUtils]: 7: Hoare triple {56094#(and (<= 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; {56095#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:11:33,798 INFO L290 TraceCheckUtils]: 8: Hoare triple {56095#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {56096#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:11:33,799 INFO L290 TraceCheckUtils]: 9: Hoare triple {56096#(and (<= main_~y~0 3) (<= 3 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; {56097#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:11:33,799 INFO L290 TraceCheckUtils]: 10: Hoare triple {56097#(and (<= main_~y~0 4) (<= 4 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; {56098#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:11:33,800 INFO L290 TraceCheckUtils]: 11: Hoare triple {56098#(and (<= 5 main_~y~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; {56099#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:11:33,800 INFO L290 TraceCheckUtils]: 12: Hoare triple {56099#(and (<= main_~y~0 6) (<= 6 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; {56100#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:11:33,801 INFO L290 TraceCheckUtils]: 13: Hoare triple {56100#(and (<= 7 main_~y~0) (<= main_~y~0 7))} 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; {56101#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:11:33,801 INFO L290 TraceCheckUtils]: 14: Hoare triple {56101#(and (<= main_~y~0 8) (<= 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; {56102#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:11:33,802 INFO L290 TraceCheckUtils]: 15: Hoare triple {56102#(and (<= 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; {56103#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:11:33,802 INFO L290 TraceCheckUtils]: 16: Hoare triple {56103#(and (<= main_~y~0 10) (<= 10 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; {56104#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:11:33,803 INFO L290 TraceCheckUtils]: 17: Hoare triple {56104#(and (<= main_~y~0 11) (<= 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; {56105#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:11:33,803 INFO L290 TraceCheckUtils]: 18: Hoare triple {56105#(and (<= 12 main_~y~0) (<= main_~y~0 12))} 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; {56106#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:11:33,804 INFO L290 TraceCheckUtils]: 19: Hoare triple {56106#(and (<= main_~y~0 13) (<= 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; {56107#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:11:33,804 INFO L290 TraceCheckUtils]: 20: Hoare triple {56107#(and (<= 14 main_~y~0) (<= main_~y~0 14))} 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; {56108#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:11:33,805 INFO L290 TraceCheckUtils]: 21: Hoare triple {56108#(and (<= main_~y~0 15) (<= 15 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; {56109#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:11:33,805 INFO L290 TraceCheckUtils]: 22: Hoare triple {56109#(and (<= 16 main_~y~0) (<= main_~y~0 16))} 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; {56110#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:11:33,806 INFO L290 TraceCheckUtils]: 23: Hoare triple {56110#(and (<= main_~y~0 17) (<= 17 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; {56111#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 10:11:33,806 INFO L290 TraceCheckUtils]: 24: Hoare triple {56111#(and (<= 18 main_~y~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; {56112#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 10:11:33,807 INFO L290 TraceCheckUtils]: 25: Hoare triple {56112#(and (<= 19 main_~y~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; {56113#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 10:11:33,807 INFO L290 TraceCheckUtils]: 26: Hoare triple {56113#(and (<= 20 main_~y~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; {56114#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 10:11:33,808 INFO L290 TraceCheckUtils]: 27: Hoare triple {56114#(and (<= main_~y~0 21) (<= 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; {56115#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 10:11:33,808 INFO L290 TraceCheckUtils]: 28: Hoare triple {56115#(and (<= main_~y~0 22) (<= 22 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; {56116#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 10:11:33,809 INFO L290 TraceCheckUtils]: 29: Hoare triple {56116#(and (<= main_~y~0 23) (<= 23 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; {56117#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-28 10:11:33,809 INFO L290 TraceCheckUtils]: 30: Hoare triple {56117#(and (<= 24 main_~y~0) (<= main_~y~0 24))} assume !(~x~0 % 4294967296 > 0); {56117#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-28 10:11:33,809 INFO L290 TraceCheckUtils]: 31: Hoare triple {56117#(and (<= 24 main_~y~0) (<= main_~y~0 24))} ~z~0 := ~y~0; {56118#(and (<= (div main_~z~0 4294967296) 0) (<= 24 main_~z~0))} is VALID [2022-04-28 10:11:33,810 INFO L290 TraceCheckUtils]: 32: Hoare triple {56118#(and (<= (div main_~z~0 4294967296) 0) (<= 24 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {56089#false} is VALID [2022-04-28 10:11:33,810 INFO L290 TraceCheckUtils]: 33: Hoare triple {56089#false} assume !(~y~0 % 4294967296 > 0); {56089#false} is VALID [2022-04-28 10:11:33,810 INFO L272 TraceCheckUtils]: 34: Hoare triple {56089#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {56089#false} is VALID [2022-04-28 10:11:33,810 INFO L290 TraceCheckUtils]: 35: Hoare triple {56089#false} ~cond := #in~cond; {56089#false} is VALID [2022-04-28 10:11:33,810 INFO L290 TraceCheckUtils]: 36: Hoare triple {56089#false} assume 0 == ~cond; {56089#false} is VALID [2022-04-28 10:11:33,810 INFO L290 TraceCheckUtils]: 37: Hoare triple {56089#false} assume !false; {56089#false} is VALID [2022-04-28 10:11:33,810 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:11:33,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:11:33,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332897871] [2022-04-28 10:11:33,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332897871] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:11:33,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [707344370] [2022-04-28 10:11:33,810 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:11:33,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:11:33,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:11:33,811 INFO L229 MonitoredProcess]: Starting monitored process 74 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:11:33,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (74)] Waiting until timeout for monitored process [2022-04-28 10:11:34,933 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2022-04-28 10:11:34,933 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:11:34,936 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 55 conjunts are in the unsatisfiable core [2022-04-28 10:11:34,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:34,945 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:11:35,375 INFO L272 TraceCheckUtils]: 0: Hoare triple {56088#true} call ULTIMATE.init(); {56088#true} is VALID [2022-04-28 10:11:35,375 INFO L290 TraceCheckUtils]: 1: Hoare triple {56088#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(10, 2);call #Ultimate.allocInit(12, 3); {56088#true} is VALID [2022-04-28 10:11:35,375 INFO L290 TraceCheckUtils]: 2: Hoare triple {56088#true} assume true; {56088#true} is VALID [2022-04-28 10:11:35,375 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {56088#true} {56088#true} #61#return; {56088#true} is VALID [2022-04-28 10:11:35,375 INFO L272 TraceCheckUtils]: 4: Hoare triple {56088#true} call #t~ret11 := main(); {56088#true} is VALID [2022-04-28 10:11:35,375 INFO L290 TraceCheckUtils]: 5: Hoare triple {56088#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {56093#(= main_~y~0 0)} is VALID [2022-04-28 10:11:35,376 INFO L290 TraceCheckUtils]: 6: Hoare triple {56093#(= 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; {56094#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:11:35,376 INFO L290 TraceCheckUtils]: 7: Hoare triple {56094#(and (<= 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; {56095#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:11:35,377 INFO L290 TraceCheckUtils]: 8: Hoare triple {56095#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {56096#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:11:35,377 INFO L290 TraceCheckUtils]: 9: Hoare triple {56096#(and (<= main_~y~0 3) (<= 3 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; {56097#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:11:35,378 INFO L290 TraceCheckUtils]: 10: Hoare triple {56097#(and (<= main_~y~0 4) (<= 4 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; {56098#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:11:35,378 INFO L290 TraceCheckUtils]: 11: Hoare triple {56098#(and (<= 5 main_~y~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; {56099#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:11:35,379 INFO L290 TraceCheckUtils]: 12: Hoare triple {56099#(and (<= main_~y~0 6) (<= 6 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; {56100#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:11:35,379 INFO L290 TraceCheckUtils]: 13: Hoare triple {56100#(and (<= 7 main_~y~0) (<= main_~y~0 7))} 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; {56101#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:11:35,380 INFO L290 TraceCheckUtils]: 14: Hoare triple {56101#(and (<= main_~y~0 8) (<= 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; {56102#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:11:35,380 INFO L290 TraceCheckUtils]: 15: Hoare triple {56102#(and (<= 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; {56103#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:11:35,381 INFO L290 TraceCheckUtils]: 16: Hoare triple {56103#(and (<= main_~y~0 10) (<= 10 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; {56104#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:11:35,381 INFO L290 TraceCheckUtils]: 17: Hoare triple {56104#(and (<= main_~y~0 11) (<= 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; {56105#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:11:35,382 INFO L290 TraceCheckUtils]: 18: Hoare triple {56105#(and (<= 12 main_~y~0) (<= main_~y~0 12))} 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; {56106#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:11:35,382 INFO L290 TraceCheckUtils]: 19: Hoare triple {56106#(and (<= main_~y~0 13) (<= 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; {56107#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:11:35,383 INFO L290 TraceCheckUtils]: 20: Hoare triple {56107#(and (<= 14 main_~y~0) (<= main_~y~0 14))} 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; {56108#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:11:35,383 INFO L290 TraceCheckUtils]: 21: Hoare triple {56108#(and (<= main_~y~0 15) (<= 15 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; {56109#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:11:35,384 INFO L290 TraceCheckUtils]: 22: Hoare triple {56109#(and (<= 16 main_~y~0) (<= main_~y~0 16))} 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; {56110#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:11:35,384 INFO L290 TraceCheckUtils]: 23: Hoare triple {56110#(and (<= main_~y~0 17) (<= 17 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; {56111#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 10:11:35,385 INFO L290 TraceCheckUtils]: 24: Hoare triple {56111#(and (<= 18 main_~y~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; {56112#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 10:11:35,385 INFO L290 TraceCheckUtils]: 25: Hoare triple {56112#(and (<= 19 main_~y~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; {56113#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 10:11:35,386 INFO L290 TraceCheckUtils]: 26: Hoare triple {56113#(and (<= 20 main_~y~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; {56114#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 10:11:35,386 INFO L290 TraceCheckUtils]: 27: Hoare triple {56114#(and (<= main_~y~0 21) (<= 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; {56115#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 10:11:35,387 INFO L290 TraceCheckUtils]: 28: Hoare triple {56115#(and (<= main_~y~0 22) (<= 22 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; {56116#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 10:11:35,387 INFO L290 TraceCheckUtils]: 29: Hoare triple {56116#(and (<= main_~y~0 23) (<= 23 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; {56117#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-28 10:11:35,387 INFO L290 TraceCheckUtils]: 30: Hoare triple {56117#(and (<= 24 main_~y~0) (<= main_~y~0 24))} assume !(~x~0 % 4294967296 > 0); {56117#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-28 10:11:35,388 INFO L290 TraceCheckUtils]: 31: Hoare triple {56117#(and (<= 24 main_~y~0) (<= main_~y~0 24))} ~z~0 := ~y~0; {56216#(and (<= main_~z~0 24) (<= 24 main_~z~0))} is VALID [2022-04-28 10:11:35,388 INFO L290 TraceCheckUtils]: 32: Hoare triple {56216#(and (<= main_~z~0 24) (<= 24 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {56089#false} is VALID [2022-04-28 10:11:35,388 INFO L290 TraceCheckUtils]: 33: Hoare triple {56089#false} assume !(~y~0 % 4294967296 > 0); {56089#false} is VALID [2022-04-28 10:11:35,388 INFO L272 TraceCheckUtils]: 34: Hoare triple {56089#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {56089#false} is VALID [2022-04-28 10:11:35,388 INFO L290 TraceCheckUtils]: 35: Hoare triple {56089#false} ~cond := #in~cond; {56089#false} is VALID [2022-04-28 10:11:35,388 INFO L290 TraceCheckUtils]: 36: Hoare triple {56089#false} assume 0 == ~cond; {56089#false} is VALID [2022-04-28 10:11:35,388 INFO L290 TraceCheckUtils]: 37: Hoare triple {56089#false} assume !false; {56089#false} is VALID [2022-04-28 10:11:35,388 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:11:35,388 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:11:36,531 INFO L290 TraceCheckUtils]: 37: Hoare triple {56089#false} assume !false; {56089#false} is VALID [2022-04-28 10:11:36,531 INFO L290 TraceCheckUtils]: 36: Hoare triple {56089#false} assume 0 == ~cond; {56089#false} is VALID [2022-04-28 10:11:36,531 INFO L290 TraceCheckUtils]: 35: Hoare triple {56089#false} ~cond := #in~cond; {56089#false} is VALID [2022-04-28 10:11:36,531 INFO L272 TraceCheckUtils]: 34: Hoare triple {56089#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {56089#false} is VALID [2022-04-28 10:11:36,531 INFO L290 TraceCheckUtils]: 33: Hoare triple {56089#false} assume !(~y~0 % 4294967296 > 0); {56089#false} is VALID [2022-04-28 10:11:36,531 INFO L290 TraceCheckUtils]: 32: Hoare triple {56250#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {56089#false} is VALID [2022-04-28 10:11:36,532 INFO L290 TraceCheckUtils]: 31: Hoare triple {56254#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {56250#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:11:36,532 INFO L290 TraceCheckUtils]: 30: Hoare triple {56254#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {56254#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:11:36,533 INFO L290 TraceCheckUtils]: 29: Hoare triple {56261#(< 0 (mod (+ main_~y~0 1) 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; {56254#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:11:36,533 INFO L290 TraceCheckUtils]: 28: Hoare triple {56265#(< 0 (mod (+ main_~y~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; {56261#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:11:36,534 INFO L290 TraceCheckUtils]: 27: Hoare triple {56269#(< 0 (mod (+ main_~y~0 3) 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; {56265#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:11:36,535 INFO L290 TraceCheckUtils]: 26: Hoare triple {56273#(< 0 (mod (+ main_~y~0 4) 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; {56269#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:11:36,535 INFO L290 TraceCheckUtils]: 25: Hoare triple {56277#(< 0 (mod (+ 5 main_~y~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; {56273#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:11:36,536 INFO L290 TraceCheckUtils]: 24: Hoare triple {56281#(< 0 (mod (+ main_~y~0 6) 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; {56277#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:11:36,536 INFO L290 TraceCheckUtils]: 23: Hoare triple {56285#(< 0 (mod (+ 7 main_~y~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; {56281#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:11:36,537 INFO L290 TraceCheckUtils]: 22: Hoare triple {56289#(< 0 (mod (+ main_~y~0 8) 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; {56285#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:11:36,538 INFO L290 TraceCheckUtils]: 21: Hoare triple {56293#(< 0 (mod (+ main_~y~0 9) 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; {56289#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:11:36,538 INFO L290 TraceCheckUtils]: 20: Hoare triple {56297#(< 0 (mod (+ main_~y~0 10) 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; {56293#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:11:36,539 INFO L290 TraceCheckUtils]: 19: Hoare triple {56301#(< 0 (mod (+ main_~y~0 11) 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; {56297#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-28 10:11:36,540 INFO L290 TraceCheckUtils]: 18: Hoare triple {56305#(< 0 (mod (+ main_~y~0 12) 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; {56301#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-28 10:11:36,540 INFO L290 TraceCheckUtils]: 17: Hoare triple {56309#(< 0 (mod (+ main_~y~0 13) 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; {56305#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-28 10:11:36,541 INFO L290 TraceCheckUtils]: 16: Hoare triple {56313#(< 0 (mod (+ main_~y~0 14) 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; {56309#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-28 10:11:36,541 INFO L290 TraceCheckUtils]: 15: Hoare triple {56317#(< 0 (mod (+ main_~y~0 15) 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; {56313#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-28 10:11:36,542 INFO L290 TraceCheckUtils]: 14: Hoare triple {56321#(< 0 (mod (+ main_~y~0 16) 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; {56317#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID [2022-04-28 10:11:36,543 INFO L290 TraceCheckUtils]: 13: Hoare triple {56325#(< 0 (mod (+ main_~y~0 17) 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; {56321#(< 0 (mod (+ main_~y~0 16) 4294967296))} is VALID [2022-04-28 10:11:36,543 INFO L290 TraceCheckUtils]: 12: Hoare triple {56329#(< 0 (mod (+ main_~y~0 18) 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; {56325#(< 0 (mod (+ main_~y~0 17) 4294967296))} is VALID [2022-04-28 10:11:36,544 INFO L290 TraceCheckUtils]: 11: Hoare triple {56333#(< 0 (mod (+ 19 main_~y~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; {56329#(< 0 (mod (+ main_~y~0 18) 4294967296))} is VALID [2022-04-28 10:11:36,544 INFO L290 TraceCheckUtils]: 10: Hoare triple {56337#(< 0 (mod (+ main_~y~0 20) 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; {56333#(< 0 (mod (+ 19 main_~y~0) 4294967296))} is VALID [2022-04-28 10:11:36,545 INFO L290 TraceCheckUtils]: 9: Hoare triple {56341#(< 0 (mod (+ main_~y~0 21) 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; {56337#(< 0 (mod (+ main_~y~0 20) 4294967296))} is VALID [2022-04-28 10:11:36,546 INFO L290 TraceCheckUtils]: 8: Hoare triple {56345#(< 0 (mod (+ main_~y~0 22) 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; {56341#(< 0 (mod (+ main_~y~0 21) 4294967296))} is VALID [2022-04-28 10:11:36,546 INFO L290 TraceCheckUtils]: 7: Hoare triple {56349#(< 0 (mod (+ 23 main_~y~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; {56345#(< 0 (mod (+ main_~y~0 22) 4294967296))} is VALID [2022-04-28 10:11:36,547 INFO L290 TraceCheckUtils]: 6: Hoare triple {56353#(< 0 (mod (+ main_~y~0 24) 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; {56349#(< 0 (mod (+ 23 main_~y~0) 4294967296))} is VALID [2022-04-28 10:11:36,547 INFO L290 TraceCheckUtils]: 5: Hoare triple {56088#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {56353#(< 0 (mod (+ main_~y~0 24) 4294967296))} is VALID [2022-04-28 10:11:36,547 INFO L272 TraceCheckUtils]: 4: Hoare triple {56088#true} call #t~ret11 := main(); {56088#true} is VALID [2022-04-28 10:11:36,547 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {56088#true} {56088#true} #61#return; {56088#true} is VALID [2022-04-28 10:11:36,547 INFO L290 TraceCheckUtils]: 2: Hoare triple {56088#true} assume true; {56088#true} is VALID [2022-04-28 10:11:36,548 INFO L290 TraceCheckUtils]: 1: Hoare triple {56088#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(10, 2);call #Ultimate.allocInit(12, 3); {56088#true} is VALID [2022-04-28 10:11:36,548 INFO L272 TraceCheckUtils]: 0: Hoare triple {56088#true} call ULTIMATE.init(); {56088#true} is VALID [2022-04-28 10:11:36,548 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:11:36,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [707344370] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:11:36,548 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:11:36,548 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 28, 28] total 56 [2022-04-28 10:11:36,548 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:11:36,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1888659445] [2022-04-28 10:11:36,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1888659445] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:11:36,548 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:11:36,548 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-04-28 10:11:36,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229222376] [2022-04-28 10:11:36,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:11:36,549 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 28 states have internal predecessors, (34), 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 38 [2022-04-28 10:11:36,549 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:11:36,549 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 29 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 28 states have internal predecessors, (34), 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-28 10:11:36,569 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:11:36,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-04-28 10:11:36,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:11:36,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-04-28 10:11:36,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=736, Invalid=2344, Unknown=0, NotChecked=0, Total=3080 [2022-04-28 10:11:36,570 INFO L87 Difference]: Start difference. First operand 120 states and 152 transitions. Second operand has 29 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 28 states have internal predecessors, (34), 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-28 10:11:41,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:41,282 INFO L93 Difference]: Finished difference Result 156 states and 216 transitions. [2022-04-28 10:11:41,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-28 10:11:41,282 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 28 states have internal predecessors, (34), 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 38 [2022-04-28 10:11:41,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:11:41,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 28 states have internal predecessors, (34), 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-28 10:11:41,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 165 transitions. [2022-04-28 10:11:41,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 28 states have internal predecessors, (34), 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-28 10:11:41,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 165 transitions. [2022-04-28 10:11:41,284 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 165 transitions. [2022-04-28 10:11:41,409 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 165 edges. 165 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:11:41,410 INFO L225 Difference]: With dead ends: 156 [2022-04-28 10:11:41,410 INFO L226 Difference]: Without dead ends: 150 [2022-04-28 10:11:41,411 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 401 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1492, Invalid=5150, Unknown=0, NotChecked=0, Total=6642 [2022-04-28 10:11:41,411 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 140 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 3048 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 3151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 3048 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-28 10:11:41,411 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 189 Invalid, 3151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 3048 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-04-28 10:11:41,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-04-28 10:11:41,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 125. [2022-04-28 10:11:41,538 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:11:41,539 INFO L82 GeneralOperation]: Start isEquivalent. First operand 150 states. Second operand has 125 states, 120 states have (on average 1.2916666666666667) internal successors, (155), 120 states have internal predecessors, (155), 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-28 10:11:41,539 INFO L74 IsIncluded]: Start isIncluded. First operand 150 states. Second operand has 125 states, 120 states have (on average 1.2916666666666667) internal successors, (155), 120 states have internal predecessors, (155), 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-28 10:11:41,539 INFO L87 Difference]: Start difference. First operand 150 states. Second operand has 125 states, 120 states have (on average 1.2916666666666667) internal successors, (155), 120 states have internal predecessors, (155), 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-28 10:11:41,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:41,540 INFO L93 Difference]: Finished difference Result 150 states and 184 transitions. [2022-04-28 10:11:41,540 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 184 transitions. [2022-04-28 10:11:41,540 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:11:41,540 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:11:41,540 INFO L74 IsIncluded]: Start isIncluded. First operand has 125 states, 120 states have (on average 1.2916666666666667) internal successors, (155), 120 states have internal predecessors, (155), 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 150 states. [2022-04-28 10:11:41,540 INFO L87 Difference]: Start difference. First operand has 125 states, 120 states have (on average 1.2916666666666667) internal successors, (155), 120 states have internal predecessors, (155), 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 150 states. [2022-04-28 10:11:41,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:41,544 INFO L93 Difference]: Finished difference Result 150 states and 184 transitions. [2022-04-28 10:11:41,544 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 184 transitions. [2022-04-28 10:11:41,544 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:11:41,544 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:11:41,544 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:11:41,544 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:11:41,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 120 states have (on average 1.2916666666666667) internal successors, (155), 120 states have internal predecessors, (155), 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-28 10:11:41,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 159 transitions. [2022-04-28 10:11:41,545 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 159 transitions. Word has length 38 [2022-04-28 10:11:41,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:11:41,546 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 159 transitions. [2022-04-28 10:11:41,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 28 states have internal predecessors, (34), 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-28 10:11:41,546 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 125 states and 159 transitions. [2022-04-28 10:11:46,303 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 159 edges. 158 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 10:11:46,303 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 159 transitions. [2022-04-28 10:11:46,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-28 10:11:46,304 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:11:46,304 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:11:46,310 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (74)] Forceful destruction successful, exit code 0 [2022-04-28 10:11:46,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73,74 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:11:46,504 INFO L420 AbstractCegarLoop]: === Iteration 75 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:11:46,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:11:46,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1865343295, now seen corresponding path program 99 times [2022-04-28 10:11:46,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:11:46,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1861850293] [2022-04-28 10:11:46,506 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:11:46,506 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:11:46,506 INFO L85 PathProgramCache]: Analyzing trace with hash 1865343295, now seen corresponding path program 100 times [2022-04-28 10:11:46,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:11:46,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276536367] [2022-04-28 10:11:46,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:11:46,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:11:46,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:46,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:11:46,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:46,775 INFO L290 TraceCheckUtils]: 0: Hoare triple {57311#(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(10, 2);call #Ultimate.allocInit(12, 3); {57288#true} is VALID [2022-04-28 10:11:46,775 INFO L290 TraceCheckUtils]: 1: Hoare triple {57288#true} assume true; {57288#true} is VALID [2022-04-28 10:11:46,775 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {57288#true} {57288#true} #61#return; {57288#true} is VALID [2022-04-28 10:11:46,775 INFO L272 TraceCheckUtils]: 0: Hoare triple {57288#true} call ULTIMATE.init(); {57311#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:11:46,775 INFO L290 TraceCheckUtils]: 1: Hoare triple {57311#(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(10, 2);call #Ultimate.allocInit(12, 3); {57288#true} is VALID [2022-04-28 10:11:46,775 INFO L290 TraceCheckUtils]: 2: Hoare triple {57288#true} assume true; {57288#true} is VALID [2022-04-28 10:11:46,775 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {57288#true} {57288#true} #61#return; {57288#true} is VALID [2022-04-28 10:11:46,775 INFO L272 TraceCheckUtils]: 4: Hoare triple {57288#true} call #t~ret11 := main(); {57288#true} is VALID [2022-04-28 10:11:46,775 INFO L290 TraceCheckUtils]: 5: Hoare triple {57288#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {57293#(= main_~y~0 0)} is VALID [2022-04-28 10:11:46,776 INFO L290 TraceCheckUtils]: 6: Hoare triple {57293#(= 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; {57294#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:11:46,776 INFO L290 TraceCheckUtils]: 7: Hoare triple {57294#(and (<= 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; {57295#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:11:46,777 INFO L290 TraceCheckUtils]: 8: Hoare triple {57295#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {57296#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:11:46,781 INFO L290 TraceCheckUtils]: 9: Hoare triple {57296#(and (<= main_~y~0 3) (<= 3 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; {57297#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:11:46,781 INFO L290 TraceCheckUtils]: 10: Hoare triple {57297#(and (<= main_~y~0 4) (<= 4 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; {57298#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:11:46,782 INFO L290 TraceCheckUtils]: 11: Hoare triple {57298#(and (<= 5 main_~y~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; {57299#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:11:46,782 INFO L290 TraceCheckUtils]: 12: Hoare triple {57299#(and (<= main_~y~0 6) (<= 6 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; {57300#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:11:46,783 INFO L290 TraceCheckUtils]: 13: Hoare triple {57300#(and (<= 7 main_~y~0) (<= main_~y~0 7))} 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; {57301#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:11:46,783 INFO L290 TraceCheckUtils]: 14: Hoare triple {57301#(and (<= main_~y~0 8) (<= 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; {57302#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:11:46,784 INFO L290 TraceCheckUtils]: 15: Hoare triple {57302#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {57302#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:11:46,784 INFO L290 TraceCheckUtils]: 16: Hoare triple {57302#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {57303#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:11:46,784 INFO L290 TraceCheckUtils]: 17: Hoare triple {57303#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {57304#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:11:46,785 INFO L290 TraceCheckUtils]: 18: Hoare triple {57304#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {57305#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:11:46,785 INFO L290 TraceCheckUtils]: 19: Hoare triple {57305#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {57306#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:11:46,786 INFO L290 TraceCheckUtils]: 20: Hoare triple {57306#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {57307#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:11:46,786 INFO L290 TraceCheckUtils]: 21: Hoare triple {57307#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {57308#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:11:46,787 INFO L290 TraceCheckUtils]: 22: Hoare triple {57308#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {57309#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:11:46,787 INFO L290 TraceCheckUtils]: 23: Hoare triple {57309#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {57310#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} is VALID [2022-04-28 10:11:46,788 INFO L290 TraceCheckUtils]: 24: Hoare triple {57310#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {57289#false} is VALID [2022-04-28 10:11:46,788 INFO L290 TraceCheckUtils]: 25: Hoare triple {57289#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {57289#false} is VALID [2022-04-28 10:11:46,788 INFO L290 TraceCheckUtils]: 26: Hoare triple {57289#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {57289#false} is VALID [2022-04-28 10:11:46,788 INFO L290 TraceCheckUtils]: 27: Hoare triple {57289#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {57289#false} is VALID [2022-04-28 10:11:46,788 INFO L290 TraceCheckUtils]: 28: Hoare triple {57289#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {57289#false} is VALID [2022-04-28 10:11:46,788 INFO L290 TraceCheckUtils]: 29: Hoare triple {57289#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {57289#false} is VALID [2022-04-28 10:11:46,788 INFO L290 TraceCheckUtils]: 30: Hoare triple {57289#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {57289#false} is VALID [2022-04-28 10:11:46,788 INFO L290 TraceCheckUtils]: 31: Hoare triple {57289#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {57289#false} is VALID [2022-04-28 10:11:46,788 INFO L290 TraceCheckUtils]: 32: Hoare triple {57289#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {57289#false} is VALID [2022-04-28 10:11:46,788 INFO L290 TraceCheckUtils]: 33: Hoare triple {57289#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {57289#false} is VALID [2022-04-28 10:11:46,788 INFO L290 TraceCheckUtils]: 34: Hoare triple {57289#false} assume !(~y~0 % 4294967296 > 0); {57289#false} is VALID [2022-04-28 10:11:46,788 INFO L272 TraceCheckUtils]: 35: Hoare triple {57289#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {57289#false} is VALID [2022-04-28 10:11:46,788 INFO L290 TraceCheckUtils]: 36: Hoare triple {57289#false} ~cond := #in~cond; {57289#false} is VALID [2022-04-28 10:11:46,788 INFO L290 TraceCheckUtils]: 37: Hoare triple {57289#false} assume 0 == ~cond; {57289#false} is VALID [2022-04-28 10:11:46,788 INFO L290 TraceCheckUtils]: 38: Hoare triple {57289#false} assume !false; {57289#false} is VALID [2022-04-28 10:11:46,789 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 73 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-04-28 10:11:46,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:11:46,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276536367] [2022-04-28 10:11:46,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276536367] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:11:46,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [722209014] [2022-04-28 10:11:46,789 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:11:46,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:11:46,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:11:46,790 INFO L229 MonitoredProcess]: Starting monitored process 75 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:11:46,790 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (75)] Waiting until timeout for monitored process [2022-04-28 10:11:46,831 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:11:46,831 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:11:46,832 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 52 conjunts are in the unsatisfiable core [2022-04-28 10:11:46,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:46,841 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:11:47,176 INFO L272 TraceCheckUtils]: 0: Hoare triple {57288#true} call ULTIMATE.init(); {57288#true} is VALID [2022-04-28 10:11:47,177 INFO L290 TraceCheckUtils]: 1: Hoare triple {57288#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(10, 2);call #Ultimate.allocInit(12, 3); {57288#true} is VALID [2022-04-28 10:11:47,177 INFO L290 TraceCheckUtils]: 2: Hoare triple {57288#true} assume true; {57288#true} is VALID [2022-04-28 10:11:47,177 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {57288#true} {57288#true} #61#return; {57288#true} is VALID [2022-04-28 10:11:47,177 INFO L272 TraceCheckUtils]: 4: Hoare triple {57288#true} call #t~ret11 := main(); {57288#true} is VALID [2022-04-28 10:11:47,177 INFO L290 TraceCheckUtils]: 5: Hoare triple {57288#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {57293#(= main_~y~0 0)} is VALID [2022-04-28 10:11:47,177 INFO L290 TraceCheckUtils]: 6: Hoare triple {57293#(= 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; {57294#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:11:47,178 INFO L290 TraceCheckUtils]: 7: Hoare triple {57294#(and (<= 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; {57295#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:11:47,178 INFO L290 TraceCheckUtils]: 8: Hoare triple {57295#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {57296#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:11:47,179 INFO L290 TraceCheckUtils]: 9: Hoare triple {57296#(and (<= main_~y~0 3) (<= 3 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; {57297#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:11:47,179 INFO L290 TraceCheckUtils]: 10: Hoare triple {57297#(and (<= main_~y~0 4) (<= 4 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; {57298#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:11:47,180 INFO L290 TraceCheckUtils]: 11: Hoare triple {57298#(and (<= 5 main_~y~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; {57299#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:11:47,180 INFO L290 TraceCheckUtils]: 12: Hoare triple {57299#(and (<= main_~y~0 6) (<= 6 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; {57300#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:11:47,181 INFO L290 TraceCheckUtils]: 13: Hoare triple {57300#(and (<= 7 main_~y~0) (<= main_~y~0 7))} 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; {57301#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:11:47,181 INFO L290 TraceCheckUtils]: 14: Hoare triple {57301#(and (<= main_~y~0 8) (<= 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; {57302#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:11:47,182 INFO L290 TraceCheckUtils]: 15: Hoare triple {57302#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {57302#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:11:47,182 INFO L290 TraceCheckUtils]: 16: Hoare triple {57302#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {57363#(and (= main_~z~0 main_~y~0) (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:11:47,182 INFO L290 TraceCheckUtils]: 17: Hoare triple {57363#(and (= main_~z~0 main_~y~0) (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {57367#(and (<= 9 main_~y~0) (<= main_~y~0 9) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-28 10:11:47,183 INFO L290 TraceCheckUtils]: 18: Hoare triple {57367#(and (<= 9 main_~y~0) (<= main_~y~0 9) (= main_~y~0 (+ main_~z~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {57371#(and (= (+ main_~z~0 1) (+ (- 1) main_~y~0)) (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:11:47,183 INFO L290 TraceCheckUtils]: 19: Hoare triple {57371#(and (= (+ main_~z~0 1) (+ (- 1) main_~y~0)) (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {57375#(and (= (+ main_~z~0 2) (+ (- 1) main_~y~0)) (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:11:47,184 INFO L290 TraceCheckUtils]: 20: Hoare triple {57375#(and (= (+ main_~z~0 2) (+ (- 1) main_~y~0)) (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {57379#(and (= (+ main_~z~0 3) (+ (- 1) main_~y~0)) (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:11:47,185 INFO L290 TraceCheckUtils]: 21: Hoare triple {57379#(and (= (+ main_~z~0 3) (+ (- 1) main_~y~0)) (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {57383#(and (= (+ main_~y~0 (- 4)) (+ main_~z~0 1)) (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:11:47,185 INFO L290 TraceCheckUtils]: 22: Hoare triple {57383#(and (= (+ main_~y~0 (- 4)) (+ main_~z~0 1)) (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {57387#(and (= (+ main_~y~0 (- 5)) (+ main_~z~0 1)) (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:11:47,186 INFO L290 TraceCheckUtils]: 23: Hoare triple {57387#(and (= (+ main_~y~0 (- 5)) (+ main_~z~0 1)) (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {57391#(and (= (+ main_~z~0 2) (+ main_~y~0 (- 5))) (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:11:47,186 INFO L290 TraceCheckUtils]: 24: Hoare triple {57391#(and (= (+ main_~z~0 2) (+ main_~y~0 (- 5))) (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~z~0 % 4294967296 > 0); {57289#false} is VALID [2022-04-28 10:11:47,186 INFO L290 TraceCheckUtils]: 25: Hoare triple {57289#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {57289#false} is VALID [2022-04-28 10:11:47,186 INFO L290 TraceCheckUtils]: 26: Hoare triple {57289#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {57289#false} is VALID [2022-04-28 10:11:47,186 INFO L290 TraceCheckUtils]: 27: Hoare triple {57289#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {57289#false} is VALID [2022-04-28 10:11:47,186 INFO L290 TraceCheckUtils]: 28: Hoare triple {57289#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {57289#false} is VALID [2022-04-28 10:11:47,186 INFO L290 TraceCheckUtils]: 29: Hoare triple {57289#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {57289#false} is VALID [2022-04-28 10:11:47,186 INFO L290 TraceCheckUtils]: 30: Hoare triple {57289#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {57289#false} is VALID [2022-04-28 10:11:47,186 INFO L290 TraceCheckUtils]: 31: Hoare triple {57289#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {57289#false} is VALID [2022-04-28 10:11:47,187 INFO L290 TraceCheckUtils]: 32: Hoare triple {57289#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {57289#false} is VALID [2022-04-28 10:11:47,187 INFO L290 TraceCheckUtils]: 33: Hoare triple {57289#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {57289#false} is VALID [2022-04-28 10:11:47,187 INFO L290 TraceCheckUtils]: 34: Hoare triple {57289#false} assume !(~y~0 % 4294967296 > 0); {57289#false} is VALID [2022-04-28 10:11:47,187 INFO L272 TraceCheckUtils]: 35: Hoare triple {57289#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {57289#false} is VALID [2022-04-28 10:11:47,187 INFO L290 TraceCheckUtils]: 36: Hoare triple {57289#false} ~cond := #in~cond; {57289#false} is VALID [2022-04-28 10:11:47,187 INFO L290 TraceCheckUtils]: 37: Hoare triple {57289#false} assume 0 == ~cond; {57289#false} is VALID [2022-04-28 10:11:47,187 INFO L290 TraceCheckUtils]: 38: Hoare triple {57289#false} assume !false; {57289#false} is VALID [2022-04-28 10:11:47,187 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 73 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-04-28 10:11:47,187 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:11:47,744 INFO L290 TraceCheckUtils]: 38: Hoare triple {57289#false} assume !false; {57289#false} is VALID [2022-04-28 10:11:47,744 INFO L290 TraceCheckUtils]: 37: Hoare triple {57289#false} assume 0 == ~cond; {57289#false} is VALID [2022-04-28 10:11:47,744 INFO L290 TraceCheckUtils]: 36: Hoare triple {57289#false} ~cond := #in~cond; {57289#false} is VALID [2022-04-28 10:11:47,744 INFO L272 TraceCheckUtils]: 35: Hoare triple {57289#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {57289#false} is VALID [2022-04-28 10:11:47,744 INFO L290 TraceCheckUtils]: 34: Hoare triple {57289#false} assume !(~y~0 % 4294967296 > 0); {57289#false} is VALID [2022-04-28 10:11:47,744 INFO L290 TraceCheckUtils]: 33: Hoare triple {57289#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {57289#false} is VALID [2022-04-28 10:11:47,745 INFO L290 TraceCheckUtils]: 32: Hoare triple {57455#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {57289#false} is VALID [2022-04-28 10:11:47,745 INFO L290 TraceCheckUtils]: 31: Hoare triple {57459#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {57455#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:11:47,746 INFO L290 TraceCheckUtils]: 30: Hoare triple {57463#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {57459#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:11:47,747 INFO L290 TraceCheckUtils]: 29: Hoare triple {57467#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {57463#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-28 10:11:47,747 INFO L290 TraceCheckUtils]: 28: Hoare triple {57471#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {57467#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-28 10:11:47,748 INFO L290 TraceCheckUtils]: 27: Hoare triple {57475#(not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {57471#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:11:47,749 INFO L290 TraceCheckUtils]: 26: Hoare triple {57479#(not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {57475#(not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:11:47,750 INFO L290 TraceCheckUtils]: 25: Hoare triple {57483#(not (< 0 (mod (+ main_~y~0 4294967289) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {57479#(not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:11:47,750 INFO L290 TraceCheckUtils]: 24: Hoare triple {57487#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod main_~z~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {57483#(not (< 0 (mod (+ main_~y~0 4294967289) 4294967296)))} is VALID [2022-04-28 10:11:47,751 INFO L290 TraceCheckUtils]: 23: Hoare triple {57491#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {57487#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-28 10:11:47,752 INFO L290 TraceCheckUtils]: 22: Hoare triple {57495#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {57491#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:11:47,753 INFO L290 TraceCheckUtils]: 21: Hoare triple {57499#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {57495#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)))} is VALID [2022-04-28 10:11:47,754 INFO L290 TraceCheckUtils]: 20: Hoare triple {57503#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {57499#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} is VALID [2022-04-28 10:11:47,754 INFO L290 TraceCheckUtils]: 19: Hoare triple {57507#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {57503#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)))} is VALID [2022-04-28 10:11:47,757 INFO L290 TraceCheckUtils]: 18: Hoare triple {57511#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ 4294967290 main_~z~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {57507#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)))} is VALID [2022-04-28 10:11:47,757 INFO L290 TraceCheckUtils]: 17: Hoare triple {57515#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ main_~z~0 4294967289) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {57511#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ 4294967290 main_~z~0) 4294967296)))} is VALID [2022-04-28 10:11:47,758 INFO L290 TraceCheckUtils]: 16: Hoare triple {57288#true} ~z~0 := ~y~0; {57515#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ main_~z~0 4294967289) 4294967296)))} is VALID [2022-04-28 10:11:47,758 INFO L290 TraceCheckUtils]: 15: Hoare triple {57288#true} assume !(~x~0 % 4294967296 > 0); {57288#true} is VALID [2022-04-28 10:11:47,758 INFO L290 TraceCheckUtils]: 14: Hoare triple {57288#true} 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; {57288#true} is VALID [2022-04-28 10:11:47,758 INFO L290 TraceCheckUtils]: 13: Hoare triple {57288#true} 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; {57288#true} is VALID [2022-04-28 10:11:47,758 INFO L290 TraceCheckUtils]: 12: Hoare triple {57288#true} 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; {57288#true} is VALID [2022-04-28 10:11:47,758 INFO L290 TraceCheckUtils]: 11: Hoare triple {57288#true} 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; {57288#true} is VALID [2022-04-28 10:11:47,758 INFO L290 TraceCheckUtils]: 10: Hoare triple {57288#true} 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; {57288#true} is VALID [2022-04-28 10:11:47,758 INFO L290 TraceCheckUtils]: 9: Hoare triple {57288#true} 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; {57288#true} is VALID [2022-04-28 10:11:47,758 INFO L290 TraceCheckUtils]: 8: Hoare triple {57288#true} 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; {57288#true} is VALID [2022-04-28 10:11:47,758 INFO L290 TraceCheckUtils]: 7: Hoare triple {57288#true} 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; {57288#true} is VALID [2022-04-28 10:11:47,758 INFO L290 TraceCheckUtils]: 6: Hoare triple {57288#true} 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; {57288#true} is VALID [2022-04-28 10:11:47,758 INFO L290 TraceCheckUtils]: 5: Hoare triple {57288#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {57288#true} is VALID [2022-04-28 10:11:47,758 INFO L272 TraceCheckUtils]: 4: Hoare triple {57288#true} call #t~ret11 := main(); {57288#true} is VALID [2022-04-28 10:11:47,758 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {57288#true} {57288#true} #61#return; {57288#true} is VALID [2022-04-28 10:11:47,758 INFO L290 TraceCheckUtils]: 2: Hoare triple {57288#true} assume true; {57288#true} is VALID [2022-04-28 10:11:47,759 INFO L290 TraceCheckUtils]: 1: Hoare triple {57288#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(10, 2);call #Ultimate.allocInit(12, 3); {57288#true} is VALID [2022-04-28 10:11:47,759 INFO L272 TraceCheckUtils]: 0: Hoare triple {57288#true} call ULTIMATE.init(); {57288#true} is VALID [2022-04-28 10:11:47,759 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 16 proven. 56 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-04-28 10:11:47,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [722209014] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:11:47,759 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:11:47,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 18] total 45 [2022-04-28 10:11:47,759 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:11:47,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1861850293] [2022-04-28 10:11:47,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1861850293] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:11:47,759 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:11:47,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-28 10:11:47,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578428105] [2022-04-28 10:11:47,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:11:47,759 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 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 39 [2022-04-28 10:11:47,760 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:11:47,760 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 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-28 10:11:47,779 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:11:47,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-28 10:11:47,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:11:47,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-28 10:11:47,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=252, Invalid=1728, Unknown=0, NotChecked=0, Total=1980 [2022-04-28 10:11:47,779 INFO L87 Difference]: Start difference. First operand 125 states and 159 transitions. Second operand has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 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-28 10:11:49,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:49,170 INFO L93 Difference]: Finished difference Result 152 states and 186 transitions. [2022-04-28 10:11:49,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-28 10:11:49,170 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 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 39 [2022-04-28 10:11:49,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:11:49,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 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-28 10:11:49,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 57 transitions. [2022-04-28 10:11:49,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 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-28 10:11:49,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 57 transitions. [2022-04-28 10:11:49,171 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 57 transitions. [2022-04-28 10:11:49,213 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:11:49,215 INFO L225 Difference]: With dead ends: 152 [2022-04-28 10:11:49,215 INFO L226 Difference]: Without dead ends: 137 [2022-04-28 10:11:49,215 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 623 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=430, Invalid=3476, Unknown=0, NotChecked=0, Total=3906 [2022-04-28 10:11:49,215 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 17 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 600 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 10:11:49,215 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 93 Invalid, 638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 600 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 10:11:49,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-04-28 10:11:49,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 126. [2022-04-28 10:11:49,350 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:11:49,350 INFO L82 GeneralOperation]: Start isEquivalent. First operand 137 states. Second operand has 126 states, 121 states have (on average 1.2892561983471074) internal successors, (156), 121 states have internal predecessors, (156), 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-28 10:11:49,350 INFO L74 IsIncluded]: Start isIncluded. First operand 137 states. Second operand has 126 states, 121 states have (on average 1.2892561983471074) internal successors, (156), 121 states have internal predecessors, (156), 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-28 10:11:49,350 INFO L87 Difference]: Start difference. First operand 137 states. Second operand has 126 states, 121 states have (on average 1.2892561983471074) internal successors, (156), 121 states have internal predecessors, (156), 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-28 10:11:49,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:49,351 INFO L93 Difference]: Finished difference Result 137 states and 171 transitions. [2022-04-28 10:11:49,351 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 171 transitions. [2022-04-28 10:11:49,351 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:11:49,351 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:11:49,351 INFO L74 IsIncluded]: Start isIncluded. First operand has 126 states, 121 states have (on average 1.2892561983471074) internal successors, (156), 121 states have internal predecessors, (156), 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 137 states. [2022-04-28 10:11:49,351 INFO L87 Difference]: Start difference. First operand has 126 states, 121 states have (on average 1.2892561983471074) internal successors, (156), 121 states have internal predecessors, (156), 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 137 states. [2022-04-28 10:11:49,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:49,352 INFO L93 Difference]: Finished difference Result 137 states and 171 transitions. [2022-04-28 10:11:49,353 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 171 transitions. [2022-04-28 10:11:49,353 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:11:49,353 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:11:49,353 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:11:49,353 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:11:49,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 121 states have (on average 1.2892561983471074) internal successors, (156), 121 states have internal predecessors, (156), 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-28 10:11:49,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 160 transitions. [2022-04-28 10:11:49,354 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 160 transitions. Word has length 39 [2022-04-28 10:11:49,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:11:49,354 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 160 transitions. [2022-04-28 10:11:49,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 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-28 10:11:49,354 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 126 states and 160 transitions. [2022-04-28 10:11:49,861 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 160 edges. 160 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:11:49,861 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 160 transitions. [2022-04-28 10:11:49,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-28 10:11:49,861 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:11:49,861 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:11:49,877 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (75)] Ended with exit code 0 [2022-04-28 10:11:50,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74,75 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:11:50,062 INFO L420 AbstractCegarLoop]: === Iteration 76 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:11:50,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:11:50,062 INFO L85 PathProgramCache]: Analyzing trace with hash -1135246993, now seen corresponding path program 101 times [2022-04-28 10:11:50,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:11:50,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1790564203] [2022-04-28 10:11:50,064 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:11:50,064 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:11:50,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1135246993, now seen corresponding path program 102 times [2022-04-28 10:11:50,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:11:50,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661967903] [2022-04-28 10:11:50,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:11:50,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:11:50,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:50,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:11:50,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:50,311 INFO L290 TraceCheckUtils]: 0: Hoare triple {58457#(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(10, 2);call #Ultimate.allocInit(12, 3); {58435#true} is VALID [2022-04-28 10:11:50,311 INFO L290 TraceCheckUtils]: 1: Hoare triple {58435#true} assume true; {58435#true} is VALID [2022-04-28 10:11:50,311 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {58435#true} {58435#true} #61#return; {58435#true} is VALID [2022-04-28 10:11:50,312 INFO L272 TraceCheckUtils]: 0: Hoare triple {58435#true} call ULTIMATE.init(); {58457#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:11:50,312 INFO L290 TraceCheckUtils]: 1: Hoare triple {58457#(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(10, 2);call #Ultimate.allocInit(12, 3); {58435#true} is VALID [2022-04-28 10:11:50,312 INFO L290 TraceCheckUtils]: 2: Hoare triple {58435#true} assume true; {58435#true} is VALID [2022-04-28 10:11:50,312 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {58435#true} {58435#true} #61#return; {58435#true} is VALID [2022-04-28 10:11:50,312 INFO L272 TraceCheckUtils]: 4: Hoare triple {58435#true} call #t~ret11 := main(); {58435#true} is VALID [2022-04-28 10:11:50,312 INFO L290 TraceCheckUtils]: 5: Hoare triple {58435#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {58440#(= main_~y~0 0)} is VALID [2022-04-28 10:11:50,313 INFO L290 TraceCheckUtils]: 6: Hoare triple {58440#(= 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; {58441#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:11:50,313 INFO L290 TraceCheckUtils]: 7: Hoare triple {58441#(and (<= 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; {58442#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:11:50,314 INFO L290 TraceCheckUtils]: 8: Hoare triple {58442#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {58443#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:11:50,314 INFO L290 TraceCheckUtils]: 9: Hoare triple {58443#(and (<= main_~y~0 3) (<= 3 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; {58444#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:11:50,315 INFO L290 TraceCheckUtils]: 10: Hoare triple {58444#(and (<= main_~y~0 4) (<= 4 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; {58445#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:11:50,315 INFO L290 TraceCheckUtils]: 11: Hoare triple {58445#(and (<= 5 main_~y~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; {58446#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:11:50,316 INFO L290 TraceCheckUtils]: 12: Hoare triple {58446#(and (<= main_~y~0 6) (<= 6 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; {58447#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:11:50,316 INFO L290 TraceCheckUtils]: 13: Hoare triple {58447#(and (<= 7 main_~y~0) (<= main_~y~0 7))} 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; {58448#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:11:50,317 INFO L290 TraceCheckUtils]: 14: Hoare triple {58448#(and (<= main_~y~0 8) (<= 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; {58449#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:11:50,317 INFO L290 TraceCheckUtils]: 15: Hoare triple {58449#(and (<= 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; {58450#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:11:50,317 INFO L290 TraceCheckUtils]: 16: Hoare triple {58450#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {58450#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:11:50,318 INFO L290 TraceCheckUtils]: 17: Hoare triple {58450#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {58451#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:11:50,318 INFO L290 TraceCheckUtils]: 18: Hoare triple {58451#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {58452#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:11:50,319 INFO L290 TraceCheckUtils]: 19: Hoare triple {58452#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {58453#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:11:50,319 INFO L290 TraceCheckUtils]: 20: Hoare triple {58453#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {58454#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:11:50,320 INFO L290 TraceCheckUtils]: 21: Hoare triple {58454#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {58455#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:11:50,320 INFO L290 TraceCheckUtils]: 22: Hoare triple {58455#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {58456#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:11:50,321 INFO L290 TraceCheckUtils]: 23: Hoare triple {58456#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {58436#false} is VALID [2022-04-28 10:11:50,321 INFO L290 TraceCheckUtils]: 24: Hoare triple {58436#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {58436#false} is VALID [2022-04-28 10:11:50,321 INFO L290 TraceCheckUtils]: 25: Hoare triple {58436#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {58436#false} is VALID [2022-04-28 10:11:50,321 INFO L290 TraceCheckUtils]: 26: Hoare triple {58436#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {58436#false} is VALID [2022-04-28 10:11:50,321 INFO L290 TraceCheckUtils]: 27: Hoare triple {58436#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {58436#false} is VALID [2022-04-28 10:11:50,321 INFO L290 TraceCheckUtils]: 28: Hoare triple {58436#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {58436#false} is VALID [2022-04-28 10:11:50,321 INFO L290 TraceCheckUtils]: 29: Hoare triple {58436#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {58436#false} is VALID [2022-04-28 10:11:50,321 INFO L290 TraceCheckUtils]: 30: Hoare triple {58436#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {58436#false} is VALID [2022-04-28 10:11:50,321 INFO L290 TraceCheckUtils]: 31: Hoare triple {58436#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {58436#false} is VALID [2022-04-28 10:11:50,321 INFO L290 TraceCheckUtils]: 32: Hoare triple {58436#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {58436#false} is VALID [2022-04-28 10:11:50,321 INFO L290 TraceCheckUtils]: 33: Hoare triple {58436#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {58436#false} is VALID [2022-04-28 10:11:50,321 INFO L290 TraceCheckUtils]: 34: Hoare triple {58436#false} assume !(~y~0 % 4294967296 > 0); {58436#false} is VALID [2022-04-28 10:11:50,321 INFO L272 TraceCheckUtils]: 35: Hoare triple {58436#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {58436#false} is VALID [2022-04-28 10:11:50,321 INFO L290 TraceCheckUtils]: 36: Hoare triple {58436#false} ~cond := #in~cond; {58436#false} is VALID [2022-04-28 10:11:50,321 INFO L290 TraceCheckUtils]: 37: Hoare triple {58436#false} assume 0 == ~cond; {58436#false} is VALID [2022-04-28 10:11:50,321 INFO L290 TraceCheckUtils]: 38: Hoare triple {58436#false} assume !false; {58436#false} is VALID [2022-04-28 10:11:50,321 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-04-28 10:11:50,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:11:50,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661967903] [2022-04-28 10:11:50,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661967903] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:11:50,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [525545779] [2022-04-28 10:11:50,322 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:11:50,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:11:50,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:11:50,323 INFO L229 MonitoredProcess]: Starting monitored process 76 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:11:50,323 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (76)] Waiting until timeout for monitored process [2022-04-28 10:11:50,495 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-04-28 10:11:50,495 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:11:50,496 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-28 10:11:50,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:50,505 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:11:50,762 INFO L272 TraceCheckUtils]: 0: Hoare triple {58435#true} call ULTIMATE.init(); {58435#true} is VALID [2022-04-28 10:11:50,762 INFO L290 TraceCheckUtils]: 1: Hoare triple {58435#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(10, 2);call #Ultimate.allocInit(12, 3); {58435#true} is VALID [2022-04-28 10:11:50,762 INFO L290 TraceCheckUtils]: 2: Hoare triple {58435#true} assume true; {58435#true} is VALID [2022-04-28 10:11:50,762 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {58435#true} {58435#true} #61#return; {58435#true} is VALID [2022-04-28 10:11:50,762 INFO L272 TraceCheckUtils]: 4: Hoare triple {58435#true} call #t~ret11 := main(); {58435#true} is VALID [2022-04-28 10:11:50,763 INFO L290 TraceCheckUtils]: 5: Hoare triple {58435#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {58440#(= main_~y~0 0)} is VALID [2022-04-28 10:11:50,763 INFO L290 TraceCheckUtils]: 6: Hoare triple {58440#(= 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; {58441#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:11:50,764 INFO L290 TraceCheckUtils]: 7: Hoare triple {58441#(and (<= 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; {58442#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:11:50,764 INFO L290 TraceCheckUtils]: 8: Hoare triple {58442#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {58443#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:11:50,764 INFO L290 TraceCheckUtils]: 9: Hoare triple {58443#(and (<= main_~y~0 3) (<= 3 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; {58444#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:11:50,765 INFO L290 TraceCheckUtils]: 10: Hoare triple {58444#(and (<= main_~y~0 4) (<= 4 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; {58445#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:11:50,765 INFO L290 TraceCheckUtils]: 11: Hoare triple {58445#(and (<= 5 main_~y~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; {58446#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:11:50,766 INFO L290 TraceCheckUtils]: 12: Hoare triple {58446#(and (<= main_~y~0 6) (<= 6 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; {58447#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:11:50,766 INFO L290 TraceCheckUtils]: 13: Hoare triple {58447#(and (<= 7 main_~y~0) (<= main_~y~0 7))} 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; {58448#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:11:50,767 INFO L290 TraceCheckUtils]: 14: Hoare triple {58448#(and (<= main_~y~0 8) (<= 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; {58449#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:11:50,767 INFO L290 TraceCheckUtils]: 15: Hoare triple {58449#(and (<= 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; {58450#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:11:50,768 INFO L290 TraceCheckUtils]: 16: Hoare triple {58450#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {58450#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:11:50,768 INFO L290 TraceCheckUtils]: 17: Hoare triple {58450#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {58451#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:11:50,769 INFO L290 TraceCheckUtils]: 18: Hoare triple {58451#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {58452#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:11:50,769 INFO L290 TraceCheckUtils]: 19: Hoare triple {58452#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {58453#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:11:50,770 INFO L290 TraceCheckUtils]: 20: Hoare triple {58453#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {58454#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:11:50,770 INFO L290 TraceCheckUtils]: 21: Hoare triple {58454#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {58455#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:11:50,771 INFO L290 TraceCheckUtils]: 22: Hoare triple {58455#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {58527#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:11:50,771 INFO L290 TraceCheckUtils]: 23: Hoare triple {58527#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {58436#false} is VALID [2022-04-28 10:11:50,771 INFO L290 TraceCheckUtils]: 24: Hoare triple {58436#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {58436#false} is VALID [2022-04-28 10:11:50,771 INFO L290 TraceCheckUtils]: 25: Hoare triple {58436#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {58436#false} is VALID [2022-04-28 10:11:50,771 INFO L290 TraceCheckUtils]: 26: Hoare triple {58436#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {58436#false} is VALID [2022-04-28 10:11:50,771 INFO L290 TraceCheckUtils]: 27: Hoare triple {58436#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {58436#false} is VALID [2022-04-28 10:11:50,771 INFO L290 TraceCheckUtils]: 28: Hoare triple {58436#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {58436#false} is VALID [2022-04-28 10:11:50,771 INFO L290 TraceCheckUtils]: 29: Hoare triple {58436#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {58436#false} is VALID [2022-04-28 10:11:50,771 INFO L290 TraceCheckUtils]: 30: Hoare triple {58436#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {58436#false} is VALID [2022-04-28 10:11:50,771 INFO L290 TraceCheckUtils]: 31: Hoare triple {58436#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {58436#false} is VALID [2022-04-28 10:11:50,771 INFO L290 TraceCheckUtils]: 32: Hoare triple {58436#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {58436#false} is VALID [2022-04-28 10:11:50,771 INFO L290 TraceCheckUtils]: 33: Hoare triple {58436#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {58436#false} is VALID [2022-04-28 10:11:50,772 INFO L290 TraceCheckUtils]: 34: Hoare triple {58436#false} assume !(~y~0 % 4294967296 > 0); {58436#false} is VALID [2022-04-28 10:11:50,772 INFO L272 TraceCheckUtils]: 35: Hoare triple {58436#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {58436#false} is VALID [2022-04-28 10:11:50,772 INFO L290 TraceCheckUtils]: 36: Hoare triple {58436#false} ~cond := #in~cond; {58436#false} is VALID [2022-04-28 10:11:50,772 INFO L290 TraceCheckUtils]: 37: Hoare triple {58436#false} assume 0 == ~cond; {58436#false} is VALID [2022-04-28 10:11:50,772 INFO L290 TraceCheckUtils]: 38: Hoare triple {58436#false} assume !false; {58436#false} is VALID [2022-04-28 10:11:50,772 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-04-28 10:11:50,772 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:11:51,252 INFO L290 TraceCheckUtils]: 38: Hoare triple {58436#false} assume !false; {58436#false} is VALID [2022-04-28 10:11:51,252 INFO L290 TraceCheckUtils]: 37: Hoare triple {58436#false} assume 0 == ~cond; {58436#false} is VALID [2022-04-28 10:11:51,252 INFO L290 TraceCheckUtils]: 36: Hoare triple {58436#false} ~cond := #in~cond; {58436#false} is VALID [2022-04-28 10:11:51,253 INFO L272 TraceCheckUtils]: 35: Hoare triple {58436#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {58436#false} is VALID [2022-04-28 10:11:51,253 INFO L290 TraceCheckUtils]: 34: Hoare triple {58436#false} assume !(~y~0 % 4294967296 > 0); {58436#false} is VALID [2022-04-28 10:11:51,253 INFO L290 TraceCheckUtils]: 33: Hoare triple {58436#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {58436#false} is VALID [2022-04-28 10:11:51,253 INFO L290 TraceCheckUtils]: 32: Hoare triple {58436#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {58436#false} is VALID [2022-04-28 10:11:51,253 INFO L290 TraceCheckUtils]: 31: Hoare triple {58436#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {58436#false} is VALID [2022-04-28 10:11:51,253 INFO L290 TraceCheckUtils]: 30: Hoare triple {58436#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {58436#false} is VALID [2022-04-28 10:11:51,253 INFO L290 TraceCheckUtils]: 29: Hoare triple {58436#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {58436#false} is VALID [2022-04-28 10:11:51,253 INFO L290 TraceCheckUtils]: 28: Hoare triple {58436#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {58436#false} is VALID [2022-04-28 10:11:51,253 INFO L290 TraceCheckUtils]: 27: Hoare triple {58436#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {58436#false} is VALID [2022-04-28 10:11:51,253 INFO L290 TraceCheckUtils]: 26: Hoare triple {58436#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {58436#false} is VALID [2022-04-28 10:11:51,253 INFO L290 TraceCheckUtils]: 25: Hoare triple {58436#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {58436#false} is VALID [2022-04-28 10:11:51,253 INFO L290 TraceCheckUtils]: 24: Hoare triple {58436#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {58436#false} is VALID [2022-04-28 10:11:51,253 INFO L290 TraceCheckUtils]: 23: Hoare triple {58621#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {58436#false} is VALID [2022-04-28 10:11:51,254 INFO L290 TraceCheckUtils]: 22: Hoare triple {58625#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {58621#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:11:51,255 INFO L290 TraceCheckUtils]: 21: Hoare triple {58629#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {58625#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:11:51,256 INFO L290 TraceCheckUtils]: 20: Hoare triple {58633#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {58629#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-28 10:11:51,257 INFO L290 TraceCheckUtils]: 19: Hoare triple {58637#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {58633#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-28 10:11:51,257 INFO L290 TraceCheckUtils]: 18: Hoare triple {58641#(< 0 (mod (+ 4294967291 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {58637#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID [2022-04-28 10:11:51,258 INFO L290 TraceCheckUtils]: 17: Hoare triple {58645#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} ~z~0 := ~y~0; {58641#(< 0 (mod (+ 4294967291 main_~z~0) 4294967296))} is VALID [2022-04-28 10:11:51,258 INFO L290 TraceCheckUtils]: 16: Hoare triple {58645#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {58645#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-28 10:11:51,259 INFO L290 TraceCheckUtils]: 15: Hoare triple {58652#(< 0 (mod (+ 4294967292 main_~y~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; {58645#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-28 10:11:51,259 INFO L290 TraceCheckUtils]: 14: Hoare triple {58656#(< 0 (mod (+ main_~y~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; {58652#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-28 10:11:51,260 INFO L290 TraceCheckUtils]: 13: Hoare triple {58660#(< 0 (mod (+ main_~y~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; {58656#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 10:11:51,261 INFO L290 TraceCheckUtils]: 12: Hoare triple {58664#(< 0 (mod (+ main_~y~0 4294967295) 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; {58660#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:11:51,261 INFO L290 TraceCheckUtils]: 11: Hoare triple {58668#(< 0 (mod main_~y~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; {58664#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:11:51,262 INFO L290 TraceCheckUtils]: 10: Hoare triple {58672#(< 0 (mod (+ main_~y~0 1) 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; {58668#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:11:51,263 INFO L290 TraceCheckUtils]: 9: Hoare triple {58676#(< 0 (mod (+ main_~y~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; {58672#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:11:51,263 INFO L290 TraceCheckUtils]: 8: Hoare triple {58680#(< 0 (mod (+ main_~y~0 3) 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; {58676#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:11:51,264 INFO L290 TraceCheckUtils]: 7: Hoare triple {58684#(< 0 (mod (+ main_~y~0 4) 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; {58680#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:11:51,264 INFO L290 TraceCheckUtils]: 6: Hoare triple {58688#(< 0 (mod (+ 5 main_~y~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; {58684#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:11:51,265 INFO L290 TraceCheckUtils]: 5: Hoare triple {58435#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {58688#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:11:51,265 INFO L272 TraceCheckUtils]: 4: Hoare triple {58435#true} call #t~ret11 := main(); {58435#true} is VALID [2022-04-28 10:11:51,265 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {58435#true} {58435#true} #61#return; {58435#true} is VALID [2022-04-28 10:11:51,265 INFO L290 TraceCheckUtils]: 2: Hoare triple {58435#true} assume true; {58435#true} is VALID [2022-04-28 10:11:51,265 INFO L290 TraceCheckUtils]: 1: Hoare triple {58435#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(10, 2);call #Ultimate.allocInit(12, 3); {58435#true} is VALID [2022-04-28 10:11:51,265 INFO L272 TraceCheckUtils]: 0: Hoare triple {58435#true} call ULTIMATE.init(); {58435#true} is VALID [2022-04-28 10:11:51,265 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-04-28 10:11:51,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [525545779] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:11:51,265 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:11:51,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 19] total 38 [2022-04-28 10:11:51,265 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:11:51,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1790564203] [2022-04-28 10:11:51,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1790564203] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:11:51,266 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:11:51,266 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-28 10:11:51,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208881244] [2022-04-28 10:11:51,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:11:51,266 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 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 39 [2022-04-28 10:11:51,266 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:11:51,266 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 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-28 10:11:51,284 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:11:51,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-28 10:11:51,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:11:51,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-28 10:11:51,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=1172, Unknown=0, NotChecked=0, Total=1406 [2022-04-28 10:11:51,285 INFO L87 Difference]: Start difference. First operand 126 states and 160 transitions. Second operand has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 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-28 10:11:52,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:52,701 INFO L93 Difference]: Finished difference Result 155 states and 189 transitions. [2022-04-28 10:11:52,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-28 10:11:52,701 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 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 39 [2022-04-28 10:11:52,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:11:52,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 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-28 10:11:52,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 66 transitions. [2022-04-28 10:11:52,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 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-28 10:11:52,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 66 transitions. [2022-04-28 10:11:52,702 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 66 transitions. [2022-04-28 10:11:52,751 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:11:52,752 INFO L225 Difference]: With dead ends: 155 [2022-04-28 10:11:52,752 INFO L226 Difference]: Without dead ends: 139 [2022-04-28 10:11:52,752 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 352 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=662, Invalid=2878, Unknown=0, NotChecked=0, Total=3540 [2022-04-28 10:11:52,753 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 23 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 10:11:52,753 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 85 Invalid, 672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 623 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 10:11:52,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-04-28 10:11:52,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 127. [2022-04-28 10:11:52,883 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:11:52,883 INFO L82 GeneralOperation]: Start isEquivalent. First operand 139 states. Second operand has 127 states, 122 states have (on average 1.2868852459016393) internal successors, (157), 122 states have internal predecessors, (157), 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-28 10:11:52,883 INFO L74 IsIncluded]: Start isIncluded. First operand 139 states. Second operand has 127 states, 122 states have (on average 1.2868852459016393) internal successors, (157), 122 states have internal predecessors, (157), 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-28 10:11:52,883 INFO L87 Difference]: Start difference. First operand 139 states. Second operand has 127 states, 122 states have (on average 1.2868852459016393) internal successors, (157), 122 states have internal predecessors, (157), 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-28 10:11:52,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:52,884 INFO L93 Difference]: Finished difference Result 139 states and 173 transitions. [2022-04-28 10:11:52,884 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 173 transitions. [2022-04-28 10:11:52,885 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:11:52,885 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:11:52,885 INFO L74 IsIncluded]: Start isIncluded. First operand has 127 states, 122 states have (on average 1.2868852459016393) internal successors, (157), 122 states have internal predecessors, (157), 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 139 states. [2022-04-28 10:11:52,885 INFO L87 Difference]: Start difference. First operand has 127 states, 122 states have (on average 1.2868852459016393) internal successors, (157), 122 states have internal predecessors, (157), 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 139 states. [2022-04-28 10:11:52,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:52,886 INFO L93 Difference]: Finished difference Result 139 states and 173 transitions. [2022-04-28 10:11:52,886 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 173 transitions. [2022-04-28 10:11:52,886 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:11:52,886 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:11:52,886 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:11:52,886 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:11:52,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 122 states have (on average 1.2868852459016393) internal successors, (157), 122 states have internal predecessors, (157), 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-28 10:11:52,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 161 transitions. [2022-04-28 10:11:52,887 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 161 transitions. Word has length 39 [2022-04-28 10:11:52,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:11:52,887 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 161 transitions. [2022-04-28 10:11:52,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 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-28 10:11:52,888 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 127 states and 161 transitions. [2022-04-28 10:11:54,830 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 161 edges. 161 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:11:54,830 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 161 transitions. [2022-04-28 10:11:54,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-28 10:11:54,830 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:11:54,831 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:11:54,834 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (76)] Forceful destruction successful, exit code 0 [2022-04-28 10:11:55,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 76 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable75 [2022-04-28 10:11:55,031 INFO L420 AbstractCegarLoop]: === Iteration 77 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:11:55,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:11:55,031 INFO L85 PathProgramCache]: Analyzing trace with hash -1958069505, now seen corresponding path program 103 times [2022-04-28 10:11:55,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:11:55,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [243795012] [2022-04-28 10:11:55,033 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:11:55,033 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:11:55,033 INFO L85 PathProgramCache]: Analyzing trace with hash -1958069505, now seen corresponding path program 104 times [2022-04-28 10:11:55,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:11:55,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398890027] [2022-04-28 10:11:55,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:11:55,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:11:55,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:55,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:11:55,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:55,264 INFO L290 TraceCheckUtils]: 0: Hoare triple {59616#(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(10, 2);call #Ultimate.allocInit(12, 3); {59595#true} is VALID [2022-04-28 10:11:55,264 INFO L290 TraceCheckUtils]: 1: Hoare triple {59595#true} assume true; {59595#true} is VALID [2022-04-28 10:11:55,264 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {59595#true} {59595#true} #61#return; {59595#true} is VALID [2022-04-28 10:11:55,265 INFO L272 TraceCheckUtils]: 0: Hoare triple {59595#true} call ULTIMATE.init(); {59616#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:11:55,265 INFO L290 TraceCheckUtils]: 1: Hoare triple {59616#(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(10, 2);call #Ultimate.allocInit(12, 3); {59595#true} is VALID [2022-04-28 10:11:55,265 INFO L290 TraceCheckUtils]: 2: Hoare triple {59595#true} assume true; {59595#true} is VALID [2022-04-28 10:11:55,265 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {59595#true} {59595#true} #61#return; {59595#true} is VALID [2022-04-28 10:11:55,265 INFO L272 TraceCheckUtils]: 4: Hoare triple {59595#true} call #t~ret11 := main(); {59595#true} is VALID [2022-04-28 10:11:55,265 INFO L290 TraceCheckUtils]: 5: Hoare triple {59595#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {59600#(= main_~y~0 0)} is VALID [2022-04-28 10:11:55,265 INFO L290 TraceCheckUtils]: 6: Hoare triple {59600#(= 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; {59601#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:11:55,266 INFO L290 TraceCheckUtils]: 7: Hoare triple {59601#(and (<= 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; {59602#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:11:55,266 INFO L290 TraceCheckUtils]: 8: Hoare triple {59602#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {59603#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:11:55,267 INFO L290 TraceCheckUtils]: 9: Hoare triple {59603#(and (<= main_~y~0 3) (<= 3 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; {59604#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:11:55,267 INFO L290 TraceCheckUtils]: 10: Hoare triple {59604#(and (<= main_~y~0 4) (<= 4 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; {59605#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:11:55,268 INFO L290 TraceCheckUtils]: 11: Hoare triple {59605#(and (<= 5 main_~y~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; {59606#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:11:55,268 INFO L290 TraceCheckUtils]: 12: Hoare triple {59606#(and (<= main_~y~0 6) (<= 6 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; {59607#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:11:55,269 INFO L290 TraceCheckUtils]: 13: Hoare triple {59607#(and (<= 7 main_~y~0) (<= main_~y~0 7))} 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; {59608#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:11:55,269 INFO L290 TraceCheckUtils]: 14: Hoare triple {59608#(and (<= main_~y~0 8) (<= 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; {59609#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:11:55,270 INFO L290 TraceCheckUtils]: 15: Hoare triple {59609#(and (<= 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; {59610#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:11:55,270 INFO L290 TraceCheckUtils]: 16: Hoare triple {59610#(and (<= main_~y~0 10) (<= 10 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; {59611#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:11:55,271 INFO L290 TraceCheckUtils]: 17: Hoare triple {59611#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {59611#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:11:55,271 INFO L290 TraceCheckUtils]: 18: Hoare triple {59611#(and (<= main_~y~0 11) (<= 11 main_~y~0))} ~z~0 := ~y~0; {59612#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-28 10:11:55,272 INFO L290 TraceCheckUtils]: 19: Hoare triple {59612#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {59613#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:11:55,272 INFO L290 TraceCheckUtils]: 20: Hoare triple {59613#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {59614#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:11:55,273 INFO L290 TraceCheckUtils]: 21: Hoare triple {59614#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {59615#(and (<= 8 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:11:55,273 INFO L290 TraceCheckUtils]: 22: Hoare triple {59615#(and (<= 8 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {59596#false} is VALID [2022-04-28 10:11:55,273 INFO L290 TraceCheckUtils]: 23: Hoare triple {59596#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {59596#false} is VALID [2022-04-28 10:11:55,273 INFO L290 TraceCheckUtils]: 24: Hoare triple {59596#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {59596#false} is VALID [2022-04-28 10:11:55,273 INFO L290 TraceCheckUtils]: 25: Hoare triple {59596#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {59596#false} is VALID [2022-04-28 10:11:55,273 INFO L290 TraceCheckUtils]: 26: Hoare triple {59596#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {59596#false} is VALID [2022-04-28 10:11:55,273 INFO L290 TraceCheckUtils]: 27: Hoare triple {59596#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {59596#false} is VALID [2022-04-28 10:11:55,273 INFO L290 TraceCheckUtils]: 28: Hoare triple {59596#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {59596#false} is VALID [2022-04-28 10:11:55,273 INFO L290 TraceCheckUtils]: 29: Hoare triple {59596#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {59596#false} is VALID [2022-04-28 10:11:55,273 INFO L290 TraceCheckUtils]: 30: Hoare triple {59596#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {59596#false} is VALID [2022-04-28 10:11:55,273 INFO L290 TraceCheckUtils]: 31: Hoare triple {59596#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {59596#false} is VALID [2022-04-28 10:11:55,273 INFO L290 TraceCheckUtils]: 32: Hoare triple {59596#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {59596#false} is VALID [2022-04-28 10:11:55,273 INFO L290 TraceCheckUtils]: 33: Hoare triple {59596#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {59596#false} is VALID [2022-04-28 10:11:55,274 INFO L290 TraceCheckUtils]: 34: Hoare triple {59596#false} assume !(~y~0 % 4294967296 > 0); {59596#false} is VALID [2022-04-28 10:11:55,274 INFO L272 TraceCheckUtils]: 35: Hoare triple {59596#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {59596#false} is VALID [2022-04-28 10:11:55,274 INFO L290 TraceCheckUtils]: 36: Hoare triple {59596#false} ~cond := #in~cond; {59596#false} is VALID [2022-04-28 10:11:55,274 INFO L290 TraceCheckUtils]: 37: Hoare triple {59596#false} assume 0 == ~cond; {59596#false} is VALID [2022-04-28 10:11:55,274 INFO L290 TraceCheckUtils]: 38: Hoare triple {59596#false} assume !false; {59596#false} is VALID [2022-04-28 10:11:55,274 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-04-28 10:11:55,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:11:55,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398890027] [2022-04-28 10:11:55,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398890027] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:11:55,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1724553743] [2022-04-28 10:11:55,274 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:11:55,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:11:55,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:11:55,275 INFO L229 MonitoredProcess]: Starting monitored process 77 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:11:55,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (77)] Waiting until timeout for monitored process [2022-04-28 10:11:55,316 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:11:55,316 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:11:55,317 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-28 10:11:55,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:11:55,325 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:11:55,568 INFO L272 TraceCheckUtils]: 0: Hoare triple {59595#true} call ULTIMATE.init(); {59595#true} is VALID [2022-04-28 10:11:55,568 INFO L290 TraceCheckUtils]: 1: Hoare triple {59595#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(10, 2);call #Ultimate.allocInit(12, 3); {59595#true} is VALID [2022-04-28 10:11:55,569 INFO L290 TraceCheckUtils]: 2: Hoare triple {59595#true} assume true; {59595#true} is VALID [2022-04-28 10:11:55,569 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {59595#true} {59595#true} #61#return; {59595#true} is VALID [2022-04-28 10:11:55,569 INFO L272 TraceCheckUtils]: 4: Hoare triple {59595#true} call #t~ret11 := main(); {59595#true} is VALID [2022-04-28 10:11:55,569 INFO L290 TraceCheckUtils]: 5: Hoare triple {59595#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {59600#(= main_~y~0 0)} is VALID [2022-04-28 10:11:55,569 INFO L290 TraceCheckUtils]: 6: Hoare triple {59600#(= 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; {59601#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:11:55,570 INFO L290 TraceCheckUtils]: 7: Hoare triple {59601#(and (<= 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; {59602#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:11:55,570 INFO L290 TraceCheckUtils]: 8: Hoare triple {59602#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {59603#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:11:55,571 INFO L290 TraceCheckUtils]: 9: Hoare triple {59603#(and (<= main_~y~0 3) (<= 3 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; {59604#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:11:55,571 INFO L290 TraceCheckUtils]: 10: Hoare triple {59604#(and (<= main_~y~0 4) (<= 4 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; {59605#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:11:55,572 INFO L290 TraceCheckUtils]: 11: Hoare triple {59605#(and (<= 5 main_~y~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; {59606#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:11:55,572 INFO L290 TraceCheckUtils]: 12: Hoare triple {59606#(and (<= main_~y~0 6) (<= 6 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; {59607#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:11:55,573 INFO L290 TraceCheckUtils]: 13: Hoare triple {59607#(and (<= 7 main_~y~0) (<= main_~y~0 7))} 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; {59608#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:11:55,573 INFO L290 TraceCheckUtils]: 14: Hoare triple {59608#(and (<= main_~y~0 8) (<= 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; {59609#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:11:55,574 INFO L290 TraceCheckUtils]: 15: Hoare triple {59609#(and (<= 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; {59610#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:11:55,574 INFO L290 TraceCheckUtils]: 16: Hoare triple {59610#(and (<= main_~y~0 10) (<= 10 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; {59611#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:11:55,575 INFO L290 TraceCheckUtils]: 17: Hoare triple {59611#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {59611#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:11:55,575 INFO L290 TraceCheckUtils]: 18: Hoare triple {59611#(and (<= main_~y~0 11) (<= 11 main_~y~0))} ~z~0 := ~y~0; {59612#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-28 10:11:55,575 INFO L290 TraceCheckUtils]: 19: Hoare triple {59612#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {59613#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:11:55,576 INFO L290 TraceCheckUtils]: 20: Hoare triple {59613#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {59614#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:11:55,576 INFO L290 TraceCheckUtils]: 21: Hoare triple {59614#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {59683#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:11:55,577 INFO L290 TraceCheckUtils]: 22: Hoare triple {59683#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !(~z~0 % 4294967296 > 0); {59596#false} is VALID [2022-04-28 10:11:55,577 INFO L290 TraceCheckUtils]: 23: Hoare triple {59596#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {59596#false} is VALID [2022-04-28 10:11:55,577 INFO L290 TraceCheckUtils]: 24: Hoare triple {59596#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {59596#false} is VALID [2022-04-28 10:11:55,577 INFO L290 TraceCheckUtils]: 25: Hoare triple {59596#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {59596#false} is VALID [2022-04-28 10:11:55,577 INFO L290 TraceCheckUtils]: 26: Hoare triple {59596#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {59596#false} is VALID [2022-04-28 10:11:55,577 INFO L290 TraceCheckUtils]: 27: Hoare triple {59596#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {59596#false} is VALID [2022-04-28 10:11:55,577 INFO L290 TraceCheckUtils]: 28: Hoare triple {59596#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {59596#false} is VALID [2022-04-28 10:11:55,577 INFO L290 TraceCheckUtils]: 29: Hoare triple {59596#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {59596#false} is VALID [2022-04-28 10:11:55,577 INFO L290 TraceCheckUtils]: 30: Hoare triple {59596#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {59596#false} is VALID [2022-04-28 10:11:55,577 INFO L290 TraceCheckUtils]: 31: Hoare triple {59596#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {59596#false} is VALID [2022-04-28 10:11:55,577 INFO L290 TraceCheckUtils]: 32: Hoare triple {59596#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {59596#false} is VALID [2022-04-28 10:11:55,577 INFO L290 TraceCheckUtils]: 33: Hoare triple {59596#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {59596#false} is VALID [2022-04-28 10:11:55,577 INFO L290 TraceCheckUtils]: 34: Hoare triple {59596#false} assume !(~y~0 % 4294967296 > 0); {59596#false} is VALID [2022-04-28 10:11:55,577 INFO L272 TraceCheckUtils]: 35: Hoare triple {59596#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {59596#false} is VALID [2022-04-28 10:11:55,577 INFO L290 TraceCheckUtils]: 36: Hoare triple {59596#false} ~cond := #in~cond; {59596#false} is VALID [2022-04-28 10:11:55,577 INFO L290 TraceCheckUtils]: 37: Hoare triple {59596#false} assume 0 == ~cond; {59596#false} is VALID [2022-04-28 10:11:55,578 INFO L290 TraceCheckUtils]: 38: Hoare triple {59596#false} assume !false; {59596#false} is VALID [2022-04-28 10:11:55,578 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-04-28 10:11:55,578 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:11:56,023 INFO L290 TraceCheckUtils]: 38: Hoare triple {59596#false} assume !false; {59596#false} is VALID [2022-04-28 10:11:56,023 INFO L290 TraceCheckUtils]: 37: Hoare triple {59596#false} assume 0 == ~cond; {59596#false} is VALID [2022-04-28 10:11:56,023 INFO L290 TraceCheckUtils]: 36: Hoare triple {59596#false} ~cond := #in~cond; {59596#false} is VALID [2022-04-28 10:11:56,023 INFO L272 TraceCheckUtils]: 35: Hoare triple {59596#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {59596#false} is VALID [2022-04-28 10:11:56,023 INFO L290 TraceCheckUtils]: 34: Hoare triple {59596#false} assume !(~y~0 % 4294967296 > 0); {59596#false} is VALID [2022-04-28 10:11:56,023 INFO L290 TraceCheckUtils]: 33: Hoare triple {59596#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {59596#false} is VALID [2022-04-28 10:11:56,023 INFO L290 TraceCheckUtils]: 32: Hoare triple {59596#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {59596#false} is VALID [2022-04-28 10:11:56,023 INFO L290 TraceCheckUtils]: 31: Hoare triple {59596#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {59596#false} is VALID [2022-04-28 10:11:56,023 INFO L290 TraceCheckUtils]: 30: Hoare triple {59596#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {59596#false} is VALID [2022-04-28 10:11:56,024 INFO L290 TraceCheckUtils]: 29: Hoare triple {59596#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {59596#false} is VALID [2022-04-28 10:11:56,024 INFO L290 TraceCheckUtils]: 28: Hoare triple {59596#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {59596#false} is VALID [2022-04-28 10:11:56,024 INFO L290 TraceCheckUtils]: 27: Hoare triple {59596#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {59596#false} is VALID [2022-04-28 10:11:56,024 INFO L290 TraceCheckUtils]: 26: Hoare triple {59596#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {59596#false} is VALID [2022-04-28 10:11:56,024 INFO L290 TraceCheckUtils]: 25: Hoare triple {59596#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {59596#false} is VALID [2022-04-28 10:11:56,024 INFO L290 TraceCheckUtils]: 24: Hoare triple {59596#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {59596#false} is VALID [2022-04-28 10:11:56,024 INFO L290 TraceCheckUtils]: 23: Hoare triple {59596#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {59596#false} is VALID [2022-04-28 10:11:56,024 INFO L290 TraceCheckUtils]: 22: Hoare triple {59783#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {59596#false} is VALID [2022-04-28 10:11:56,025 INFO L290 TraceCheckUtils]: 21: Hoare triple {59787#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {59783#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:11:56,026 INFO L290 TraceCheckUtils]: 20: Hoare triple {59791#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {59787#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:11:56,026 INFO L290 TraceCheckUtils]: 19: Hoare triple {59795#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {59791#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-28 10:11:56,027 INFO L290 TraceCheckUtils]: 18: Hoare triple {59799#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} ~z~0 := ~y~0; {59795#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-28 10:11:56,027 INFO L290 TraceCheckUtils]: 17: Hoare triple {59799#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !(~x~0 % 4294967296 > 0); {59799#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 10:11:56,028 INFO L290 TraceCheckUtils]: 16: Hoare triple {59806#(< 0 (mod (+ main_~y~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; {59799#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 10:11:56,028 INFO L290 TraceCheckUtils]: 15: Hoare triple {59810#(< 0 (mod (+ main_~y~0 4294967295) 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; {59806#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:11:56,029 INFO L290 TraceCheckUtils]: 14: Hoare triple {59814#(< 0 (mod main_~y~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; {59810#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:11:56,030 INFO L290 TraceCheckUtils]: 13: Hoare triple {59818#(< 0 (mod (+ main_~y~0 1) 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; {59814#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:11:56,030 INFO L290 TraceCheckUtils]: 12: Hoare triple {59822#(< 0 (mod (+ main_~y~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; {59818#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:11:56,031 INFO L290 TraceCheckUtils]: 11: Hoare triple {59826#(< 0 (mod (+ main_~y~0 3) 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; {59822#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:11:56,031 INFO L290 TraceCheckUtils]: 10: Hoare triple {59830#(< 0 (mod (+ main_~y~0 4) 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; {59826#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:11:56,032 INFO L290 TraceCheckUtils]: 9: Hoare triple {59834#(< 0 (mod (+ 5 main_~y~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; {59830#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:11:56,033 INFO L290 TraceCheckUtils]: 8: Hoare triple {59838#(< 0 (mod (+ main_~y~0 6) 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; {59834#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:11:56,033 INFO L290 TraceCheckUtils]: 7: Hoare triple {59842#(< 0 (mod (+ 7 main_~y~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; {59838#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:11:56,034 INFO L290 TraceCheckUtils]: 6: Hoare triple {59846#(< 0 (mod (+ main_~y~0 8) 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; {59842#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:11:56,034 INFO L290 TraceCheckUtils]: 5: Hoare triple {59595#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {59846#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:11:56,034 INFO L272 TraceCheckUtils]: 4: Hoare triple {59595#true} call #t~ret11 := main(); {59595#true} is VALID [2022-04-28 10:11:56,034 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {59595#true} {59595#true} #61#return; {59595#true} is VALID [2022-04-28 10:11:56,034 INFO L290 TraceCheckUtils]: 2: Hoare triple {59595#true} assume true; {59595#true} is VALID [2022-04-28 10:11:56,034 INFO L290 TraceCheckUtils]: 1: Hoare triple {59595#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(10, 2);call #Ultimate.allocInit(12, 3); {59595#true} is VALID [2022-04-28 10:11:56,035 INFO L272 TraceCheckUtils]: 0: Hoare triple {59595#true} call ULTIMATE.init(); {59595#true} is VALID [2022-04-28 10:11:56,035 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-04-28 10:11:56,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1724553743] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:11:56,035 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:11:56,035 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 36 [2022-04-28 10:11:56,035 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:11:56,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [243795012] [2022-04-28 10:11:56,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [243795012] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:11:56,035 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:11:56,035 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-28 10:11:56,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686172898] [2022-04-28 10:11:56,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:11:56,035 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 states have internal predecessors, (25), 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 39 [2022-04-28 10:11:56,036 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:11:56,036 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 states have internal predecessors, (25), 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-28 10:11:56,055 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-28 10:11:56,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-28 10:11:56,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:11:56,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-28 10:11:56,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=1027, Unknown=0, NotChecked=0, Total=1260 [2022-04-28 10:11:56,056 INFO L87 Difference]: Start difference. First operand 127 states and 161 transitions. Second operand has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 states have internal predecessors, (25), 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-28 10:11:57,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:57,435 INFO L93 Difference]: Finished difference Result 158 states and 192 transitions. [2022-04-28 10:11:57,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-28 10:11:57,435 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 states have internal predecessors, (25), 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 39 [2022-04-28 10:11:57,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:11:57,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 states have internal predecessors, (25), 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-28 10:11:57,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 70 transitions. [2022-04-28 10:11:57,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 states have internal predecessors, (25), 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-28 10:11:57,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 70 transitions. [2022-04-28 10:11:57,440 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 70 transitions. [2022-04-28 10:11:57,493 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:11:57,494 INFO L225 Difference]: With dead ends: 158 [2022-04-28 10:11:57,494 INFO L226 Difference]: Without dead ends: 141 [2022-04-28 10:11:57,494 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=631, Invalid=2561, Unknown=0, NotChecked=0, Total=3192 [2022-04-28 10:11:57,494 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 30 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 635 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 10:11:57,495 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 87 Invalid, 684 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 635 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 10:11:57,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-04-28 10:11:57,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 128. [2022-04-28 10:11:57,628 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:11:57,628 INFO L82 GeneralOperation]: Start isEquivalent. First operand 141 states. Second operand has 128 states, 123 states have (on average 1.2845528455284554) internal successors, (158), 123 states have internal predecessors, (158), 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-28 10:11:57,628 INFO L74 IsIncluded]: Start isIncluded. First operand 141 states. Second operand has 128 states, 123 states have (on average 1.2845528455284554) internal successors, (158), 123 states have internal predecessors, (158), 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-28 10:11:57,628 INFO L87 Difference]: Start difference. First operand 141 states. Second operand has 128 states, 123 states have (on average 1.2845528455284554) internal successors, (158), 123 states have internal predecessors, (158), 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-28 10:11:57,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:57,629 INFO L93 Difference]: Finished difference Result 141 states and 175 transitions. [2022-04-28 10:11:57,629 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 175 transitions. [2022-04-28 10:11:57,629 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:11:57,629 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:11:57,630 INFO L74 IsIncluded]: Start isIncluded. First operand has 128 states, 123 states have (on average 1.2845528455284554) internal successors, (158), 123 states have internal predecessors, (158), 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 141 states. [2022-04-28 10:11:57,630 INFO L87 Difference]: Start difference. First operand has 128 states, 123 states have (on average 1.2845528455284554) internal successors, (158), 123 states have internal predecessors, (158), 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 141 states. [2022-04-28 10:11:57,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:11:57,631 INFO L93 Difference]: Finished difference Result 141 states and 175 transitions. [2022-04-28 10:11:57,631 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 175 transitions. [2022-04-28 10:11:57,631 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:11:57,631 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:11:57,631 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:11:57,631 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:11:57,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 123 states have (on average 1.2845528455284554) internal successors, (158), 123 states have internal predecessors, (158), 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-28 10:11:57,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 162 transitions. [2022-04-28 10:11:57,632 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 162 transitions. Word has length 39 [2022-04-28 10:11:57,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:11:57,632 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 162 transitions. [2022-04-28 10:11:57,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 states have internal predecessors, (25), 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-28 10:11:57,632 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 128 states and 162 transitions. [2022-04-28 10:12:01,170 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 162 edges. 161 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 10:12:01,170 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 162 transitions. [2022-04-28 10:12:01,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-28 10:12:01,170 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:12:01,170 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:12:01,186 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (77)] Forceful destruction successful, exit code 0 [2022-04-28 10:12:01,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 77 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable76 [2022-04-28 10:12:01,371 INFO L420 AbstractCegarLoop]: === Iteration 78 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:12:01,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:12:01,371 INFO L85 PathProgramCache]: Analyzing trace with hash -1215567953, now seen corresponding path program 105 times [2022-04-28 10:12:01,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:12:01,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [96696185] [2022-04-28 10:12:01,373 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:12:01,373 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:12:01,373 INFO L85 PathProgramCache]: Analyzing trace with hash -1215567953, now seen corresponding path program 106 times [2022-04-28 10:12:01,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:12:01,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544661136] [2022-04-28 10:12:01,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:12:01,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:12:01,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:12:01,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:12:01,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:12:01,590 INFO L290 TraceCheckUtils]: 0: Hoare triple {60783#(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(10, 2);call #Ultimate.allocInit(12, 3); {60763#true} is VALID [2022-04-28 10:12:01,590 INFO L290 TraceCheckUtils]: 1: Hoare triple {60763#true} assume true; {60763#true} is VALID [2022-04-28 10:12:01,590 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {60763#true} {60763#true} #61#return; {60763#true} is VALID [2022-04-28 10:12:01,590 INFO L272 TraceCheckUtils]: 0: Hoare triple {60763#true} call ULTIMATE.init(); {60783#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:12:01,590 INFO L290 TraceCheckUtils]: 1: Hoare triple {60783#(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(10, 2);call #Ultimate.allocInit(12, 3); {60763#true} is VALID [2022-04-28 10:12:01,590 INFO L290 TraceCheckUtils]: 2: Hoare triple {60763#true} assume true; {60763#true} is VALID [2022-04-28 10:12:01,590 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {60763#true} {60763#true} #61#return; {60763#true} is VALID [2022-04-28 10:12:01,590 INFO L272 TraceCheckUtils]: 4: Hoare triple {60763#true} call #t~ret11 := main(); {60763#true} is VALID [2022-04-28 10:12:01,590 INFO L290 TraceCheckUtils]: 5: Hoare triple {60763#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {60768#(= main_~y~0 0)} is VALID [2022-04-28 10:12:01,591 INFO L290 TraceCheckUtils]: 6: Hoare triple {60768#(= 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; {60769#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:12:01,591 INFO L290 TraceCheckUtils]: 7: Hoare triple {60769#(and (<= 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; {60770#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:12:01,592 INFO L290 TraceCheckUtils]: 8: Hoare triple {60770#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {60771#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:12:01,592 INFO L290 TraceCheckUtils]: 9: Hoare triple {60771#(and (<= main_~y~0 3) (<= 3 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; {60772#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:12:01,593 INFO L290 TraceCheckUtils]: 10: Hoare triple {60772#(and (<= main_~y~0 4) (<= 4 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; {60773#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:12:01,593 INFO L290 TraceCheckUtils]: 11: Hoare triple {60773#(and (<= 5 main_~y~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; {60774#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:12:01,594 INFO L290 TraceCheckUtils]: 12: Hoare triple {60774#(and (<= main_~y~0 6) (<= 6 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; {60775#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:12:01,594 INFO L290 TraceCheckUtils]: 13: Hoare triple {60775#(and (<= 7 main_~y~0) (<= main_~y~0 7))} 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; {60776#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:12:01,595 INFO L290 TraceCheckUtils]: 14: Hoare triple {60776#(and (<= main_~y~0 8) (<= 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; {60777#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:12:01,595 INFO L290 TraceCheckUtils]: 15: Hoare triple {60777#(and (<= 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; {60778#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:12:01,596 INFO L290 TraceCheckUtils]: 16: Hoare triple {60778#(and (<= main_~y~0 10) (<= 10 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; {60779#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:12:01,596 INFO L290 TraceCheckUtils]: 17: Hoare triple {60779#(and (<= main_~y~0 11) (<= 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; {60780#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:12:01,597 INFO L290 TraceCheckUtils]: 18: Hoare triple {60780#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !(~x~0 % 4294967296 > 0); {60780#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:12:01,597 INFO L290 TraceCheckUtils]: 19: Hoare triple {60780#(and (<= 12 main_~y~0) (<= main_~y~0 12))} ~z~0 := ~y~0; {60781#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-28 10:12:01,597 INFO L290 TraceCheckUtils]: 20: Hoare triple {60781#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {60782#(and (<= (div main_~z~0 4294967296) 0) (<= 11 main_~z~0))} is VALID [2022-04-28 10:12:01,598 INFO L290 TraceCheckUtils]: 21: Hoare triple {60782#(and (<= (div main_~z~0 4294967296) 0) (<= 11 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {60764#false} is VALID [2022-04-28 10:12:01,598 INFO L290 TraceCheckUtils]: 22: Hoare triple {60764#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {60764#false} is VALID [2022-04-28 10:12:01,598 INFO L290 TraceCheckUtils]: 23: Hoare triple {60764#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {60764#false} is VALID [2022-04-28 10:12:01,598 INFO L290 TraceCheckUtils]: 24: Hoare triple {60764#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {60764#false} is VALID [2022-04-28 10:12:01,598 INFO L290 TraceCheckUtils]: 25: Hoare triple {60764#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {60764#false} is VALID [2022-04-28 10:12:01,598 INFO L290 TraceCheckUtils]: 26: Hoare triple {60764#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {60764#false} is VALID [2022-04-28 10:12:01,598 INFO L290 TraceCheckUtils]: 27: Hoare triple {60764#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {60764#false} is VALID [2022-04-28 10:12:01,598 INFO L290 TraceCheckUtils]: 28: Hoare triple {60764#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {60764#false} is VALID [2022-04-28 10:12:01,598 INFO L290 TraceCheckUtils]: 29: Hoare triple {60764#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {60764#false} is VALID [2022-04-28 10:12:01,598 INFO L290 TraceCheckUtils]: 30: Hoare triple {60764#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {60764#false} is VALID [2022-04-28 10:12:01,598 INFO L290 TraceCheckUtils]: 31: Hoare triple {60764#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {60764#false} is VALID [2022-04-28 10:12:01,598 INFO L290 TraceCheckUtils]: 32: Hoare triple {60764#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {60764#false} is VALID [2022-04-28 10:12:01,598 INFO L290 TraceCheckUtils]: 33: Hoare triple {60764#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {60764#false} is VALID [2022-04-28 10:12:01,598 INFO L290 TraceCheckUtils]: 34: Hoare triple {60764#false} assume !(~y~0 % 4294967296 > 0); {60764#false} is VALID [2022-04-28 10:12:01,598 INFO L272 TraceCheckUtils]: 35: Hoare triple {60764#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {60764#false} is VALID [2022-04-28 10:12:01,598 INFO L290 TraceCheckUtils]: 36: Hoare triple {60764#false} ~cond := #in~cond; {60764#false} is VALID [2022-04-28 10:12:01,599 INFO L290 TraceCheckUtils]: 37: Hoare triple {60764#false} assume 0 == ~cond; {60764#false} is VALID [2022-04-28 10:12:01,599 INFO L290 TraceCheckUtils]: 38: Hoare triple {60764#false} assume !false; {60764#false} is VALID [2022-04-28 10:12:01,599 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 0 proven. 79 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-04-28 10:12:01,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:12:01,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544661136] [2022-04-28 10:12:01,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544661136] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:12:01,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1438494690] [2022-04-28 10:12:01,599 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:12:01,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:12:01,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:12:01,600 INFO L229 MonitoredProcess]: Starting monitored process 78 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:12:01,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (78)] Waiting until timeout for monitored process [2022-04-28 10:12:01,643 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:12:01,644 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:12:01,644 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-28 10:12:01,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:12:01,653 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:12:01,892 INFO L272 TraceCheckUtils]: 0: Hoare triple {60763#true} call ULTIMATE.init(); {60763#true} is VALID [2022-04-28 10:12:01,892 INFO L290 TraceCheckUtils]: 1: Hoare triple {60763#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(10, 2);call #Ultimate.allocInit(12, 3); {60763#true} is VALID [2022-04-28 10:12:01,892 INFO L290 TraceCheckUtils]: 2: Hoare triple {60763#true} assume true; {60763#true} is VALID [2022-04-28 10:12:01,892 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {60763#true} {60763#true} #61#return; {60763#true} is VALID [2022-04-28 10:12:01,892 INFO L272 TraceCheckUtils]: 4: Hoare triple {60763#true} call #t~ret11 := main(); {60763#true} is VALID [2022-04-28 10:12:01,892 INFO L290 TraceCheckUtils]: 5: Hoare triple {60763#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {60768#(= main_~y~0 0)} is VALID [2022-04-28 10:12:01,893 INFO L290 TraceCheckUtils]: 6: Hoare triple {60768#(= 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; {60769#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:12:01,893 INFO L290 TraceCheckUtils]: 7: Hoare triple {60769#(and (<= 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; {60770#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:12:01,894 INFO L290 TraceCheckUtils]: 8: Hoare triple {60770#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {60771#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:12:01,894 INFO L290 TraceCheckUtils]: 9: Hoare triple {60771#(and (<= main_~y~0 3) (<= 3 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; {60772#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:12:01,895 INFO L290 TraceCheckUtils]: 10: Hoare triple {60772#(and (<= main_~y~0 4) (<= 4 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; {60773#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:12:01,895 INFO L290 TraceCheckUtils]: 11: Hoare triple {60773#(and (<= 5 main_~y~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; {60774#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:12:01,896 INFO L290 TraceCheckUtils]: 12: Hoare triple {60774#(and (<= main_~y~0 6) (<= 6 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; {60775#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:12:01,896 INFO L290 TraceCheckUtils]: 13: Hoare triple {60775#(and (<= 7 main_~y~0) (<= main_~y~0 7))} 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; {60776#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:12:01,897 INFO L290 TraceCheckUtils]: 14: Hoare triple {60776#(and (<= main_~y~0 8) (<= 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; {60777#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:12:01,897 INFO L290 TraceCheckUtils]: 15: Hoare triple {60777#(and (<= 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; {60778#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:12:01,898 INFO L290 TraceCheckUtils]: 16: Hoare triple {60778#(and (<= main_~y~0 10) (<= 10 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; {60779#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:12:01,898 INFO L290 TraceCheckUtils]: 17: Hoare triple {60779#(and (<= main_~y~0 11) (<= 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; {60780#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:12:01,899 INFO L290 TraceCheckUtils]: 18: Hoare triple {60780#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !(~x~0 % 4294967296 > 0); {60780#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:12:01,899 INFO L290 TraceCheckUtils]: 19: Hoare triple {60780#(and (<= 12 main_~y~0) (<= main_~y~0 12))} ~z~0 := ~y~0; {60781#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-28 10:12:01,900 INFO L290 TraceCheckUtils]: 20: Hoare triple {60781#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {60847#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-28 10:12:01,900 INFO L290 TraceCheckUtils]: 21: Hoare triple {60847#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {60764#false} is VALID [2022-04-28 10:12:01,900 INFO L290 TraceCheckUtils]: 22: Hoare triple {60764#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {60764#false} is VALID [2022-04-28 10:12:01,900 INFO L290 TraceCheckUtils]: 23: Hoare triple {60764#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {60764#false} is VALID [2022-04-28 10:12:01,900 INFO L290 TraceCheckUtils]: 24: Hoare triple {60764#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {60764#false} is VALID [2022-04-28 10:12:01,900 INFO L290 TraceCheckUtils]: 25: Hoare triple {60764#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {60764#false} is VALID [2022-04-28 10:12:01,900 INFO L290 TraceCheckUtils]: 26: Hoare triple {60764#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {60764#false} is VALID [2022-04-28 10:12:01,900 INFO L290 TraceCheckUtils]: 27: Hoare triple {60764#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {60764#false} is VALID [2022-04-28 10:12:01,900 INFO L290 TraceCheckUtils]: 28: Hoare triple {60764#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {60764#false} is VALID [2022-04-28 10:12:01,900 INFO L290 TraceCheckUtils]: 29: Hoare triple {60764#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {60764#false} is VALID [2022-04-28 10:12:01,900 INFO L290 TraceCheckUtils]: 30: Hoare triple {60764#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {60764#false} is VALID [2022-04-28 10:12:01,900 INFO L290 TraceCheckUtils]: 31: Hoare triple {60764#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {60764#false} is VALID [2022-04-28 10:12:01,900 INFO L290 TraceCheckUtils]: 32: Hoare triple {60764#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {60764#false} is VALID [2022-04-28 10:12:01,901 INFO L290 TraceCheckUtils]: 33: Hoare triple {60764#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {60764#false} is VALID [2022-04-28 10:12:01,901 INFO L290 TraceCheckUtils]: 34: Hoare triple {60764#false} assume !(~y~0 % 4294967296 > 0); {60764#false} is VALID [2022-04-28 10:12:01,901 INFO L272 TraceCheckUtils]: 35: Hoare triple {60764#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {60764#false} is VALID [2022-04-28 10:12:01,901 INFO L290 TraceCheckUtils]: 36: Hoare triple {60764#false} ~cond := #in~cond; {60764#false} is VALID [2022-04-28 10:12:01,901 INFO L290 TraceCheckUtils]: 37: Hoare triple {60764#false} assume 0 == ~cond; {60764#false} is VALID [2022-04-28 10:12:01,901 INFO L290 TraceCheckUtils]: 38: Hoare triple {60764#false} assume !false; {60764#false} is VALID [2022-04-28 10:12:01,901 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 0 proven. 79 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-04-28 10:12:01,901 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:12:02,314 INFO L290 TraceCheckUtils]: 38: Hoare triple {60764#false} assume !false; {60764#false} is VALID [2022-04-28 10:12:02,314 INFO L290 TraceCheckUtils]: 37: Hoare triple {60764#false} assume 0 == ~cond; {60764#false} is VALID [2022-04-28 10:12:02,314 INFO L290 TraceCheckUtils]: 36: Hoare triple {60764#false} ~cond := #in~cond; {60764#false} is VALID [2022-04-28 10:12:02,314 INFO L272 TraceCheckUtils]: 35: Hoare triple {60764#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {60764#false} is VALID [2022-04-28 10:12:02,314 INFO L290 TraceCheckUtils]: 34: Hoare triple {60764#false} assume !(~y~0 % 4294967296 > 0); {60764#false} is VALID [2022-04-28 10:12:02,314 INFO L290 TraceCheckUtils]: 33: Hoare triple {60764#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {60764#false} is VALID [2022-04-28 10:12:02,314 INFO L290 TraceCheckUtils]: 32: Hoare triple {60764#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {60764#false} is VALID [2022-04-28 10:12:02,314 INFO L290 TraceCheckUtils]: 31: Hoare triple {60764#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {60764#false} is VALID [2022-04-28 10:12:02,314 INFO L290 TraceCheckUtils]: 30: Hoare triple {60764#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {60764#false} is VALID [2022-04-28 10:12:02,314 INFO L290 TraceCheckUtils]: 29: Hoare triple {60764#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {60764#false} is VALID [2022-04-28 10:12:02,314 INFO L290 TraceCheckUtils]: 28: Hoare triple {60764#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {60764#false} is VALID [2022-04-28 10:12:02,315 INFO L290 TraceCheckUtils]: 27: Hoare triple {60764#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {60764#false} is VALID [2022-04-28 10:12:02,315 INFO L290 TraceCheckUtils]: 26: Hoare triple {60764#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {60764#false} is VALID [2022-04-28 10:12:02,315 INFO L290 TraceCheckUtils]: 25: Hoare triple {60764#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {60764#false} is VALID [2022-04-28 10:12:02,315 INFO L290 TraceCheckUtils]: 24: Hoare triple {60764#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {60764#false} is VALID [2022-04-28 10:12:02,315 INFO L290 TraceCheckUtils]: 23: Hoare triple {60764#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {60764#false} is VALID [2022-04-28 10:12:02,315 INFO L290 TraceCheckUtils]: 22: Hoare triple {60764#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {60764#false} is VALID [2022-04-28 10:12:02,315 INFO L290 TraceCheckUtils]: 21: Hoare triple {60953#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {60764#false} is VALID [2022-04-28 10:12:02,316 INFO L290 TraceCheckUtils]: 20: Hoare triple {60957#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {60953#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:12:02,316 INFO L290 TraceCheckUtils]: 19: Hoare triple {60961#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} ~z~0 := ~y~0; {60957#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:12:02,317 INFO L290 TraceCheckUtils]: 18: Hoare triple {60961#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {60961#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:12:02,317 INFO L290 TraceCheckUtils]: 17: Hoare triple {60968#(< 0 (mod main_~y~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; {60961#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:12:02,318 INFO L290 TraceCheckUtils]: 16: Hoare triple {60972#(< 0 (mod (+ main_~y~0 1) 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; {60968#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:12:02,318 INFO L290 TraceCheckUtils]: 15: Hoare triple {60976#(< 0 (mod (+ main_~y~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; {60972#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:12:02,319 INFO L290 TraceCheckUtils]: 14: Hoare triple {60980#(< 0 (mod (+ main_~y~0 3) 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; {60976#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:12:02,320 INFO L290 TraceCheckUtils]: 13: Hoare triple {60984#(< 0 (mod (+ main_~y~0 4) 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; {60980#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:12:02,320 INFO L290 TraceCheckUtils]: 12: Hoare triple {60988#(< 0 (mod (+ 5 main_~y~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; {60984#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:12:02,321 INFO L290 TraceCheckUtils]: 11: Hoare triple {60992#(< 0 (mod (+ main_~y~0 6) 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; {60988#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:12:02,322 INFO L290 TraceCheckUtils]: 10: Hoare triple {60996#(< 0 (mod (+ 7 main_~y~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; {60992#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:12:02,322 INFO L290 TraceCheckUtils]: 9: Hoare triple {61000#(< 0 (mod (+ main_~y~0 8) 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; {60996#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:12:02,323 INFO L290 TraceCheckUtils]: 8: Hoare triple {61004#(< 0 (mod (+ main_~y~0 9) 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; {61000#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:12:02,324 INFO L290 TraceCheckUtils]: 7: Hoare triple {61008#(< 0 (mod (+ main_~y~0 10) 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; {61004#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:12:02,324 INFO L290 TraceCheckUtils]: 6: Hoare triple {61012#(< 0 (mod (+ main_~y~0 11) 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; {61008#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-28 10:12:02,325 INFO L290 TraceCheckUtils]: 5: Hoare triple {60763#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {61012#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-28 10:12:02,325 INFO L272 TraceCheckUtils]: 4: Hoare triple {60763#true} call #t~ret11 := main(); {60763#true} is VALID [2022-04-28 10:12:02,325 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {60763#true} {60763#true} #61#return; {60763#true} is VALID [2022-04-28 10:12:02,325 INFO L290 TraceCheckUtils]: 2: Hoare triple {60763#true} assume true; {60763#true} is VALID [2022-04-28 10:12:02,325 INFO L290 TraceCheckUtils]: 1: Hoare triple {60763#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(10, 2);call #Ultimate.allocInit(12, 3); {60763#true} is VALID [2022-04-28 10:12:02,325 INFO L272 TraceCheckUtils]: 0: Hoare triple {60763#true} call ULTIMATE.init(); {60763#true} is VALID [2022-04-28 10:12:02,325 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 0 proven. 79 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-04-28 10:12:02,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1438494690] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:12:02,325 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:12:02,325 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 34 [2022-04-28 10:12:02,325 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:12:02,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [96696185] [2022-04-28 10:12:02,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [96696185] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:12:02,325 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:12:02,325 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-28 10:12:02,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479941458] [2022-04-28 10:12:02,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:12:02,326 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 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 39 [2022-04-28 10:12:02,326 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:12:02,326 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 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-28 10:12:02,342 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:12:02,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-28 10:12:02,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:12:02,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-28 10:12:02,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=240, Invalid=882, Unknown=0, NotChecked=0, Total=1122 [2022-04-28 10:12:02,343 INFO L87 Difference]: Start difference. First operand 128 states and 162 transitions. Second operand has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 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-28 10:12:03,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:12:03,740 INFO L93 Difference]: Finished difference Result 161 states and 195 transitions. [2022-04-28 10:12:03,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-28 10:12:03,740 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 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 39 [2022-04-28 10:12:03,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:12:03,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 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-28 10:12:03,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 70 transitions. [2022-04-28 10:12:03,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 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-28 10:12:03,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 70 transitions. [2022-04-28 10:12:03,741 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 70 transitions. [2022-04-28 10:12:03,794 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:12:03,795 INFO L225 Difference]: With dead ends: 161 [2022-04-28 10:12:03,795 INFO L226 Difference]: Without dead ends: 143 [2022-04-28 10:12:03,796 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=524, Invalid=1926, Unknown=0, NotChecked=0, Total=2450 [2022-04-28 10:12:03,796 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 39 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 725 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 761 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 725 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 10:12:03,796 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 99 Invalid, 761 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 725 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 10:12:03,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2022-04-28 10:12:03,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 129. [2022-04-28 10:12:03,946 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:12:03,946 INFO L82 GeneralOperation]: Start isEquivalent. First operand 143 states. Second operand has 129 states, 124 states have (on average 1.282258064516129) internal successors, (159), 124 states have internal predecessors, (159), 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-28 10:12:03,946 INFO L74 IsIncluded]: Start isIncluded. First operand 143 states. Second operand has 129 states, 124 states have (on average 1.282258064516129) internal successors, (159), 124 states have internal predecessors, (159), 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-28 10:12:03,947 INFO L87 Difference]: Start difference. First operand 143 states. Second operand has 129 states, 124 states have (on average 1.282258064516129) internal successors, (159), 124 states have internal predecessors, (159), 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-28 10:12:03,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:12:03,948 INFO L93 Difference]: Finished difference Result 143 states and 177 transitions. [2022-04-28 10:12:03,948 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 177 transitions. [2022-04-28 10:12:03,948 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:12:03,948 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:12:03,948 INFO L74 IsIncluded]: Start isIncluded. First operand has 129 states, 124 states have (on average 1.282258064516129) internal successors, (159), 124 states have internal predecessors, (159), 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 143 states. [2022-04-28 10:12:03,948 INFO L87 Difference]: Start difference. First operand has 129 states, 124 states have (on average 1.282258064516129) internal successors, (159), 124 states have internal predecessors, (159), 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 143 states. [2022-04-28 10:12:03,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:12:03,949 INFO L93 Difference]: Finished difference Result 143 states and 177 transitions. [2022-04-28 10:12:03,949 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 177 transitions. [2022-04-28 10:12:03,949 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:12:03,949 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:12:03,949 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:12:03,949 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:12:03,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 124 states have (on average 1.282258064516129) internal successors, (159), 124 states have internal predecessors, (159), 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-28 10:12:03,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 163 transitions. [2022-04-28 10:12:03,951 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 163 transitions. Word has length 39 [2022-04-28 10:12:03,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:12:03,951 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 163 transitions. [2022-04-28 10:12:03,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 17 states have internal predecessors, (24), 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-28 10:12:03,951 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 129 states and 163 transitions. [2022-04-28 10:12:07,623 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 163 edges. 162 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 10:12:07,624 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 163 transitions. [2022-04-28 10:12:07,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-28 10:12:07,624 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:12:07,624 INFO L195 NwaCegarLoop]: trace histogram [25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:12:07,640 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (78)] Ended with exit code 0 [2022-04-28 10:12:07,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77,78 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:12:07,827 INFO L420 AbstractCegarLoop]: === Iteration 79 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:12:07,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:12:07,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1654406958, now seen corresponding path program 49 times [2022-04-28 10:12:07,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:12:07,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [154853912] [2022-04-28 10:12:07,830 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:12:07,830 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:12:07,830 INFO L85 PathProgramCache]: Analyzing trace with hash 1654406958, now seen corresponding path program 50 times [2022-04-28 10:12:07,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:12:07,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288959706] [2022-04-28 10:12:07,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:12:07,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:12:07,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:12:08,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:12:08,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:12:08,301 INFO L290 TraceCheckUtils]: 0: Hoare triple {61963#(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(10, 2);call #Ultimate.allocInit(12, 3); {61931#true} is VALID [2022-04-28 10:12:08,301 INFO L290 TraceCheckUtils]: 1: Hoare triple {61931#true} assume true; {61931#true} is VALID [2022-04-28 10:12:08,301 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {61931#true} {61931#true} #61#return; {61931#true} is VALID [2022-04-28 10:12:08,302 INFO L272 TraceCheckUtils]: 0: Hoare triple {61931#true} call ULTIMATE.init(); {61963#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:12:08,302 INFO L290 TraceCheckUtils]: 1: Hoare triple {61963#(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(10, 2);call #Ultimate.allocInit(12, 3); {61931#true} is VALID [2022-04-28 10:12:08,302 INFO L290 TraceCheckUtils]: 2: Hoare triple {61931#true} assume true; {61931#true} is VALID [2022-04-28 10:12:08,302 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {61931#true} {61931#true} #61#return; {61931#true} is VALID [2022-04-28 10:12:08,302 INFO L272 TraceCheckUtils]: 4: Hoare triple {61931#true} call #t~ret11 := main(); {61931#true} is VALID [2022-04-28 10:12:08,302 INFO L290 TraceCheckUtils]: 5: Hoare triple {61931#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {61936#(= main_~y~0 0)} is VALID [2022-04-28 10:12:08,302 INFO L290 TraceCheckUtils]: 6: Hoare triple {61936#(= 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; {61937#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:12:08,303 INFO L290 TraceCheckUtils]: 7: Hoare triple {61937#(and (<= 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; {61938#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:12:08,303 INFO L290 TraceCheckUtils]: 8: Hoare triple {61938#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {61939#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:12:08,304 INFO L290 TraceCheckUtils]: 9: Hoare triple {61939#(and (<= main_~y~0 3) (<= 3 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; {61940#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:12:08,304 INFO L290 TraceCheckUtils]: 10: Hoare triple {61940#(and (<= main_~y~0 4) (<= 4 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; {61941#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:12:08,305 INFO L290 TraceCheckUtils]: 11: Hoare triple {61941#(and (<= 5 main_~y~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; {61942#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:12:08,305 INFO L290 TraceCheckUtils]: 12: Hoare triple {61942#(and (<= main_~y~0 6) (<= 6 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; {61943#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:12:08,306 INFO L290 TraceCheckUtils]: 13: Hoare triple {61943#(and (<= 7 main_~y~0) (<= main_~y~0 7))} 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; {61944#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:12:08,306 INFO L290 TraceCheckUtils]: 14: Hoare triple {61944#(and (<= main_~y~0 8) (<= 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; {61945#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:12:08,307 INFO L290 TraceCheckUtils]: 15: Hoare triple {61945#(and (<= 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; {61946#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:12:08,307 INFO L290 TraceCheckUtils]: 16: Hoare triple {61946#(and (<= main_~y~0 10) (<= 10 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; {61947#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:12:08,308 INFO L290 TraceCheckUtils]: 17: Hoare triple {61947#(and (<= main_~y~0 11) (<= 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; {61948#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:12:08,308 INFO L290 TraceCheckUtils]: 18: Hoare triple {61948#(and (<= 12 main_~y~0) (<= main_~y~0 12))} 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; {61949#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:12:08,309 INFO L290 TraceCheckUtils]: 19: Hoare triple {61949#(and (<= main_~y~0 13) (<= 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; {61950#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:12:08,309 INFO L290 TraceCheckUtils]: 20: Hoare triple {61950#(and (<= 14 main_~y~0) (<= main_~y~0 14))} 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; {61951#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:12:08,310 INFO L290 TraceCheckUtils]: 21: Hoare triple {61951#(and (<= main_~y~0 15) (<= 15 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; {61952#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:12:08,310 INFO L290 TraceCheckUtils]: 22: Hoare triple {61952#(and (<= 16 main_~y~0) (<= main_~y~0 16))} 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; {61953#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:12:08,311 INFO L290 TraceCheckUtils]: 23: Hoare triple {61953#(and (<= main_~y~0 17) (<= 17 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; {61954#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 10:12:08,311 INFO L290 TraceCheckUtils]: 24: Hoare triple {61954#(and (<= 18 main_~y~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; {61955#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 10:12:08,312 INFO L290 TraceCheckUtils]: 25: Hoare triple {61955#(and (<= 19 main_~y~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; {61956#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 10:12:08,312 INFO L290 TraceCheckUtils]: 26: Hoare triple {61956#(and (<= 20 main_~y~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; {61957#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 10:12:08,313 INFO L290 TraceCheckUtils]: 27: Hoare triple {61957#(and (<= main_~y~0 21) (<= 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; {61958#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 10:12:08,313 INFO L290 TraceCheckUtils]: 28: Hoare triple {61958#(and (<= main_~y~0 22) (<= 22 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; {61959#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 10:12:08,314 INFO L290 TraceCheckUtils]: 29: Hoare triple {61959#(and (<= main_~y~0 23) (<= 23 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; {61960#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-28 10:12:08,314 INFO L290 TraceCheckUtils]: 30: Hoare triple {61960#(and (<= 24 main_~y~0) (<= main_~y~0 24))} 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; {61961#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-28 10:12:08,314 INFO L290 TraceCheckUtils]: 31: Hoare triple {61961#(and (<= 25 main_~y~0) (<= main_~y~0 25))} assume !(~x~0 % 4294967296 > 0); {61961#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-28 10:12:08,315 INFO L290 TraceCheckUtils]: 32: Hoare triple {61961#(and (<= 25 main_~y~0) (<= main_~y~0 25))} ~z~0 := ~y~0; {61962#(and (<= 25 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:12:08,315 INFO L290 TraceCheckUtils]: 33: Hoare triple {61962#(and (<= 25 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {61932#false} is VALID [2022-04-28 10:12:08,315 INFO L290 TraceCheckUtils]: 34: Hoare triple {61932#false} assume !(~y~0 % 4294967296 > 0); {61932#false} is VALID [2022-04-28 10:12:08,315 INFO L272 TraceCheckUtils]: 35: Hoare triple {61932#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {61932#false} is VALID [2022-04-28 10:12:08,315 INFO L290 TraceCheckUtils]: 36: Hoare triple {61932#false} ~cond := #in~cond; {61932#false} is VALID [2022-04-28 10:12:08,316 INFO L290 TraceCheckUtils]: 37: Hoare triple {61932#false} assume 0 == ~cond; {61932#false} is VALID [2022-04-28 10:12:08,316 INFO L290 TraceCheckUtils]: 38: Hoare triple {61932#false} assume !false; {61932#false} is VALID [2022-04-28 10:12:08,316 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:12:08,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:12:08,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288959706] [2022-04-28 10:12:08,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288959706] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:12:08,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1996874728] [2022-04-28 10:12:08,316 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:12:08,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:12:08,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:12:08,317 INFO L229 MonitoredProcess]: Starting monitored process 79 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:12:08,317 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (79)] Waiting until timeout for monitored process [2022-04-28 10:12:08,358 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:12:08,358 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:12:08,359 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 55 conjunts are in the unsatisfiable core [2022-04-28 10:12:08,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:12:08,368 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:12:08,704 INFO L272 TraceCheckUtils]: 0: Hoare triple {61931#true} call ULTIMATE.init(); {61931#true} is VALID [2022-04-28 10:12:08,705 INFO L290 TraceCheckUtils]: 1: Hoare triple {61931#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(10, 2);call #Ultimate.allocInit(12, 3); {61931#true} is VALID [2022-04-28 10:12:08,705 INFO L290 TraceCheckUtils]: 2: Hoare triple {61931#true} assume true; {61931#true} is VALID [2022-04-28 10:12:08,705 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {61931#true} {61931#true} #61#return; {61931#true} is VALID [2022-04-28 10:12:08,705 INFO L272 TraceCheckUtils]: 4: Hoare triple {61931#true} call #t~ret11 := main(); {61931#true} is VALID [2022-04-28 10:12:08,705 INFO L290 TraceCheckUtils]: 5: Hoare triple {61931#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {61936#(= main_~y~0 0)} is VALID [2022-04-28 10:12:08,705 INFO L290 TraceCheckUtils]: 6: Hoare triple {61936#(= 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; {61937#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:12:08,706 INFO L290 TraceCheckUtils]: 7: Hoare triple {61937#(and (<= 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; {61938#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:12:08,706 INFO L290 TraceCheckUtils]: 8: Hoare triple {61938#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {61939#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:12:08,707 INFO L290 TraceCheckUtils]: 9: Hoare triple {61939#(and (<= main_~y~0 3) (<= 3 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; {61940#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:12:08,708 INFO L290 TraceCheckUtils]: 10: Hoare triple {61940#(and (<= main_~y~0 4) (<= 4 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; {61941#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:12:08,708 INFO L290 TraceCheckUtils]: 11: Hoare triple {61941#(and (<= 5 main_~y~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; {61942#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:12:08,709 INFO L290 TraceCheckUtils]: 12: Hoare triple {61942#(and (<= main_~y~0 6) (<= 6 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; {61943#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:12:08,709 INFO L290 TraceCheckUtils]: 13: Hoare triple {61943#(and (<= 7 main_~y~0) (<= main_~y~0 7))} 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; {61944#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:12:08,709 INFO L290 TraceCheckUtils]: 14: Hoare triple {61944#(and (<= main_~y~0 8) (<= 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; {61945#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:12:08,710 INFO L290 TraceCheckUtils]: 15: Hoare triple {61945#(and (<= 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; {61946#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:12:08,710 INFO L290 TraceCheckUtils]: 16: Hoare triple {61946#(and (<= main_~y~0 10) (<= 10 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; {61947#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:12:08,711 INFO L290 TraceCheckUtils]: 17: Hoare triple {61947#(and (<= main_~y~0 11) (<= 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; {61948#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:12:08,711 INFO L290 TraceCheckUtils]: 18: Hoare triple {61948#(and (<= 12 main_~y~0) (<= main_~y~0 12))} 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; {61949#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:12:08,712 INFO L290 TraceCheckUtils]: 19: Hoare triple {61949#(and (<= main_~y~0 13) (<= 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; {61950#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:12:08,712 INFO L290 TraceCheckUtils]: 20: Hoare triple {61950#(and (<= 14 main_~y~0) (<= main_~y~0 14))} 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; {61951#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:12:08,713 INFO L290 TraceCheckUtils]: 21: Hoare triple {61951#(and (<= main_~y~0 15) (<= 15 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; {61952#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:12:08,713 INFO L290 TraceCheckUtils]: 22: Hoare triple {61952#(and (<= 16 main_~y~0) (<= main_~y~0 16))} 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; {61953#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:12:08,714 INFO L290 TraceCheckUtils]: 23: Hoare triple {61953#(and (<= main_~y~0 17) (<= 17 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; {61954#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 10:12:08,714 INFO L290 TraceCheckUtils]: 24: Hoare triple {61954#(and (<= 18 main_~y~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; {61955#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 10:12:08,715 INFO L290 TraceCheckUtils]: 25: Hoare triple {61955#(and (<= 19 main_~y~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; {61956#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 10:12:08,716 INFO L290 TraceCheckUtils]: 26: Hoare triple {61956#(and (<= 20 main_~y~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; {61957#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 10:12:08,716 INFO L290 TraceCheckUtils]: 27: Hoare triple {61957#(and (<= main_~y~0 21) (<= 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; {61958#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 10:12:08,717 INFO L290 TraceCheckUtils]: 28: Hoare triple {61958#(and (<= main_~y~0 22) (<= 22 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; {61959#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 10:12:08,717 INFO L290 TraceCheckUtils]: 29: Hoare triple {61959#(and (<= main_~y~0 23) (<= 23 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; {61960#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-28 10:12:08,718 INFO L290 TraceCheckUtils]: 30: Hoare triple {61960#(and (<= 24 main_~y~0) (<= main_~y~0 24))} 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; {61961#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-28 10:12:08,718 INFO L290 TraceCheckUtils]: 31: Hoare triple {61961#(and (<= 25 main_~y~0) (<= main_~y~0 25))} assume !(~x~0 % 4294967296 > 0); {61961#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-28 10:12:08,718 INFO L290 TraceCheckUtils]: 32: Hoare triple {61961#(and (<= 25 main_~y~0) (<= main_~y~0 25))} ~z~0 := ~y~0; {62063#(and (<= 25 main_~z~0) (<= main_~z~0 25))} is VALID [2022-04-28 10:12:08,719 INFO L290 TraceCheckUtils]: 33: Hoare triple {62063#(and (<= 25 main_~z~0) (<= main_~z~0 25))} assume !(~z~0 % 4294967296 > 0); {61932#false} is VALID [2022-04-28 10:12:08,719 INFO L290 TraceCheckUtils]: 34: Hoare triple {61932#false} assume !(~y~0 % 4294967296 > 0); {61932#false} is VALID [2022-04-28 10:12:08,719 INFO L272 TraceCheckUtils]: 35: Hoare triple {61932#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {61932#false} is VALID [2022-04-28 10:12:08,719 INFO L290 TraceCheckUtils]: 36: Hoare triple {61932#false} ~cond := #in~cond; {61932#false} is VALID [2022-04-28 10:12:08,719 INFO L290 TraceCheckUtils]: 37: Hoare triple {61932#false} assume 0 == ~cond; {61932#false} is VALID [2022-04-28 10:12:08,719 INFO L290 TraceCheckUtils]: 38: Hoare triple {61932#false} assume !false; {61932#false} is VALID [2022-04-28 10:12:08,719 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:12:08,719 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:12:09,839 INFO L290 TraceCheckUtils]: 38: Hoare triple {61932#false} assume !false; {61932#false} is VALID [2022-04-28 10:12:09,839 INFO L290 TraceCheckUtils]: 37: Hoare triple {61932#false} assume 0 == ~cond; {61932#false} is VALID [2022-04-28 10:12:09,839 INFO L290 TraceCheckUtils]: 36: Hoare triple {61932#false} ~cond := #in~cond; {61932#false} is VALID [2022-04-28 10:12:09,839 INFO L272 TraceCheckUtils]: 35: Hoare triple {61932#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {61932#false} is VALID [2022-04-28 10:12:09,839 INFO L290 TraceCheckUtils]: 34: Hoare triple {61932#false} assume !(~y~0 % 4294967296 > 0); {61932#false} is VALID [2022-04-28 10:12:09,839 INFO L290 TraceCheckUtils]: 33: Hoare triple {62097#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {61932#false} is VALID [2022-04-28 10:12:09,839 INFO L290 TraceCheckUtils]: 32: Hoare triple {62101#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {62097#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:12:09,840 INFO L290 TraceCheckUtils]: 31: Hoare triple {62101#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {62101#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:12:09,840 INFO L290 TraceCheckUtils]: 30: Hoare triple {62108#(< 0 (mod (+ main_~y~0 1) 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; {62101#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:12:09,841 INFO L290 TraceCheckUtils]: 29: Hoare triple {62112#(< 0 (mod (+ main_~y~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; {62108#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:12:09,842 INFO L290 TraceCheckUtils]: 28: Hoare triple {62116#(< 0 (mod (+ main_~y~0 3) 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; {62112#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:12:09,842 INFO L290 TraceCheckUtils]: 27: Hoare triple {62120#(< 0 (mod (+ main_~y~0 4) 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; {62116#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:12:09,843 INFO L290 TraceCheckUtils]: 26: Hoare triple {62124#(< 0 (mod (+ 5 main_~y~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; {62120#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:12:09,844 INFO L290 TraceCheckUtils]: 25: Hoare triple {62128#(< 0 (mod (+ main_~y~0 6) 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; {62124#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:12:09,844 INFO L290 TraceCheckUtils]: 24: Hoare triple {62132#(< 0 (mod (+ 7 main_~y~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; {62128#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:12:09,845 INFO L290 TraceCheckUtils]: 23: Hoare triple {62136#(< 0 (mod (+ main_~y~0 8) 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; {62132#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:12:09,846 INFO L290 TraceCheckUtils]: 22: Hoare triple {62140#(< 0 (mod (+ main_~y~0 9) 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; {62136#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:12:09,846 INFO L290 TraceCheckUtils]: 21: Hoare triple {62144#(< 0 (mod (+ main_~y~0 10) 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; {62140#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:12:09,847 INFO L290 TraceCheckUtils]: 20: Hoare triple {62148#(< 0 (mod (+ main_~y~0 11) 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; {62144#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-28 10:12:09,848 INFO L290 TraceCheckUtils]: 19: Hoare triple {62152#(< 0 (mod (+ main_~y~0 12) 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; {62148#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-28 10:12:09,848 INFO L290 TraceCheckUtils]: 18: Hoare triple {62156#(< 0 (mod (+ main_~y~0 13) 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; {62152#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-28 10:12:09,849 INFO L290 TraceCheckUtils]: 17: Hoare triple {62160#(< 0 (mod (+ main_~y~0 14) 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; {62156#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-28 10:12:09,849 INFO L290 TraceCheckUtils]: 16: Hoare triple {62164#(< 0 (mod (+ main_~y~0 15) 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; {62160#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-28 10:12:09,850 INFO L290 TraceCheckUtils]: 15: Hoare triple {62168#(< 0 (mod (+ main_~y~0 16) 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; {62164#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID [2022-04-28 10:12:09,851 INFO L290 TraceCheckUtils]: 14: Hoare triple {62172#(< 0 (mod (+ main_~y~0 17) 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; {62168#(< 0 (mod (+ main_~y~0 16) 4294967296))} is VALID [2022-04-28 10:12:09,851 INFO L290 TraceCheckUtils]: 13: Hoare triple {62176#(< 0 (mod (+ main_~y~0 18) 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; {62172#(< 0 (mod (+ main_~y~0 17) 4294967296))} is VALID [2022-04-28 10:12:09,852 INFO L290 TraceCheckUtils]: 12: Hoare triple {62180#(< 0 (mod (+ 19 main_~y~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; {62176#(< 0 (mod (+ main_~y~0 18) 4294967296))} is VALID [2022-04-28 10:12:09,853 INFO L290 TraceCheckUtils]: 11: Hoare triple {62184#(< 0 (mod (+ main_~y~0 20) 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; {62180#(< 0 (mod (+ 19 main_~y~0) 4294967296))} is VALID [2022-04-28 10:12:09,853 INFO L290 TraceCheckUtils]: 10: Hoare triple {62188#(< 0 (mod (+ main_~y~0 21) 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; {62184#(< 0 (mod (+ main_~y~0 20) 4294967296))} is VALID [2022-04-28 10:12:09,854 INFO L290 TraceCheckUtils]: 9: Hoare triple {62192#(< 0 (mod (+ main_~y~0 22) 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; {62188#(< 0 (mod (+ main_~y~0 21) 4294967296))} is VALID [2022-04-28 10:12:09,855 INFO L290 TraceCheckUtils]: 8: Hoare triple {62196#(< 0 (mod (+ 23 main_~y~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; {62192#(< 0 (mod (+ main_~y~0 22) 4294967296))} is VALID [2022-04-28 10:12:09,855 INFO L290 TraceCheckUtils]: 7: Hoare triple {62200#(< 0 (mod (+ main_~y~0 24) 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; {62196#(< 0 (mod (+ 23 main_~y~0) 4294967296))} is VALID [2022-04-28 10:12:09,856 INFO L290 TraceCheckUtils]: 6: Hoare triple {62204#(< 0 (mod (+ main_~y~0 25) 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; {62200#(< 0 (mod (+ main_~y~0 24) 4294967296))} is VALID [2022-04-28 10:12:09,856 INFO L290 TraceCheckUtils]: 5: Hoare triple {61931#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {62204#(< 0 (mod (+ main_~y~0 25) 4294967296))} is VALID [2022-04-28 10:12:09,856 INFO L272 TraceCheckUtils]: 4: Hoare triple {61931#true} call #t~ret11 := main(); {61931#true} is VALID [2022-04-28 10:12:09,856 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {61931#true} {61931#true} #61#return; {61931#true} is VALID [2022-04-28 10:12:09,856 INFO L290 TraceCheckUtils]: 2: Hoare triple {61931#true} assume true; {61931#true} is VALID [2022-04-28 10:12:09,856 INFO L290 TraceCheckUtils]: 1: Hoare triple {61931#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(10, 2);call #Ultimate.allocInit(12, 3); {61931#true} is VALID [2022-04-28 10:12:09,856 INFO L272 TraceCheckUtils]: 0: Hoare triple {61931#true} call ULTIMATE.init(); {61931#true} is VALID [2022-04-28 10:12:09,857 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:12:09,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1996874728] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:12:09,857 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:12:09,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 29, 29] total 58 [2022-04-28 10:12:09,857 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:12:09,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [154853912] [2022-04-28 10:12:09,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [154853912] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:12:09,857 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:12:09,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2022-04-28 10:12:09,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84750383] [2022-04-28 10:12:09,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:12:09,857 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 29 states have internal predecessors, (35), 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 39 [2022-04-28 10:12:09,857 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:12:09,857 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 30 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 29 states have internal predecessors, (35), 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-28 10:12:09,878 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:12:09,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-04-28 10:12:09,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:12:09,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-04-28 10:12:09,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=791, Invalid=2515, Unknown=0, NotChecked=0, Total=3306 [2022-04-28 10:12:09,879 INFO L87 Difference]: Start difference. First operand 129 states and 163 transitions. Second operand has 30 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 29 states have internal predecessors, (35), 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-28 10:12:15,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:12:15,000 INFO L93 Difference]: Finished difference Result 166 states and 229 transitions. [2022-04-28 10:12:15,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-04-28 10:12:15,001 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 29 states have internal predecessors, (35), 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 39 [2022-04-28 10:12:15,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:12:15,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 29 states have internal predecessors, (35), 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-28 10:12:15,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 172 transitions. [2022-04-28 10:12:15,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 29 states have internal predecessors, (35), 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-28 10:12:15,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 172 transitions. [2022-04-28 10:12:15,002 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 172 transitions. [2022-04-28 10:12:15,135 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 172 edges. 172 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:12:15,137 INFO L225 Difference]: With dead ends: 166 [2022-04-28 10:12:15,137 INFO L226 Difference]: Without dead ends: 160 [2022-04-28 10:12:15,137 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 430 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1603, Invalid=5537, Unknown=0, NotChecked=0, Total=7140 [2022-04-28 10:12:15,137 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 148 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 3326 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 3433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 3326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-28 10:12:15,137 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 197 Invalid, 3433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 3326 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-04-28 10:12:15,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2022-04-28 10:12:15,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 134. [2022-04-28 10:12:15,289 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:12:15,289 INFO L82 GeneralOperation]: Start isEquivalent. First operand 160 states. Second operand has 134 states, 129 states have (on average 1.2868217054263567) internal successors, (166), 129 states have internal predecessors, (166), 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-28 10:12:15,289 INFO L74 IsIncluded]: Start isIncluded. First operand 160 states. Second operand has 134 states, 129 states have (on average 1.2868217054263567) internal successors, (166), 129 states have internal predecessors, (166), 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-28 10:12:15,289 INFO L87 Difference]: Start difference. First operand 160 states. Second operand has 134 states, 129 states have (on average 1.2868217054263567) internal successors, (166), 129 states have internal predecessors, (166), 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-28 10:12:15,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:12:15,290 INFO L93 Difference]: Finished difference Result 160 states and 196 transitions. [2022-04-28 10:12:15,290 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 196 transitions. [2022-04-28 10:12:15,291 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:12:15,291 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:12:15,291 INFO L74 IsIncluded]: Start isIncluded. First operand has 134 states, 129 states have (on average 1.2868217054263567) internal successors, (166), 129 states have internal predecessors, (166), 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 160 states. [2022-04-28 10:12:15,291 INFO L87 Difference]: Start difference. First operand has 134 states, 129 states have (on average 1.2868217054263567) internal successors, (166), 129 states have internal predecessors, (166), 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 160 states. [2022-04-28 10:12:15,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:12:15,292 INFO L93 Difference]: Finished difference Result 160 states and 196 transitions. [2022-04-28 10:12:15,292 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 196 transitions. [2022-04-28 10:12:15,292 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:12:15,292 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:12:15,292 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:12:15,292 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:12:15,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 129 states have (on average 1.2868217054263567) internal successors, (166), 129 states have internal predecessors, (166), 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-28 10:12:15,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 170 transitions. [2022-04-28 10:12:15,293 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 170 transitions. Word has length 39 [2022-04-28 10:12:15,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:12:15,294 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 170 transitions. [2022-04-28 10:12:15,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 29 states have internal predecessors, (35), 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-28 10:12:15,294 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 134 states and 170 transitions. [2022-04-28 10:12:16,057 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 170 edges. 170 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:12:16,057 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 170 transitions. [2022-04-28 10:12:16,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-28 10:12:16,057 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:12:16,058 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:12:16,073 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (79)] Forceful destruction successful, exit code 0 [2022-04-28 10:12:16,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78,79 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:12:16,258 INFO L420 AbstractCegarLoop]: === Iteration 80 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:12:16,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:12:16,258 INFO L85 PathProgramCache]: Analyzing trace with hash -1413810305, now seen corresponding path program 107 times [2022-04-28 10:12:16,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:12:16,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1048744877] [2022-04-28 10:12:16,260 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:12:16,260 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:12:16,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1413810305, now seen corresponding path program 108 times [2022-04-28 10:12:16,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:12:16,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062231752] [2022-04-28 10:12:16,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:12:16,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:12:16,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:12:16,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:12:16,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:12:16,550 INFO L290 TraceCheckUtils]: 0: Hoare triple {63223#(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(10, 2);call #Ultimate.allocInit(12, 3); {63199#true} is VALID [2022-04-28 10:12:16,550 INFO L290 TraceCheckUtils]: 1: Hoare triple {63199#true} assume true; {63199#true} is VALID [2022-04-28 10:12:16,550 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {63199#true} {63199#true} #61#return; {63199#true} is VALID [2022-04-28 10:12:16,550 INFO L272 TraceCheckUtils]: 0: Hoare triple {63199#true} call ULTIMATE.init(); {63223#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:12:16,550 INFO L290 TraceCheckUtils]: 1: Hoare triple {63223#(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(10, 2);call #Ultimate.allocInit(12, 3); {63199#true} is VALID [2022-04-28 10:12:16,550 INFO L290 TraceCheckUtils]: 2: Hoare triple {63199#true} assume true; {63199#true} is VALID [2022-04-28 10:12:16,550 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {63199#true} {63199#true} #61#return; {63199#true} is VALID [2022-04-28 10:12:16,550 INFO L272 TraceCheckUtils]: 4: Hoare triple {63199#true} call #t~ret11 := main(); {63199#true} is VALID [2022-04-28 10:12:16,551 INFO L290 TraceCheckUtils]: 5: Hoare triple {63199#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {63204#(= main_~y~0 0)} is VALID [2022-04-28 10:12:16,551 INFO L290 TraceCheckUtils]: 6: Hoare triple {63204#(= 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; {63205#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:12:16,551 INFO L290 TraceCheckUtils]: 7: Hoare triple {63205#(and (<= 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; {63206#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:12:16,552 INFO L290 TraceCheckUtils]: 8: Hoare triple {63206#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {63207#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:12:16,552 INFO L290 TraceCheckUtils]: 9: Hoare triple {63207#(and (<= main_~y~0 3) (<= 3 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; {63208#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:12:16,553 INFO L290 TraceCheckUtils]: 10: Hoare triple {63208#(and (<= main_~y~0 4) (<= 4 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; {63209#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:12:16,553 INFO L290 TraceCheckUtils]: 11: Hoare triple {63209#(and (<= 5 main_~y~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; {63210#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:12:16,554 INFO L290 TraceCheckUtils]: 12: Hoare triple {63210#(and (<= main_~y~0 6) (<= 6 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; {63211#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:12:16,554 INFO L290 TraceCheckUtils]: 13: Hoare triple {63211#(and (<= 7 main_~y~0) (<= main_~y~0 7))} 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; {63212#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:12:16,555 INFO L290 TraceCheckUtils]: 14: Hoare triple {63212#(and (<= main_~y~0 8) (<= 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; {63213#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:12:16,555 INFO L290 TraceCheckUtils]: 15: Hoare triple {63213#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {63213#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:12:16,555 INFO L290 TraceCheckUtils]: 16: Hoare triple {63213#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {63214#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:12:16,556 INFO L290 TraceCheckUtils]: 17: Hoare triple {63214#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {63215#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:12:16,556 INFO L290 TraceCheckUtils]: 18: Hoare triple {63215#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {63216#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:12:16,557 INFO L290 TraceCheckUtils]: 19: Hoare triple {63216#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {63217#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:12:16,557 INFO L290 TraceCheckUtils]: 20: Hoare triple {63217#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {63218#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:12:16,558 INFO L290 TraceCheckUtils]: 21: Hoare triple {63218#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {63219#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:12:16,558 INFO L290 TraceCheckUtils]: 22: Hoare triple {63219#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {63220#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:12:16,559 INFO L290 TraceCheckUtils]: 23: Hoare triple {63220#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {63221#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-28 10:12:16,559 INFO L290 TraceCheckUtils]: 24: Hoare triple {63221#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {63222#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-28 10:12:16,560 INFO L290 TraceCheckUtils]: 25: Hoare triple {63222#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {63200#false} is VALID [2022-04-28 10:12:16,560 INFO L290 TraceCheckUtils]: 26: Hoare triple {63200#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {63200#false} is VALID [2022-04-28 10:12:16,560 INFO L290 TraceCheckUtils]: 27: Hoare triple {63200#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {63200#false} is VALID [2022-04-28 10:12:16,560 INFO L290 TraceCheckUtils]: 28: Hoare triple {63200#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {63200#false} is VALID [2022-04-28 10:12:16,560 INFO L290 TraceCheckUtils]: 29: Hoare triple {63200#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {63200#false} is VALID [2022-04-28 10:12:16,560 INFO L290 TraceCheckUtils]: 30: Hoare triple {63200#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {63200#false} is VALID [2022-04-28 10:12:16,560 INFO L290 TraceCheckUtils]: 31: Hoare triple {63200#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {63200#false} is VALID [2022-04-28 10:12:16,560 INFO L290 TraceCheckUtils]: 32: Hoare triple {63200#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {63200#false} is VALID [2022-04-28 10:12:16,560 INFO L290 TraceCheckUtils]: 33: Hoare triple {63200#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {63200#false} is VALID [2022-04-28 10:12:16,560 INFO L290 TraceCheckUtils]: 34: Hoare triple {63200#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {63200#false} is VALID [2022-04-28 10:12:16,560 INFO L290 TraceCheckUtils]: 35: Hoare triple {63200#false} assume !(~y~0 % 4294967296 > 0); {63200#false} is VALID [2022-04-28 10:12:16,560 INFO L272 TraceCheckUtils]: 36: Hoare triple {63200#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {63200#false} is VALID [2022-04-28 10:12:16,560 INFO L290 TraceCheckUtils]: 37: Hoare triple {63200#false} ~cond := #in~cond; {63200#false} is VALID [2022-04-28 10:12:16,560 INFO L290 TraceCheckUtils]: 38: Hoare triple {63200#false} assume 0 == ~cond; {63200#false} is VALID [2022-04-28 10:12:16,560 INFO L290 TraceCheckUtils]: 39: Hoare triple {63200#false} assume !false; {63200#false} is VALID [2022-04-28 10:12:16,560 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-04-28 10:12:16,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:12:16,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062231752] [2022-04-28 10:12:16,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062231752] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:12:16,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [573502379] [2022-04-28 10:12:16,561 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:12:16,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:12:16,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:12:16,562 INFO L229 MonitoredProcess]: Starting monitored process 80 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:12:16,562 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (80)] Waiting until timeout for monitored process [2022-04-28 10:12:16,687 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-04-28 10:12:16,687 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:12:16,688 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 56 conjunts are in the unsatisfiable core [2022-04-28 10:12:16,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:12:16,698 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:12:17,075 INFO L272 TraceCheckUtils]: 0: Hoare triple {63199#true} call ULTIMATE.init(); {63199#true} is VALID [2022-04-28 10:12:17,075 INFO L290 TraceCheckUtils]: 1: Hoare triple {63199#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(10, 2);call #Ultimate.allocInit(12, 3); {63199#true} is VALID [2022-04-28 10:12:17,075 INFO L290 TraceCheckUtils]: 2: Hoare triple {63199#true} assume true; {63199#true} is VALID [2022-04-28 10:12:17,075 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {63199#true} {63199#true} #61#return; {63199#true} is VALID [2022-04-28 10:12:17,075 INFO L272 TraceCheckUtils]: 4: Hoare triple {63199#true} call #t~ret11 := main(); {63199#true} is VALID [2022-04-28 10:12:17,075 INFO L290 TraceCheckUtils]: 5: Hoare triple {63199#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {63204#(= main_~y~0 0)} is VALID [2022-04-28 10:12:17,076 INFO L290 TraceCheckUtils]: 6: Hoare triple {63204#(= 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; {63205#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:12:17,076 INFO L290 TraceCheckUtils]: 7: Hoare triple {63205#(and (<= 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; {63206#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:12:17,077 INFO L290 TraceCheckUtils]: 8: Hoare triple {63206#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {63207#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:12:17,077 INFO L290 TraceCheckUtils]: 9: Hoare triple {63207#(and (<= main_~y~0 3) (<= 3 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; {63208#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:12:17,078 INFO L290 TraceCheckUtils]: 10: Hoare triple {63208#(and (<= main_~y~0 4) (<= 4 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; {63209#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:12:17,078 INFO L290 TraceCheckUtils]: 11: Hoare triple {63209#(and (<= 5 main_~y~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; {63210#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:12:17,079 INFO L290 TraceCheckUtils]: 12: Hoare triple {63210#(and (<= main_~y~0 6) (<= 6 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; {63211#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:12:17,079 INFO L290 TraceCheckUtils]: 13: Hoare triple {63211#(and (<= 7 main_~y~0) (<= main_~y~0 7))} 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; {63212#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:12:17,080 INFO L290 TraceCheckUtils]: 14: Hoare triple {63212#(and (<= main_~y~0 8) (<= 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; {63213#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:12:17,080 INFO L290 TraceCheckUtils]: 15: Hoare triple {63213#(and (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {63213#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:12:17,080 INFO L290 TraceCheckUtils]: 16: Hoare triple {63213#(and (<= 9 main_~y~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {63275#(and (= main_~z~0 main_~y~0) (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:12:17,081 INFO L290 TraceCheckUtils]: 17: Hoare triple {63275#(and (= main_~z~0 main_~y~0) (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {63279#(and (<= 9 main_~y~0) (<= main_~y~0 9) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-28 10:12:17,081 INFO L290 TraceCheckUtils]: 18: Hoare triple {63279#(and (<= 9 main_~y~0) (<= main_~y~0 9) (= main_~y~0 (+ main_~z~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {63283#(and (= (+ main_~z~0 1) (+ (- 1) main_~y~0)) (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:12:17,082 INFO L290 TraceCheckUtils]: 19: Hoare triple {63283#(and (= (+ main_~z~0 1) (+ (- 1) main_~y~0)) (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {63287#(and (= (+ main_~z~0 2) (+ (- 1) main_~y~0)) (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:12:17,082 INFO L290 TraceCheckUtils]: 20: Hoare triple {63287#(and (= (+ main_~z~0 2) (+ (- 1) main_~y~0)) (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {63291#(and (= (+ main_~z~0 3) (+ (- 1) main_~y~0)) (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:12:17,083 INFO L290 TraceCheckUtils]: 21: Hoare triple {63291#(and (= (+ main_~z~0 3) (+ (- 1) main_~y~0)) (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {63295#(and (= (+ (- 1) main_~y~0) (+ main_~z~0 4)) (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:12:17,084 INFO L290 TraceCheckUtils]: 22: Hoare triple {63295#(and (= (+ (- 1) main_~y~0) (+ main_~z~0 4)) (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {63299#(and (= (+ main_~y~0 (- 5)) (+ main_~z~0 1)) (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:12:17,084 INFO L290 TraceCheckUtils]: 23: Hoare triple {63299#(and (= (+ main_~y~0 (- 5)) (+ main_~z~0 1)) (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {63303#(and (= (+ main_~y~0 (- 6)) (+ main_~z~0 1)) (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:12:17,085 INFO L290 TraceCheckUtils]: 24: Hoare triple {63303#(and (= (+ main_~y~0 (- 6)) (+ main_~z~0 1)) (<= 9 main_~y~0) (<= main_~y~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {63307#(and (= (+ main_~z~0 1) (+ main_~y~0 (- 7))) (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:12:17,085 INFO L290 TraceCheckUtils]: 25: Hoare triple {63307#(and (= (+ main_~z~0 1) (+ main_~y~0 (- 7))) (<= 9 main_~y~0) (<= main_~y~0 9))} assume !(~z~0 % 4294967296 > 0); {63200#false} is VALID [2022-04-28 10:12:17,085 INFO L290 TraceCheckUtils]: 26: Hoare triple {63200#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {63200#false} is VALID [2022-04-28 10:12:17,085 INFO L290 TraceCheckUtils]: 27: Hoare triple {63200#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {63200#false} is VALID [2022-04-28 10:12:17,085 INFO L290 TraceCheckUtils]: 28: Hoare triple {63200#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {63200#false} is VALID [2022-04-28 10:12:17,085 INFO L290 TraceCheckUtils]: 29: Hoare triple {63200#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {63200#false} is VALID [2022-04-28 10:12:17,085 INFO L290 TraceCheckUtils]: 30: Hoare triple {63200#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {63200#false} is VALID [2022-04-28 10:12:17,085 INFO L290 TraceCheckUtils]: 31: Hoare triple {63200#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {63200#false} is VALID [2022-04-28 10:12:17,086 INFO L290 TraceCheckUtils]: 32: Hoare triple {63200#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {63200#false} is VALID [2022-04-28 10:12:17,086 INFO L290 TraceCheckUtils]: 33: Hoare triple {63200#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {63200#false} is VALID [2022-04-28 10:12:17,086 INFO L290 TraceCheckUtils]: 34: Hoare triple {63200#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {63200#false} is VALID [2022-04-28 10:12:17,086 INFO L290 TraceCheckUtils]: 35: Hoare triple {63200#false} assume !(~y~0 % 4294967296 > 0); {63200#false} is VALID [2022-04-28 10:12:17,086 INFO L272 TraceCheckUtils]: 36: Hoare triple {63200#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {63200#false} is VALID [2022-04-28 10:12:17,086 INFO L290 TraceCheckUtils]: 37: Hoare triple {63200#false} ~cond := #in~cond; {63200#false} is VALID [2022-04-28 10:12:17,086 INFO L290 TraceCheckUtils]: 38: Hoare triple {63200#false} assume 0 == ~cond; {63200#false} is VALID [2022-04-28 10:12:17,086 INFO L290 TraceCheckUtils]: 39: Hoare triple {63200#false} assume !false; {63200#false} is VALID [2022-04-28 10:12:17,086 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-04-28 10:12:17,086 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:12:17,739 INFO L290 TraceCheckUtils]: 39: Hoare triple {63200#false} assume !false; {63200#false} is VALID [2022-04-28 10:12:17,739 INFO L290 TraceCheckUtils]: 38: Hoare triple {63200#false} assume 0 == ~cond; {63200#false} is VALID [2022-04-28 10:12:17,739 INFO L290 TraceCheckUtils]: 37: Hoare triple {63200#false} ~cond := #in~cond; {63200#false} is VALID [2022-04-28 10:12:17,739 INFO L272 TraceCheckUtils]: 36: Hoare triple {63200#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {63200#false} is VALID [2022-04-28 10:12:17,739 INFO L290 TraceCheckUtils]: 35: Hoare triple {63200#false} assume !(~y~0 % 4294967296 > 0); {63200#false} is VALID [2022-04-28 10:12:17,739 INFO L290 TraceCheckUtils]: 34: Hoare triple {63368#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {63200#false} is VALID [2022-04-28 10:12:17,740 INFO L290 TraceCheckUtils]: 33: Hoare triple {63372#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {63368#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:12:17,741 INFO L290 TraceCheckUtils]: 32: Hoare triple {63376#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {63372#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:12:17,741 INFO L290 TraceCheckUtils]: 31: Hoare triple {63380#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {63376#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-28 10:12:17,742 INFO L290 TraceCheckUtils]: 30: Hoare triple {63384#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {63380#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-28 10:12:17,743 INFO L290 TraceCheckUtils]: 29: Hoare triple {63388#(not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {63384#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:12:17,743 INFO L290 TraceCheckUtils]: 28: Hoare triple {63392#(not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {63388#(not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:12:17,745 INFO L290 TraceCheckUtils]: 27: Hoare triple {63396#(not (< 0 (mod (+ main_~y~0 4294967289) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {63392#(not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:12:17,745 INFO L290 TraceCheckUtils]: 26: Hoare triple {63400#(not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {63396#(not (< 0 (mod (+ main_~y~0 4294967289) 4294967296)))} is VALID [2022-04-28 10:12:17,746 INFO L290 TraceCheckUtils]: 25: Hoare triple {63404#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod main_~z~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {63400#(not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:12:17,747 INFO L290 TraceCheckUtils]: 24: Hoare triple {63408#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {63404#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-28 10:12:17,747 INFO L290 TraceCheckUtils]: 23: Hoare triple {63412#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {63408#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:12:17,748 INFO L290 TraceCheckUtils]: 22: Hoare triple {63416#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {63412#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))))} is VALID [2022-04-28 10:12:17,749 INFO L290 TraceCheckUtils]: 21: Hoare triple {63420#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {63416#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} is VALID [2022-04-28 10:12:17,750 INFO L290 TraceCheckUtils]: 20: Hoare triple {63424#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {63420#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)))} is VALID [2022-04-28 10:12:17,751 INFO L290 TraceCheckUtils]: 19: Hoare triple {63428#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod (+ 4294967290 main_~z~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {63424#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)))} is VALID [2022-04-28 10:12:17,751 INFO L290 TraceCheckUtils]: 18: Hoare triple {63432#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod (+ main_~z~0 4294967289) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {63428#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod (+ 4294967290 main_~z~0) 4294967296)))} is VALID [2022-04-28 10:12:17,752 INFO L290 TraceCheckUtils]: 17: Hoare triple {63436#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod (+ 4294967288 main_~z~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {63432#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod (+ main_~z~0 4294967289) 4294967296)))} is VALID [2022-04-28 10:12:17,752 INFO L290 TraceCheckUtils]: 16: Hoare triple {63199#true} ~z~0 := ~y~0; {63436#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod (+ 4294967288 main_~z~0) 4294967296)))} is VALID [2022-04-28 10:12:17,752 INFO L290 TraceCheckUtils]: 15: Hoare triple {63199#true} assume !(~x~0 % 4294967296 > 0); {63199#true} is VALID [2022-04-28 10:12:17,753 INFO L290 TraceCheckUtils]: 14: Hoare triple {63199#true} 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; {63199#true} is VALID [2022-04-28 10:12:17,753 INFO L290 TraceCheckUtils]: 13: Hoare triple {63199#true} 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; {63199#true} is VALID [2022-04-28 10:12:17,753 INFO L290 TraceCheckUtils]: 12: Hoare triple {63199#true} 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; {63199#true} is VALID [2022-04-28 10:12:17,753 INFO L290 TraceCheckUtils]: 11: Hoare triple {63199#true} 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; {63199#true} is VALID [2022-04-28 10:12:17,753 INFO L290 TraceCheckUtils]: 10: Hoare triple {63199#true} 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; {63199#true} is VALID [2022-04-28 10:12:17,753 INFO L290 TraceCheckUtils]: 9: Hoare triple {63199#true} 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; {63199#true} is VALID [2022-04-28 10:12:17,753 INFO L290 TraceCheckUtils]: 8: Hoare triple {63199#true} 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; {63199#true} is VALID [2022-04-28 10:12:17,753 INFO L290 TraceCheckUtils]: 7: Hoare triple {63199#true} 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; {63199#true} is VALID [2022-04-28 10:12:17,753 INFO L290 TraceCheckUtils]: 6: Hoare triple {63199#true} 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; {63199#true} is VALID [2022-04-28 10:12:17,753 INFO L290 TraceCheckUtils]: 5: Hoare triple {63199#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {63199#true} is VALID [2022-04-28 10:12:17,753 INFO L272 TraceCheckUtils]: 4: Hoare triple {63199#true} call #t~ret11 := main(); {63199#true} is VALID [2022-04-28 10:12:17,753 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {63199#true} {63199#true} #61#return; {63199#true} is VALID [2022-04-28 10:12:17,753 INFO L290 TraceCheckUtils]: 2: Hoare triple {63199#true} assume true; {63199#true} is VALID [2022-04-28 10:12:17,753 INFO L290 TraceCheckUtils]: 1: Hoare triple {63199#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(10, 2);call #Ultimate.allocInit(12, 3); {63199#true} is VALID [2022-04-28 10:12:17,753 INFO L272 TraceCheckUtils]: 0: Hoare triple {63199#true} call ULTIMATE.init(); {63199#true} is VALID [2022-04-28 10:12:17,753 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 9 proven. 72 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-04-28 10:12:17,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [573502379] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:12:17,754 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:12:17,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 20] total 49 [2022-04-28 10:12:17,754 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:12:17,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1048744877] [2022-04-28 10:12:17,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1048744877] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:12:17,754 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:12:17,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-28 10:12:17,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234002830] [2022-04-28 10:12:17,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:12:17,754 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 states have internal predecessors, (28), 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 40 [2022-04-28 10:12:17,754 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:12:17,754 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 states have internal predecessors, (28), 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-28 10:12:17,774 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:12:17,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-28 10:12:17,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:12:17,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-28 10:12:17,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=295, Invalid=2057, Unknown=0, NotChecked=0, Total=2352 [2022-04-28 10:12:17,774 INFO L87 Difference]: Start difference. First operand 134 states and 170 transitions. Second operand has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 states have internal predecessors, (28), 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-28 10:12:19,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:12:19,297 INFO L93 Difference]: Finished difference Result 161 states and 197 transitions. [2022-04-28 10:12:19,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-28 10:12:19,297 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 states have internal predecessors, (28), 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 40 [2022-04-28 10:12:19,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:12:19,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 states have internal predecessors, (28), 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-28 10:12:19,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 58 transitions. [2022-04-28 10:12:19,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 states have internal predecessors, (28), 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-28 10:12:19,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 58 transitions. [2022-04-28 10:12:19,298 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 58 transitions. [2022-04-28 10:12:19,355 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:12:19,356 INFO L225 Difference]: With dead ends: 161 [2022-04-28 10:12:19,356 INFO L226 Difference]: Without dead ends: 146 [2022-04-28 10:12:19,356 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 758 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=497, Invalid=4059, Unknown=0, NotChecked=0, Total=4556 [2022-04-28 10:12:19,357 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 17 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 655 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 655 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 10:12:19,357 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 98 Invalid, 695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 655 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 10:12:19,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-04-28 10:12:19,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 135. [2022-04-28 10:12:19,510 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:12:19,510 INFO L82 GeneralOperation]: Start isEquivalent. First operand 146 states. Second operand has 135 states, 130 states have (on average 1.2846153846153847) internal successors, (167), 130 states have internal predecessors, (167), 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-28 10:12:19,510 INFO L74 IsIncluded]: Start isIncluded. First operand 146 states. Second operand has 135 states, 130 states have (on average 1.2846153846153847) internal successors, (167), 130 states have internal predecessors, (167), 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-28 10:12:19,511 INFO L87 Difference]: Start difference. First operand 146 states. Second operand has 135 states, 130 states have (on average 1.2846153846153847) internal successors, (167), 130 states have internal predecessors, (167), 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-28 10:12:19,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:12:19,512 INFO L93 Difference]: Finished difference Result 146 states and 182 transitions. [2022-04-28 10:12:19,512 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 182 transitions. [2022-04-28 10:12:19,512 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:12:19,512 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:12:19,512 INFO L74 IsIncluded]: Start isIncluded. First operand has 135 states, 130 states have (on average 1.2846153846153847) internal successors, (167), 130 states have internal predecessors, (167), 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 146 states. [2022-04-28 10:12:19,512 INFO L87 Difference]: Start difference. First operand has 135 states, 130 states have (on average 1.2846153846153847) internal successors, (167), 130 states have internal predecessors, (167), 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 146 states. [2022-04-28 10:12:19,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:12:19,513 INFO L93 Difference]: Finished difference Result 146 states and 182 transitions. [2022-04-28 10:12:19,513 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 182 transitions. [2022-04-28 10:12:19,513 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:12:19,513 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:12:19,513 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:12:19,513 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:12:19,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 130 states have (on average 1.2846153846153847) internal successors, (167), 130 states have internal predecessors, (167), 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-28 10:12:19,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 171 transitions. [2022-04-28 10:12:19,515 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 171 transitions. Word has length 40 [2022-04-28 10:12:19,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:12:19,515 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 171 transitions. [2022-04-28 10:12:19,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 states have internal predecessors, (28), 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-28 10:12:19,515 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 135 states and 171 transitions. [2022-04-28 10:12:21,766 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 171 edges. 171 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:12:21,767 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 171 transitions. [2022-04-28 10:12:21,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-28 10:12:21,767 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:12:21,767 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:12:21,771 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (80)] Forceful destruction successful, exit code 0 [2022-04-28 10:12:21,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 80 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable79 [2022-04-28 10:12:21,968 INFO L420 AbstractCegarLoop]: === Iteration 81 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:12:21,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:12:21,968 INFO L85 PathProgramCache]: Analyzing trace with hash -44794227, now seen corresponding path program 109 times [2022-04-28 10:12:21,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:12:21,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [541789695] [2022-04-28 10:12:21,970 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:12:21,970 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:12:21,970 INFO L85 PathProgramCache]: Analyzing trace with hash -44794227, now seen corresponding path program 110 times [2022-04-28 10:12:21,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:12:21,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480645247] [2022-04-28 10:12:21,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:12:21,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:12:21,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:12:22,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:12:22,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:12:22,235 INFO L290 TraceCheckUtils]: 0: Hoare triple {64435#(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(10, 2);call #Ultimate.allocInit(12, 3); {64412#true} is VALID [2022-04-28 10:12:22,235 INFO L290 TraceCheckUtils]: 1: Hoare triple {64412#true} assume true; {64412#true} is VALID [2022-04-28 10:12:22,235 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {64412#true} {64412#true} #61#return; {64412#true} is VALID [2022-04-28 10:12:22,235 INFO L272 TraceCheckUtils]: 0: Hoare triple {64412#true} call ULTIMATE.init(); {64435#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:12:22,235 INFO L290 TraceCheckUtils]: 1: Hoare triple {64435#(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(10, 2);call #Ultimate.allocInit(12, 3); {64412#true} is VALID [2022-04-28 10:12:22,235 INFO L290 TraceCheckUtils]: 2: Hoare triple {64412#true} assume true; {64412#true} is VALID [2022-04-28 10:12:22,235 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {64412#true} {64412#true} #61#return; {64412#true} is VALID [2022-04-28 10:12:22,235 INFO L272 TraceCheckUtils]: 4: Hoare triple {64412#true} call #t~ret11 := main(); {64412#true} is VALID [2022-04-28 10:12:22,236 INFO L290 TraceCheckUtils]: 5: Hoare triple {64412#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {64417#(= main_~y~0 0)} is VALID [2022-04-28 10:12:22,236 INFO L290 TraceCheckUtils]: 6: Hoare triple {64417#(= 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; {64418#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:12:22,237 INFO L290 TraceCheckUtils]: 7: Hoare triple {64418#(and (<= 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; {64419#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:12:22,237 INFO L290 TraceCheckUtils]: 8: Hoare triple {64419#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {64420#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:12:22,237 INFO L290 TraceCheckUtils]: 9: Hoare triple {64420#(and (<= main_~y~0 3) (<= 3 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; {64421#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:12:22,238 INFO L290 TraceCheckUtils]: 10: Hoare triple {64421#(and (<= main_~y~0 4) (<= 4 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; {64422#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:12:22,238 INFO L290 TraceCheckUtils]: 11: Hoare triple {64422#(and (<= 5 main_~y~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; {64423#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:12:22,239 INFO L290 TraceCheckUtils]: 12: Hoare triple {64423#(and (<= main_~y~0 6) (<= 6 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; {64424#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:12:22,239 INFO L290 TraceCheckUtils]: 13: Hoare triple {64424#(and (<= 7 main_~y~0) (<= main_~y~0 7))} 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; {64425#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:12:22,240 INFO L290 TraceCheckUtils]: 14: Hoare triple {64425#(and (<= main_~y~0 8) (<= 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; {64426#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:12:22,240 INFO L290 TraceCheckUtils]: 15: Hoare triple {64426#(and (<= 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; {64427#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:12:22,241 INFO L290 TraceCheckUtils]: 16: Hoare triple {64427#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {64427#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:12:22,241 INFO L290 TraceCheckUtils]: 17: Hoare triple {64427#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {64428#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:12:22,242 INFO L290 TraceCheckUtils]: 18: Hoare triple {64428#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {64429#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:12:22,242 INFO L290 TraceCheckUtils]: 19: Hoare triple {64429#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {64430#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:12:22,242 INFO L290 TraceCheckUtils]: 20: Hoare triple {64430#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {64431#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:12:22,243 INFO L290 TraceCheckUtils]: 21: Hoare triple {64431#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {64432#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:12:22,243 INFO L290 TraceCheckUtils]: 22: Hoare triple {64432#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {64433#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:12:22,244 INFO L290 TraceCheckUtils]: 23: Hoare triple {64433#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {64434#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:12:22,244 INFO L290 TraceCheckUtils]: 24: Hoare triple {64434#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {64413#false} is VALID [2022-04-28 10:12:22,244 INFO L290 TraceCheckUtils]: 25: Hoare triple {64413#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {64413#false} is VALID [2022-04-28 10:12:22,245 INFO L290 TraceCheckUtils]: 26: Hoare triple {64413#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {64413#false} is VALID [2022-04-28 10:12:22,245 INFO L290 TraceCheckUtils]: 27: Hoare triple {64413#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {64413#false} is VALID [2022-04-28 10:12:22,245 INFO L290 TraceCheckUtils]: 28: Hoare triple {64413#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {64413#false} is VALID [2022-04-28 10:12:22,245 INFO L290 TraceCheckUtils]: 29: Hoare triple {64413#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {64413#false} is VALID [2022-04-28 10:12:22,245 INFO L290 TraceCheckUtils]: 30: Hoare triple {64413#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {64413#false} is VALID [2022-04-28 10:12:22,245 INFO L290 TraceCheckUtils]: 31: Hoare triple {64413#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {64413#false} is VALID [2022-04-28 10:12:22,245 INFO L290 TraceCheckUtils]: 32: Hoare triple {64413#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {64413#false} is VALID [2022-04-28 10:12:22,245 INFO L290 TraceCheckUtils]: 33: Hoare triple {64413#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {64413#false} is VALID [2022-04-28 10:12:22,245 INFO L290 TraceCheckUtils]: 34: Hoare triple {64413#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {64413#false} is VALID [2022-04-28 10:12:22,245 INFO L290 TraceCheckUtils]: 35: Hoare triple {64413#false} assume !(~y~0 % 4294967296 > 0); {64413#false} is VALID [2022-04-28 10:12:22,245 INFO L272 TraceCheckUtils]: 36: Hoare triple {64413#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {64413#false} is VALID [2022-04-28 10:12:22,245 INFO L290 TraceCheckUtils]: 37: Hoare triple {64413#false} ~cond := #in~cond; {64413#false} is VALID [2022-04-28 10:12:22,245 INFO L290 TraceCheckUtils]: 38: Hoare triple {64413#false} assume 0 == ~cond; {64413#false} is VALID [2022-04-28 10:12:22,245 INFO L290 TraceCheckUtils]: 39: Hoare triple {64413#false} assume !false; {64413#false} is VALID [2022-04-28 10:12:22,245 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-04-28 10:12:22,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:12:22,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480645247] [2022-04-28 10:12:22,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480645247] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:12:22,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1779539875] [2022-04-28 10:12:22,246 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:12:22,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:12:22,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:12:22,246 INFO L229 MonitoredProcess]: Starting monitored process 81 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:12:22,247 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (81)] Waiting until timeout for monitored process [2022-04-28 10:12:22,289 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:12:22,289 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:12:22,289 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-28 10:12:22,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:12:22,298 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:12:22,565 INFO L272 TraceCheckUtils]: 0: Hoare triple {64412#true} call ULTIMATE.init(); {64412#true} is VALID [2022-04-28 10:12:22,565 INFO L290 TraceCheckUtils]: 1: Hoare triple {64412#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(10, 2);call #Ultimate.allocInit(12, 3); {64412#true} is VALID [2022-04-28 10:12:22,566 INFO L290 TraceCheckUtils]: 2: Hoare triple {64412#true} assume true; {64412#true} is VALID [2022-04-28 10:12:22,566 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {64412#true} {64412#true} #61#return; {64412#true} is VALID [2022-04-28 10:12:22,566 INFO L272 TraceCheckUtils]: 4: Hoare triple {64412#true} call #t~ret11 := main(); {64412#true} is VALID [2022-04-28 10:12:22,566 INFO L290 TraceCheckUtils]: 5: Hoare triple {64412#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {64417#(= main_~y~0 0)} is VALID [2022-04-28 10:12:22,566 INFO L290 TraceCheckUtils]: 6: Hoare triple {64417#(= 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; {64418#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:12:22,567 INFO L290 TraceCheckUtils]: 7: Hoare triple {64418#(and (<= 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; {64419#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:12:22,567 INFO L290 TraceCheckUtils]: 8: Hoare triple {64419#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {64420#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:12:22,568 INFO L290 TraceCheckUtils]: 9: Hoare triple {64420#(and (<= main_~y~0 3) (<= 3 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; {64421#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:12:22,568 INFO L290 TraceCheckUtils]: 10: Hoare triple {64421#(and (<= main_~y~0 4) (<= 4 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; {64422#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:12:22,569 INFO L290 TraceCheckUtils]: 11: Hoare triple {64422#(and (<= 5 main_~y~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; {64423#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:12:22,569 INFO L290 TraceCheckUtils]: 12: Hoare triple {64423#(and (<= main_~y~0 6) (<= 6 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; {64424#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:12:22,570 INFO L290 TraceCheckUtils]: 13: Hoare triple {64424#(and (<= 7 main_~y~0) (<= main_~y~0 7))} 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; {64425#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:12:22,570 INFO L290 TraceCheckUtils]: 14: Hoare triple {64425#(and (<= main_~y~0 8) (<= 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; {64426#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:12:22,571 INFO L290 TraceCheckUtils]: 15: Hoare triple {64426#(and (<= 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; {64427#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:12:22,571 INFO L290 TraceCheckUtils]: 16: Hoare triple {64427#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {64427#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:12:22,571 INFO L290 TraceCheckUtils]: 17: Hoare triple {64427#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {64428#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:12:22,572 INFO L290 TraceCheckUtils]: 18: Hoare triple {64428#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {64429#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:12:22,572 INFO L290 TraceCheckUtils]: 19: Hoare triple {64429#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {64430#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:12:22,573 INFO L290 TraceCheckUtils]: 20: Hoare triple {64430#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {64431#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:12:22,573 INFO L290 TraceCheckUtils]: 21: Hoare triple {64431#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {64432#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:12:22,574 INFO L290 TraceCheckUtils]: 22: Hoare triple {64432#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {64433#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:12:22,574 INFO L290 TraceCheckUtils]: 23: Hoare triple {64433#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {64508#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:12:22,575 INFO L290 TraceCheckUtils]: 24: Hoare triple {64508#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !(~z~0 % 4294967296 > 0); {64413#false} is VALID [2022-04-28 10:12:22,575 INFO L290 TraceCheckUtils]: 25: Hoare triple {64413#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {64413#false} is VALID [2022-04-28 10:12:22,575 INFO L290 TraceCheckUtils]: 26: Hoare triple {64413#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {64413#false} is VALID [2022-04-28 10:12:22,575 INFO L290 TraceCheckUtils]: 27: Hoare triple {64413#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {64413#false} is VALID [2022-04-28 10:12:22,575 INFO L290 TraceCheckUtils]: 28: Hoare triple {64413#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {64413#false} is VALID [2022-04-28 10:12:22,575 INFO L290 TraceCheckUtils]: 29: Hoare triple {64413#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {64413#false} is VALID [2022-04-28 10:12:22,575 INFO L290 TraceCheckUtils]: 30: Hoare triple {64413#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {64413#false} is VALID [2022-04-28 10:12:22,575 INFO L290 TraceCheckUtils]: 31: Hoare triple {64413#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {64413#false} is VALID [2022-04-28 10:12:22,575 INFO L290 TraceCheckUtils]: 32: Hoare triple {64413#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {64413#false} is VALID [2022-04-28 10:12:22,575 INFO L290 TraceCheckUtils]: 33: Hoare triple {64413#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {64413#false} is VALID [2022-04-28 10:12:22,575 INFO L290 TraceCheckUtils]: 34: Hoare triple {64413#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {64413#false} is VALID [2022-04-28 10:12:22,575 INFO L290 TraceCheckUtils]: 35: Hoare triple {64413#false} assume !(~y~0 % 4294967296 > 0); {64413#false} is VALID [2022-04-28 10:12:22,575 INFO L272 TraceCheckUtils]: 36: Hoare triple {64413#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {64413#false} is VALID [2022-04-28 10:12:22,575 INFO L290 TraceCheckUtils]: 37: Hoare triple {64413#false} ~cond := #in~cond; {64413#false} is VALID [2022-04-28 10:12:22,575 INFO L290 TraceCheckUtils]: 38: Hoare triple {64413#false} assume 0 == ~cond; {64413#false} is VALID [2022-04-28 10:12:22,575 INFO L290 TraceCheckUtils]: 39: Hoare triple {64413#false} assume !false; {64413#false} is VALID [2022-04-28 10:12:22,576 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-04-28 10:12:22,576 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:12:23,096 INFO L290 TraceCheckUtils]: 39: Hoare triple {64413#false} assume !false; {64413#false} is VALID [2022-04-28 10:12:23,096 INFO L290 TraceCheckUtils]: 38: Hoare triple {64413#false} assume 0 == ~cond; {64413#false} is VALID [2022-04-28 10:12:23,096 INFO L290 TraceCheckUtils]: 37: Hoare triple {64413#false} ~cond := #in~cond; {64413#false} is VALID [2022-04-28 10:12:23,096 INFO L272 TraceCheckUtils]: 36: Hoare triple {64413#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {64413#false} is VALID [2022-04-28 10:12:23,096 INFO L290 TraceCheckUtils]: 35: Hoare triple {64413#false} assume !(~y~0 % 4294967296 > 0); {64413#false} is VALID [2022-04-28 10:12:23,096 INFO L290 TraceCheckUtils]: 34: Hoare triple {64413#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {64413#false} is VALID [2022-04-28 10:12:23,096 INFO L290 TraceCheckUtils]: 33: Hoare triple {64413#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {64413#false} is VALID [2022-04-28 10:12:23,096 INFO L290 TraceCheckUtils]: 32: Hoare triple {64413#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {64413#false} is VALID [2022-04-28 10:12:23,096 INFO L290 TraceCheckUtils]: 31: Hoare triple {64413#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {64413#false} is VALID [2022-04-28 10:12:23,096 INFO L290 TraceCheckUtils]: 30: Hoare triple {64413#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {64413#false} is VALID [2022-04-28 10:12:23,096 INFO L290 TraceCheckUtils]: 29: Hoare triple {64413#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {64413#false} is VALID [2022-04-28 10:12:23,096 INFO L290 TraceCheckUtils]: 28: Hoare triple {64413#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {64413#false} is VALID [2022-04-28 10:12:23,096 INFO L290 TraceCheckUtils]: 27: Hoare triple {64413#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {64413#false} is VALID [2022-04-28 10:12:23,096 INFO L290 TraceCheckUtils]: 26: Hoare triple {64413#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {64413#false} is VALID [2022-04-28 10:12:23,096 INFO L290 TraceCheckUtils]: 25: Hoare triple {64413#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {64413#false} is VALID [2022-04-28 10:12:23,097 INFO L290 TraceCheckUtils]: 24: Hoare triple {64602#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {64413#false} is VALID [2022-04-28 10:12:23,098 INFO L290 TraceCheckUtils]: 23: Hoare triple {64606#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {64602#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:12:23,098 INFO L290 TraceCheckUtils]: 22: Hoare triple {64610#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {64606#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:12:23,099 INFO L290 TraceCheckUtils]: 21: Hoare triple {64614#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {64610#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-28 10:12:23,100 INFO L290 TraceCheckUtils]: 20: Hoare triple {64618#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {64614#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-28 10:12:23,100 INFO L290 TraceCheckUtils]: 19: Hoare triple {64622#(< 0 (mod (+ 4294967291 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {64618#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID [2022-04-28 10:12:23,101 INFO L290 TraceCheckUtils]: 18: Hoare triple {64626#(< 0 (mod (+ 4294967290 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {64622#(< 0 (mod (+ 4294967291 main_~z~0) 4294967296))} is VALID [2022-04-28 10:12:23,101 INFO L290 TraceCheckUtils]: 17: Hoare triple {64630#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} ~z~0 := ~y~0; {64626#(< 0 (mod (+ 4294967290 main_~z~0) 4294967296))} is VALID [2022-04-28 10:12:23,102 INFO L290 TraceCheckUtils]: 16: Hoare triple {64630#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {64630#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-28 10:12:23,102 INFO L290 TraceCheckUtils]: 15: Hoare triple {64637#(< 0 (mod (+ 4294967291 main_~y~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; {64630#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-28 10:12:23,103 INFO L290 TraceCheckUtils]: 14: Hoare triple {64641#(< 0 (mod (+ 4294967292 main_~y~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; {64637#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-28 10:12:23,103 INFO L290 TraceCheckUtils]: 13: Hoare triple {64645#(< 0 (mod (+ main_~y~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; {64641#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-28 10:12:23,104 INFO L290 TraceCheckUtils]: 12: Hoare triple {64649#(< 0 (mod (+ main_~y~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; {64645#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 10:12:23,105 INFO L290 TraceCheckUtils]: 11: Hoare triple {64653#(< 0 (mod (+ main_~y~0 4294967295) 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; {64649#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:12:23,105 INFO L290 TraceCheckUtils]: 10: Hoare triple {64657#(< 0 (mod main_~y~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; {64653#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:12:23,106 INFO L290 TraceCheckUtils]: 9: Hoare triple {64661#(< 0 (mod (+ main_~y~0 1) 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; {64657#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:12:23,107 INFO L290 TraceCheckUtils]: 8: Hoare triple {64665#(< 0 (mod (+ main_~y~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; {64661#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:12:23,107 INFO L290 TraceCheckUtils]: 7: Hoare triple {64669#(< 0 (mod (+ main_~y~0 3) 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; {64665#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:12:23,108 INFO L290 TraceCheckUtils]: 6: Hoare triple {64673#(< 0 (mod (+ main_~y~0 4) 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; {64669#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:12:23,108 INFO L290 TraceCheckUtils]: 5: Hoare triple {64412#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {64673#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:12:23,108 INFO L272 TraceCheckUtils]: 4: Hoare triple {64412#true} call #t~ret11 := main(); {64412#true} is VALID [2022-04-28 10:12:23,108 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {64412#true} {64412#true} #61#return; {64412#true} is VALID [2022-04-28 10:12:23,108 INFO L290 TraceCheckUtils]: 2: Hoare triple {64412#true} assume true; {64412#true} is VALID [2022-04-28 10:12:23,108 INFO L290 TraceCheckUtils]: 1: Hoare triple {64412#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(10, 2);call #Ultimate.allocInit(12, 3); {64412#true} is VALID [2022-04-28 10:12:23,108 INFO L272 TraceCheckUtils]: 0: Hoare triple {64412#true} call ULTIMATE.init(); {64412#true} is VALID [2022-04-28 10:12:23,109 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-04-28 10:12:23,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1779539875] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:12:23,109 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:12:23,109 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 40 [2022-04-28 10:12:23,109 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:12:23,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [541789695] [2022-04-28 10:12:23,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [541789695] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:12:23,109 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:12:23,109 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-28 10:12:23,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75902062] [2022-04-28 10:12:23,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:12:23,109 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 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 40 [2022-04-28 10:12:23,109 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:12:23,109 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 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-28 10:12:23,129 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:12:23,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-28 10:12:23,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:12:23,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-28 10:12:23,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=248, Invalid=1312, Unknown=0, NotChecked=0, Total=1560 [2022-04-28 10:12:23,130 INFO L87 Difference]: Start difference. First operand 135 states and 171 transitions. Second operand has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 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-28 10:12:24,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:12:24,822 INFO L93 Difference]: Finished difference Result 164 states and 200 transitions. [2022-04-28 10:12:24,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-28 10:12:24,822 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 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 40 [2022-04-28 10:12:24,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:12:24,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 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-28 10:12:24,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 68 transitions. [2022-04-28 10:12:24,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 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-28 10:12:24,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 68 transitions. [2022-04-28 10:12:24,823 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 68 transitions. [2022-04-28 10:12:24,874 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:12:24,875 INFO L225 Difference]: With dead ends: 164 [2022-04-28 10:12:24,875 INFO L226 Difference]: Without dead ends: 148 [2022-04-28 10:12:24,875 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 424 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=730, Invalid=3302, Unknown=0, NotChecked=0, Total=4032 [2022-04-28 10:12:24,875 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 23 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 771 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 771 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-28 10:12:24,876 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 100 Invalid, 823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 771 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-28 10:12:24,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2022-04-28 10:12:25,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 136. [2022-04-28 10:12:25,019 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:12:25,020 INFO L82 GeneralOperation]: Start isEquivalent. First operand 148 states. Second operand has 136 states, 131 states have (on average 1.282442748091603) internal successors, (168), 131 states have internal predecessors, (168), 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-28 10:12:25,020 INFO L74 IsIncluded]: Start isIncluded. First operand 148 states. Second operand has 136 states, 131 states have (on average 1.282442748091603) internal successors, (168), 131 states have internal predecessors, (168), 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-28 10:12:25,020 INFO L87 Difference]: Start difference. First operand 148 states. Second operand has 136 states, 131 states have (on average 1.282442748091603) internal successors, (168), 131 states have internal predecessors, (168), 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-28 10:12:25,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:12:25,021 INFO L93 Difference]: Finished difference Result 148 states and 184 transitions. [2022-04-28 10:12:25,021 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 184 transitions. [2022-04-28 10:12:25,021 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:12:25,021 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:12:25,021 INFO L74 IsIncluded]: Start isIncluded. First operand has 136 states, 131 states have (on average 1.282442748091603) internal successors, (168), 131 states have internal predecessors, (168), 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 148 states. [2022-04-28 10:12:25,021 INFO L87 Difference]: Start difference. First operand has 136 states, 131 states have (on average 1.282442748091603) internal successors, (168), 131 states have internal predecessors, (168), 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 148 states. [2022-04-28 10:12:25,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:12:25,023 INFO L93 Difference]: Finished difference Result 148 states and 184 transitions. [2022-04-28 10:12:25,023 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 184 transitions. [2022-04-28 10:12:25,023 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:12:25,023 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:12:25,023 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:12:25,023 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:12:25,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 131 states have (on average 1.282442748091603) internal successors, (168), 131 states have internal predecessors, (168), 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-28 10:12:25,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 172 transitions. [2022-04-28 10:12:25,024 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 172 transitions. Word has length 40 [2022-04-28 10:12:25,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:12:25,024 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 172 transitions. [2022-04-28 10:12:25,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 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-28 10:12:25,024 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 136 states and 172 transitions. [2022-04-28 10:12:29,091 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 172 edges. 172 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:12:29,092 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 172 transitions. [2022-04-28 10:12:29,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-28 10:12:29,092 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:12:29,092 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:12:29,108 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (81)] Forceful destruction successful, exit code 0 [2022-04-28 10:12:29,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80,81 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:12:29,292 INFO L420 AbstractCegarLoop]: === Iteration 82 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:12:29,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:12:29,293 INFO L85 PathProgramCache]: Analyzing trace with hash 1351548287, now seen corresponding path program 111 times [2022-04-28 10:12:29,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:12:29,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2057889895] [2022-04-28 10:12:29,302 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:12:29,302 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:12:29,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1351548287, now seen corresponding path program 112 times [2022-04-28 10:12:29,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:12:29,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946762471] [2022-04-28 10:12:29,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:12:29,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:12:29,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:12:29,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:12:29,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:12:29,547 INFO L290 TraceCheckUtils]: 0: Hoare triple {65660#(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(10, 2);call #Ultimate.allocInit(12, 3); {65638#true} is VALID [2022-04-28 10:12:29,547 INFO L290 TraceCheckUtils]: 1: Hoare triple {65638#true} assume true; {65638#true} is VALID [2022-04-28 10:12:29,547 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {65638#true} {65638#true} #61#return; {65638#true} is VALID [2022-04-28 10:12:29,548 INFO L272 TraceCheckUtils]: 0: Hoare triple {65638#true} call ULTIMATE.init(); {65660#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:12:29,548 INFO L290 TraceCheckUtils]: 1: Hoare triple {65660#(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(10, 2);call #Ultimate.allocInit(12, 3); {65638#true} is VALID [2022-04-28 10:12:29,548 INFO L290 TraceCheckUtils]: 2: Hoare triple {65638#true} assume true; {65638#true} is VALID [2022-04-28 10:12:29,548 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {65638#true} {65638#true} #61#return; {65638#true} is VALID [2022-04-28 10:12:29,548 INFO L272 TraceCheckUtils]: 4: Hoare triple {65638#true} call #t~ret11 := main(); {65638#true} is VALID [2022-04-28 10:12:29,548 INFO L290 TraceCheckUtils]: 5: Hoare triple {65638#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {65643#(= main_~y~0 0)} is VALID [2022-04-28 10:12:29,549 INFO L290 TraceCheckUtils]: 6: Hoare triple {65643#(= 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; {65644#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:12:29,549 INFO L290 TraceCheckUtils]: 7: Hoare triple {65644#(and (<= 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; {65645#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:12:29,550 INFO L290 TraceCheckUtils]: 8: Hoare triple {65645#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {65646#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:12:29,550 INFO L290 TraceCheckUtils]: 9: Hoare triple {65646#(and (<= main_~y~0 3) (<= 3 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; {65647#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:12:29,551 INFO L290 TraceCheckUtils]: 10: Hoare triple {65647#(and (<= main_~y~0 4) (<= 4 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; {65648#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:12:29,551 INFO L290 TraceCheckUtils]: 11: Hoare triple {65648#(and (<= 5 main_~y~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; {65649#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:12:29,552 INFO L290 TraceCheckUtils]: 12: Hoare triple {65649#(and (<= main_~y~0 6) (<= 6 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; {65650#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:12:29,552 INFO L290 TraceCheckUtils]: 13: Hoare triple {65650#(and (<= 7 main_~y~0) (<= main_~y~0 7))} 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; {65651#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:12:29,553 INFO L290 TraceCheckUtils]: 14: Hoare triple {65651#(and (<= main_~y~0 8) (<= 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; {65652#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:12:29,553 INFO L290 TraceCheckUtils]: 15: Hoare triple {65652#(and (<= 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; {65653#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:12:29,554 INFO L290 TraceCheckUtils]: 16: Hoare triple {65653#(and (<= main_~y~0 10) (<= 10 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; {65654#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:12:29,554 INFO L290 TraceCheckUtils]: 17: Hoare triple {65654#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {65654#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:12:29,554 INFO L290 TraceCheckUtils]: 18: Hoare triple {65654#(and (<= main_~y~0 11) (<= 11 main_~y~0))} ~z~0 := ~y~0; {65655#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-28 10:12:29,555 INFO L290 TraceCheckUtils]: 19: Hoare triple {65655#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {65656#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:12:29,555 INFO L290 TraceCheckUtils]: 20: Hoare triple {65656#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {65657#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:12:29,556 INFO L290 TraceCheckUtils]: 21: Hoare triple {65657#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {65658#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:12:29,556 INFO L290 TraceCheckUtils]: 22: Hoare triple {65658#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {65659#(and (<= 7 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:12:29,557 INFO L290 TraceCheckUtils]: 23: Hoare triple {65659#(and (<= 7 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {65639#false} is VALID [2022-04-28 10:12:29,557 INFO L290 TraceCheckUtils]: 24: Hoare triple {65639#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {65639#false} is VALID [2022-04-28 10:12:29,557 INFO L290 TraceCheckUtils]: 25: Hoare triple {65639#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {65639#false} is VALID [2022-04-28 10:12:29,557 INFO L290 TraceCheckUtils]: 26: Hoare triple {65639#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {65639#false} is VALID [2022-04-28 10:12:29,557 INFO L290 TraceCheckUtils]: 27: Hoare triple {65639#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {65639#false} is VALID [2022-04-28 10:12:29,557 INFO L290 TraceCheckUtils]: 28: Hoare triple {65639#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {65639#false} is VALID [2022-04-28 10:12:29,557 INFO L290 TraceCheckUtils]: 29: Hoare triple {65639#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {65639#false} is VALID [2022-04-28 10:12:29,557 INFO L290 TraceCheckUtils]: 30: Hoare triple {65639#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {65639#false} is VALID [2022-04-28 10:12:29,557 INFO L290 TraceCheckUtils]: 31: Hoare triple {65639#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {65639#false} is VALID [2022-04-28 10:12:29,557 INFO L290 TraceCheckUtils]: 32: Hoare triple {65639#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {65639#false} is VALID [2022-04-28 10:12:29,557 INFO L290 TraceCheckUtils]: 33: Hoare triple {65639#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {65639#false} is VALID [2022-04-28 10:12:29,557 INFO L290 TraceCheckUtils]: 34: Hoare triple {65639#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {65639#false} is VALID [2022-04-28 10:12:29,557 INFO L290 TraceCheckUtils]: 35: Hoare triple {65639#false} assume !(~y~0 % 4294967296 > 0); {65639#false} is VALID [2022-04-28 10:12:29,557 INFO L272 TraceCheckUtils]: 36: Hoare triple {65639#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {65639#false} is VALID [2022-04-28 10:12:29,557 INFO L290 TraceCheckUtils]: 37: Hoare triple {65639#false} ~cond := #in~cond; {65639#false} is VALID [2022-04-28 10:12:29,557 INFO L290 TraceCheckUtils]: 38: Hoare triple {65639#false} assume 0 == ~cond; {65639#false} is VALID [2022-04-28 10:12:29,557 INFO L290 TraceCheckUtils]: 39: Hoare triple {65639#false} assume !false; {65639#false} is VALID [2022-04-28 10:12:29,557 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-04-28 10:12:29,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:12:29,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946762471] [2022-04-28 10:12:29,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946762471] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:12:29,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [719056545] [2022-04-28 10:12:29,558 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:12:29,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:12:29,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:12:29,559 INFO L229 MonitoredProcess]: Starting monitored process 82 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:12:29,559 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (82)] Waiting until timeout for monitored process [2022-04-28 10:12:29,600 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:12:29,601 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:12:29,601 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-28 10:12:29,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:12:29,610 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:12:29,868 INFO L272 TraceCheckUtils]: 0: Hoare triple {65638#true} call ULTIMATE.init(); {65638#true} is VALID [2022-04-28 10:12:29,869 INFO L290 TraceCheckUtils]: 1: Hoare triple {65638#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(10, 2);call #Ultimate.allocInit(12, 3); {65638#true} is VALID [2022-04-28 10:12:29,869 INFO L290 TraceCheckUtils]: 2: Hoare triple {65638#true} assume true; {65638#true} is VALID [2022-04-28 10:12:29,869 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {65638#true} {65638#true} #61#return; {65638#true} is VALID [2022-04-28 10:12:29,869 INFO L272 TraceCheckUtils]: 4: Hoare triple {65638#true} call #t~ret11 := main(); {65638#true} is VALID [2022-04-28 10:12:29,869 INFO L290 TraceCheckUtils]: 5: Hoare triple {65638#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {65643#(= main_~y~0 0)} is VALID [2022-04-28 10:12:29,869 INFO L290 TraceCheckUtils]: 6: Hoare triple {65643#(= 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; {65644#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:12:29,870 INFO L290 TraceCheckUtils]: 7: Hoare triple {65644#(and (<= 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; {65645#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:12:29,870 INFO L290 TraceCheckUtils]: 8: Hoare triple {65645#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {65646#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:12:29,871 INFO L290 TraceCheckUtils]: 9: Hoare triple {65646#(and (<= main_~y~0 3) (<= 3 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; {65647#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:12:29,871 INFO L290 TraceCheckUtils]: 10: Hoare triple {65647#(and (<= main_~y~0 4) (<= 4 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; {65648#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:12:29,872 INFO L290 TraceCheckUtils]: 11: Hoare triple {65648#(and (<= 5 main_~y~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; {65649#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:12:29,872 INFO L290 TraceCheckUtils]: 12: Hoare triple {65649#(and (<= main_~y~0 6) (<= 6 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; {65650#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:12:29,873 INFO L290 TraceCheckUtils]: 13: Hoare triple {65650#(and (<= 7 main_~y~0) (<= main_~y~0 7))} 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; {65651#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:12:29,873 INFO L290 TraceCheckUtils]: 14: Hoare triple {65651#(and (<= main_~y~0 8) (<= 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; {65652#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:12:29,874 INFO L290 TraceCheckUtils]: 15: Hoare triple {65652#(and (<= 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; {65653#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:12:29,874 INFO L290 TraceCheckUtils]: 16: Hoare triple {65653#(and (<= main_~y~0 10) (<= 10 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; {65654#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:12:29,875 INFO L290 TraceCheckUtils]: 17: Hoare triple {65654#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {65654#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:12:29,875 INFO L290 TraceCheckUtils]: 18: Hoare triple {65654#(and (<= main_~y~0 11) (<= 11 main_~y~0))} ~z~0 := ~y~0; {65655#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-28 10:12:29,875 INFO L290 TraceCheckUtils]: 19: Hoare triple {65655#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {65656#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:12:29,876 INFO L290 TraceCheckUtils]: 20: Hoare triple {65656#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {65657#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:12:29,876 INFO L290 TraceCheckUtils]: 21: Hoare triple {65657#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {65658#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:12:29,877 INFO L290 TraceCheckUtils]: 22: Hoare triple {65658#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {65730#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:12:29,877 INFO L290 TraceCheckUtils]: 23: Hoare triple {65730#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {65639#false} is VALID [2022-04-28 10:12:29,877 INFO L290 TraceCheckUtils]: 24: Hoare triple {65639#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {65639#false} is VALID [2022-04-28 10:12:29,877 INFO L290 TraceCheckUtils]: 25: Hoare triple {65639#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {65639#false} is VALID [2022-04-28 10:12:29,877 INFO L290 TraceCheckUtils]: 26: Hoare triple {65639#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {65639#false} is VALID [2022-04-28 10:12:29,877 INFO L290 TraceCheckUtils]: 27: Hoare triple {65639#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {65639#false} is VALID [2022-04-28 10:12:29,877 INFO L290 TraceCheckUtils]: 28: Hoare triple {65639#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {65639#false} is VALID [2022-04-28 10:12:29,877 INFO L290 TraceCheckUtils]: 29: Hoare triple {65639#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {65639#false} is VALID [2022-04-28 10:12:29,878 INFO L290 TraceCheckUtils]: 30: Hoare triple {65639#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {65639#false} is VALID [2022-04-28 10:12:29,878 INFO L290 TraceCheckUtils]: 31: Hoare triple {65639#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {65639#false} is VALID [2022-04-28 10:12:29,878 INFO L290 TraceCheckUtils]: 32: Hoare triple {65639#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {65639#false} is VALID [2022-04-28 10:12:29,878 INFO L290 TraceCheckUtils]: 33: Hoare triple {65639#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {65639#false} is VALID [2022-04-28 10:12:29,878 INFO L290 TraceCheckUtils]: 34: Hoare triple {65639#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {65639#false} is VALID [2022-04-28 10:12:29,878 INFO L290 TraceCheckUtils]: 35: Hoare triple {65639#false} assume !(~y~0 % 4294967296 > 0); {65639#false} is VALID [2022-04-28 10:12:29,878 INFO L272 TraceCheckUtils]: 36: Hoare triple {65639#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {65639#false} is VALID [2022-04-28 10:12:29,878 INFO L290 TraceCheckUtils]: 37: Hoare triple {65639#false} ~cond := #in~cond; {65639#false} is VALID [2022-04-28 10:12:29,878 INFO L290 TraceCheckUtils]: 38: Hoare triple {65639#false} assume 0 == ~cond; {65639#false} is VALID [2022-04-28 10:12:29,878 INFO L290 TraceCheckUtils]: 39: Hoare triple {65639#false} assume !false; {65639#false} is VALID [2022-04-28 10:12:29,878 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-04-28 10:12:29,878 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:12:30,381 INFO L290 TraceCheckUtils]: 39: Hoare triple {65639#false} assume !false; {65639#false} is VALID [2022-04-28 10:12:30,381 INFO L290 TraceCheckUtils]: 38: Hoare triple {65639#false} assume 0 == ~cond; {65639#false} is VALID [2022-04-28 10:12:30,381 INFO L290 TraceCheckUtils]: 37: Hoare triple {65639#false} ~cond := #in~cond; {65639#false} is VALID [2022-04-28 10:12:30,381 INFO L272 TraceCheckUtils]: 36: Hoare triple {65639#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {65639#false} is VALID [2022-04-28 10:12:30,381 INFO L290 TraceCheckUtils]: 35: Hoare triple {65639#false} assume !(~y~0 % 4294967296 > 0); {65639#false} is VALID [2022-04-28 10:12:30,381 INFO L290 TraceCheckUtils]: 34: Hoare triple {65639#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {65639#false} is VALID [2022-04-28 10:12:30,381 INFO L290 TraceCheckUtils]: 33: Hoare triple {65639#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {65639#false} is VALID [2022-04-28 10:12:30,382 INFO L290 TraceCheckUtils]: 32: Hoare triple {65639#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {65639#false} is VALID [2022-04-28 10:12:30,382 INFO L290 TraceCheckUtils]: 31: Hoare triple {65639#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {65639#false} is VALID [2022-04-28 10:12:30,382 INFO L290 TraceCheckUtils]: 30: Hoare triple {65639#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {65639#false} is VALID [2022-04-28 10:12:30,382 INFO L290 TraceCheckUtils]: 29: Hoare triple {65639#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {65639#false} is VALID [2022-04-28 10:12:30,382 INFO L290 TraceCheckUtils]: 28: Hoare triple {65639#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {65639#false} is VALID [2022-04-28 10:12:30,382 INFO L290 TraceCheckUtils]: 27: Hoare triple {65639#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {65639#false} is VALID [2022-04-28 10:12:30,382 INFO L290 TraceCheckUtils]: 26: Hoare triple {65639#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {65639#false} is VALID [2022-04-28 10:12:30,382 INFO L290 TraceCheckUtils]: 25: Hoare triple {65639#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {65639#false} is VALID [2022-04-28 10:12:30,382 INFO L290 TraceCheckUtils]: 24: Hoare triple {65639#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {65639#false} is VALID [2022-04-28 10:12:30,382 INFO L290 TraceCheckUtils]: 23: Hoare triple {65830#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {65639#false} is VALID [2022-04-28 10:12:30,383 INFO L290 TraceCheckUtils]: 22: Hoare triple {65834#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {65830#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:12:30,384 INFO L290 TraceCheckUtils]: 21: Hoare triple {65838#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {65834#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:12:30,384 INFO L290 TraceCheckUtils]: 20: Hoare triple {65842#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {65838#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-28 10:12:30,385 INFO L290 TraceCheckUtils]: 19: Hoare triple {65846#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {65842#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-28 10:12:30,385 INFO L290 TraceCheckUtils]: 18: Hoare triple {65850#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} ~z~0 := ~y~0; {65846#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID [2022-04-28 10:12:30,386 INFO L290 TraceCheckUtils]: 17: Hoare triple {65850#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {65850#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-28 10:12:30,386 INFO L290 TraceCheckUtils]: 16: Hoare triple {65857#(< 0 (mod (+ main_~y~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; {65850#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-28 10:12:30,387 INFO L290 TraceCheckUtils]: 15: Hoare triple {65861#(< 0 (mod (+ main_~y~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; {65857#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 10:12:30,388 INFO L290 TraceCheckUtils]: 14: Hoare triple {65865#(< 0 (mod (+ main_~y~0 4294967295) 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; {65861#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:12:30,388 INFO L290 TraceCheckUtils]: 13: Hoare triple {65869#(< 0 (mod main_~y~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; {65865#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:12:30,389 INFO L290 TraceCheckUtils]: 12: Hoare triple {65873#(< 0 (mod (+ main_~y~0 1) 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; {65869#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:12:30,390 INFO L290 TraceCheckUtils]: 11: Hoare triple {65877#(< 0 (mod (+ main_~y~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; {65873#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:12:30,390 INFO L290 TraceCheckUtils]: 10: Hoare triple {65881#(< 0 (mod (+ main_~y~0 3) 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; {65877#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:12:30,391 INFO L290 TraceCheckUtils]: 9: Hoare triple {65885#(< 0 (mod (+ main_~y~0 4) 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; {65881#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:12:30,391 INFO L290 TraceCheckUtils]: 8: Hoare triple {65889#(< 0 (mod (+ 5 main_~y~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; {65885#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:12:30,392 INFO L290 TraceCheckUtils]: 7: Hoare triple {65893#(< 0 (mod (+ main_~y~0 6) 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; {65889#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:12:30,393 INFO L290 TraceCheckUtils]: 6: Hoare triple {65897#(< 0 (mod (+ 7 main_~y~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; {65893#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:12:30,393 INFO L290 TraceCheckUtils]: 5: Hoare triple {65638#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {65897#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:12:30,393 INFO L272 TraceCheckUtils]: 4: Hoare triple {65638#true} call #t~ret11 := main(); {65638#true} is VALID [2022-04-28 10:12:30,393 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {65638#true} {65638#true} #61#return; {65638#true} is VALID [2022-04-28 10:12:30,393 INFO L290 TraceCheckUtils]: 2: Hoare triple {65638#true} assume true; {65638#true} is VALID [2022-04-28 10:12:30,393 INFO L290 TraceCheckUtils]: 1: Hoare triple {65638#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(10, 2);call #Ultimate.allocInit(12, 3); {65638#true} is VALID [2022-04-28 10:12:30,393 INFO L272 TraceCheckUtils]: 0: Hoare triple {65638#true} call ULTIMATE.init(); {65638#true} is VALID [2022-04-28 10:12:30,393 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-04-28 10:12:30,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [719056545] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:12:30,394 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:12:30,394 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 19] total 38 [2022-04-28 10:12:30,394 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:12:30,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2057889895] [2022-04-28 10:12:30,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2057889895] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:12:30,394 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:12:30,394 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-28 10:12:30,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296724601] [2022-04-28 10:12:30,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:12:30,394 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 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 40 [2022-04-28 10:12:30,394 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:12:30,394 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 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-28 10:12:30,412 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:12:30,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-28 10:12:30,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:12:30,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-28 10:12:30,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=247, Invalid=1159, Unknown=0, NotChecked=0, Total=1406 [2022-04-28 10:12:30,413 INFO L87 Difference]: Start difference. First operand 136 states and 172 transitions. Second operand has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 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-28 10:12:32,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:12:32,057 INFO L93 Difference]: Finished difference Result 167 states and 203 transitions. [2022-04-28 10:12:32,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-28 10:12:32,057 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 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 40 [2022-04-28 10:12:32,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:12:32,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 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-28 10:12:32,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 73 transitions. [2022-04-28 10:12:32,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 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-28 10:12:32,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 73 transitions. [2022-04-28 10:12:32,058 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 73 transitions. [2022-04-28 10:12:32,113 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:12:32,114 INFO L225 Difference]: With dead ends: 167 [2022-04-28 10:12:32,114 INFO L226 Difference]: Without dead ends: 150 [2022-04-28 10:12:32,115 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 382 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=728, Invalid=3054, Unknown=0, NotChecked=0, Total=3782 [2022-04-28 10:12:32,115 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 30 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 767 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 767 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-28 10:12:32,115 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 97 Invalid, 823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 767 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-28 10:12:32,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-04-28 10:12:32,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 137. [2022-04-28 10:12:32,259 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:12:32,259 INFO L82 GeneralOperation]: Start isEquivalent. First operand 150 states. Second operand has 137 states, 132 states have (on average 1.2803030303030303) internal successors, (169), 132 states have internal predecessors, (169), 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-28 10:12:32,260 INFO L74 IsIncluded]: Start isIncluded. First operand 150 states. Second operand has 137 states, 132 states have (on average 1.2803030303030303) internal successors, (169), 132 states have internal predecessors, (169), 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-28 10:12:32,260 INFO L87 Difference]: Start difference. First operand 150 states. Second operand has 137 states, 132 states have (on average 1.2803030303030303) internal successors, (169), 132 states have internal predecessors, (169), 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-28 10:12:32,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:12:32,261 INFO L93 Difference]: Finished difference Result 150 states and 186 transitions. [2022-04-28 10:12:32,261 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 186 transitions. [2022-04-28 10:12:32,261 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:12:32,261 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:12:32,261 INFO L74 IsIncluded]: Start isIncluded. First operand has 137 states, 132 states have (on average 1.2803030303030303) internal successors, (169), 132 states have internal predecessors, (169), 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 150 states. [2022-04-28 10:12:32,261 INFO L87 Difference]: Start difference. First operand has 137 states, 132 states have (on average 1.2803030303030303) internal successors, (169), 132 states have internal predecessors, (169), 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 150 states. [2022-04-28 10:12:32,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:12:32,262 INFO L93 Difference]: Finished difference Result 150 states and 186 transitions. [2022-04-28 10:12:32,262 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 186 transitions. [2022-04-28 10:12:32,262 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:12:32,263 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:12:32,263 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:12:32,263 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:12:32,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 132 states have (on average 1.2803030303030303) internal successors, (169), 132 states have internal predecessors, (169), 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-28 10:12:32,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 173 transitions. [2022-04-28 10:12:32,264 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 173 transitions. Word has length 40 [2022-04-28 10:12:32,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:12:32,264 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 173 transitions. [2022-04-28 10:12:32,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 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-28 10:12:32,264 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 137 states and 173 transitions. [2022-04-28 10:12:36,751 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 173 edges. 172 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 10:12:36,751 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 173 transitions. [2022-04-28 10:12:36,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-28 10:12:36,751 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:12:36,751 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:12:36,767 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (82)] Forceful destruction successful, exit code 0 [2022-04-28 10:12:36,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81,82 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:12:36,952 INFO L420 AbstractCegarLoop]: === Iteration 83 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:12:36,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:12:36,952 INFO L85 PathProgramCache]: Analyzing trace with hash -605310835, now seen corresponding path program 113 times [2022-04-28 10:12:36,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:12:36,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1439429739] [2022-04-28 10:12:36,954 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:12:36,954 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:12:36,954 INFO L85 PathProgramCache]: Analyzing trace with hash -605310835, now seen corresponding path program 114 times [2022-04-28 10:12:36,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:12:36,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128712516] [2022-04-28 10:12:36,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:12:36,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:12:36,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:12:37,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:12:37,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:12:37,184 INFO L290 TraceCheckUtils]: 0: Hoare triple {66895#(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(10, 2);call #Ultimate.allocInit(12, 3); {66874#true} is VALID [2022-04-28 10:12:37,184 INFO L290 TraceCheckUtils]: 1: Hoare triple {66874#true} assume true; {66874#true} is VALID [2022-04-28 10:12:37,184 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {66874#true} {66874#true} #61#return; {66874#true} is VALID [2022-04-28 10:12:37,185 INFO L272 TraceCheckUtils]: 0: Hoare triple {66874#true} call ULTIMATE.init(); {66895#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:12:37,185 INFO L290 TraceCheckUtils]: 1: Hoare triple {66895#(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(10, 2);call #Ultimate.allocInit(12, 3); {66874#true} is VALID [2022-04-28 10:12:37,185 INFO L290 TraceCheckUtils]: 2: Hoare triple {66874#true} assume true; {66874#true} is VALID [2022-04-28 10:12:37,185 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {66874#true} {66874#true} #61#return; {66874#true} is VALID [2022-04-28 10:12:37,185 INFO L272 TraceCheckUtils]: 4: Hoare triple {66874#true} call #t~ret11 := main(); {66874#true} is VALID [2022-04-28 10:12:37,185 INFO L290 TraceCheckUtils]: 5: Hoare triple {66874#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {66879#(= main_~y~0 0)} is VALID [2022-04-28 10:12:37,185 INFO L290 TraceCheckUtils]: 6: Hoare triple {66879#(= 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; {66880#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:12:37,186 INFO L290 TraceCheckUtils]: 7: Hoare triple {66880#(and (<= 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; {66881#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:12:37,186 INFO L290 TraceCheckUtils]: 8: Hoare triple {66881#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {66882#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:12:37,187 INFO L290 TraceCheckUtils]: 9: Hoare triple {66882#(and (<= main_~y~0 3) (<= 3 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; {66883#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:12:37,187 INFO L290 TraceCheckUtils]: 10: Hoare triple {66883#(and (<= main_~y~0 4) (<= 4 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; {66884#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:12:37,188 INFO L290 TraceCheckUtils]: 11: Hoare triple {66884#(and (<= 5 main_~y~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; {66885#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:12:37,188 INFO L290 TraceCheckUtils]: 12: Hoare triple {66885#(and (<= main_~y~0 6) (<= 6 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; {66886#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:12:37,189 INFO L290 TraceCheckUtils]: 13: Hoare triple {66886#(and (<= 7 main_~y~0) (<= main_~y~0 7))} 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; {66887#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:12:37,189 INFO L290 TraceCheckUtils]: 14: Hoare triple {66887#(and (<= main_~y~0 8) (<= 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; {66888#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:12:37,190 INFO L290 TraceCheckUtils]: 15: Hoare triple {66888#(and (<= 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; {66889#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:12:37,190 INFO L290 TraceCheckUtils]: 16: Hoare triple {66889#(and (<= main_~y~0 10) (<= 10 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; {66890#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:12:37,191 INFO L290 TraceCheckUtils]: 17: Hoare triple {66890#(and (<= main_~y~0 11) (<= 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; {66891#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:12:37,191 INFO L290 TraceCheckUtils]: 18: Hoare triple {66891#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !(~x~0 % 4294967296 > 0); {66891#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:12:37,191 INFO L290 TraceCheckUtils]: 19: Hoare triple {66891#(and (<= 12 main_~y~0) (<= main_~y~0 12))} ~z~0 := ~y~0; {66892#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-28 10:12:37,192 INFO L290 TraceCheckUtils]: 20: Hoare triple {66892#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {66893#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-28 10:12:37,192 INFO L290 TraceCheckUtils]: 21: Hoare triple {66893#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {66894#(and (<= 10 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:12:37,193 INFO L290 TraceCheckUtils]: 22: Hoare triple {66894#(and (<= 10 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {66875#false} is VALID [2022-04-28 10:12:37,193 INFO L290 TraceCheckUtils]: 23: Hoare triple {66875#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {66875#false} is VALID [2022-04-28 10:12:37,193 INFO L290 TraceCheckUtils]: 24: Hoare triple {66875#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {66875#false} is VALID [2022-04-28 10:12:37,193 INFO L290 TraceCheckUtils]: 25: Hoare triple {66875#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {66875#false} is VALID [2022-04-28 10:12:37,193 INFO L290 TraceCheckUtils]: 26: Hoare triple {66875#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {66875#false} is VALID [2022-04-28 10:12:37,193 INFO L290 TraceCheckUtils]: 27: Hoare triple {66875#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {66875#false} is VALID [2022-04-28 10:12:37,193 INFO L290 TraceCheckUtils]: 28: Hoare triple {66875#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {66875#false} is VALID [2022-04-28 10:12:37,193 INFO L290 TraceCheckUtils]: 29: Hoare triple {66875#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {66875#false} is VALID [2022-04-28 10:12:37,193 INFO L290 TraceCheckUtils]: 30: Hoare triple {66875#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {66875#false} is VALID [2022-04-28 10:12:37,193 INFO L290 TraceCheckUtils]: 31: Hoare triple {66875#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {66875#false} is VALID [2022-04-28 10:12:37,193 INFO L290 TraceCheckUtils]: 32: Hoare triple {66875#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {66875#false} is VALID [2022-04-28 10:12:37,193 INFO L290 TraceCheckUtils]: 33: Hoare triple {66875#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {66875#false} is VALID [2022-04-28 10:12:37,193 INFO L290 TraceCheckUtils]: 34: Hoare triple {66875#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {66875#false} is VALID [2022-04-28 10:12:37,193 INFO L290 TraceCheckUtils]: 35: Hoare triple {66875#false} assume !(~y~0 % 4294967296 > 0); {66875#false} is VALID [2022-04-28 10:12:37,194 INFO L272 TraceCheckUtils]: 36: Hoare triple {66875#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {66875#false} is VALID [2022-04-28 10:12:37,194 INFO L290 TraceCheckUtils]: 37: Hoare triple {66875#false} ~cond := #in~cond; {66875#false} is VALID [2022-04-28 10:12:37,194 INFO L290 TraceCheckUtils]: 38: Hoare triple {66875#false} assume 0 == ~cond; {66875#false} is VALID [2022-04-28 10:12:37,194 INFO L290 TraceCheckUtils]: 39: Hoare triple {66875#false} assume !false; {66875#false} is VALID [2022-04-28 10:12:37,194 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-04-28 10:12:37,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:12:37,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128712516] [2022-04-28 10:12:37,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128712516] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:12:37,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1328450720] [2022-04-28 10:12:37,194 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:12:37,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:12:37,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:12:37,195 INFO L229 MonitoredProcess]: Starting monitored process 83 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:12:37,195 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (83)] Waiting until timeout for monitored process [2022-04-28 10:12:37,607 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-28 10:12:37,607 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:12:37,609 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-28 10:12:37,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:12:37,618 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:12:37,857 INFO L272 TraceCheckUtils]: 0: Hoare triple {66874#true} call ULTIMATE.init(); {66874#true} is VALID [2022-04-28 10:12:37,857 INFO L290 TraceCheckUtils]: 1: Hoare triple {66874#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(10, 2);call #Ultimate.allocInit(12, 3); {66874#true} is VALID [2022-04-28 10:12:37,857 INFO L290 TraceCheckUtils]: 2: Hoare triple {66874#true} assume true; {66874#true} is VALID [2022-04-28 10:12:37,857 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {66874#true} {66874#true} #61#return; {66874#true} is VALID [2022-04-28 10:12:37,857 INFO L272 TraceCheckUtils]: 4: Hoare triple {66874#true} call #t~ret11 := main(); {66874#true} is VALID [2022-04-28 10:12:37,858 INFO L290 TraceCheckUtils]: 5: Hoare triple {66874#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {66879#(= main_~y~0 0)} is VALID [2022-04-28 10:12:37,858 INFO L290 TraceCheckUtils]: 6: Hoare triple {66879#(= 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; {66880#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:12:37,859 INFO L290 TraceCheckUtils]: 7: Hoare triple {66880#(and (<= 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; {66881#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:12:37,859 INFO L290 TraceCheckUtils]: 8: Hoare triple {66881#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {66882#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:12:37,860 INFO L290 TraceCheckUtils]: 9: Hoare triple {66882#(and (<= main_~y~0 3) (<= 3 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; {66883#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:12:37,860 INFO L290 TraceCheckUtils]: 10: Hoare triple {66883#(and (<= main_~y~0 4) (<= 4 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; {66884#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:12:37,861 INFO L290 TraceCheckUtils]: 11: Hoare triple {66884#(and (<= 5 main_~y~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; {66885#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:12:37,861 INFO L290 TraceCheckUtils]: 12: Hoare triple {66885#(and (<= main_~y~0 6) (<= 6 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; {66886#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:12:37,862 INFO L290 TraceCheckUtils]: 13: Hoare triple {66886#(and (<= 7 main_~y~0) (<= main_~y~0 7))} 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; {66887#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:12:37,862 INFO L290 TraceCheckUtils]: 14: Hoare triple {66887#(and (<= main_~y~0 8) (<= 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; {66888#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:12:37,863 INFO L290 TraceCheckUtils]: 15: Hoare triple {66888#(and (<= 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; {66889#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:12:37,863 INFO L290 TraceCheckUtils]: 16: Hoare triple {66889#(and (<= main_~y~0 10) (<= 10 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; {66890#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:12:37,864 INFO L290 TraceCheckUtils]: 17: Hoare triple {66890#(and (<= main_~y~0 11) (<= 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; {66891#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:12:37,864 INFO L290 TraceCheckUtils]: 18: Hoare triple {66891#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !(~x~0 % 4294967296 > 0); {66891#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:12:37,864 INFO L290 TraceCheckUtils]: 19: Hoare triple {66891#(and (<= 12 main_~y~0) (<= main_~y~0 12))} ~z~0 := ~y~0; {66892#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-28 10:12:37,865 INFO L290 TraceCheckUtils]: 20: Hoare triple {66892#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {66893#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-28 10:12:37,865 INFO L290 TraceCheckUtils]: 21: Hoare triple {66893#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {66962#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:12:37,866 INFO L290 TraceCheckUtils]: 22: Hoare triple {66962#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {66875#false} is VALID [2022-04-28 10:12:37,866 INFO L290 TraceCheckUtils]: 23: Hoare triple {66875#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {66875#false} is VALID [2022-04-28 10:12:37,866 INFO L290 TraceCheckUtils]: 24: Hoare triple {66875#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {66875#false} is VALID [2022-04-28 10:12:37,866 INFO L290 TraceCheckUtils]: 25: Hoare triple {66875#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {66875#false} is VALID [2022-04-28 10:12:37,866 INFO L290 TraceCheckUtils]: 26: Hoare triple {66875#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {66875#false} is VALID [2022-04-28 10:12:37,866 INFO L290 TraceCheckUtils]: 27: Hoare triple {66875#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {66875#false} is VALID [2022-04-28 10:12:37,866 INFO L290 TraceCheckUtils]: 28: Hoare triple {66875#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {66875#false} is VALID [2022-04-28 10:12:37,866 INFO L290 TraceCheckUtils]: 29: Hoare triple {66875#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {66875#false} is VALID [2022-04-28 10:12:37,866 INFO L290 TraceCheckUtils]: 30: Hoare triple {66875#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {66875#false} is VALID [2022-04-28 10:12:37,866 INFO L290 TraceCheckUtils]: 31: Hoare triple {66875#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {66875#false} is VALID [2022-04-28 10:12:37,866 INFO L290 TraceCheckUtils]: 32: Hoare triple {66875#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {66875#false} is VALID [2022-04-28 10:12:37,866 INFO L290 TraceCheckUtils]: 33: Hoare triple {66875#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {66875#false} is VALID [2022-04-28 10:12:37,866 INFO L290 TraceCheckUtils]: 34: Hoare triple {66875#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {66875#false} is VALID [2022-04-28 10:12:37,866 INFO L290 TraceCheckUtils]: 35: Hoare triple {66875#false} assume !(~y~0 % 4294967296 > 0); {66875#false} is VALID [2022-04-28 10:12:37,866 INFO L272 TraceCheckUtils]: 36: Hoare triple {66875#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {66875#false} is VALID [2022-04-28 10:12:37,866 INFO L290 TraceCheckUtils]: 37: Hoare triple {66875#false} ~cond := #in~cond; {66875#false} is VALID [2022-04-28 10:12:37,866 INFO L290 TraceCheckUtils]: 38: Hoare triple {66875#false} assume 0 == ~cond; {66875#false} is VALID [2022-04-28 10:12:37,866 INFO L290 TraceCheckUtils]: 39: Hoare triple {66875#false} assume !false; {66875#false} is VALID [2022-04-28 10:12:37,866 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-04-28 10:12:37,867 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:12:38,319 INFO L290 TraceCheckUtils]: 39: Hoare triple {66875#false} assume !false; {66875#false} is VALID [2022-04-28 10:12:38,319 INFO L290 TraceCheckUtils]: 38: Hoare triple {66875#false} assume 0 == ~cond; {66875#false} is VALID [2022-04-28 10:12:38,319 INFO L290 TraceCheckUtils]: 37: Hoare triple {66875#false} ~cond := #in~cond; {66875#false} is VALID [2022-04-28 10:12:38,319 INFO L272 TraceCheckUtils]: 36: Hoare triple {66875#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {66875#false} is VALID [2022-04-28 10:12:38,319 INFO L290 TraceCheckUtils]: 35: Hoare triple {66875#false} assume !(~y~0 % 4294967296 > 0); {66875#false} is VALID [2022-04-28 10:12:38,319 INFO L290 TraceCheckUtils]: 34: Hoare triple {66875#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {66875#false} is VALID [2022-04-28 10:12:38,319 INFO L290 TraceCheckUtils]: 33: Hoare triple {66875#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {66875#false} is VALID [2022-04-28 10:12:38,319 INFO L290 TraceCheckUtils]: 32: Hoare triple {66875#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {66875#false} is VALID [2022-04-28 10:12:38,319 INFO L290 TraceCheckUtils]: 31: Hoare triple {66875#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {66875#false} is VALID [2022-04-28 10:12:38,319 INFO L290 TraceCheckUtils]: 30: Hoare triple {66875#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {66875#false} is VALID [2022-04-28 10:12:38,320 INFO L290 TraceCheckUtils]: 29: Hoare triple {66875#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {66875#false} is VALID [2022-04-28 10:12:38,320 INFO L290 TraceCheckUtils]: 28: Hoare triple {66875#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {66875#false} is VALID [2022-04-28 10:12:38,320 INFO L290 TraceCheckUtils]: 27: Hoare triple {66875#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {66875#false} is VALID [2022-04-28 10:12:38,320 INFO L290 TraceCheckUtils]: 26: Hoare triple {66875#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {66875#false} is VALID [2022-04-28 10:12:38,320 INFO L290 TraceCheckUtils]: 25: Hoare triple {66875#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {66875#false} is VALID [2022-04-28 10:12:38,320 INFO L290 TraceCheckUtils]: 24: Hoare triple {66875#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {66875#false} is VALID [2022-04-28 10:12:38,320 INFO L290 TraceCheckUtils]: 23: Hoare triple {66875#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {66875#false} is VALID [2022-04-28 10:12:38,320 INFO L290 TraceCheckUtils]: 22: Hoare triple {67068#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {66875#false} is VALID [2022-04-28 10:12:38,321 INFO L290 TraceCheckUtils]: 21: Hoare triple {67072#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {67068#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:12:38,322 INFO L290 TraceCheckUtils]: 20: Hoare triple {67076#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {67072#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:12:38,322 INFO L290 TraceCheckUtils]: 19: Hoare triple {67080#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} ~z~0 := ~y~0; {67076#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-28 10:12:38,322 INFO L290 TraceCheckUtils]: 18: Hoare triple {67080#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !(~x~0 % 4294967296 > 0); {67080#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:12:38,323 INFO L290 TraceCheckUtils]: 17: Hoare triple {67087#(< 0 (mod (+ main_~y~0 4294967295) 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; {67080#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:12:38,324 INFO L290 TraceCheckUtils]: 16: Hoare triple {67091#(< 0 (mod main_~y~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; {67087#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:12:38,324 INFO L290 TraceCheckUtils]: 15: Hoare triple {67095#(< 0 (mod (+ main_~y~0 1) 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; {67091#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:12:38,325 INFO L290 TraceCheckUtils]: 14: Hoare triple {67099#(< 0 (mod (+ main_~y~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; {67095#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:12:38,326 INFO L290 TraceCheckUtils]: 13: Hoare triple {67103#(< 0 (mod (+ main_~y~0 3) 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; {67099#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:12:38,326 INFO L290 TraceCheckUtils]: 12: Hoare triple {67107#(< 0 (mod (+ main_~y~0 4) 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; {67103#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:12:38,327 INFO L290 TraceCheckUtils]: 11: Hoare triple {67111#(< 0 (mod (+ 5 main_~y~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; {67107#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:12:38,327 INFO L290 TraceCheckUtils]: 10: Hoare triple {67115#(< 0 (mod (+ main_~y~0 6) 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; {67111#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:12:38,328 INFO L290 TraceCheckUtils]: 9: Hoare triple {67119#(< 0 (mod (+ 7 main_~y~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; {67115#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:12:38,329 INFO L290 TraceCheckUtils]: 8: Hoare triple {67123#(< 0 (mod (+ main_~y~0 8) 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; {67119#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:12:38,329 INFO L290 TraceCheckUtils]: 7: Hoare triple {67127#(< 0 (mod (+ main_~y~0 9) 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; {67123#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:12:38,330 INFO L290 TraceCheckUtils]: 6: Hoare triple {67131#(< 0 (mod (+ main_~y~0 10) 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; {67127#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:12:38,330 INFO L290 TraceCheckUtils]: 5: Hoare triple {66874#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {67131#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-28 10:12:38,330 INFO L272 TraceCheckUtils]: 4: Hoare triple {66874#true} call #t~ret11 := main(); {66874#true} is VALID [2022-04-28 10:12:38,330 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {66874#true} {66874#true} #61#return; {66874#true} is VALID [2022-04-28 10:12:38,330 INFO L290 TraceCheckUtils]: 2: Hoare triple {66874#true} assume true; {66874#true} is VALID [2022-04-28 10:12:38,330 INFO L290 TraceCheckUtils]: 1: Hoare triple {66874#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(10, 2);call #Ultimate.allocInit(12, 3); {66874#true} is VALID [2022-04-28 10:12:38,330 INFO L272 TraceCheckUtils]: 0: Hoare triple {66874#true} call ULTIMATE.init(); {66874#true} is VALID [2022-04-28 10:12:38,331 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-04-28 10:12:38,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1328450720] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:12:38,331 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:12:38,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 36 [2022-04-28 10:12:38,331 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:12:38,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1439429739] [2022-04-28 10:12:38,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1439429739] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:12:38,331 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:12:38,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-28 10:12:38,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573841589] [2022-04-28 10:12:38,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:12:38,331 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 states have internal predecessors, (25), 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 40 [2022-04-28 10:12:38,331 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:12:38,331 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 states have internal predecessors, (25), 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-28 10:12:38,348 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-28 10:12:38,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-28 10:12:38,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:12:38,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-28 10:12:38,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=1010, Unknown=0, NotChecked=0, Total=1260 [2022-04-28 10:12:38,349 INFO L87 Difference]: Start difference. First operand 137 states and 173 transitions. Second operand has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 states have internal predecessors, (25), 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-28 10:12:39,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:12:39,815 INFO L93 Difference]: Finished difference Result 170 states and 206 transitions. [2022-04-28 10:12:39,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-28 10:12:39,815 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 states have internal predecessors, (25), 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 40 [2022-04-28 10:12:39,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:12:39,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 states have internal predecessors, (25), 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-28 10:12:39,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 73 transitions. [2022-04-28 10:12:39,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 states have internal predecessors, (25), 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-28 10:12:39,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 73 transitions. [2022-04-28 10:12:39,816 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 73 transitions. [2022-04-28 10:12:39,871 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:12:39,872 INFO L225 Difference]: With dead ends: 170 [2022-04-28 10:12:39,872 INFO L226 Difference]: Without dead ends: 152 [2022-04-28 10:12:39,872 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=606, Invalid=2364, Unknown=0, NotChecked=0, Total=2970 [2022-04-28 10:12:39,873 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 38 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 725 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 768 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 725 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 10:12:39,873 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 95 Invalid, 768 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 725 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 10:12:39,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2022-04-28 10:12:40,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 138. [2022-04-28 10:12:40,024 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:12:40,024 INFO L82 GeneralOperation]: Start isEquivalent. First operand 152 states. Second operand has 138 states, 133 states have (on average 1.2781954887218046) internal successors, (170), 133 states have internal predecessors, (170), 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-28 10:12:40,024 INFO L74 IsIncluded]: Start isIncluded. First operand 152 states. Second operand has 138 states, 133 states have (on average 1.2781954887218046) internal successors, (170), 133 states have internal predecessors, (170), 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-28 10:12:40,025 INFO L87 Difference]: Start difference. First operand 152 states. Second operand has 138 states, 133 states have (on average 1.2781954887218046) internal successors, (170), 133 states have internal predecessors, (170), 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-28 10:12:40,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:12:40,026 INFO L93 Difference]: Finished difference Result 152 states and 188 transitions. [2022-04-28 10:12:40,026 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 188 transitions. [2022-04-28 10:12:40,026 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:12:40,026 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:12:40,026 INFO L74 IsIncluded]: Start isIncluded. First operand has 138 states, 133 states have (on average 1.2781954887218046) internal successors, (170), 133 states have internal predecessors, (170), 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 152 states. [2022-04-28 10:12:40,026 INFO L87 Difference]: Start difference. First operand has 138 states, 133 states have (on average 1.2781954887218046) internal successors, (170), 133 states have internal predecessors, (170), 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 152 states. [2022-04-28 10:12:40,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:12:40,027 INFO L93 Difference]: Finished difference Result 152 states and 188 transitions. [2022-04-28 10:12:40,027 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 188 transitions. [2022-04-28 10:12:40,028 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:12:40,028 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:12:40,028 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:12:40,028 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:12:40,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 133 states have (on average 1.2781954887218046) internal successors, (170), 133 states have internal predecessors, (170), 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-28 10:12:40,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 174 transitions. [2022-04-28 10:12:40,029 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 174 transitions. Word has length 40 [2022-04-28 10:12:40,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:12:40,029 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 174 transitions. [2022-04-28 10:12:40,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 states have internal predecessors, (25), 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-28 10:12:40,029 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 138 states and 174 transitions. [2022-04-28 10:12:42,936 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 174 edges. 173 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 10:12:42,936 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 174 transitions. [2022-04-28 10:12:42,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-28 10:12:42,937 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:12:42,937 INFO L195 NwaCegarLoop]: trace histogram [26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:12:42,942 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (83)] Forceful destruction successful, exit code 0 [2022-04-28 10:12:43,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 83 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable82 [2022-04-28 10:12:43,137 INFO L420 AbstractCegarLoop]: === Iteration 84 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:12:43,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:12:43,137 INFO L85 PathProgramCache]: Analyzing trace with hash 599864045, now seen corresponding path program 51 times [2022-04-28 10:12:43,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:12:43,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [198794221] [2022-04-28 10:12:43,139 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:12:43,139 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:12:43,140 INFO L85 PathProgramCache]: Analyzing trace with hash 599864045, now seen corresponding path program 52 times [2022-04-28 10:12:43,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:12:43,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945752822] [2022-04-28 10:12:43,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:12:43,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:12:43,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:12:43,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:12:43,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:12:43,638 INFO L290 TraceCheckUtils]: 0: Hoare triple {68143#(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(10, 2);call #Ultimate.allocInit(12, 3); {68110#true} is VALID [2022-04-28 10:12:43,638 INFO L290 TraceCheckUtils]: 1: Hoare triple {68110#true} assume true; {68110#true} is VALID [2022-04-28 10:12:43,638 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {68110#true} {68110#true} #61#return; {68110#true} is VALID [2022-04-28 10:12:43,638 INFO L272 TraceCheckUtils]: 0: Hoare triple {68110#true} call ULTIMATE.init(); {68143#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:12:43,638 INFO L290 TraceCheckUtils]: 1: Hoare triple {68143#(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(10, 2);call #Ultimate.allocInit(12, 3); {68110#true} is VALID [2022-04-28 10:12:43,638 INFO L290 TraceCheckUtils]: 2: Hoare triple {68110#true} assume true; {68110#true} is VALID [2022-04-28 10:12:43,638 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {68110#true} {68110#true} #61#return; {68110#true} is VALID [2022-04-28 10:12:43,638 INFO L272 TraceCheckUtils]: 4: Hoare triple {68110#true} call #t~ret11 := main(); {68110#true} is VALID [2022-04-28 10:12:43,638 INFO L290 TraceCheckUtils]: 5: Hoare triple {68110#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {68115#(= main_~y~0 0)} is VALID [2022-04-28 10:12:43,639 INFO L290 TraceCheckUtils]: 6: Hoare triple {68115#(= 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; {68116#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:12:43,639 INFO L290 TraceCheckUtils]: 7: Hoare triple {68116#(and (<= 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; {68117#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:12:43,640 INFO L290 TraceCheckUtils]: 8: Hoare triple {68117#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {68118#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:12:43,640 INFO L290 TraceCheckUtils]: 9: Hoare triple {68118#(and (<= main_~y~0 3) (<= 3 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; {68119#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:12:43,641 INFO L290 TraceCheckUtils]: 10: Hoare triple {68119#(and (<= main_~y~0 4) (<= 4 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; {68120#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:12:43,641 INFO L290 TraceCheckUtils]: 11: Hoare triple {68120#(and (<= 5 main_~y~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; {68121#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:12:43,642 INFO L290 TraceCheckUtils]: 12: Hoare triple {68121#(and (<= main_~y~0 6) (<= 6 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; {68122#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:12:43,642 INFO L290 TraceCheckUtils]: 13: Hoare triple {68122#(and (<= 7 main_~y~0) (<= main_~y~0 7))} 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; {68123#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:12:43,643 INFO L290 TraceCheckUtils]: 14: Hoare triple {68123#(and (<= main_~y~0 8) (<= 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; {68124#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:12:43,643 INFO L290 TraceCheckUtils]: 15: Hoare triple {68124#(and (<= 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; {68125#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:12:43,644 INFO L290 TraceCheckUtils]: 16: Hoare triple {68125#(and (<= main_~y~0 10) (<= 10 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; {68126#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:12:43,644 INFO L290 TraceCheckUtils]: 17: Hoare triple {68126#(and (<= main_~y~0 11) (<= 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; {68127#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:12:43,645 INFO L290 TraceCheckUtils]: 18: Hoare triple {68127#(and (<= 12 main_~y~0) (<= main_~y~0 12))} 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; {68128#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:12:43,645 INFO L290 TraceCheckUtils]: 19: Hoare triple {68128#(and (<= main_~y~0 13) (<= 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; {68129#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:12:43,646 INFO L290 TraceCheckUtils]: 20: Hoare triple {68129#(and (<= 14 main_~y~0) (<= main_~y~0 14))} 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; {68130#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:12:43,646 INFO L290 TraceCheckUtils]: 21: Hoare triple {68130#(and (<= main_~y~0 15) (<= 15 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; {68131#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:12:43,647 INFO L290 TraceCheckUtils]: 22: Hoare triple {68131#(and (<= 16 main_~y~0) (<= main_~y~0 16))} 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; {68132#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:12:43,647 INFO L290 TraceCheckUtils]: 23: Hoare triple {68132#(and (<= main_~y~0 17) (<= 17 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; {68133#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 10:12:43,648 INFO L290 TraceCheckUtils]: 24: Hoare triple {68133#(and (<= 18 main_~y~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; {68134#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 10:12:43,648 INFO L290 TraceCheckUtils]: 25: Hoare triple {68134#(and (<= 19 main_~y~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; {68135#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 10:12:43,649 INFO L290 TraceCheckUtils]: 26: Hoare triple {68135#(and (<= 20 main_~y~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; {68136#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 10:12:43,649 INFO L290 TraceCheckUtils]: 27: Hoare triple {68136#(and (<= main_~y~0 21) (<= 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; {68137#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 10:12:43,650 INFO L290 TraceCheckUtils]: 28: Hoare triple {68137#(and (<= main_~y~0 22) (<= 22 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; {68138#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 10:12:43,650 INFO L290 TraceCheckUtils]: 29: Hoare triple {68138#(and (<= main_~y~0 23) (<= 23 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; {68139#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-28 10:12:43,651 INFO L290 TraceCheckUtils]: 30: Hoare triple {68139#(and (<= 24 main_~y~0) (<= main_~y~0 24))} 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; {68140#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-28 10:12:43,651 INFO L290 TraceCheckUtils]: 31: Hoare triple {68140#(and (<= 25 main_~y~0) (<= main_~y~0 25))} 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; {68141#(and (<= main_~y~0 26) (<= 26 main_~y~0))} is VALID [2022-04-28 10:12:43,651 INFO L290 TraceCheckUtils]: 32: Hoare triple {68141#(and (<= main_~y~0 26) (<= 26 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {68141#(and (<= main_~y~0 26) (<= 26 main_~y~0))} is VALID [2022-04-28 10:12:43,652 INFO L290 TraceCheckUtils]: 33: Hoare triple {68141#(and (<= main_~y~0 26) (<= 26 main_~y~0))} ~z~0 := ~y~0; {68142#(and (<= (div main_~z~0 4294967296) 0) (<= 26 main_~z~0))} is VALID [2022-04-28 10:12:43,652 INFO L290 TraceCheckUtils]: 34: Hoare triple {68142#(and (<= (div main_~z~0 4294967296) 0) (<= 26 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {68111#false} is VALID [2022-04-28 10:12:43,652 INFO L290 TraceCheckUtils]: 35: Hoare triple {68111#false} assume !(~y~0 % 4294967296 > 0); {68111#false} is VALID [2022-04-28 10:12:43,652 INFO L272 TraceCheckUtils]: 36: Hoare triple {68111#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {68111#false} is VALID [2022-04-28 10:12:43,652 INFO L290 TraceCheckUtils]: 37: Hoare triple {68111#false} ~cond := #in~cond; {68111#false} is VALID [2022-04-28 10:12:43,652 INFO L290 TraceCheckUtils]: 38: Hoare triple {68111#false} assume 0 == ~cond; {68111#false} is VALID [2022-04-28 10:12:43,652 INFO L290 TraceCheckUtils]: 39: Hoare triple {68111#false} assume !false; {68111#false} is VALID [2022-04-28 10:12:43,653 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:12:43,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:12:43,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945752822] [2022-04-28 10:12:43,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945752822] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:12:43,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [187667990] [2022-04-28 10:12:43,653 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:12:43,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:12:43,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:12:43,654 INFO L229 MonitoredProcess]: Starting monitored process 84 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:12:43,654 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (84)] Waiting until timeout for monitored process [2022-04-28 10:12:43,695 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:12:43,695 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:12:43,696 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 57 conjunts are in the unsatisfiable core [2022-04-28 10:12:43,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:12:43,705 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:12:44,051 INFO L272 TraceCheckUtils]: 0: Hoare triple {68110#true} call ULTIMATE.init(); {68110#true} is VALID [2022-04-28 10:12:44,051 INFO L290 TraceCheckUtils]: 1: Hoare triple {68110#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(10, 2);call #Ultimate.allocInit(12, 3); {68110#true} is VALID [2022-04-28 10:12:44,051 INFO L290 TraceCheckUtils]: 2: Hoare triple {68110#true} assume true; {68110#true} is VALID [2022-04-28 10:12:44,051 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {68110#true} {68110#true} #61#return; {68110#true} is VALID [2022-04-28 10:12:44,051 INFO L272 TraceCheckUtils]: 4: Hoare triple {68110#true} call #t~ret11 := main(); {68110#true} is VALID [2022-04-28 10:12:44,051 INFO L290 TraceCheckUtils]: 5: Hoare triple {68110#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {68115#(= main_~y~0 0)} is VALID [2022-04-28 10:12:44,052 INFO L290 TraceCheckUtils]: 6: Hoare triple {68115#(= 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; {68116#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:12:44,052 INFO L290 TraceCheckUtils]: 7: Hoare triple {68116#(and (<= 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; {68117#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:12:44,053 INFO L290 TraceCheckUtils]: 8: Hoare triple {68117#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {68118#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:12:44,053 INFO L290 TraceCheckUtils]: 9: Hoare triple {68118#(and (<= main_~y~0 3) (<= 3 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; {68119#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:12:44,054 INFO L290 TraceCheckUtils]: 10: Hoare triple {68119#(and (<= main_~y~0 4) (<= 4 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; {68120#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:12:44,054 INFO L290 TraceCheckUtils]: 11: Hoare triple {68120#(and (<= 5 main_~y~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; {68121#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:12:44,055 INFO L290 TraceCheckUtils]: 12: Hoare triple {68121#(and (<= main_~y~0 6) (<= 6 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; {68122#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:12:44,055 INFO L290 TraceCheckUtils]: 13: Hoare triple {68122#(and (<= 7 main_~y~0) (<= main_~y~0 7))} 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; {68123#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:12:44,056 INFO L290 TraceCheckUtils]: 14: Hoare triple {68123#(and (<= main_~y~0 8) (<= 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; {68124#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:12:44,056 INFO L290 TraceCheckUtils]: 15: Hoare triple {68124#(and (<= 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; {68125#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:12:44,057 INFO L290 TraceCheckUtils]: 16: Hoare triple {68125#(and (<= main_~y~0 10) (<= 10 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; {68126#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:12:44,057 INFO L290 TraceCheckUtils]: 17: Hoare triple {68126#(and (<= main_~y~0 11) (<= 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; {68127#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:12:44,058 INFO L290 TraceCheckUtils]: 18: Hoare triple {68127#(and (<= 12 main_~y~0) (<= main_~y~0 12))} 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; {68128#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:12:44,058 INFO L290 TraceCheckUtils]: 19: Hoare triple {68128#(and (<= main_~y~0 13) (<= 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; {68129#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:12:44,059 INFO L290 TraceCheckUtils]: 20: Hoare triple {68129#(and (<= 14 main_~y~0) (<= main_~y~0 14))} 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; {68130#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:12:44,059 INFO L290 TraceCheckUtils]: 21: Hoare triple {68130#(and (<= main_~y~0 15) (<= 15 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; {68131#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:12:44,060 INFO L290 TraceCheckUtils]: 22: Hoare triple {68131#(and (<= 16 main_~y~0) (<= main_~y~0 16))} 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; {68132#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:12:44,060 INFO L290 TraceCheckUtils]: 23: Hoare triple {68132#(and (<= main_~y~0 17) (<= 17 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; {68133#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 10:12:44,061 INFO L290 TraceCheckUtils]: 24: Hoare triple {68133#(and (<= 18 main_~y~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; {68134#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 10:12:44,061 INFO L290 TraceCheckUtils]: 25: Hoare triple {68134#(and (<= 19 main_~y~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; {68135#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 10:12:44,062 INFO L290 TraceCheckUtils]: 26: Hoare triple {68135#(and (<= 20 main_~y~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; {68136#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 10:12:44,062 INFO L290 TraceCheckUtils]: 27: Hoare triple {68136#(and (<= main_~y~0 21) (<= 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; {68137#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 10:12:44,063 INFO L290 TraceCheckUtils]: 28: Hoare triple {68137#(and (<= main_~y~0 22) (<= 22 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; {68138#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 10:12:44,063 INFO L290 TraceCheckUtils]: 29: Hoare triple {68138#(and (<= main_~y~0 23) (<= 23 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; {68139#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-28 10:12:44,063 INFO L290 TraceCheckUtils]: 30: Hoare triple {68139#(and (<= 24 main_~y~0) (<= main_~y~0 24))} 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; {68140#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-28 10:12:44,064 INFO L290 TraceCheckUtils]: 31: Hoare triple {68140#(and (<= 25 main_~y~0) (<= main_~y~0 25))} 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; {68141#(and (<= main_~y~0 26) (<= 26 main_~y~0))} is VALID [2022-04-28 10:12:44,064 INFO L290 TraceCheckUtils]: 32: Hoare triple {68141#(and (<= main_~y~0 26) (<= 26 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {68141#(and (<= main_~y~0 26) (<= 26 main_~y~0))} is VALID [2022-04-28 10:12:44,065 INFO L290 TraceCheckUtils]: 33: Hoare triple {68141#(and (<= main_~y~0 26) (<= 26 main_~y~0))} ~z~0 := ~y~0; {68246#(and (<= main_~z~0 26) (<= 26 main_~z~0))} is VALID [2022-04-28 10:12:44,065 INFO L290 TraceCheckUtils]: 34: Hoare triple {68246#(and (<= main_~z~0 26) (<= 26 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {68111#false} is VALID [2022-04-28 10:12:44,065 INFO L290 TraceCheckUtils]: 35: Hoare triple {68111#false} assume !(~y~0 % 4294967296 > 0); {68111#false} is VALID [2022-04-28 10:12:44,065 INFO L272 TraceCheckUtils]: 36: Hoare triple {68111#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {68111#false} is VALID [2022-04-28 10:12:44,065 INFO L290 TraceCheckUtils]: 37: Hoare triple {68111#false} ~cond := #in~cond; {68111#false} is VALID [2022-04-28 10:12:44,065 INFO L290 TraceCheckUtils]: 38: Hoare triple {68111#false} assume 0 == ~cond; {68111#false} is VALID [2022-04-28 10:12:44,065 INFO L290 TraceCheckUtils]: 39: Hoare triple {68111#false} assume !false; {68111#false} is VALID [2022-04-28 10:12:44,065 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:12:44,065 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:12:45,278 INFO L290 TraceCheckUtils]: 39: Hoare triple {68111#false} assume !false; {68111#false} is VALID [2022-04-28 10:12:45,278 INFO L290 TraceCheckUtils]: 38: Hoare triple {68111#false} assume 0 == ~cond; {68111#false} is VALID [2022-04-28 10:12:45,278 INFO L290 TraceCheckUtils]: 37: Hoare triple {68111#false} ~cond := #in~cond; {68111#false} is VALID [2022-04-28 10:12:45,278 INFO L272 TraceCheckUtils]: 36: Hoare triple {68111#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {68111#false} is VALID [2022-04-28 10:12:45,278 INFO L290 TraceCheckUtils]: 35: Hoare triple {68111#false} assume !(~y~0 % 4294967296 > 0); {68111#false} is VALID [2022-04-28 10:12:45,278 INFO L290 TraceCheckUtils]: 34: Hoare triple {68280#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {68111#false} is VALID [2022-04-28 10:12:45,279 INFO L290 TraceCheckUtils]: 33: Hoare triple {68284#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {68280#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:12:45,279 INFO L290 TraceCheckUtils]: 32: Hoare triple {68284#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {68284#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:12:45,280 INFO L290 TraceCheckUtils]: 31: Hoare triple {68291#(< 0 (mod (+ main_~y~0 1) 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; {68284#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:12:45,280 INFO L290 TraceCheckUtils]: 30: Hoare triple {68295#(< 0 (mod (+ main_~y~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; {68291#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:12:45,281 INFO L290 TraceCheckUtils]: 29: Hoare triple {68299#(< 0 (mod (+ main_~y~0 3) 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; {68295#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:12:45,282 INFO L290 TraceCheckUtils]: 28: Hoare triple {68303#(< 0 (mod (+ main_~y~0 4) 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; {68299#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:12:45,283 INFO L290 TraceCheckUtils]: 27: Hoare triple {68307#(< 0 (mod (+ 5 main_~y~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; {68303#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:12:45,283 INFO L290 TraceCheckUtils]: 26: Hoare triple {68311#(< 0 (mod (+ main_~y~0 6) 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; {68307#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:12:45,284 INFO L290 TraceCheckUtils]: 25: Hoare triple {68315#(< 0 (mod (+ 7 main_~y~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; {68311#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:12:45,284 INFO L290 TraceCheckUtils]: 24: Hoare triple {68319#(< 0 (mod (+ main_~y~0 8) 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; {68315#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:12:45,285 INFO L290 TraceCheckUtils]: 23: Hoare triple {68323#(< 0 (mod (+ main_~y~0 9) 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; {68319#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:12:45,286 INFO L290 TraceCheckUtils]: 22: Hoare triple {68327#(< 0 (mod (+ main_~y~0 10) 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; {68323#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:12:45,286 INFO L290 TraceCheckUtils]: 21: Hoare triple {68331#(< 0 (mod (+ main_~y~0 11) 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; {68327#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-28 10:12:45,287 INFO L290 TraceCheckUtils]: 20: Hoare triple {68335#(< 0 (mod (+ main_~y~0 12) 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; {68331#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-28 10:12:45,288 INFO L290 TraceCheckUtils]: 19: Hoare triple {68339#(< 0 (mod (+ main_~y~0 13) 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; {68335#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-28 10:12:45,288 INFO L290 TraceCheckUtils]: 18: Hoare triple {68343#(< 0 (mod (+ main_~y~0 14) 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; {68339#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-28 10:12:45,289 INFO L290 TraceCheckUtils]: 17: Hoare triple {68347#(< 0 (mod (+ main_~y~0 15) 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; {68343#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-28 10:12:45,290 INFO L290 TraceCheckUtils]: 16: Hoare triple {68351#(< 0 (mod (+ main_~y~0 16) 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; {68347#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID [2022-04-28 10:12:45,290 INFO L290 TraceCheckUtils]: 15: Hoare triple {68355#(< 0 (mod (+ main_~y~0 17) 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; {68351#(< 0 (mod (+ main_~y~0 16) 4294967296))} is VALID [2022-04-28 10:12:45,291 INFO L290 TraceCheckUtils]: 14: Hoare triple {68359#(< 0 (mod (+ main_~y~0 18) 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; {68355#(< 0 (mod (+ main_~y~0 17) 4294967296))} is VALID [2022-04-28 10:12:45,291 INFO L290 TraceCheckUtils]: 13: Hoare triple {68363#(< 0 (mod (+ 19 main_~y~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; {68359#(< 0 (mod (+ main_~y~0 18) 4294967296))} is VALID [2022-04-28 10:12:45,292 INFO L290 TraceCheckUtils]: 12: Hoare triple {68367#(< 0 (mod (+ main_~y~0 20) 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; {68363#(< 0 (mod (+ 19 main_~y~0) 4294967296))} is VALID [2022-04-28 10:12:45,293 INFO L290 TraceCheckUtils]: 11: Hoare triple {68371#(< 0 (mod (+ main_~y~0 21) 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; {68367#(< 0 (mod (+ main_~y~0 20) 4294967296))} is VALID [2022-04-28 10:12:45,293 INFO L290 TraceCheckUtils]: 10: Hoare triple {68375#(< 0 (mod (+ main_~y~0 22) 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; {68371#(< 0 (mod (+ main_~y~0 21) 4294967296))} is VALID [2022-04-28 10:12:45,294 INFO L290 TraceCheckUtils]: 9: Hoare triple {68379#(< 0 (mod (+ 23 main_~y~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; {68375#(< 0 (mod (+ main_~y~0 22) 4294967296))} is VALID [2022-04-28 10:12:45,295 INFO L290 TraceCheckUtils]: 8: Hoare triple {68383#(< 0 (mod (+ main_~y~0 24) 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; {68379#(< 0 (mod (+ 23 main_~y~0) 4294967296))} is VALID [2022-04-28 10:12:45,295 INFO L290 TraceCheckUtils]: 7: Hoare triple {68387#(< 0 (mod (+ main_~y~0 25) 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; {68383#(< 0 (mod (+ main_~y~0 24) 4294967296))} is VALID [2022-04-28 10:12:45,296 INFO L290 TraceCheckUtils]: 6: Hoare triple {68391#(< 0 (mod (+ main_~y~0 26) 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; {68387#(< 0 (mod (+ main_~y~0 25) 4294967296))} is VALID [2022-04-28 10:12:45,296 INFO L290 TraceCheckUtils]: 5: Hoare triple {68110#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {68391#(< 0 (mod (+ main_~y~0 26) 4294967296))} is VALID [2022-04-28 10:12:45,296 INFO L272 TraceCheckUtils]: 4: Hoare triple {68110#true} call #t~ret11 := main(); {68110#true} is VALID [2022-04-28 10:12:45,296 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {68110#true} {68110#true} #61#return; {68110#true} is VALID [2022-04-28 10:12:45,296 INFO L290 TraceCheckUtils]: 2: Hoare triple {68110#true} assume true; {68110#true} is VALID [2022-04-28 10:12:45,296 INFO L290 TraceCheckUtils]: 1: Hoare triple {68110#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(10, 2);call #Ultimate.allocInit(12, 3); {68110#true} is VALID [2022-04-28 10:12:45,296 INFO L272 TraceCheckUtils]: 0: Hoare triple {68110#true} call ULTIMATE.init(); {68110#true} is VALID [2022-04-28 10:12:45,297 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:12:45,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [187667990] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:12:45,297 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:12:45,297 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 30, 30] total 60 [2022-04-28 10:12:45,297 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:12:45,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [198794221] [2022-04-28 10:12:45,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [198794221] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:12:45,297 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:12:45,297 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2022-04-28 10:12:45,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90454395] [2022-04-28 10:12:45,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:12:45,298 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 30 states have internal predecessors, (36), 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 40 [2022-04-28 10:12:45,298 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:12:45,298 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 31 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 30 states have internal predecessors, (36), 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-28 10:12:45,320 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:12:45,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-04-28 10:12:45,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:12:45,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-04-28 10:12:45,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=848, Invalid=2692, Unknown=0, NotChecked=0, Total=3540 [2022-04-28 10:12:45,320 INFO L87 Difference]: Start difference. First operand 138 states and 174 transitions. Second operand has 31 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 30 states have internal predecessors, (36), 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-28 10:12:50,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:12:50,839 INFO L93 Difference]: Finished difference Result 176 states and 242 transitions. [2022-04-28 10:12:50,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-28 10:12:50,839 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 30 states have internal predecessors, (36), 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 40 [2022-04-28 10:12:50,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:12:50,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 30 states have internal predecessors, (36), 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-28 10:12:50,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 179 transitions. [2022-04-28 10:12:50,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 30 states have internal predecessors, (36), 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-28 10:12:50,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 179 transitions. [2022-04-28 10:12:50,841 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 179 transitions. [2022-04-28 10:12:50,976 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 179 edges. 179 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:12:50,978 INFO L225 Difference]: With dead ends: 176 [2022-04-28 10:12:50,978 INFO L226 Difference]: Without dead ends: 170 [2022-04-28 10:12:50,979 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 460 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1718, Invalid=5938, Unknown=0, NotChecked=0, Total=7656 [2022-04-28 10:12:50,979 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 156 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 3616 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 3727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 3616 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-04-28 10:12:50,979 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 205 Invalid, 3727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 3616 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-04-28 10:12:50,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2022-04-28 10:12:51,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 143. [2022-04-28 10:12:51,134 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:12:51,134 INFO L82 GeneralOperation]: Start isEquivalent. First operand 170 states. Second operand has 143 states, 138 states have (on average 1.2826086956521738) internal successors, (177), 138 states have internal predecessors, (177), 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-28 10:12:51,134 INFO L74 IsIncluded]: Start isIncluded. First operand 170 states. Second operand has 143 states, 138 states have (on average 1.2826086956521738) internal successors, (177), 138 states have internal predecessors, (177), 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-28 10:12:51,134 INFO L87 Difference]: Start difference. First operand 170 states. Second operand has 143 states, 138 states have (on average 1.2826086956521738) internal successors, (177), 138 states have internal predecessors, (177), 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-28 10:12:51,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:12:51,136 INFO L93 Difference]: Finished difference Result 170 states and 208 transitions. [2022-04-28 10:12:51,136 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 208 transitions. [2022-04-28 10:12:51,136 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:12:51,136 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:12:51,136 INFO L74 IsIncluded]: Start isIncluded. First operand has 143 states, 138 states have (on average 1.2826086956521738) internal successors, (177), 138 states have internal predecessors, (177), 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 170 states. [2022-04-28 10:12:51,136 INFO L87 Difference]: Start difference. First operand has 143 states, 138 states have (on average 1.2826086956521738) internal successors, (177), 138 states have internal predecessors, (177), 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 170 states. [2022-04-28 10:12:51,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:12:51,137 INFO L93 Difference]: Finished difference Result 170 states and 208 transitions. [2022-04-28 10:12:51,137 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 208 transitions. [2022-04-28 10:12:51,137 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:12:51,137 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:12:51,137 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:12:51,138 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:12:51,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 138 states have (on average 1.2826086956521738) internal successors, (177), 138 states have internal predecessors, (177), 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-28 10:12:51,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 181 transitions. [2022-04-28 10:12:51,139 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 181 transitions. Word has length 40 [2022-04-28 10:12:51,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:12:51,139 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 181 transitions. [2022-04-28 10:12:51,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 30 states have internal predecessors, (36), 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-28 10:12:51,139 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 143 states and 181 transitions. [2022-04-28 10:12:53,537 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 181 edges. 181 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:12:53,537 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 181 transitions. [2022-04-28 10:12:53,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-28 10:12:53,537 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:12:53,537 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:12:53,552 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (84)] Forceful destruction successful, exit code 0 [2022-04-28 10:12:53,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83,84 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:12:53,737 INFO L420 AbstractCegarLoop]: === Iteration 85 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:12:53,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:12:53,738 INFO L85 PathProgramCache]: Analyzing trace with hash 11643199, now seen corresponding path program 115 times [2022-04-28 10:12:53,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:12:53,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1558949454] [2022-04-28 10:12:53,740 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:12:53,740 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:12:53,740 INFO L85 PathProgramCache]: Analyzing trace with hash 11643199, now seen corresponding path program 116 times [2022-04-28 10:12:53,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:12:53,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073653781] [2022-04-28 10:12:53,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:12:53,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:12:53,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:12:54,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:12:54,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:12:54,641 INFO L290 TraceCheckUtils]: 0: Hoare triple {69475#(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(10, 2);call #Ultimate.allocInit(12, 3); {69446#true} is VALID [2022-04-28 10:12:54,641 INFO L290 TraceCheckUtils]: 1: Hoare triple {69446#true} assume true; {69446#true} is VALID [2022-04-28 10:12:54,641 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {69446#true} {69446#true} #61#return; {69446#true} is VALID [2022-04-28 10:12:54,641 INFO L272 TraceCheckUtils]: 0: Hoare triple {69446#true} call ULTIMATE.init(); {69475#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:12:54,641 INFO L290 TraceCheckUtils]: 1: Hoare triple {69475#(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(10, 2);call #Ultimate.allocInit(12, 3); {69446#true} is VALID [2022-04-28 10:12:54,641 INFO L290 TraceCheckUtils]: 2: Hoare triple {69446#true} assume true; {69446#true} is VALID [2022-04-28 10:12:54,641 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {69446#true} {69446#true} #61#return; {69446#true} is VALID [2022-04-28 10:12:54,641 INFO L272 TraceCheckUtils]: 4: Hoare triple {69446#true} call #t~ret11 := main(); {69446#true} is VALID [2022-04-28 10:12:54,642 INFO L290 TraceCheckUtils]: 5: Hoare triple {69446#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {69451#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-28 10:12:54,645 INFO L290 TraceCheckUtils]: 6: Hoare triple {69451#(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; {69452#(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-28 10:12:54,696 INFO L290 TraceCheckUtils]: 7: Hoare triple {69452#(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; {69453#(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-28 10:12:54,698 INFO L290 TraceCheckUtils]: 8: Hoare triple {69453#(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; {69454#(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-28 10:12:54,730 INFO L290 TraceCheckUtils]: 9: Hoare triple {69454#(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; {69455#(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-28 10:12:54,737 INFO L290 TraceCheckUtils]: 10: Hoare triple {69455#(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; {69456#(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-28 10:12:54,738 INFO L290 TraceCheckUtils]: 11: Hoare triple {69456#(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; {69457#(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-28 10:12:54,744 INFO L290 TraceCheckUtils]: 12: Hoare triple {69457#(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; {69458#(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-28 10:12:54,746 INFO L290 TraceCheckUtils]: 13: Hoare triple {69458#(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; {69459#(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-28 10:12:54,924 INFO L290 TraceCheckUtils]: 14: Hoare triple {69459#(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; {69460#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) 4294967295)) (<= 9 main_~y~0) (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~x~0) (* (- 1) main_~y~0) (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296) 9) main_~n~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:12:54,926 INFO L290 TraceCheckUtils]: 15: Hoare triple {69460#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) 4294967295)) (<= 9 main_~y~0) (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~x~0) (* (- 1) main_~y~0) (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296) 9) main_~n~0) (<= main_~y~0 9))} assume !(~x~0 % 4294967296 > 0); {69461#(and (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) 9) main_~n~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:12:54,926 INFO L290 TraceCheckUtils]: 16: Hoare triple {69461#(and (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) 9) main_~n~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {69462#(and (<= main_~z~0 9) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 9) main_~n~0))} is VALID [2022-04-28 10:12:54,927 INFO L290 TraceCheckUtils]: 17: Hoare triple {69462#(and (<= main_~z~0 9) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 9) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {69463#(and (<= main_~z~0 8) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 9) main_~n~0))} is VALID [2022-04-28 10:12:54,928 INFO L290 TraceCheckUtils]: 18: Hoare triple {69463#(and (<= main_~z~0 8) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 9) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {69464#(and (<= main_~z~0 7) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 9) main_~n~0))} is VALID [2022-04-28 10:12:54,929 INFO L290 TraceCheckUtils]: 19: Hoare triple {69464#(and (<= main_~z~0 7) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 9) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {69465#(and (<= main_~z~0 6) (<= (+ 9 (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} is VALID [2022-04-28 10:12:54,930 INFO L290 TraceCheckUtils]: 20: Hoare triple {69465#(and (<= main_~z~0 6) (<= (+ 9 (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {69466#(and (<= main_~z~0 5) (<= (+ 9 (* (div (+ 4294967291 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} is VALID [2022-04-28 10:12:54,931 INFO L290 TraceCheckUtils]: 21: Hoare triple {69466#(and (<= main_~z~0 5) (<= (+ 9 (* (div (+ 4294967291 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {69467#(and (<= main_~z~0 4) (<= (+ 9 (* (div (+ 4294967290 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} is VALID [2022-04-28 10:12:54,932 INFO L290 TraceCheckUtils]: 22: Hoare triple {69467#(and (<= main_~z~0 4) (<= (+ 9 (* (div (+ 4294967290 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {69468#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967289) 4294967296) 4294967296) 9) main_~n~0) (<= main_~z~0 3))} is VALID [2022-04-28 10:12:54,933 INFO L290 TraceCheckUtils]: 23: Hoare triple {69468#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967289) 4294967296) 4294967296) 9) main_~n~0) (<= main_~z~0 3))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {69469#(and (<= main_~z~0 2) (<= (+ 9 (* (div (+ 4294967288 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} is VALID [2022-04-28 10:12:54,934 INFO L290 TraceCheckUtils]: 24: Hoare triple {69469#(and (<= main_~z~0 2) (<= (+ 9 (* (div (+ 4294967288 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {69470#(and (<= (+ 9 (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967287) 4294967296) 4294967296)) main_~n~0) (<= main_~z~0 1))} is VALID [2022-04-28 10:12:54,935 INFO L290 TraceCheckUtils]: 25: Hoare triple {69470#(and (<= (+ 9 (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967287) 4294967296) 4294967296)) main_~n~0) (<= main_~z~0 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {69471#(and (<= main_~z~0 0) (<= (+ 9 (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967286) 4294967296) 4294967296)) main_~n~0))} is VALID [2022-04-28 10:12:54,935 INFO L290 TraceCheckUtils]: 26: Hoare triple {69471#(and (<= main_~z~0 0) (<= (+ 9 (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967286) 4294967296) 4294967296)) main_~n~0))} assume !(~z~0 % 4294967296 > 0); {69471#(and (<= main_~z~0 0) (<= (+ 9 (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967286) 4294967296) 4294967296)) main_~n~0))} is VALID [2022-04-28 10:12:54,936 INFO L290 TraceCheckUtils]: 27: Hoare triple {69471#(and (<= main_~z~0 0) (<= (+ 9 (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967286) 4294967296) 4294967296)) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {69470#(and (<= (+ 9 (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967287) 4294967296) 4294967296)) main_~n~0) (<= main_~z~0 1))} is VALID [2022-04-28 10:12:54,937 INFO L290 TraceCheckUtils]: 28: Hoare triple {69470#(and (<= (+ 9 (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967287) 4294967296) 4294967296)) main_~n~0) (<= main_~z~0 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {69469#(and (<= main_~z~0 2) (<= (+ 9 (* (div (+ 4294967288 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} is VALID [2022-04-28 10:12:54,938 INFO L290 TraceCheckUtils]: 29: Hoare triple {69469#(and (<= main_~z~0 2) (<= (+ 9 (* (div (+ 4294967288 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {69468#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967289) 4294967296) 4294967296) 9) main_~n~0) (<= main_~z~0 3))} is VALID [2022-04-28 10:12:54,939 INFO L290 TraceCheckUtils]: 30: Hoare triple {69468#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967289) 4294967296) 4294967296) 9) main_~n~0) (<= main_~z~0 3))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {69467#(and (<= main_~z~0 4) (<= (+ 9 (* (div (+ 4294967290 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} is VALID [2022-04-28 10:12:54,940 INFO L290 TraceCheckUtils]: 31: Hoare triple {69467#(and (<= main_~z~0 4) (<= (+ 9 (* (div (+ 4294967290 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {69466#(and (<= main_~z~0 5) (<= (+ 9 (* (div (+ 4294967291 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} is VALID [2022-04-28 10:12:54,941 INFO L290 TraceCheckUtils]: 32: Hoare triple {69466#(and (<= main_~z~0 5) (<= (+ 9 (* (div (+ 4294967291 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {69465#(and (<= main_~z~0 6) (<= (+ 9 (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} is VALID [2022-04-28 10:12:54,942 INFO L290 TraceCheckUtils]: 33: Hoare triple {69465#(and (<= main_~z~0 6) (<= (+ 9 (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {69464#(and (<= main_~z~0 7) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 9) main_~n~0))} is VALID [2022-04-28 10:12:54,943 INFO L290 TraceCheckUtils]: 34: Hoare triple {69464#(and (<= main_~z~0 7) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 9) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {69463#(and (<= main_~z~0 8) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 9) main_~n~0))} is VALID [2022-04-28 10:12:54,945 INFO L290 TraceCheckUtils]: 35: Hoare triple {69463#(and (<= main_~z~0 8) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 9) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {69472#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-28 10:12:54,945 INFO L290 TraceCheckUtils]: 36: Hoare triple {69472#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {69472#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-28 10:12:54,946 INFO L272 TraceCheckUtils]: 37: Hoare triple {69472#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {69473#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:12:54,946 INFO L290 TraceCheckUtils]: 38: Hoare triple {69473#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {69474#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 10:12:54,946 INFO L290 TraceCheckUtils]: 39: Hoare triple {69474#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {69447#false} is VALID [2022-04-28 10:12:54,946 INFO L290 TraceCheckUtils]: 40: Hoare triple {69447#false} assume !false; {69447#false} is VALID [2022-04-28 10:12:54,947 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 0 proven. 135 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:12:54,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:12:54,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073653781] [2022-04-28 10:12:54,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073653781] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:12:54,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [678589486] [2022-04-28 10:12:54,947 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:12:54,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:12:54,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:12:54,948 INFO L229 MonitoredProcess]: Starting monitored process 85 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:12:54,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (85)] Waiting until timeout for monitored process [2022-04-28 10:12:55,267 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:12:55,267 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:12:55,268 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 86 conjunts are in the unsatisfiable core [2022-04-28 10:12:55,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:12:55,318 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:12:56,955 INFO L272 TraceCheckUtils]: 0: Hoare triple {69446#true} call ULTIMATE.init(); {69446#true} is VALID [2022-04-28 10:12:56,955 INFO L290 TraceCheckUtils]: 1: Hoare triple {69446#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(10, 2);call #Ultimate.allocInit(12, 3); {69446#true} is VALID [2022-04-28 10:12:56,955 INFO L290 TraceCheckUtils]: 2: Hoare triple {69446#true} assume true; {69446#true} is VALID [2022-04-28 10:12:56,955 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {69446#true} {69446#true} #61#return; {69446#true} is VALID [2022-04-28 10:12:56,955 INFO L272 TraceCheckUtils]: 4: Hoare triple {69446#true} call #t~ret11 := main(); {69446#true} is VALID [2022-04-28 10:12:56,955 INFO L290 TraceCheckUtils]: 5: Hoare triple {69446#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {69451#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-28 10:12:56,956 INFO L290 TraceCheckUtils]: 6: Hoare triple {69451#(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; {69497#(and (= (+ main_~x~0 1) main_~n~0) (= main_~y~0 1))} is VALID [2022-04-28 10:12:56,956 INFO L290 TraceCheckUtils]: 7: Hoare triple {69497#(and (= (+ main_~x~0 1) main_~n~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; {69501#(and (= main_~y~0 2) (= (+ main_~x~0 1) (+ (- 1) main_~n~0)))} is VALID [2022-04-28 10:12:56,957 INFO L290 TraceCheckUtils]: 8: Hoare triple {69501#(and (= main_~y~0 2) (= (+ main_~x~0 1) (+ (- 1) 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; {69505#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) (+ main_~x~0 2)))} is VALID [2022-04-28 10:12:56,957 INFO L290 TraceCheckUtils]: 9: Hoare triple {69505#(and (= 2 (+ (- 1) main_~y~0)) (= (+ (- 1) main_~n~0) (+ main_~x~0 2)))} 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; {69509#(and (= (+ main_~n~0 (- 3)) (+ main_~x~0 1)) (= (+ (- 2) main_~y~0) 2))} is VALID [2022-04-28 10:12:56,958 INFO L290 TraceCheckUtils]: 10: Hoare triple {69509#(and (= (+ main_~n~0 (- 3)) (+ main_~x~0 1)) (= (+ (- 2) main_~y~0) 2))} 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; {69513#(and (< 0 (mod (+ main_~x~0 1) 4294967296)) (= (+ main_~y~0 (- 3)) 2) (= (+ main_~n~0 (- 3)) (+ main_~x~0 2)))} is VALID [2022-04-28 10:12:56,959 INFO L290 TraceCheckUtils]: 11: Hoare triple {69513#(and (< 0 (mod (+ main_~x~0 1) 4294967296)) (= (+ main_~y~0 (- 3)) 2) (= (+ main_~n~0 (- 3)) (+ main_~x~0 2)))} 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; {69517#(and (= main_~y~0 6) (= (+ main_~x~0 1) (+ main_~n~0 (- 5))) (< 0 (mod (+ 4294967292 main_~n~0) 4294967296)))} is VALID [2022-04-28 10:12:56,961 INFO L290 TraceCheckUtils]: 12: Hoare triple {69517#(and (= main_~y~0 6) (= (+ main_~x~0 1) (+ main_~n~0 (- 5))) (< 0 (mod (+ 4294967292 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; {69521#(and (< 0 (mod (+ 4294967290 main_~n~0) 4294967296)) (= (+ main_~x~0 1) (+ main_~n~0 (- 6))) (= 7 main_~y~0) (< 0 (mod (+ 4294967292 main_~n~0) 4294967296)))} is VALID [2022-04-28 10:12:56,962 INFO L290 TraceCheckUtils]: 13: Hoare triple {69521#(and (< 0 (mod (+ 4294967290 main_~n~0) 4294967296)) (= (+ main_~x~0 1) (+ main_~n~0 (- 6))) (= 7 main_~y~0) (< 0 (mod (+ 4294967292 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; {69525#(and (< 0 (mod (+ 4294967290 main_~n~0) 4294967296)) (= 7 (+ (- 1) main_~y~0)) (< 0 (mod (+ main_~n~0 4294967289) 4294967296)) (= (+ main_~x~0 1) (+ main_~n~0 (- 7))) (< 0 (mod (+ 4294967292 main_~n~0) 4294967296)))} is VALID [2022-04-28 10:12:56,963 INFO L290 TraceCheckUtils]: 14: Hoare triple {69525#(and (< 0 (mod (+ 4294967290 main_~n~0) 4294967296)) (= 7 (+ (- 1) main_~y~0)) (< 0 (mod (+ main_~n~0 4294967289) 4294967296)) (= (+ main_~x~0 1) (+ main_~n~0 (- 7))) (< 0 (mod (+ 4294967292 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; {69529#(and (< 0 (mod (+ 4294967290 main_~n~0) 4294967296)) (= main_~y~0 9) (= (+ main_~x~0 2) (+ main_~n~0 (- 7))) (< 0 (mod (+ main_~n~0 4294967289) 4294967296)) (< 0 (mod (+ main_~x~0 1) 4294967296)) (< 0 (mod (+ 4294967292 main_~n~0) 4294967296)))} is VALID [2022-04-28 10:12:56,971 INFO L290 TraceCheckUtils]: 15: Hoare triple {69529#(and (< 0 (mod (+ 4294967290 main_~n~0) 4294967296)) (= main_~y~0 9) (= (+ main_~x~0 2) (+ main_~n~0 (- 7))) (< 0 (mod (+ main_~n~0 4294967289) 4294967296)) (< 0 (mod (+ main_~x~0 1) 4294967296)) (< 0 (mod (+ 4294967292 main_~n~0) 4294967296)))} assume !(~x~0 % 4294967296 > 0); {69461#(and (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) 9) main_~n~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:12:56,971 INFO L290 TraceCheckUtils]: 16: Hoare triple {69461#(and (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) 9) main_~n~0) (<= main_~y~0 9))} ~z~0 := ~y~0; {69462#(and (<= main_~z~0 9) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 9) main_~n~0))} is VALID [2022-04-28 10:12:56,972 INFO L290 TraceCheckUtils]: 17: Hoare triple {69462#(and (<= main_~z~0 9) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 9) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {69463#(and (<= main_~z~0 8) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 9) main_~n~0))} is VALID [2022-04-28 10:12:56,973 INFO L290 TraceCheckUtils]: 18: Hoare triple {69463#(and (<= main_~z~0 8) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 9) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {69464#(and (<= main_~z~0 7) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 9) main_~n~0))} is VALID [2022-04-28 10:12:56,974 INFO L290 TraceCheckUtils]: 19: Hoare triple {69464#(and (<= main_~z~0 7) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 9) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {69465#(and (<= main_~z~0 6) (<= (+ 9 (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} is VALID [2022-04-28 10:12:56,975 INFO L290 TraceCheckUtils]: 20: Hoare triple {69465#(and (<= main_~z~0 6) (<= (+ 9 (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {69466#(and (<= main_~z~0 5) (<= (+ 9 (* (div (+ 4294967291 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} is VALID [2022-04-28 10:12:56,975 INFO L290 TraceCheckUtils]: 21: Hoare triple {69466#(and (<= main_~z~0 5) (<= (+ 9 (* (div (+ 4294967291 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {69467#(and (<= main_~z~0 4) (<= (+ 9 (* (div (+ 4294967290 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} is VALID [2022-04-28 10:12:56,976 INFO L290 TraceCheckUtils]: 22: Hoare triple {69467#(and (<= main_~z~0 4) (<= (+ 9 (* (div (+ 4294967290 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {69468#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967289) 4294967296) 4294967296) 9) main_~n~0) (<= main_~z~0 3))} is VALID [2022-04-28 10:12:56,977 INFO L290 TraceCheckUtils]: 23: Hoare triple {69468#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967289) 4294967296) 4294967296) 9) main_~n~0) (<= main_~z~0 3))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {69469#(and (<= main_~z~0 2) (<= (+ 9 (* (div (+ 4294967288 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} is VALID [2022-04-28 10:12:56,978 INFO L290 TraceCheckUtils]: 24: Hoare triple {69469#(and (<= main_~z~0 2) (<= (+ 9 (* (div (+ 4294967288 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {69470#(and (<= (+ 9 (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967287) 4294967296) 4294967296)) main_~n~0) (<= main_~z~0 1))} is VALID [2022-04-28 10:12:56,979 INFO L290 TraceCheckUtils]: 25: Hoare triple {69470#(and (<= (+ 9 (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967287) 4294967296) 4294967296)) main_~n~0) (<= main_~z~0 1))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {69471#(and (<= main_~z~0 0) (<= (+ 9 (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967286) 4294967296) 4294967296)) main_~n~0))} is VALID [2022-04-28 10:12:56,980 INFO L290 TraceCheckUtils]: 26: Hoare triple {69471#(and (<= main_~z~0 0) (<= (+ 9 (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967286) 4294967296) 4294967296)) main_~n~0))} assume !(~z~0 % 4294967296 > 0); {69471#(and (<= main_~z~0 0) (<= (+ 9 (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967286) 4294967296) 4294967296)) main_~n~0))} is VALID [2022-04-28 10:12:56,981 INFO L290 TraceCheckUtils]: 27: Hoare triple {69471#(and (<= main_~z~0 0) (<= (+ 9 (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967286) 4294967296) 4294967296)) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {69470#(and (<= (+ 9 (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967287) 4294967296) 4294967296)) main_~n~0) (<= main_~z~0 1))} is VALID [2022-04-28 10:12:56,981 INFO L290 TraceCheckUtils]: 28: Hoare triple {69470#(and (<= (+ 9 (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967287) 4294967296) 4294967296)) main_~n~0) (<= main_~z~0 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {69469#(and (<= main_~z~0 2) (<= (+ 9 (* (div (+ 4294967288 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} is VALID [2022-04-28 10:12:56,982 INFO L290 TraceCheckUtils]: 29: Hoare triple {69469#(and (<= main_~z~0 2) (<= (+ 9 (* (div (+ 4294967288 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {69468#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967289) 4294967296) 4294967296) 9) main_~n~0) (<= main_~z~0 3))} is VALID [2022-04-28 10:12:56,983 INFO L290 TraceCheckUtils]: 30: Hoare triple {69468#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967289) 4294967296) 4294967296) 9) main_~n~0) (<= main_~z~0 3))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {69467#(and (<= main_~z~0 4) (<= (+ 9 (* (div (+ 4294967290 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} is VALID [2022-04-28 10:12:56,984 INFO L290 TraceCheckUtils]: 31: Hoare triple {69467#(and (<= main_~z~0 4) (<= (+ 9 (* (div (+ 4294967290 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {69466#(and (<= main_~z~0 5) (<= (+ 9 (* (div (+ 4294967291 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} is VALID [2022-04-28 10:12:56,985 INFO L290 TraceCheckUtils]: 32: Hoare triple {69466#(and (<= main_~z~0 5) (<= (+ 9 (* (div (+ 4294967291 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {69465#(and (<= main_~z~0 6) (<= (+ 9 (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} is VALID [2022-04-28 10:12:56,986 INFO L290 TraceCheckUtils]: 33: Hoare triple {69465#(and (<= main_~z~0 6) (<= (+ 9 (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {69464#(and (<= main_~z~0 7) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 9) main_~n~0))} is VALID [2022-04-28 10:12:56,987 INFO L290 TraceCheckUtils]: 34: Hoare triple {69464#(and (<= main_~z~0 7) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 9) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {69463#(and (<= main_~z~0 8) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 9) main_~n~0))} is VALID [2022-04-28 10:12:56,987 INFO L290 TraceCheckUtils]: 35: Hoare triple {69463#(and (<= main_~z~0 8) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 9) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {69462#(and (<= main_~z~0 9) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 9) main_~n~0))} is VALID [2022-04-28 10:12:56,988 INFO L290 TraceCheckUtils]: 36: Hoare triple {69462#(and (<= main_~z~0 9) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 9) main_~n~0))} assume !(~y~0 % 4294967296 > 0); {69462#(and (<= main_~z~0 9) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 9) main_~n~0))} is VALID [2022-04-28 10:12:56,989 INFO L272 TraceCheckUtils]: 37: Hoare triple {69462#(and (<= main_~z~0 9) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 9) main_~n~0))} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {69599#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:12:56,990 INFO L290 TraceCheckUtils]: 38: Hoare triple {69599#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {69603#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:12:56,990 INFO L290 TraceCheckUtils]: 39: Hoare triple {69603#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {69447#false} is VALID [2022-04-28 10:12:56,990 INFO L290 TraceCheckUtils]: 40: Hoare triple {69447#false} assume !false; {69447#false} is VALID [2022-04-28 10:12:56,990 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 0 proven. 135 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:12:56,990 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:13:05,052 INFO L290 TraceCheckUtils]: 40: Hoare triple {69447#false} assume !false; {69447#false} is VALID [2022-04-28 10:13:05,052 INFO L290 TraceCheckUtils]: 39: Hoare triple {69603#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {69447#false} is VALID [2022-04-28 10:13:05,052 INFO L290 TraceCheckUtils]: 38: Hoare triple {69599#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {69603#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:13:05,053 INFO L272 TraceCheckUtils]: 37: Hoare triple {69472#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {69599#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:13:05,054 INFO L290 TraceCheckUtils]: 36: Hoare triple {69472#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {69472#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-28 10:13:05,054 INFO L290 TraceCheckUtils]: 35: Hoare triple {69625#(and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {69472#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-28 10:13:05,055 INFO L290 TraceCheckUtils]: 34: Hoare triple {69629#(and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {69625#(and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-28 10:13:05,056 INFO L290 TraceCheckUtils]: 33: Hoare triple {69633#(and (< (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {69629#(and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-28 10:13:05,057 INFO L290 TraceCheckUtils]: 32: Hoare triple {69637#(and (< (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) main_~n~0) (+ 5 main_~z~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) main_~n~0)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {69633#(and (< (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296))))} is VALID [2022-04-28 10:13:05,058 INFO L290 TraceCheckUtils]: 31: Hoare triple {69641#(and (<= (+ 5 main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ 5 main_~z~0) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ 5 main_~z~0) 4294967296) 4294967296)) (+ main_~z~0 6 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {69637#(and (< (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) main_~n~0) (+ 5 main_~z~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-28 10:13:05,059 INFO L290 TraceCheckUtils]: 30: Hoare triple {69645#(and (< (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) main_~n~0) (+ 7 main_~z~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 6 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) main_~n~0)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {69641#(and (<= (+ 5 main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ 5 main_~z~0) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ 5 main_~z~0) 4294967296) 4294967296)) (+ main_~z~0 6 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-28 10:13:05,060 INFO L290 TraceCheckUtils]: 29: Hoare triple {69649#(and (< (+ main_~n~0 (* (div (+ 7 main_~z~0) 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 8)) (<= (+ 7 main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ 7 main_~z~0) 4294967296) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {69645#(and (< (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) main_~n~0) (+ 7 main_~z~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 6 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-28 10:13:05,061 INFO L290 TraceCheckUtils]: 28: Hoare triple {69653#(and (< (+ main_~n~0 (* (div (+ main_~z~0 8) 4294967296) 4294967296)) (+ main_~z~0 9 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 8) (+ main_~n~0 (* (div (+ main_~z~0 8) 4294967296) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {69649#(and (< (+ main_~n~0 (* (div (+ 7 main_~z~0) 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 8)) (<= (+ 7 main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ 7 main_~z~0) 4294967296) 4294967296))))} is VALID [2022-04-28 10:13:05,061 INFO L290 TraceCheckUtils]: 27: Hoare triple {69657#(and (<= (+ main_~z~0 9 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~z~0 9) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 9) 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 10)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {69653#(and (< (+ main_~n~0 (* (div (+ main_~z~0 8) 4294967296) 4294967296)) (+ main_~z~0 9 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 8) (+ main_~n~0 (* (div (+ main_~z~0 8) 4294967296) 4294967296))))} is VALID [2022-04-28 10:13:05,062 INFO L290 TraceCheckUtils]: 26: Hoare triple {69657#(and (<= (+ main_~z~0 9 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~z~0 9) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 9) 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 10)))} assume !(~z~0 % 4294967296 > 0); {69657#(and (<= (+ main_~z~0 9 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~z~0 9) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 9) 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 10)))} is VALID [2022-04-28 10:13:05,063 INFO L290 TraceCheckUtils]: 25: Hoare triple {69653#(and (< (+ main_~n~0 (* (div (+ main_~z~0 8) 4294967296) 4294967296)) (+ main_~z~0 9 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 8) (+ main_~n~0 (* (div (+ main_~z~0 8) 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {69657#(and (<= (+ main_~z~0 9 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~z~0 9) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 9) 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 10)))} is VALID [2022-04-28 10:13:05,063 INFO L290 TraceCheckUtils]: 24: Hoare triple {69649#(and (< (+ main_~n~0 (* (div (+ 7 main_~z~0) 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 8)) (<= (+ 7 main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ 7 main_~z~0) 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {69653#(and (< (+ main_~n~0 (* (div (+ main_~z~0 8) 4294967296) 4294967296)) (+ main_~z~0 9 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 8) (+ main_~n~0 (* (div (+ main_~z~0 8) 4294967296) 4294967296))))} is VALID [2022-04-28 10:13:05,064 INFO L290 TraceCheckUtils]: 23: Hoare triple {69645#(and (< (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) main_~n~0) (+ 7 main_~z~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 6 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) main_~n~0)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {69649#(and (< (+ main_~n~0 (* (div (+ 7 main_~z~0) 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 8)) (<= (+ 7 main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ 7 main_~z~0) 4294967296) 4294967296))))} is VALID [2022-04-28 10:13:05,065 INFO L290 TraceCheckUtils]: 22: Hoare triple {69641#(and (<= (+ 5 main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ 5 main_~z~0) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ 5 main_~z~0) 4294967296) 4294967296)) (+ main_~z~0 6 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {69645#(and (< (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) main_~n~0) (+ 7 main_~z~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 6 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-28 10:13:05,066 INFO L290 TraceCheckUtils]: 21: Hoare triple {69637#(and (< (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) main_~n~0) (+ 5 main_~z~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) main_~n~0)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {69641#(and (<= (+ 5 main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ 5 main_~z~0) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ 5 main_~z~0) 4294967296) 4294967296)) (+ main_~z~0 6 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-28 10:13:05,067 INFO L290 TraceCheckUtils]: 20: Hoare triple {69633#(and (< (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {69637#(and (< (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) main_~n~0) (+ 5 main_~z~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-28 10:13:05,068 INFO L290 TraceCheckUtils]: 19: Hoare triple {69629#(and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {69633#(and (< (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296))))} is VALID [2022-04-28 10:13:05,069 INFO L290 TraceCheckUtils]: 18: Hoare triple {69625#(and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {69629#(and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-28 10:13:05,069 INFO L290 TraceCheckUtils]: 17: Hoare triple {69472#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {69625#(and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-28 10:13:05,070 INFO L290 TraceCheckUtils]: 16: Hoare triple {69691#(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)))} ~z~0 := ~y~0; {69472#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-28 10:13:05,070 INFO L290 TraceCheckUtils]: 15: Hoare triple {69695#(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); {69691#(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-28 10:13:05,072 INFO L290 TraceCheckUtils]: 14: Hoare triple {69699#(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; {69695#(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-28 10:13:05,073 INFO L290 TraceCheckUtils]: 13: Hoare triple {69703#(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; {69699#(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-28 10:13:05,074 INFO L290 TraceCheckUtils]: 12: Hoare triple {69707#(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; {69703#(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-28 10:13:05,076 INFO L290 TraceCheckUtils]: 11: Hoare triple {69711#(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; {69707#(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-28 10:13:05,077 INFO L290 TraceCheckUtils]: 10: Hoare triple {69715#(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; {69711#(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-28 10:13:05,078 INFO L290 TraceCheckUtils]: 9: Hoare triple {69719#(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; {69715#(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-28 10:13:05,079 INFO L290 TraceCheckUtils]: 8: Hoare triple {69723#(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; {69719#(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-28 10:13:05,080 INFO L290 TraceCheckUtils]: 7: Hoare triple {69727#(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; {69723#(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-28 10:13:05,081 INFO L290 TraceCheckUtils]: 6: Hoare triple {69731#(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; {69727#(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-28 10:13:05,082 INFO L290 TraceCheckUtils]: 5: Hoare triple {69446#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {69731#(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-28 10:13:05,082 INFO L272 TraceCheckUtils]: 4: Hoare triple {69446#true} call #t~ret11 := main(); {69446#true} is VALID [2022-04-28 10:13:05,082 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {69446#true} {69446#true} #61#return; {69446#true} is VALID [2022-04-28 10:13:05,082 INFO L290 TraceCheckUtils]: 2: Hoare triple {69446#true} assume true; {69446#true} is VALID [2022-04-28 10:13:05,082 INFO L290 TraceCheckUtils]: 1: Hoare triple {69446#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(10, 2);call #Ultimate.allocInit(12, 3); {69446#true} is VALID [2022-04-28 10:13:05,082 INFO L272 TraceCheckUtils]: 0: Hoare triple {69446#true} call ULTIMATE.init(); {69446#true} is VALID [2022-04-28 10:13:05,083 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 0 proven. 135 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:13:05,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [678589486] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:13:05,083 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:13:05,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 25, 25] total 58 [2022-04-28 10:13:05,083 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:13:05,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1558949454] [2022-04-28 10:13:05,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1558949454] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:13:05,083 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:13:05,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-04-28 10:13:05,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132916613] [2022-04-28 10:13:05,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:13:05,084 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 25 states have internal predecessors, (37), 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 41 [2022-04-28 10:13:05,084 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:13:05,084 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 27 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 25 states have internal predecessors, (37), 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-28 10:13:05,682 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:13:05,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-04-28 10:13:05,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:13:05,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-04-28 10:13:05,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=318, Invalid=2987, Unknown=1, NotChecked=0, Total=3306 [2022-04-28 10:13:05,683 INFO L87 Difference]: Start difference. First operand 143 states and 181 transitions. Second operand has 27 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 25 states have internal predecessors, (37), 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-28 10:13:08,180 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-28 10:13:14,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:13:14,030 INFO L93 Difference]: Finished difference Result 172 states and 210 transitions. [2022-04-28 10:13:14,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-04-28 10:13:14,030 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 25 states have internal predecessors, (37), 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 41 [2022-04-28 10:13:14,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:13:14,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 25 states have internal predecessors, (37), 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-28 10:13:14,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 61 transitions. [2022-04-28 10:13:14,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 25 states have internal predecessors, (37), 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-28 10:13:14,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 61 transitions. [2022-04-28 10:13:14,031 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 61 transitions. [2022-04-28 10:13:14,131 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:13:14,132 INFO L225 Difference]: With dead ends: 172 [2022-04-28 10:13:14,132 INFO L226 Difference]: Without dead ends: 132 [2022-04-28 10:13:14,133 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 57 SyntacticMatches, 4 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 989 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=639, Invalid=7369, Unknown=2, NotChecked=0, Total=8010 [2022-04-28 10:13:14,133 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 20 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 920 mSolverCounterSat, 27 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 948 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 920 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-04-28 10:13:14,133 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 134 Invalid, 948 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 920 Invalid, 1 Unknown, 0 Unchecked, 3.4s Time] [2022-04-28 10:13:14,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-04-28 10:13:14,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2022-04-28 10:13:14,271 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:13:14,271 INFO L82 GeneralOperation]: Start isEquivalent. First operand 132 states. Second operand has 132 states, 127 states have (on average 1.2913385826771653) internal successors, (164), 127 states have internal predecessors, (164), 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-28 10:13:14,271 INFO L74 IsIncluded]: Start isIncluded. First operand 132 states. Second operand has 132 states, 127 states have (on average 1.2913385826771653) internal successors, (164), 127 states have internal predecessors, (164), 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-28 10:13:14,271 INFO L87 Difference]: Start difference. First operand 132 states. Second operand has 132 states, 127 states have (on average 1.2913385826771653) internal successors, (164), 127 states have internal predecessors, (164), 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-28 10:13:14,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:13:14,272 INFO L93 Difference]: Finished difference Result 132 states and 168 transitions. [2022-04-28 10:13:14,272 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 168 transitions. [2022-04-28 10:13:14,273 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:13:14,273 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:13:14,273 INFO L74 IsIncluded]: Start isIncluded. First operand has 132 states, 127 states have (on average 1.2913385826771653) internal successors, (164), 127 states have internal predecessors, (164), 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 132 states. [2022-04-28 10:13:14,273 INFO L87 Difference]: Start difference. First operand has 132 states, 127 states have (on average 1.2913385826771653) internal successors, (164), 127 states have internal predecessors, (164), 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 132 states. [2022-04-28 10:13:14,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:13:14,274 INFO L93 Difference]: Finished difference Result 132 states and 168 transitions. [2022-04-28 10:13:14,274 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 168 transitions. [2022-04-28 10:13:14,274 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:13:14,274 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:13:14,274 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:13:14,274 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:13:14,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 127 states have (on average 1.2913385826771653) internal successors, (164), 127 states have internal predecessors, (164), 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-28 10:13:14,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 168 transitions. [2022-04-28 10:13:14,275 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 168 transitions. Word has length 41 [2022-04-28 10:13:14,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:13:14,275 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 168 transitions. [2022-04-28 10:13:14,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 25 states have internal predecessors, (37), 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-28 10:13:14,275 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 132 states and 168 transitions. [2022-04-28 10:13:18,449 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 168 edges. 168 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:13:18,449 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 168 transitions. [2022-04-28 10:13:18,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-28 10:13:18,449 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:13:18,449 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:13:18,453 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (85)] Forceful destruction successful, exit code 0 [2022-04-28 10:13:18,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84,85 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:13:18,653 INFO L420 AbstractCegarLoop]: === Iteration 86 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:13:18,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:13:18,654 INFO L85 PathProgramCache]: Analyzing trace with hash -600496849, now seen corresponding path program 117 times [2022-04-28 10:13:18,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:13:18,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1468413099] [2022-04-28 10:13:18,656 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:13:18,656 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:13:18,656 INFO L85 PathProgramCache]: Analyzing trace with hash -600496849, now seen corresponding path program 118 times [2022-04-28 10:13:18,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:13:18,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299075199] [2022-04-28 10:13:18,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:13:18,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:13:18,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:13:18,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:13:18,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:13:18,945 INFO L290 TraceCheckUtils]: 0: Hoare triple {70712#(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(10, 2);call #Ultimate.allocInit(12, 3); {70688#true} is VALID [2022-04-28 10:13:18,946 INFO L290 TraceCheckUtils]: 1: Hoare triple {70688#true} assume true; {70688#true} is VALID [2022-04-28 10:13:18,946 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {70688#true} {70688#true} #61#return; {70688#true} is VALID [2022-04-28 10:13:18,946 INFO L272 TraceCheckUtils]: 0: Hoare triple {70688#true} call ULTIMATE.init(); {70712#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:13:18,946 INFO L290 TraceCheckUtils]: 1: Hoare triple {70712#(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(10, 2);call #Ultimate.allocInit(12, 3); {70688#true} is VALID [2022-04-28 10:13:18,947 INFO L290 TraceCheckUtils]: 2: Hoare triple {70688#true} assume true; {70688#true} is VALID [2022-04-28 10:13:18,947 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {70688#true} {70688#true} #61#return; {70688#true} is VALID [2022-04-28 10:13:18,947 INFO L272 TraceCheckUtils]: 4: Hoare triple {70688#true} call #t~ret11 := main(); {70688#true} is VALID [2022-04-28 10:13:18,947 INFO L290 TraceCheckUtils]: 5: Hoare triple {70688#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {70693#(= main_~y~0 0)} is VALID [2022-04-28 10:13:18,947 INFO L290 TraceCheckUtils]: 6: Hoare triple {70693#(= 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; {70694#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:13:18,948 INFO L290 TraceCheckUtils]: 7: Hoare triple {70694#(and (<= 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; {70695#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:13:18,948 INFO L290 TraceCheckUtils]: 8: Hoare triple {70695#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {70696#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:13:18,949 INFO L290 TraceCheckUtils]: 9: Hoare triple {70696#(and (<= main_~y~0 3) (<= 3 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; {70697#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:13:18,949 INFO L290 TraceCheckUtils]: 10: Hoare triple {70697#(and (<= main_~y~0 4) (<= 4 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; {70698#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:13:18,950 INFO L290 TraceCheckUtils]: 11: Hoare triple {70698#(and (<= 5 main_~y~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; {70699#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:13:18,950 INFO L290 TraceCheckUtils]: 12: Hoare triple {70699#(and (<= main_~y~0 6) (<= 6 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; {70700#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:13:18,951 INFO L290 TraceCheckUtils]: 13: Hoare triple {70700#(and (<= 7 main_~y~0) (<= main_~y~0 7))} 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; {70701#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:13:18,951 INFO L290 TraceCheckUtils]: 14: Hoare triple {70701#(and (<= main_~y~0 8) (<= 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; {70702#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:13:18,952 INFO L290 TraceCheckUtils]: 15: Hoare triple {70702#(and (<= 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; {70703#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:13:18,952 INFO L290 TraceCheckUtils]: 16: Hoare triple {70703#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {70703#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:13:18,952 INFO L290 TraceCheckUtils]: 17: Hoare triple {70703#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {70704#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:13:18,953 INFO L290 TraceCheckUtils]: 18: Hoare triple {70704#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {70705#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:13:18,953 INFO L290 TraceCheckUtils]: 19: Hoare triple {70705#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {70706#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:13:18,954 INFO L290 TraceCheckUtils]: 20: Hoare triple {70706#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {70707#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:13:18,954 INFO L290 TraceCheckUtils]: 21: Hoare triple {70707#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {70708#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:13:18,955 INFO L290 TraceCheckUtils]: 22: Hoare triple {70708#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {70709#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:13:18,955 INFO L290 TraceCheckUtils]: 23: Hoare triple {70709#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {70710#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:13:18,956 INFO L290 TraceCheckUtils]: 24: Hoare triple {70710#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {70711#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:13:18,956 INFO L290 TraceCheckUtils]: 25: Hoare triple {70711#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {70689#false} is VALID [2022-04-28 10:13:18,956 INFO L290 TraceCheckUtils]: 26: Hoare triple {70689#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {70689#false} is VALID [2022-04-28 10:13:18,956 INFO L290 TraceCheckUtils]: 27: Hoare triple {70689#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {70689#false} is VALID [2022-04-28 10:13:18,956 INFO L290 TraceCheckUtils]: 28: Hoare triple {70689#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {70689#false} is VALID [2022-04-28 10:13:18,956 INFO L290 TraceCheckUtils]: 29: Hoare triple {70689#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {70689#false} is VALID [2022-04-28 10:13:18,956 INFO L290 TraceCheckUtils]: 30: Hoare triple {70689#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {70689#false} is VALID [2022-04-28 10:13:18,956 INFO L290 TraceCheckUtils]: 31: Hoare triple {70689#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {70689#false} is VALID [2022-04-28 10:13:18,956 INFO L290 TraceCheckUtils]: 32: Hoare triple {70689#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {70689#false} is VALID [2022-04-28 10:13:18,957 INFO L290 TraceCheckUtils]: 33: Hoare triple {70689#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {70689#false} is VALID [2022-04-28 10:13:18,957 INFO L290 TraceCheckUtils]: 34: Hoare triple {70689#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {70689#false} is VALID [2022-04-28 10:13:18,957 INFO L290 TraceCheckUtils]: 35: Hoare triple {70689#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {70689#false} is VALID [2022-04-28 10:13:18,957 INFO L290 TraceCheckUtils]: 36: Hoare triple {70689#false} assume !(~y~0 % 4294967296 > 0); {70689#false} is VALID [2022-04-28 10:13:18,957 INFO L272 TraceCheckUtils]: 37: Hoare triple {70689#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {70689#false} is VALID [2022-04-28 10:13:18,957 INFO L290 TraceCheckUtils]: 38: Hoare triple {70689#false} ~cond := #in~cond; {70689#false} is VALID [2022-04-28 10:13:18,957 INFO L290 TraceCheckUtils]: 39: Hoare triple {70689#false} assume 0 == ~cond; {70689#false} is VALID [2022-04-28 10:13:18,957 INFO L290 TraceCheckUtils]: 40: Hoare triple {70689#false} assume !false; {70689#false} is VALID [2022-04-28 10:13:18,957 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 83 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-04-28 10:13:18,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:13:18,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299075199] [2022-04-28 10:13:18,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299075199] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:13:18,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1627880061] [2022-04-28 10:13:18,957 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:13:18,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:13:18,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:13:18,958 INFO L229 MonitoredProcess]: Starting monitored process 86 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:13:18,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (86)] Waiting until timeout for monitored process [2022-04-28 10:13:19,004 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:13:19,004 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:13:19,005 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 54 conjunts are in the unsatisfiable core [2022-04-28 10:13:19,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:13:19,014 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:13:19,374 INFO L272 TraceCheckUtils]: 0: Hoare triple {70688#true} call ULTIMATE.init(); {70688#true} is VALID [2022-04-28 10:13:19,374 INFO L290 TraceCheckUtils]: 1: Hoare triple {70688#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(10, 2);call #Ultimate.allocInit(12, 3); {70688#true} is VALID [2022-04-28 10:13:19,374 INFO L290 TraceCheckUtils]: 2: Hoare triple {70688#true} assume true; {70688#true} is VALID [2022-04-28 10:13:19,374 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {70688#true} {70688#true} #61#return; {70688#true} is VALID [2022-04-28 10:13:19,374 INFO L272 TraceCheckUtils]: 4: Hoare triple {70688#true} call #t~ret11 := main(); {70688#true} is VALID [2022-04-28 10:13:19,375 INFO L290 TraceCheckUtils]: 5: Hoare triple {70688#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {70693#(= main_~y~0 0)} is VALID [2022-04-28 10:13:19,375 INFO L290 TraceCheckUtils]: 6: Hoare triple {70693#(= 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; {70694#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:13:19,375 INFO L290 TraceCheckUtils]: 7: Hoare triple {70694#(and (<= 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; {70695#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:13:19,376 INFO L290 TraceCheckUtils]: 8: Hoare triple {70695#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {70696#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:13:19,376 INFO L290 TraceCheckUtils]: 9: Hoare triple {70696#(and (<= main_~y~0 3) (<= 3 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; {70697#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:13:19,377 INFO L290 TraceCheckUtils]: 10: Hoare triple {70697#(and (<= main_~y~0 4) (<= 4 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; {70698#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:13:19,377 INFO L290 TraceCheckUtils]: 11: Hoare triple {70698#(and (<= 5 main_~y~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; {70699#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:13:19,378 INFO L290 TraceCheckUtils]: 12: Hoare triple {70699#(and (<= main_~y~0 6) (<= 6 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; {70700#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:13:19,378 INFO L290 TraceCheckUtils]: 13: Hoare triple {70700#(and (<= 7 main_~y~0) (<= main_~y~0 7))} 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; {70701#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:13:19,379 INFO L290 TraceCheckUtils]: 14: Hoare triple {70701#(and (<= main_~y~0 8) (<= 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; {70702#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:13:19,379 INFO L290 TraceCheckUtils]: 15: Hoare triple {70702#(and (<= 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; {70703#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:13:19,380 INFO L290 TraceCheckUtils]: 16: Hoare triple {70703#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {70703#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:13:19,380 INFO L290 TraceCheckUtils]: 17: Hoare triple {70703#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {70767#(and (= main_~z~0 main_~y~0) (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:13:19,380 INFO L290 TraceCheckUtils]: 18: Hoare triple {70767#(and (= main_~z~0 main_~y~0) (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {70771#(and (<= main_~y~0 10) (<= 10 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-28 10:13:19,381 INFO L290 TraceCheckUtils]: 19: Hoare triple {70771#(and (<= main_~y~0 10) (<= 10 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {70775#(and (= main_~y~0 (+ main_~z~0 2)) (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:13:19,382 INFO L290 TraceCheckUtils]: 20: Hoare triple {70775#(and (= main_~y~0 (+ main_~z~0 2)) (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {70779#(and (<= main_~y~0 10) (<= 10 main_~y~0) (= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-28 10:13:19,382 INFO L290 TraceCheckUtils]: 21: Hoare triple {70779#(and (<= main_~y~0 10) (<= 10 main_~y~0) (= main_~y~0 (+ main_~z~0 3)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {70783#(and (<= main_~y~0 10) (<= 10 main_~y~0) (= main_~y~0 (+ main_~z~0 4)))} is VALID [2022-04-28 10:13:19,383 INFO L290 TraceCheckUtils]: 22: Hoare triple {70783#(and (<= main_~y~0 10) (<= 10 main_~y~0) (= main_~y~0 (+ main_~z~0 4)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {70787#(and (<= main_~y~0 10) (= (+ main_~y~0 (- 4)) (+ main_~z~0 1)) (<= 10 main_~y~0))} is VALID [2022-04-28 10:13:19,383 INFO L290 TraceCheckUtils]: 23: Hoare triple {70787#(and (<= main_~y~0 10) (= (+ main_~y~0 (- 4)) (+ main_~z~0 1)) (<= 10 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {70791#(and (= (+ main_~y~0 (- 5)) (+ main_~z~0 1)) (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:13:19,384 INFO L290 TraceCheckUtils]: 24: Hoare triple {70791#(and (= (+ main_~y~0 (- 5)) (+ main_~z~0 1)) (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {70795#(and (<= main_~y~0 10) (<= 10 main_~y~0) (= (+ main_~y~0 (- 6)) (+ main_~z~0 1)))} is VALID [2022-04-28 10:13:19,384 INFO L290 TraceCheckUtils]: 25: Hoare triple {70795#(and (<= main_~y~0 10) (<= 10 main_~y~0) (= (+ main_~y~0 (- 6)) (+ main_~z~0 1)))} assume !(~z~0 % 4294967296 > 0); {70689#false} is VALID [2022-04-28 10:13:19,384 INFO L290 TraceCheckUtils]: 26: Hoare triple {70689#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {70689#false} is VALID [2022-04-28 10:13:19,384 INFO L290 TraceCheckUtils]: 27: Hoare triple {70689#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {70689#false} is VALID [2022-04-28 10:13:19,384 INFO L290 TraceCheckUtils]: 28: Hoare triple {70689#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {70689#false} is VALID [2022-04-28 10:13:19,384 INFO L290 TraceCheckUtils]: 29: Hoare triple {70689#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {70689#false} is VALID [2022-04-28 10:13:19,385 INFO L290 TraceCheckUtils]: 30: Hoare triple {70689#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {70689#false} is VALID [2022-04-28 10:13:19,385 INFO L290 TraceCheckUtils]: 31: Hoare triple {70689#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {70689#false} is VALID [2022-04-28 10:13:19,385 INFO L290 TraceCheckUtils]: 32: Hoare triple {70689#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {70689#false} is VALID [2022-04-28 10:13:19,385 INFO L290 TraceCheckUtils]: 33: Hoare triple {70689#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {70689#false} is VALID [2022-04-28 10:13:19,385 INFO L290 TraceCheckUtils]: 34: Hoare triple {70689#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {70689#false} is VALID [2022-04-28 10:13:19,385 INFO L290 TraceCheckUtils]: 35: Hoare triple {70689#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {70689#false} is VALID [2022-04-28 10:13:19,385 INFO L290 TraceCheckUtils]: 36: Hoare triple {70689#false} assume !(~y~0 % 4294967296 > 0); {70689#false} is VALID [2022-04-28 10:13:19,385 INFO L272 TraceCheckUtils]: 37: Hoare triple {70689#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {70689#false} is VALID [2022-04-28 10:13:19,385 INFO L290 TraceCheckUtils]: 38: Hoare triple {70689#false} ~cond := #in~cond; {70689#false} is VALID [2022-04-28 10:13:19,385 INFO L290 TraceCheckUtils]: 39: Hoare triple {70689#false} assume 0 == ~cond; {70689#false} is VALID [2022-04-28 10:13:19,385 INFO L290 TraceCheckUtils]: 40: Hoare triple {70689#false} assume !false; {70689#false} is VALID [2022-04-28 10:13:19,385 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 83 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-04-28 10:13:19,385 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:13:19,973 INFO L290 TraceCheckUtils]: 40: Hoare triple {70689#false} assume !false; {70689#false} is VALID [2022-04-28 10:13:19,973 INFO L290 TraceCheckUtils]: 39: Hoare triple {70689#false} assume 0 == ~cond; {70689#false} is VALID [2022-04-28 10:13:19,973 INFO L290 TraceCheckUtils]: 38: Hoare triple {70689#false} ~cond := #in~cond; {70689#false} is VALID [2022-04-28 10:13:19,973 INFO L272 TraceCheckUtils]: 37: Hoare triple {70689#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {70689#false} is VALID [2022-04-28 10:13:19,973 INFO L290 TraceCheckUtils]: 36: Hoare triple {70689#false} assume !(~y~0 % 4294967296 > 0); {70689#false} is VALID [2022-04-28 10:13:19,973 INFO L290 TraceCheckUtils]: 35: Hoare triple {70689#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {70689#false} is VALID [2022-04-28 10:13:19,973 INFO L290 TraceCheckUtils]: 34: Hoare triple {70689#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {70689#false} is VALID [2022-04-28 10:13:19,973 INFO L290 TraceCheckUtils]: 33: Hoare triple {70865#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {70689#false} is VALID [2022-04-28 10:13:19,974 INFO L290 TraceCheckUtils]: 32: Hoare triple {70869#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {70865#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:13:19,975 INFO L290 TraceCheckUtils]: 31: Hoare triple {70873#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {70869#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:13:19,976 INFO L290 TraceCheckUtils]: 30: Hoare triple {70877#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {70873#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-28 10:13:19,976 INFO L290 TraceCheckUtils]: 29: Hoare triple {70881#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {70877#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-28 10:13:19,977 INFO L290 TraceCheckUtils]: 28: Hoare triple {70885#(not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {70881#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:13:19,978 INFO L290 TraceCheckUtils]: 27: Hoare triple {70889#(not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {70885#(not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:13:19,979 INFO L290 TraceCheckUtils]: 26: Hoare triple {70893#(not (< 0 (mod (+ main_~y~0 4294967289) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {70889#(not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:13:19,979 INFO L290 TraceCheckUtils]: 25: Hoare triple {70897#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod main_~z~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {70893#(not (< 0 (mod (+ main_~y~0 4294967289) 4294967296)))} is VALID [2022-04-28 10:13:19,980 INFO L290 TraceCheckUtils]: 24: Hoare triple {70901#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {70897#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-28 10:13:19,981 INFO L290 TraceCheckUtils]: 23: Hoare triple {70905#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {70901#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:13:19,982 INFO L290 TraceCheckUtils]: 22: Hoare triple {70909#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {70905#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)))} is VALID [2022-04-28 10:13:19,983 INFO L290 TraceCheckUtils]: 21: Hoare triple {70913#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {70909#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} is VALID [2022-04-28 10:13:19,983 INFO L290 TraceCheckUtils]: 20: Hoare triple {70917#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {70913#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)))} is VALID [2022-04-28 10:13:19,985 INFO L290 TraceCheckUtils]: 19: Hoare triple {70921#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ 4294967290 main_~z~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {70917#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)))} is VALID [2022-04-28 10:13:19,985 INFO L290 TraceCheckUtils]: 18: Hoare triple {70925#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ main_~z~0 4294967289) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {70921#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ 4294967290 main_~z~0) 4294967296)))} is VALID [2022-04-28 10:13:19,986 INFO L290 TraceCheckUtils]: 17: Hoare triple {70688#true} ~z~0 := ~y~0; {70925#(or (not (< 0 (mod (+ main_~y~0 4294967289) 4294967296))) (< 0 (mod (+ main_~z~0 4294967289) 4294967296)))} is VALID [2022-04-28 10:13:19,986 INFO L290 TraceCheckUtils]: 16: Hoare triple {70688#true} assume !(~x~0 % 4294967296 > 0); {70688#true} is VALID [2022-04-28 10:13:19,986 INFO L290 TraceCheckUtils]: 15: Hoare triple {70688#true} 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; {70688#true} is VALID [2022-04-28 10:13:19,986 INFO L290 TraceCheckUtils]: 14: Hoare triple {70688#true} 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; {70688#true} is VALID [2022-04-28 10:13:19,986 INFO L290 TraceCheckUtils]: 13: Hoare triple {70688#true} 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; {70688#true} is VALID [2022-04-28 10:13:19,986 INFO L290 TraceCheckUtils]: 12: Hoare triple {70688#true} 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; {70688#true} is VALID [2022-04-28 10:13:19,986 INFO L290 TraceCheckUtils]: 11: Hoare triple {70688#true} 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; {70688#true} is VALID [2022-04-28 10:13:19,986 INFO L290 TraceCheckUtils]: 10: Hoare triple {70688#true} 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; {70688#true} is VALID [2022-04-28 10:13:19,986 INFO L290 TraceCheckUtils]: 9: Hoare triple {70688#true} 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; {70688#true} is VALID [2022-04-28 10:13:19,986 INFO L290 TraceCheckUtils]: 8: Hoare triple {70688#true} 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; {70688#true} is VALID [2022-04-28 10:13:19,986 INFO L290 TraceCheckUtils]: 7: Hoare triple {70688#true} 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; {70688#true} is VALID [2022-04-28 10:13:19,986 INFO L290 TraceCheckUtils]: 6: Hoare triple {70688#true} 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; {70688#true} is VALID [2022-04-28 10:13:19,986 INFO L290 TraceCheckUtils]: 5: Hoare triple {70688#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {70688#true} is VALID [2022-04-28 10:13:19,986 INFO L272 TraceCheckUtils]: 4: Hoare triple {70688#true} call #t~ret11 := main(); {70688#true} is VALID [2022-04-28 10:13:19,986 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {70688#true} {70688#true} #61#return; {70688#true} is VALID [2022-04-28 10:13:19,986 INFO L290 TraceCheckUtils]: 2: Hoare triple {70688#true} assume true; {70688#true} is VALID [2022-04-28 10:13:19,986 INFO L290 TraceCheckUtils]: 1: Hoare triple {70688#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(10, 2);call #Ultimate.allocInit(12, 3); {70688#true} is VALID [2022-04-28 10:13:19,986 INFO L272 TraceCheckUtils]: 0: Hoare triple {70688#true} call ULTIMATE.init(); {70688#true} is VALID [2022-04-28 10:13:19,987 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 24 proven. 56 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2022-04-28 10:13:19,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1627880061] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:13:19,987 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:13:19,987 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 18] total 46 [2022-04-28 10:13:19,987 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:13:19,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1468413099] [2022-04-28 10:13:19,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1468413099] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:13:19,988 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:13:19,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-28 10:13:19,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495519572] [2022-04-28 10:13:19,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:13:19,988 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 states have internal predecessors, (28), 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 41 [2022-04-28 10:13:19,988 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:13:19,988 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 states have internal predecessors, (28), 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-28 10:13:20,009 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:13:20,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-28 10:13:20,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:13:20,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-28 10:13:20,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=257, Invalid=1813, Unknown=0, NotChecked=0, Total=2070 [2022-04-28 10:13:20,010 INFO L87 Difference]: Start difference. First operand 132 states and 168 transitions. Second operand has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 states have internal predecessors, (28), 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-28 10:13:21,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:13:21,454 INFO L93 Difference]: Finished difference Result 161 states and 197 transitions. [2022-04-28 10:13:21,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-28 10:13:21,454 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 states have internal predecessors, (28), 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 41 [2022-04-28 10:13:21,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:13:21,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 states have internal predecessors, (28), 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-28 10:13:21,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 59 transitions. [2022-04-28 10:13:21,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 states have internal predecessors, (28), 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-28 10:13:21,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 59 transitions. [2022-04-28 10:13:21,455 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 59 transitions. [2022-04-28 10:13:21,499 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:13:21,500 INFO L225 Difference]: With dead ends: 161 [2022-04-28 10:13:21,500 INFO L226 Difference]: Without dead ends: 145 [2022-04-28 10:13:21,500 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 648 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=441, Invalid=3719, Unknown=0, NotChecked=0, Total=4160 [2022-04-28 10:13:21,501 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 17 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 604 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 10:13:21,501 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 88 Invalid, 644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 604 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 10:13:21,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2022-04-28 10:13:21,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 133. [2022-04-28 10:13:21,641 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:13:21,641 INFO L82 GeneralOperation]: Start isEquivalent. First operand 145 states. Second operand has 133 states, 128 states have (on average 1.2890625) internal successors, (165), 128 states have internal predecessors, (165), 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-28 10:13:21,641 INFO L74 IsIncluded]: Start isIncluded. First operand 145 states. Second operand has 133 states, 128 states have (on average 1.2890625) internal successors, (165), 128 states have internal predecessors, (165), 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-28 10:13:21,641 INFO L87 Difference]: Start difference. First operand 145 states. Second operand has 133 states, 128 states have (on average 1.2890625) internal successors, (165), 128 states have internal predecessors, (165), 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-28 10:13:21,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:13:21,643 INFO L93 Difference]: Finished difference Result 145 states and 181 transitions. [2022-04-28 10:13:21,643 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 181 transitions. [2022-04-28 10:13:21,643 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:13:21,643 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:13:21,643 INFO L74 IsIncluded]: Start isIncluded. First operand has 133 states, 128 states have (on average 1.2890625) internal successors, (165), 128 states have internal predecessors, (165), 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 145 states. [2022-04-28 10:13:21,643 INFO L87 Difference]: Start difference. First operand has 133 states, 128 states have (on average 1.2890625) internal successors, (165), 128 states have internal predecessors, (165), 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 145 states. [2022-04-28 10:13:21,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:13:21,644 INFO L93 Difference]: Finished difference Result 145 states and 181 transitions. [2022-04-28 10:13:21,644 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 181 transitions. [2022-04-28 10:13:21,644 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:13:21,644 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:13:21,644 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:13:21,644 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:13:21,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 128 states have (on average 1.2890625) internal successors, (165), 128 states have internal predecessors, (165), 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-28 10:13:21,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 169 transitions. [2022-04-28 10:13:21,646 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 169 transitions. Word has length 41 [2022-04-28 10:13:21,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:13:21,646 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 169 transitions. [2022-04-28 10:13:21,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 states have internal predecessors, (28), 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-28 10:13:21,646 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 133 states and 169 transitions. [2022-04-28 10:13:28,441 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 169 edges. 168 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 10:13:28,441 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 169 transitions. [2022-04-28 10:13:28,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-28 10:13:28,441 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:13:28,441 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:13:28,457 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (86)] Forceful destruction successful, exit code 0 [2022-04-28 10:13:28,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85,86 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:13:28,642 INFO L420 AbstractCegarLoop]: === Iteration 87 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:13:28,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:13:28,642 INFO L85 PathProgramCache]: Analyzing trace with hash 870484735, now seen corresponding path program 119 times [2022-04-28 10:13:28,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:13:28,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [256055715] [2022-04-28 10:13:28,644 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:13:28,644 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:13:28,644 INFO L85 PathProgramCache]: Analyzing trace with hash 870484735, now seen corresponding path program 120 times [2022-04-28 10:13:28,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:13:28,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521936512] [2022-04-28 10:13:28,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:13:28,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:13:28,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:13:28,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:13:28,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:13:28,910 INFO L290 TraceCheckUtils]: 0: Hoare triple {71921#(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(10, 2);call #Ultimate.allocInit(12, 3); {71898#true} is VALID [2022-04-28 10:13:28,910 INFO L290 TraceCheckUtils]: 1: Hoare triple {71898#true} assume true; {71898#true} is VALID [2022-04-28 10:13:28,910 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {71898#true} {71898#true} #61#return; {71898#true} is VALID [2022-04-28 10:13:28,911 INFO L272 TraceCheckUtils]: 0: Hoare triple {71898#true} call ULTIMATE.init(); {71921#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:13:28,911 INFO L290 TraceCheckUtils]: 1: Hoare triple {71921#(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(10, 2);call #Ultimate.allocInit(12, 3); {71898#true} is VALID [2022-04-28 10:13:28,911 INFO L290 TraceCheckUtils]: 2: Hoare triple {71898#true} assume true; {71898#true} is VALID [2022-04-28 10:13:28,911 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {71898#true} {71898#true} #61#return; {71898#true} is VALID [2022-04-28 10:13:28,911 INFO L272 TraceCheckUtils]: 4: Hoare triple {71898#true} call #t~ret11 := main(); {71898#true} is VALID [2022-04-28 10:13:28,911 INFO L290 TraceCheckUtils]: 5: Hoare triple {71898#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {71903#(= main_~y~0 0)} is VALID [2022-04-28 10:13:28,912 INFO L290 TraceCheckUtils]: 6: Hoare triple {71903#(= 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; {71904#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:13:28,912 INFO L290 TraceCheckUtils]: 7: Hoare triple {71904#(and (<= 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; {71905#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:13:28,913 INFO L290 TraceCheckUtils]: 8: Hoare triple {71905#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {71906#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:13:28,913 INFO L290 TraceCheckUtils]: 9: Hoare triple {71906#(and (<= main_~y~0 3) (<= 3 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; {71907#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:13:28,914 INFO L290 TraceCheckUtils]: 10: Hoare triple {71907#(and (<= main_~y~0 4) (<= 4 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; {71908#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:13:28,914 INFO L290 TraceCheckUtils]: 11: Hoare triple {71908#(and (<= 5 main_~y~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; {71909#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:13:28,915 INFO L290 TraceCheckUtils]: 12: Hoare triple {71909#(and (<= main_~y~0 6) (<= 6 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; {71910#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:13:28,915 INFO L290 TraceCheckUtils]: 13: Hoare triple {71910#(and (<= 7 main_~y~0) (<= main_~y~0 7))} 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; {71911#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:13:28,916 INFO L290 TraceCheckUtils]: 14: Hoare triple {71911#(and (<= main_~y~0 8) (<= 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; {71912#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:13:28,916 INFO L290 TraceCheckUtils]: 15: Hoare triple {71912#(and (<= 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; {71913#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:13:28,917 INFO L290 TraceCheckUtils]: 16: Hoare triple {71913#(and (<= main_~y~0 10) (<= 10 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; {71914#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:13:28,917 INFO L290 TraceCheckUtils]: 17: Hoare triple {71914#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {71914#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:13:28,917 INFO L290 TraceCheckUtils]: 18: Hoare triple {71914#(and (<= main_~y~0 11) (<= 11 main_~y~0))} ~z~0 := ~y~0; {71915#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-28 10:13:28,918 INFO L290 TraceCheckUtils]: 19: Hoare triple {71915#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {71916#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:13:28,918 INFO L290 TraceCheckUtils]: 20: Hoare triple {71916#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {71917#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:13:28,919 INFO L290 TraceCheckUtils]: 21: Hoare triple {71917#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {71918#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:13:28,919 INFO L290 TraceCheckUtils]: 22: Hoare triple {71918#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {71919#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:13:28,920 INFO L290 TraceCheckUtils]: 23: Hoare triple {71919#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {71920#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} is VALID [2022-04-28 10:13:28,920 INFO L290 TraceCheckUtils]: 24: Hoare triple {71920#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {71899#false} is VALID [2022-04-28 10:13:28,920 INFO L290 TraceCheckUtils]: 25: Hoare triple {71899#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {71899#false} is VALID [2022-04-28 10:13:28,920 INFO L290 TraceCheckUtils]: 26: Hoare triple {71899#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {71899#false} is VALID [2022-04-28 10:13:28,920 INFO L290 TraceCheckUtils]: 27: Hoare triple {71899#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {71899#false} is VALID [2022-04-28 10:13:28,920 INFO L290 TraceCheckUtils]: 28: Hoare triple {71899#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {71899#false} is VALID [2022-04-28 10:13:28,920 INFO L290 TraceCheckUtils]: 29: Hoare triple {71899#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {71899#false} is VALID [2022-04-28 10:13:28,920 INFO L290 TraceCheckUtils]: 30: Hoare triple {71899#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {71899#false} is VALID [2022-04-28 10:13:28,920 INFO L290 TraceCheckUtils]: 31: Hoare triple {71899#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {71899#false} is VALID [2022-04-28 10:13:28,920 INFO L290 TraceCheckUtils]: 32: Hoare triple {71899#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {71899#false} is VALID [2022-04-28 10:13:28,921 INFO L290 TraceCheckUtils]: 33: Hoare triple {71899#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {71899#false} is VALID [2022-04-28 10:13:28,921 INFO L290 TraceCheckUtils]: 34: Hoare triple {71899#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {71899#false} is VALID [2022-04-28 10:13:28,921 INFO L290 TraceCheckUtils]: 35: Hoare triple {71899#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {71899#false} is VALID [2022-04-28 10:13:28,921 INFO L290 TraceCheckUtils]: 36: Hoare triple {71899#false} assume !(~y~0 % 4294967296 > 0); {71899#false} is VALID [2022-04-28 10:13:28,921 INFO L272 TraceCheckUtils]: 37: Hoare triple {71899#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {71899#false} is VALID [2022-04-28 10:13:28,921 INFO L290 TraceCheckUtils]: 38: Hoare triple {71899#false} ~cond := #in~cond; {71899#false} is VALID [2022-04-28 10:13:28,921 INFO L290 TraceCheckUtils]: 39: Hoare triple {71899#false} assume 0 == ~cond; {71899#false} is VALID [2022-04-28 10:13:28,921 INFO L290 TraceCheckUtils]: 40: Hoare triple {71899#false} assume !false; {71899#false} is VALID [2022-04-28 10:13:28,921 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-04-28 10:13:28,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:13:28,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521936512] [2022-04-28 10:13:28,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521936512] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:13:28,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1849609568] [2022-04-28 10:13:28,921 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:13:28,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:13:28,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:13:28,922 INFO L229 MonitoredProcess]: Starting monitored process 87 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:13:28,925 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (87)] Waiting until timeout for monitored process [2022-04-28 10:13:29,278 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-28 10:13:29,279 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:13:29,280 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-28 10:13:29,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:13:29,289 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:13:29,548 INFO L272 TraceCheckUtils]: 0: Hoare triple {71898#true} call ULTIMATE.init(); {71898#true} is VALID [2022-04-28 10:13:29,548 INFO L290 TraceCheckUtils]: 1: Hoare triple {71898#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(10, 2);call #Ultimate.allocInit(12, 3); {71898#true} is VALID [2022-04-28 10:13:29,548 INFO L290 TraceCheckUtils]: 2: Hoare triple {71898#true} assume true; {71898#true} is VALID [2022-04-28 10:13:29,548 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {71898#true} {71898#true} #61#return; {71898#true} is VALID [2022-04-28 10:13:29,548 INFO L272 TraceCheckUtils]: 4: Hoare triple {71898#true} call #t~ret11 := main(); {71898#true} is VALID [2022-04-28 10:13:29,548 INFO L290 TraceCheckUtils]: 5: Hoare triple {71898#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {71903#(= main_~y~0 0)} is VALID [2022-04-28 10:13:29,549 INFO L290 TraceCheckUtils]: 6: Hoare triple {71903#(= 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; {71904#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:13:29,549 INFO L290 TraceCheckUtils]: 7: Hoare triple {71904#(and (<= 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; {71905#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:13:29,550 INFO L290 TraceCheckUtils]: 8: Hoare triple {71905#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {71906#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:13:29,550 INFO L290 TraceCheckUtils]: 9: Hoare triple {71906#(and (<= main_~y~0 3) (<= 3 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; {71907#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:13:29,551 INFO L290 TraceCheckUtils]: 10: Hoare triple {71907#(and (<= main_~y~0 4) (<= 4 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; {71908#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:13:29,551 INFO L290 TraceCheckUtils]: 11: Hoare triple {71908#(and (<= 5 main_~y~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; {71909#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:13:29,552 INFO L290 TraceCheckUtils]: 12: Hoare triple {71909#(and (<= main_~y~0 6) (<= 6 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; {71910#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:13:29,552 INFO L290 TraceCheckUtils]: 13: Hoare triple {71910#(and (<= 7 main_~y~0) (<= main_~y~0 7))} 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; {71911#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:13:29,553 INFO L290 TraceCheckUtils]: 14: Hoare triple {71911#(and (<= main_~y~0 8) (<= 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; {71912#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:13:29,553 INFO L290 TraceCheckUtils]: 15: Hoare triple {71912#(and (<= 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; {71913#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:13:29,554 INFO L290 TraceCheckUtils]: 16: Hoare triple {71913#(and (<= main_~y~0 10) (<= 10 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; {71914#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:13:29,554 INFO L290 TraceCheckUtils]: 17: Hoare triple {71914#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {71914#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:13:29,554 INFO L290 TraceCheckUtils]: 18: Hoare triple {71914#(and (<= main_~y~0 11) (<= 11 main_~y~0))} ~z~0 := ~y~0; {71915#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-28 10:13:29,555 INFO L290 TraceCheckUtils]: 19: Hoare triple {71915#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {71916#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:13:29,555 INFO L290 TraceCheckUtils]: 20: Hoare triple {71916#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {71917#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:13:29,556 INFO L290 TraceCheckUtils]: 21: Hoare triple {71917#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {71918#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:13:29,556 INFO L290 TraceCheckUtils]: 22: Hoare triple {71918#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {71919#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:13:29,557 INFO L290 TraceCheckUtils]: 23: Hoare triple {71919#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {71994#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:13:29,557 INFO L290 TraceCheckUtils]: 24: Hoare triple {71994#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {71899#false} is VALID [2022-04-28 10:13:29,557 INFO L290 TraceCheckUtils]: 25: Hoare triple {71899#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {71899#false} is VALID [2022-04-28 10:13:29,557 INFO L290 TraceCheckUtils]: 26: Hoare triple {71899#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {71899#false} is VALID [2022-04-28 10:13:29,557 INFO L290 TraceCheckUtils]: 27: Hoare triple {71899#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {71899#false} is VALID [2022-04-28 10:13:29,557 INFO L290 TraceCheckUtils]: 28: Hoare triple {71899#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {71899#false} is VALID [2022-04-28 10:13:29,557 INFO L290 TraceCheckUtils]: 29: Hoare triple {71899#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {71899#false} is VALID [2022-04-28 10:13:29,557 INFO L290 TraceCheckUtils]: 30: Hoare triple {71899#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {71899#false} is VALID [2022-04-28 10:13:29,557 INFO L290 TraceCheckUtils]: 31: Hoare triple {71899#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {71899#false} is VALID [2022-04-28 10:13:29,557 INFO L290 TraceCheckUtils]: 32: Hoare triple {71899#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {71899#false} is VALID [2022-04-28 10:13:29,557 INFO L290 TraceCheckUtils]: 33: Hoare triple {71899#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {71899#false} is VALID [2022-04-28 10:13:29,557 INFO L290 TraceCheckUtils]: 34: Hoare triple {71899#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {71899#false} is VALID [2022-04-28 10:13:29,558 INFO L290 TraceCheckUtils]: 35: Hoare triple {71899#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {71899#false} is VALID [2022-04-28 10:13:29,558 INFO L290 TraceCheckUtils]: 36: Hoare triple {71899#false} assume !(~y~0 % 4294967296 > 0); {71899#false} is VALID [2022-04-28 10:13:29,558 INFO L272 TraceCheckUtils]: 37: Hoare triple {71899#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {71899#false} is VALID [2022-04-28 10:13:29,558 INFO L290 TraceCheckUtils]: 38: Hoare triple {71899#false} ~cond := #in~cond; {71899#false} is VALID [2022-04-28 10:13:29,558 INFO L290 TraceCheckUtils]: 39: Hoare triple {71899#false} assume 0 == ~cond; {71899#false} is VALID [2022-04-28 10:13:29,558 INFO L290 TraceCheckUtils]: 40: Hoare triple {71899#false} assume !false; {71899#false} is VALID [2022-04-28 10:13:29,558 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-04-28 10:13:29,558 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:13:30,104 INFO L290 TraceCheckUtils]: 40: Hoare triple {71899#false} assume !false; {71899#false} is VALID [2022-04-28 10:13:30,105 INFO L290 TraceCheckUtils]: 39: Hoare triple {71899#false} assume 0 == ~cond; {71899#false} is VALID [2022-04-28 10:13:30,105 INFO L290 TraceCheckUtils]: 38: Hoare triple {71899#false} ~cond := #in~cond; {71899#false} is VALID [2022-04-28 10:13:30,105 INFO L272 TraceCheckUtils]: 37: Hoare triple {71899#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {71899#false} is VALID [2022-04-28 10:13:30,105 INFO L290 TraceCheckUtils]: 36: Hoare triple {71899#false} assume !(~y~0 % 4294967296 > 0); {71899#false} is VALID [2022-04-28 10:13:30,105 INFO L290 TraceCheckUtils]: 35: Hoare triple {71899#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {71899#false} is VALID [2022-04-28 10:13:30,105 INFO L290 TraceCheckUtils]: 34: Hoare triple {71899#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {71899#false} is VALID [2022-04-28 10:13:30,105 INFO L290 TraceCheckUtils]: 33: Hoare triple {71899#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {71899#false} is VALID [2022-04-28 10:13:30,105 INFO L290 TraceCheckUtils]: 32: Hoare triple {71899#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {71899#false} is VALID [2022-04-28 10:13:30,105 INFO L290 TraceCheckUtils]: 31: Hoare triple {71899#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {71899#false} is VALID [2022-04-28 10:13:30,105 INFO L290 TraceCheckUtils]: 30: Hoare triple {71899#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {71899#false} is VALID [2022-04-28 10:13:30,105 INFO L290 TraceCheckUtils]: 29: Hoare triple {71899#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {71899#false} is VALID [2022-04-28 10:13:30,105 INFO L290 TraceCheckUtils]: 28: Hoare triple {71899#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {71899#false} is VALID [2022-04-28 10:13:30,105 INFO L290 TraceCheckUtils]: 27: Hoare triple {71899#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {71899#false} is VALID [2022-04-28 10:13:30,105 INFO L290 TraceCheckUtils]: 26: Hoare triple {71899#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {71899#false} is VALID [2022-04-28 10:13:30,105 INFO L290 TraceCheckUtils]: 25: Hoare triple {71899#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {71899#false} is VALID [2022-04-28 10:13:30,106 INFO L290 TraceCheckUtils]: 24: Hoare triple {72094#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {71899#false} is VALID [2022-04-28 10:13:30,107 INFO L290 TraceCheckUtils]: 23: Hoare triple {72098#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {72094#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:13:30,107 INFO L290 TraceCheckUtils]: 22: Hoare triple {72102#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {72098#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:13:30,108 INFO L290 TraceCheckUtils]: 21: Hoare triple {72106#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {72102#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-28 10:13:30,109 INFO L290 TraceCheckUtils]: 20: Hoare triple {72110#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {72106#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-28 10:13:30,110 INFO L290 TraceCheckUtils]: 19: Hoare triple {72114#(< 0 (mod (+ 4294967291 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {72110#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID [2022-04-28 10:13:30,110 INFO L290 TraceCheckUtils]: 18: Hoare triple {72118#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} ~z~0 := ~y~0; {72114#(< 0 (mod (+ 4294967291 main_~z~0) 4294967296))} is VALID [2022-04-28 10:13:30,110 INFO L290 TraceCheckUtils]: 17: Hoare triple {72118#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {72118#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-28 10:13:30,111 INFO L290 TraceCheckUtils]: 16: Hoare triple {72125#(< 0 (mod (+ 4294967292 main_~y~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; {72118#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-28 10:13:30,112 INFO L290 TraceCheckUtils]: 15: Hoare triple {72129#(< 0 (mod (+ main_~y~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; {72125#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-28 10:13:30,112 INFO L290 TraceCheckUtils]: 14: Hoare triple {72133#(< 0 (mod (+ main_~y~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; {72129#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 10:13:30,113 INFO L290 TraceCheckUtils]: 13: Hoare triple {72137#(< 0 (mod (+ main_~y~0 4294967295) 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; {72133#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:13:30,114 INFO L290 TraceCheckUtils]: 12: Hoare triple {72141#(< 0 (mod main_~y~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; {72137#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:13:30,114 INFO L290 TraceCheckUtils]: 11: Hoare triple {72145#(< 0 (mod (+ main_~y~0 1) 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; {72141#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:13:30,115 INFO L290 TraceCheckUtils]: 10: Hoare triple {72149#(< 0 (mod (+ main_~y~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; {72145#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:13:30,116 INFO L290 TraceCheckUtils]: 9: Hoare triple {72153#(< 0 (mod (+ main_~y~0 3) 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; {72149#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:13:30,116 INFO L290 TraceCheckUtils]: 8: Hoare triple {72157#(< 0 (mod (+ main_~y~0 4) 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; {72153#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:13:30,117 INFO L290 TraceCheckUtils]: 7: Hoare triple {72161#(< 0 (mod (+ 5 main_~y~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; {72157#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:13:30,118 INFO L290 TraceCheckUtils]: 6: Hoare triple {72165#(< 0 (mod (+ main_~y~0 6) 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; {72161#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:13:30,118 INFO L290 TraceCheckUtils]: 5: Hoare triple {71898#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {72165#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:13:30,118 INFO L272 TraceCheckUtils]: 4: Hoare triple {71898#true} call #t~ret11 := main(); {71898#true} is VALID [2022-04-28 10:13:30,118 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {71898#true} {71898#true} #61#return; {71898#true} is VALID [2022-04-28 10:13:30,118 INFO L290 TraceCheckUtils]: 2: Hoare triple {71898#true} assume true; {71898#true} is VALID [2022-04-28 10:13:30,118 INFO L290 TraceCheckUtils]: 1: Hoare triple {71898#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(10, 2);call #Ultimate.allocInit(12, 3); {71898#true} is VALID [2022-04-28 10:13:30,118 INFO L272 TraceCheckUtils]: 0: Hoare triple {71898#true} call ULTIMATE.init(); {71898#true} is VALID [2022-04-28 10:13:30,118 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-04-28 10:13:30,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1849609568] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:13:30,118 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:13:30,119 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 40 [2022-04-28 10:13:30,119 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:13:30,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [256055715] [2022-04-28 10:13:30,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [256055715] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:13:30,119 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:13:30,119 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-28 10:13:30,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824969511] [2022-04-28 10:13:30,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:13:30,119 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 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 41 [2022-04-28 10:13:30,119 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:13:30,119 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 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-28 10:13:30,151 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:13:30,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-28 10:13:30,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:13:30,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-28 10:13:30,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=1297, Unknown=0, NotChecked=0, Total=1560 [2022-04-28 10:13:30,152 INFO L87 Difference]: Start difference. First operand 133 states and 169 transitions. Second operand has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 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-28 10:13:31,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:13:31,692 INFO L93 Difference]: Finished difference Result 164 states and 200 transitions. [2022-04-28 10:13:31,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-28 10:13:31,693 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 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 41 [2022-04-28 10:13:31,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:13:31,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 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-28 10:13:31,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 68 transitions. [2022-04-28 10:13:31,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 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-28 10:13:31,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 68 transitions. [2022-04-28 10:13:31,694 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 68 transitions. [2022-04-28 10:13:31,745 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:13:31,760 INFO L225 Difference]: With dead ends: 164 [2022-04-28 10:13:31,760 INFO L226 Difference]: Without dead ends: 147 [2022-04-28 10:13:31,761 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 379 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=731, Invalid=3175, Unknown=0, NotChecked=0, Total=3906 [2022-04-28 10:13:31,761 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 23 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 660 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 660 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 10:13:31,761 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 85 Invalid, 711 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 660 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 10:13:31,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2022-04-28 10:13:31,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 134. [2022-04-28 10:13:31,921 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:13:31,921 INFO L82 GeneralOperation]: Start isEquivalent. First operand 147 states. Second operand has 134 states, 129 states have (on average 1.2868217054263567) internal successors, (166), 129 states have internal predecessors, (166), 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-28 10:13:31,921 INFO L74 IsIncluded]: Start isIncluded. First operand 147 states. Second operand has 134 states, 129 states have (on average 1.2868217054263567) internal successors, (166), 129 states have internal predecessors, (166), 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-28 10:13:31,921 INFO L87 Difference]: Start difference. First operand 147 states. Second operand has 134 states, 129 states have (on average 1.2868217054263567) internal successors, (166), 129 states have internal predecessors, (166), 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-28 10:13:31,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:13:31,922 INFO L93 Difference]: Finished difference Result 147 states and 183 transitions. [2022-04-28 10:13:31,922 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 183 transitions. [2022-04-28 10:13:31,922 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:13:31,922 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:13:31,922 INFO L74 IsIncluded]: Start isIncluded. First operand has 134 states, 129 states have (on average 1.2868217054263567) internal successors, (166), 129 states have internal predecessors, (166), 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 147 states. [2022-04-28 10:13:31,923 INFO L87 Difference]: Start difference. First operand has 134 states, 129 states have (on average 1.2868217054263567) internal successors, (166), 129 states have internal predecessors, (166), 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 147 states. [2022-04-28 10:13:31,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:13:31,924 INFO L93 Difference]: Finished difference Result 147 states and 183 transitions. [2022-04-28 10:13:31,924 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 183 transitions. [2022-04-28 10:13:31,924 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:13:31,924 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:13:31,924 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:13:31,924 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:13:31,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 129 states have (on average 1.2868217054263567) internal successors, (166), 129 states have internal predecessors, (166), 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-28 10:13:31,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 170 transitions. [2022-04-28 10:13:31,925 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 170 transitions. Word has length 41 [2022-04-28 10:13:31,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:13:31,925 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 170 transitions. [2022-04-28 10:13:31,925 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 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-28 10:13:31,925 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 134 states and 170 transitions. [2022-04-28 10:13:34,937 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 170 edges. 170 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:13:34,937 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 170 transitions. [2022-04-28 10:13:34,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-28 10:13:34,938 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:13:34,938 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:13:34,942 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (87)] Forceful destruction successful, exit code 0 [2022-04-28 10:13:35,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86,87 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:13:35,138 INFO L420 AbstractCegarLoop]: === Iteration 88 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:13:35,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:13:35,138 INFO L85 PathProgramCache]: Analyzing trace with hash 1132790639, now seen corresponding path program 121 times [2022-04-28 10:13:35,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:13:35,139 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [57834294] [2022-04-28 10:13:35,140 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:13:35,141 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:13:35,141 INFO L85 PathProgramCache]: Analyzing trace with hash 1132790639, now seen corresponding path program 122 times [2022-04-28 10:13:35,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:13:35,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386972260] [2022-04-28 10:13:35,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:13:35,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:13:35,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:13:35,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:13:35,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:13:35,386 INFO L290 TraceCheckUtils]: 0: Hoare triple {73144#(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(10, 2);call #Ultimate.allocInit(12, 3); {73122#true} is VALID [2022-04-28 10:13:35,386 INFO L290 TraceCheckUtils]: 1: Hoare triple {73122#true} assume true; {73122#true} is VALID [2022-04-28 10:13:35,387 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {73122#true} {73122#true} #61#return; {73122#true} is VALID [2022-04-28 10:13:35,387 INFO L272 TraceCheckUtils]: 0: Hoare triple {73122#true} call ULTIMATE.init(); {73144#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:13:35,387 INFO L290 TraceCheckUtils]: 1: Hoare triple {73144#(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(10, 2);call #Ultimate.allocInit(12, 3); {73122#true} is VALID [2022-04-28 10:13:35,387 INFO L290 TraceCheckUtils]: 2: Hoare triple {73122#true} assume true; {73122#true} is VALID [2022-04-28 10:13:35,387 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {73122#true} {73122#true} #61#return; {73122#true} is VALID [2022-04-28 10:13:35,387 INFO L272 TraceCheckUtils]: 4: Hoare triple {73122#true} call #t~ret11 := main(); {73122#true} is VALID [2022-04-28 10:13:35,387 INFO L290 TraceCheckUtils]: 5: Hoare triple {73122#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {73127#(= main_~y~0 0)} is VALID [2022-04-28 10:13:35,388 INFO L290 TraceCheckUtils]: 6: Hoare triple {73127#(= 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; {73128#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:13:35,388 INFO L290 TraceCheckUtils]: 7: Hoare triple {73128#(and (<= 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; {73129#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:13:35,389 INFO L290 TraceCheckUtils]: 8: Hoare triple {73129#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {73130#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:13:35,389 INFO L290 TraceCheckUtils]: 9: Hoare triple {73130#(and (<= main_~y~0 3) (<= 3 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; {73131#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:13:35,390 INFO L290 TraceCheckUtils]: 10: Hoare triple {73131#(and (<= main_~y~0 4) (<= 4 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; {73132#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:13:35,390 INFO L290 TraceCheckUtils]: 11: Hoare triple {73132#(and (<= 5 main_~y~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; {73133#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:13:35,391 INFO L290 TraceCheckUtils]: 12: Hoare triple {73133#(and (<= main_~y~0 6) (<= 6 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; {73134#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:13:35,391 INFO L290 TraceCheckUtils]: 13: Hoare triple {73134#(and (<= 7 main_~y~0) (<= main_~y~0 7))} 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; {73135#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:13:35,392 INFO L290 TraceCheckUtils]: 14: Hoare triple {73135#(and (<= main_~y~0 8) (<= 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; {73136#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:13:35,392 INFO L290 TraceCheckUtils]: 15: Hoare triple {73136#(and (<= 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; {73137#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:13:35,393 INFO L290 TraceCheckUtils]: 16: Hoare triple {73137#(and (<= main_~y~0 10) (<= 10 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; {73138#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:13:35,393 INFO L290 TraceCheckUtils]: 17: Hoare triple {73138#(and (<= main_~y~0 11) (<= 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; {73139#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:13:35,394 INFO L290 TraceCheckUtils]: 18: Hoare triple {73139#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !(~x~0 % 4294967296 > 0); {73139#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:13:35,394 INFO L290 TraceCheckUtils]: 19: Hoare triple {73139#(and (<= 12 main_~y~0) (<= main_~y~0 12))} ~z~0 := ~y~0; {73140#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-28 10:13:35,394 INFO L290 TraceCheckUtils]: 20: Hoare triple {73140#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {73141#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-28 10:13:35,395 INFO L290 TraceCheckUtils]: 21: Hoare triple {73141#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {73142#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:13:35,395 INFO L290 TraceCheckUtils]: 22: Hoare triple {73142#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {73143#(and (<= 9 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:13:35,396 INFO L290 TraceCheckUtils]: 23: Hoare triple {73143#(and (<= 9 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {73123#false} is VALID [2022-04-28 10:13:35,396 INFO L290 TraceCheckUtils]: 24: Hoare triple {73123#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {73123#false} is VALID [2022-04-28 10:13:35,396 INFO L290 TraceCheckUtils]: 25: Hoare triple {73123#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {73123#false} is VALID [2022-04-28 10:13:35,396 INFO L290 TraceCheckUtils]: 26: Hoare triple {73123#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {73123#false} is VALID [2022-04-28 10:13:35,396 INFO L290 TraceCheckUtils]: 27: Hoare triple {73123#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {73123#false} is VALID [2022-04-28 10:13:35,396 INFO L290 TraceCheckUtils]: 28: Hoare triple {73123#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {73123#false} is VALID [2022-04-28 10:13:35,396 INFO L290 TraceCheckUtils]: 29: Hoare triple {73123#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {73123#false} is VALID [2022-04-28 10:13:35,396 INFO L290 TraceCheckUtils]: 30: Hoare triple {73123#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {73123#false} is VALID [2022-04-28 10:13:35,396 INFO L290 TraceCheckUtils]: 31: Hoare triple {73123#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {73123#false} is VALID [2022-04-28 10:13:35,396 INFO L290 TraceCheckUtils]: 32: Hoare triple {73123#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {73123#false} is VALID [2022-04-28 10:13:35,396 INFO L290 TraceCheckUtils]: 33: Hoare triple {73123#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {73123#false} is VALID [2022-04-28 10:13:35,396 INFO L290 TraceCheckUtils]: 34: Hoare triple {73123#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {73123#false} is VALID [2022-04-28 10:13:35,396 INFO L290 TraceCheckUtils]: 35: Hoare triple {73123#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {73123#false} is VALID [2022-04-28 10:13:35,396 INFO L290 TraceCheckUtils]: 36: Hoare triple {73123#false} assume !(~y~0 % 4294967296 > 0); {73123#false} is VALID [2022-04-28 10:13:35,396 INFO L272 TraceCheckUtils]: 37: Hoare triple {73123#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {73123#false} is VALID [2022-04-28 10:13:35,396 INFO L290 TraceCheckUtils]: 38: Hoare triple {73123#false} ~cond := #in~cond; {73123#false} is VALID [2022-04-28 10:13:35,396 INFO L290 TraceCheckUtils]: 39: Hoare triple {73123#false} assume 0 == ~cond; {73123#false} is VALID [2022-04-28 10:13:35,397 INFO L290 TraceCheckUtils]: 40: Hoare triple {73123#false} assume !false; {73123#false} is VALID [2022-04-28 10:13:35,397 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-04-28 10:13:35,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:13:35,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386972260] [2022-04-28 10:13:35,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386972260] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:13:35,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [80852486] [2022-04-28 10:13:35,397 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:13:35,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:13:35,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:13:35,398 INFO L229 MonitoredProcess]: Starting monitored process 88 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:13:35,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (88)] Waiting until timeout for monitored process [2022-04-28 10:13:35,440 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:13:35,440 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:13:35,441 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-28 10:13:35,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:13:35,450 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:13:35,708 INFO L272 TraceCheckUtils]: 0: Hoare triple {73122#true} call ULTIMATE.init(); {73122#true} is VALID [2022-04-28 10:13:35,708 INFO L290 TraceCheckUtils]: 1: Hoare triple {73122#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(10, 2);call #Ultimate.allocInit(12, 3); {73122#true} is VALID [2022-04-28 10:13:35,708 INFO L290 TraceCheckUtils]: 2: Hoare triple {73122#true} assume true; {73122#true} is VALID [2022-04-28 10:13:35,708 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {73122#true} {73122#true} #61#return; {73122#true} is VALID [2022-04-28 10:13:35,708 INFO L272 TraceCheckUtils]: 4: Hoare triple {73122#true} call #t~ret11 := main(); {73122#true} is VALID [2022-04-28 10:13:35,709 INFO L290 TraceCheckUtils]: 5: Hoare triple {73122#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {73127#(= main_~y~0 0)} is VALID [2022-04-28 10:13:35,709 INFO L290 TraceCheckUtils]: 6: Hoare triple {73127#(= 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; {73128#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:13:35,710 INFO L290 TraceCheckUtils]: 7: Hoare triple {73128#(and (<= 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; {73129#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:13:35,710 INFO L290 TraceCheckUtils]: 8: Hoare triple {73129#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {73130#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:13:35,711 INFO L290 TraceCheckUtils]: 9: Hoare triple {73130#(and (<= main_~y~0 3) (<= 3 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; {73131#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:13:35,711 INFO L290 TraceCheckUtils]: 10: Hoare triple {73131#(and (<= main_~y~0 4) (<= 4 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; {73132#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:13:35,712 INFO L290 TraceCheckUtils]: 11: Hoare triple {73132#(and (<= 5 main_~y~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; {73133#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:13:35,712 INFO L290 TraceCheckUtils]: 12: Hoare triple {73133#(and (<= main_~y~0 6) (<= 6 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; {73134#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:13:35,713 INFO L290 TraceCheckUtils]: 13: Hoare triple {73134#(and (<= 7 main_~y~0) (<= main_~y~0 7))} 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; {73135#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:13:35,713 INFO L290 TraceCheckUtils]: 14: Hoare triple {73135#(and (<= main_~y~0 8) (<= 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; {73136#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:13:35,714 INFO L290 TraceCheckUtils]: 15: Hoare triple {73136#(and (<= 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; {73137#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:13:35,714 INFO L290 TraceCheckUtils]: 16: Hoare triple {73137#(and (<= main_~y~0 10) (<= 10 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; {73138#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:13:35,715 INFO L290 TraceCheckUtils]: 17: Hoare triple {73138#(and (<= main_~y~0 11) (<= 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; {73139#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:13:35,715 INFO L290 TraceCheckUtils]: 18: Hoare triple {73139#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !(~x~0 % 4294967296 > 0); {73139#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:13:35,715 INFO L290 TraceCheckUtils]: 19: Hoare triple {73139#(and (<= 12 main_~y~0) (<= main_~y~0 12))} ~z~0 := ~y~0; {73140#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-28 10:13:35,716 INFO L290 TraceCheckUtils]: 20: Hoare triple {73140#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {73141#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-28 10:13:35,716 INFO L290 TraceCheckUtils]: 21: Hoare triple {73141#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {73142#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:13:35,717 INFO L290 TraceCheckUtils]: 22: Hoare triple {73142#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {73214#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:13:35,717 INFO L290 TraceCheckUtils]: 23: Hoare triple {73214#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !(~z~0 % 4294967296 > 0); {73123#false} is VALID [2022-04-28 10:13:35,717 INFO L290 TraceCheckUtils]: 24: Hoare triple {73123#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {73123#false} is VALID [2022-04-28 10:13:35,717 INFO L290 TraceCheckUtils]: 25: Hoare triple {73123#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {73123#false} is VALID [2022-04-28 10:13:35,718 INFO L290 TraceCheckUtils]: 26: Hoare triple {73123#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {73123#false} is VALID [2022-04-28 10:13:35,718 INFO L290 TraceCheckUtils]: 27: Hoare triple {73123#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {73123#false} is VALID [2022-04-28 10:13:35,718 INFO L290 TraceCheckUtils]: 28: Hoare triple {73123#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {73123#false} is VALID [2022-04-28 10:13:35,718 INFO L290 TraceCheckUtils]: 29: Hoare triple {73123#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {73123#false} is VALID [2022-04-28 10:13:35,718 INFO L290 TraceCheckUtils]: 30: Hoare triple {73123#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {73123#false} is VALID [2022-04-28 10:13:35,718 INFO L290 TraceCheckUtils]: 31: Hoare triple {73123#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {73123#false} is VALID [2022-04-28 10:13:35,718 INFO L290 TraceCheckUtils]: 32: Hoare triple {73123#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {73123#false} is VALID [2022-04-28 10:13:35,718 INFO L290 TraceCheckUtils]: 33: Hoare triple {73123#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {73123#false} is VALID [2022-04-28 10:13:35,718 INFO L290 TraceCheckUtils]: 34: Hoare triple {73123#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {73123#false} is VALID [2022-04-28 10:13:35,718 INFO L290 TraceCheckUtils]: 35: Hoare triple {73123#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {73123#false} is VALID [2022-04-28 10:13:35,718 INFO L290 TraceCheckUtils]: 36: Hoare triple {73123#false} assume !(~y~0 % 4294967296 > 0); {73123#false} is VALID [2022-04-28 10:13:35,718 INFO L272 TraceCheckUtils]: 37: Hoare triple {73123#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {73123#false} is VALID [2022-04-28 10:13:35,718 INFO L290 TraceCheckUtils]: 38: Hoare triple {73123#false} ~cond := #in~cond; {73123#false} is VALID [2022-04-28 10:13:35,718 INFO L290 TraceCheckUtils]: 39: Hoare triple {73123#false} assume 0 == ~cond; {73123#false} is VALID [2022-04-28 10:13:35,718 INFO L290 TraceCheckUtils]: 40: Hoare triple {73123#false} assume !false; {73123#false} is VALID [2022-04-28 10:13:35,718 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-04-28 10:13:35,718 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:13:36,238 INFO L290 TraceCheckUtils]: 40: Hoare triple {73123#false} assume !false; {73123#false} is VALID [2022-04-28 10:13:36,238 INFO L290 TraceCheckUtils]: 39: Hoare triple {73123#false} assume 0 == ~cond; {73123#false} is VALID [2022-04-28 10:13:36,238 INFO L290 TraceCheckUtils]: 38: Hoare triple {73123#false} ~cond := #in~cond; {73123#false} is VALID [2022-04-28 10:13:36,238 INFO L272 TraceCheckUtils]: 37: Hoare triple {73123#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {73123#false} is VALID [2022-04-28 10:13:36,238 INFO L290 TraceCheckUtils]: 36: Hoare triple {73123#false} assume !(~y~0 % 4294967296 > 0); {73123#false} is VALID [2022-04-28 10:13:36,238 INFO L290 TraceCheckUtils]: 35: Hoare triple {73123#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {73123#false} is VALID [2022-04-28 10:13:36,238 INFO L290 TraceCheckUtils]: 34: Hoare triple {73123#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {73123#false} is VALID [2022-04-28 10:13:36,238 INFO L290 TraceCheckUtils]: 33: Hoare triple {73123#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {73123#false} is VALID [2022-04-28 10:13:36,238 INFO L290 TraceCheckUtils]: 32: Hoare triple {73123#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {73123#false} is VALID [2022-04-28 10:13:36,238 INFO L290 TraceCheckUtils]: 31: Hoare triple {73123#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {73123#false} is VALID [2022-04-28 10:13:36,238 INFO L290 TraceCheckUtils]: 30: Hoare triple {73123#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {73123#false} is VALID [2022-04-28 10:13:36,238 INFO L290 TraceCheckUtils]: 29: Hoare triple {73123#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {73123#false} is VALID [2022-04-28 10:13:36,239 INFO L290 TraceCheckUtils]: 28: Hoare triple {73123#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {73123#false} is VALID [2022-04-28 10:13:36,239 INFO L290 TraceCheckUtils]: 27: Hoare triple {73123#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {73123#false} is VALID [2022-04-28 10:13:36,239 INFO L290 TraceCheckUtils]: 26: Hoare triple {73123#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {73123#false} is VALID [2022-04-28 10:13:36,239 INFO L290 TraceCheckUtils]: 25: Hoare triple {73123#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {73123#false} is VALID [2022-04-28 10:13:36,239 INFO L290 TraceCheckUtils]: 24: Hoare triple {73123#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {73123#false} is VALID [2022-04-28 10:13:36,239 INFO L290 TraceCheckUtils]: 23: Hoare triple {73320#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {73123#false} is VALID [2022-04-28 10:13:36,240 INFO L290 TraceCheckUtils]: 22: Hoare triple {73324#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {73320#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:13:36,241 INFO L290 TraceCheckUtils]: 21: Hoare triple {73328#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {73324#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:13:36,242 INFO L290 TraceCheckUtils]: 20: Hoare triple {73332#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {73328#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-28 10:13:36,242 INFO L290 TraceCheckUtils]: 19: Hoare triple {73336#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} ~z~0 := ~y~0; {73332#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-28 10:13:36,242 INFO L290 TraceCheckUtils]: 18: Hoare triple {73336#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !(~x~0 % 4294967296 > 0); {73336#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 10:13:36,243 INFO L290 TraceCheckUtils]: 17: Hoare triple {73343#(< 0 (mod (+ main_~y~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; {73336#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 10:13:36,244 INFO L290 TraceCheckUtils]: 16: Hoare triple {73347#(< 0 (mod (+ main_~y~0 4294967295) 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; {73343#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:13:36,245 INFO L290 TraceCheckUtils]: 15: Hoare triple {73351#(< 0 (mod main_~y~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; {73347#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:13:36,245 INFO L290 TraceCheckUtils]: 14: Hoare triple {73355#(< 0 (mod (+ main_~y~0 1) 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; {73351#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:13:36,246 INFO L290 TraceCheckUtils]: 13: Hoare triple {73359#(< 0 (mod (+ main_~y~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; {73355#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:13:36,247 INFO L290 TraceCheckUtils]: 12: Hoare triple {73363#(< 0 (mod (+ main_~y~0 3) 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; {73359#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:13:36,247 INFO L290 TraceCheckUtils]: 11: Hoare triple {73367#(< 0 (mod (+ main_~y~0 4) 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; {73363#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:13:36,248 INFO L290 TraceCheckUtils]: 10: Hoare triple {73371#(< 0 (mod (+ 5 main_~y~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; {73367#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:13:36,249 INFO L290 TraceCheckUtils]: 9: Hoare triple {73375#(< 0 (mod (+ main_~y~0 6) 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; {73371#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:13:36,249 INFO L290 TraceCheckUtils]: 8: Hoare triple {73379#(< 0 (mod (+ 7 main_~y~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; {73375#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:13:36,250 INFO L290 TraceCheckUtils]: 7: Hoare triple {73383#(< 0 (mod (+ main_~y~0 8) 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; {73379#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:13:36,250 INFO L290 TraceCheckUtils]: 6: Hoare triple {73387#(< 0 (mod (+ main_~y~0 9) 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; {73383#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:13:36,251 INFO L290 TraceCheckUtils]: 5: Hoare triple {73122#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {73387#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:13:36,251 INFO L272 TraceCheckUtils]: 4: Hoare triple {73122#true} call #t~ret11 := main(); {73122#true} is VALID [2022-04-28 10:13:36,251 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {73122#true} {73122#true} #61#return; {73122#true} is VALID [2022-04-28 10:13:36,251 INFO L290 TraceCheckUtils]: 2: Hoare triple {73122#true} assume true; {73122#true} is VALID [2022-04-28 10:13:36,251 INFO L290 TraceCheckUtils]: 1: Hoare triple {73122#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(10, 2);call #Ultimate.allocInit(12, 3); {73122#true} is VALID [2022-04-28 10:13:36,251 INFO L272 TraceCheckUtils]: 0: Hoare triple {73122#true} call ULTIMATE.init(); {73122#true} is VALID [2022-04-28 10:13:36,251 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-04-28 10:13:36,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [80852486] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:13:36,251 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:13:36,251 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 19] total 38 [2022-04-28 10:13:36,252 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:13:36,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [57834294] [2022-04-28 10:13:36,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [57834294] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:13:36,252 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:13:36,252 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-28 10:13:36,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882811826] [2022-04-28 10:13:36,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:13:36,252 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 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 41 [2022-04-28 10:13:36,252 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:13:36,252 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 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-28 10:13:36,271 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:13:36,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-28 10:13:36,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:13:36,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-28 10:13:36,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=262, Invalid=1144, Unknown=0, NotChecked=0, Total=1406 [2022-04-28 10:13:36,272 INFO L87 Difference]: Start difference. First operand 134 states and 170 transitions. Second operand has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 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-28 10:13:37,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:13:37,952 INFO L93 Difference]: Finished difference Result 167 states and 203 transitions. [2022-04-28 10:13:37,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-28 10:13:37,952 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 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 41 [2022-04-28 10:13:37,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:13:37,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 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-28 10:13:37,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 72 transitions. [2022-04-28 10:13:37,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 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-28 10:13:37,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 72 transitions. [2022-04-28 10:13:37,953 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 72 transitions. [2022-04-28 10:13:38,011 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:13:38,012 INFO L225 Difference]: With dead ends: 167 [2022-04-28 10:13:38,012 INFO L226 Difference]: Without dead ends: 149 [2022-04-28 10:13:38,012 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=698, Invalid=2842, Unknown=0, NotChecked=0, Total=3540 [2022-04-28 10:13:38,012 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 30 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 793 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 842 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 793 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-28 10:13:38,013 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 102 Invalid, 842 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 793 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-28 10:13:38,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2022-04-28 10:13:38,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 135. [2022-04-28 10:13:38,160 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:13:38,160 INFO L82 GeneralOperation]: Start isEquivalent. First operand 149 states. Second operand has 135 states, 130 states have (on average 1.2846153846153847) internal successors, (167), 130 states have internal predecessors, (167), 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-28 10:13:38,160 INFO L74 IsIncluded]: Start isIncluded. First operand 149 states. Second operand has 135 states, 130 states have (on average 1.2846153846153847) internal successors, (167), 130 states have internal predecessors, (167), 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-28 10:13:38,160 INFO L87 Difference]: Start difference. First operand 149 states. Second operand has 135 states, 130 states have (on average 1.2846153846153847) internal successors, (167), 130 states have internal predecessors, (167), 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-28 10:13:38,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:13:38,162 INFO L93 Difference]: Finished difference Result 149 states and 185 transitions. [2022-04-28 10:13:38,162 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 185 transitions. [2022-04-28 10:13:38,162 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:13:38,162 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:13:38,162 INFO L74 IsIncluded]: Start isIncluded. First operand has 135 states, 130 states have (on average 1.2846153846153847) internal successors, (167), 130 states have internal predecessors, (167), 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 149 states. [2022-04-28 10:13:38,162 INFO L87 Difference]: Start difference. First operand has 135 states, 130 states have (on average 1.2846153846153847) internal successors, (167), 130 states have internal predecessors, (167), 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 149 states. [2022-04-28 10:13:38,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:13:38,163 INFO L93 Difference]: Finished difference Result 149 states and 185 transitions. [2022-04-28 10:13:38,163 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 185 transitions. [2022-04-28 10:13:38,163 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:13:38,163 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:13:38,163 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:13:38,164 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:13:38,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 130 states have (on average 1.2846153846153847) internal successors, (167), 130 states have internal predecessors, (167), 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-28 10:13:38,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 171 transitions. [2022-04-28 10:13:38,165 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 171 transitions. Word has length 41 [2022-04-28 10:13:38,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:13:38,165 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 171 transitions. [2022-04-28 10:13:38,165 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 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-28 10:13:38,165 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 135 states and 171 transitions. [2022-04-28 10:13:39,447 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 171 edges. 171 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:13:39,447 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 171 transitions. [2022-04-28 10:13:39,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-28 10:13:39,448 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:13:39,448 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:13:39,463 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (88)] Forceful destruction successful, exit code 0 [2022-04-28 10:13:39,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87,88 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:13:39,648 INFO L420 AbstractCegarLoop]: === Iteration 89 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:13:39,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:13:39,648 INFO L85 PathProgramCache]: Analyzing trace with hash -1619465025, now seen corresponding path program 123 times [2022-04-28 10:13:39,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:13:39,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1204150677] [2022-04-28 10:13:39,650 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:13:39,650 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:13:39,650 INFO L85 PathProgramCache]: Analyzing trace with hash -1619465025, now seen corresponding path program 124 times [2022-04-28 10:13:39,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:13:39,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86345639] [2022-04-28 10:13:39,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:13:39,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:13:39,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:13:39,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:13:39,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:13:39,880 INFO L290 TraceCheckUtils]: 0: Hoare triple {74375#(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(10, 2);call #Ultimate.allocInit(12, 3); {74354#true} is VALID [2022-04-28 10:13:39,880 INFO L290 TraceCheckUtils]: 1: Hoare triple {74354#true} assume true; {74354#true} is VALID [2022-04-28 10:13:39,880 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {74354#true} {74354#true} #61#return; {74354#true} is VALID [2022-04-28 10:13:39,880 INFO L272 TraceCheckUtils]: 0: Hoare triple {74354#true} call ULTIMATE.init(); {74375#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:13:39,880 INFO L290 TraceCheckUtils]: 1: Hoare triple {74375#(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(10, 2);call #Ultimate.allocInit(12, 3); {74354#true} is VALID [2022-04-28 10:13:39,880 INFO L290 TraceCheckUtils]: 2: Hoare triple {74354#true} assume true; {74354#true} is VALID [2022-04-28 10:13:39,880 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {74354#true} {74354#true} #61#return; {74354#true} is VALID [2022-04-28 10:13:39,880 INFO L272 TraceCheckUtils]: 4: Hoare triple {74354#true} call #t~ret11 := main(); {74354#true} is VALID [2022-04-28 10:13:39,881 INFO L290 TraceCheckUtils]: 5: Hoare triple {74354#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {74359#(= main_~y~0 0)} is VALID [2022-04-28 10:13:39,881 INFO L290 TraceCheckUtils]: 6: Hoare triple {74359#(= 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; {74360#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:13:39,881 INFO L290 TraceCheckUtils]: 7: Hoare triple {74360#(and (<= 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; {74361#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:13:39,882 INFO L290 TraceCheckUtils]: 8: Hoare triple {74361#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {74362#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:13:39,882 INFO L290 TraceCheckUtils]: 9: Hoare triple {74362#(and (<= main_~y~0 3) (<= 3 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; {74363#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:13:39,883 INFO L290 TraceCheckUtils]: 10: Hoare triple {74363#(and (<= main_~y~0 4) (<= 4 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; {74364#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:13:39,883 INFO L290 TraceCheckUtils]: 11: Hoare triple {74364#(and (<= 5 main_~y~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; {74365#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:13:39,884 INFO L290 TraceCheckUtils]: 12: Hoare triple {74365#(and (<= main_~y~0 6) (<= 6 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; {74366#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:13:39,884 INFO L290 TraceCheckUtils]: 13: Hoare triple {74366#(and (<= 7 main_~y~0) (<= main_~y~0 7))} 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; {74367#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:13:39,885 INFO L290 TraceCheckUtils]: 14: Hoare triple {74367#(and (<= main_~y~0 8) (<= 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; {74368#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:13:39,885 INFO L290 TraceCheckUtils]: 15: Hoare triple {74368#(and (<= 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; {74369#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:13:39,886 INFO L290 TraceCheckUtils]: 16: Hoare triple {74369#(and (<= main_~y~0 10) (<= 10 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; {74370#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:13:39,886 INFO L290 TraceCheckUtils]: 17: Hoare triple {74370#(and (<= main_~y~0 11) (<= 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; {74371#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:13:39,887 INFO L290 TraceCheckUtils]: 18: Hoare triple {74371#(and (<= 12 main_~y~0) (<= main_~y~0 12))} 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; {74372#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:13:39,887 INFO L290 TraceCheckUtils]: 19: Hoare triple {74372#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {74372#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:13:39,888 INFO L290 TraceCheckUtils]: 20: Hoare triple {74372#(and (<= main_~y~0 13) (<= 13 main_~y~0))} ~z~0 := ~y~0; {74373#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-28 10:13:39,888 INFO L290 TraceCheckUtils]: 21: Hoare triple {74373#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {74374#(and (<= (div main_~z~0 4294967296) 0) (<= 12 main_~z~0))} is VALID [2022-04-28 10:13:39,889 INFO L290 TraceCheckUtils]: 22: Hoare triple {74374#(and (<= (div main_~z~0 4294967296) 0) (<= 12 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {74355#false} is VALID [2022-04-28 10:13:39,889 INFO L290 TraceCheckUtils]: 23: Hoare triple {74355#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {74355#false} is VALID [2022-04-28 10:13:39,889 INFO L290 TraceCheckUtils]: 24: Hoare triple {74355#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {74355#false} is VALID [2022-04-28 10:13:39,889 INFO L290 TraceCheckUtils]: 25: Hoare triple {74355#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {74355#false} is VALID [2022-04-28 10:13:39,889 INFO L290 TraceCheckUtils]: 26: Hoare triple {74355#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {74355#false} is VALID [2022-04-28 10:13:39,889 INFO L290 TraceCheckUtils]: 27: Hoare triple {74355#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {74355#false} is VALID [2022-04-28 10:13:39,889 INFO L290 TraceCheckUtils]: 28: Hoare triple {74355#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {74355#false} is VALID [2022-04-28 10:13:39,889 INFO L290 TraceCheckUtils]: 29: Hoare triple {74355#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {74355#false} is VALID [2022-04-28 10:13:39,889 INFO L290 TraceCheckUtils]: 30: Hoare triple {74355#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {74355#false} is VALID [2022-04-28 10:13:39,889 INFO L290 TraceCheckUtils]: 31: Hoare triple {74355#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {74355#false} is VALID [2022-04-28 10:13:39,889 INFO L290 TraceCheckUtils]: 32: Hoare triple {74355#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {74355#false} is VALID [2022-04-28 10:13:39,889 INFO L290 TraceCheckUtils]: 33: Hoare triple {74355#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {74355#false} is VALID [2022-04-28 10:13:39,889 INFO L290 TraceCheckUtils]: 34: Hoare triple {74355#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {74355#false} is VALID [2022-04-28 10:13:39,889 INFO L290 TraceCheckUtils]: 35: Hoare triple {74355#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {74355#false} is VALID [2022-04-28 10:13:39,889 INFO L290 TraceCheckUtils]: 36: Hoare triple {74355#false} assume !(~y~0 % 4294967296 > 0); {74355#false} is VALID [2022-04-28 10:13:39,889 INFO L272 TraceCheckUtils]: 37: Hoare triple {74355#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {74355#false} is VALID [2022-04-28 10:13:39,889 INFO L290 TraceCheckUtils]: 38: Hoare triple {74355#false} ~cond := #in~cond; {74355#false} is VALID [2022-04-28 10:13:39,889 INFO L290 TraceCheckUtils]: 39: Hoare triple {74355#false} assume 0 == ~cond; {74355#false} is VALID [2022-04-28 10:13:39,889 INFO L290 TraceCheckUtils]: 40: Hoare triple {74355#false} assume !false; {74355#false} is VALID [2022-04-28 10:13:39,890 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-04-28 10:13:39,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:13:39,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86345639] [2022-04-28 10:13:39,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86345639] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:13:39,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1743356044] [2022-04-28 10:13:39,890 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:13:39,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:13:39,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:13:39,891 INFO L229 MonitoredProcess]: Starting monitored process 89 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:13:39,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (89)] Waiting until timeout for monitored process [2022-04-28 10:13:39,934 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:13:39,934 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:13:39,935 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-28 10:13:39,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:13:39,944 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:13:40,196 INFO L272 TraceCheckUtils]: 0: Hoare triple {74354#true} call ULTIMATE.init(); {74354#true} is VALID [2022-04-28 10:13:40,196 INFO L290 TraceCheckUtils]: 1: Hoare triple {74354#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(10, 2);call #Ultimate.allocInit(12, 3); {74354#true} is VALID [2022-04-28 10:13:40,196 INFO L290 TraceCheckUtils]: 2: Hoare triple {74354#true} assume true; {74354#true} is VALID [2022-04-28 10:13:40,196 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {74354#true} {74354#true} #61#return; {74354#true} is VALID [2022-04-28 10:13:40,196 INFO L272 TraceCheckUtils]: 4: Hoare triple {74354#true} call #t~ret11 := main(); {74354#true} is VALID [2022-04-28 10:13:40,196 INFO L290 TraceCheckUtils]: 5: Hoare triple {74354#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {74359#(= main_~y~0 0)} is VALID [2022-04-28 10:13:40,197 INFO L290 TraceCheckUtils]: 6: Hoare triple {74359#(= 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; {74360#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:13:40,197 INFO L290 TraceCheckUtils]: 7: Hoare triple {74360#(and (<= 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; {74361#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:13:40,198 INFO L290 TraceCheckUtils]: 8: Hoare triple {74361#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {74362#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:13:40,198 INFO L290 TraceCheckUtils]: 9: Hoare triple {74362#(and (<= main_~y~0 3) (<= 3 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; {74363#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:13:40,199 INFO L290 TraceCheckUtils]: 10: Hoare triple {74363#(and (<= main_~y~0 4) (<= 4 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; {74364#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:13:40,199 INFO L290 TraceCheckUtils]: 11: Hoare triple {74364#(and (<= 5 main_~y~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; {74365#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:13:40,200 INFO L290 TraceCheckUtils]: 12: Hoare triple {74365#(and (<= main_~y~0 6) (<= 6 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; {74366#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:13:40,200 INFO L290 TraceCheckUtils]: 13: Hoare triple {74366#(and (<= 7 main_~y~0) (<= main_~y~0 7))} 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; {74367#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:13:40,201 INFO L290 TraceCheckUtils]: 14: Hoare triple {74367#(and (<= main_~y~0 8) (<= 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; {74368#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:13:40,201 INFO L290 TraceCheckUtils]: 15: Hoare triple {74368#(and (<= 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; {74369#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:13:40,202 INFO L290 TraceCheckUtils]: 16: Hoare triple {74369#(and (<= main_~y~0 10) (<= 10 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; {74370#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:13:40,202 INFO L290 TraceCheckUtils]: 17: Hoare triple {74370#(and (<= main_~y~0 11) (<= 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; {74371#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:13:40,203 INFO L290 TraceCheckUtils]: 18: Hoare triple {74371#(and (<= 12 main_~y~0) (<= main_~y~0 12))} 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; {74372#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:13:40,203 INFO L290 TraceCheckUtils]: 19: Hoare triple {74372#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {74372#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:13:40,203 INFO L290 TraceCheckUtils]: 20: Hoare triple {74372#(and (<= main_~y~0 13) (<= 13 main_~y~0))} ~z~0 := ~y~0; {74373#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-28 10:13:40,204 INFO L290 TraceCheckUtils]: 21: Hoare triple {74373#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {74442#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-28 10:13:40,204 INFO L290 TraceCheckUtils]: 22: Hoare triple {74442#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {74355#false} is VALID [2022-04-28 10:13:40,204 INFO L290 TraceCheckUtils]: 23: Hoare triple {74355#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {74355#false} is VALID [2022-04-28 10:13:40,204 INFO L290 TraceCheckUtils]: 24: Hoare triple {74355#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {74355#false} is VALID [2022-04-28 10:13:40,205 INFO L290 TraceCheckUtils]: 25: Hoare triple {74355#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {74355#false} is VALID [2022-04-28 10:13:40,205 INFO L290 TraceCheckUtils]: 26: Hoare triple {74355#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {74355#false} is VALID [2022-04-28 10:13:40,205 INFO L290 TraceCheckUtils]: 27: Hoare triple {74355#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {74355#false} is VALID [2022-04-28 10:13:40,205 INFO L290 TraceCheckUtils]: 28: Hoare triple {74355#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {74355#false} is VALID [2022-04-28 10:13:40,205 INFO L290 TraceCheckUtils]: 29: Hoare triple {74355#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {74355#false} is VALID [2022-04-28 10:13:40,205 INFO L290 TraceCheckUtils]: 30: Hoare triple {74355#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {74355#false} is VALID [2022-04-28 10:13:40,205 INFO L290 TraceCheckUtils]: 31: Hoare triple {74355#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {74355#false} is VALID [2022-04-28 10:13:40,205 INFO L290 TraceCheckUtils]: 32: Hoare triple {74355#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {74355#false} is VALID [2022-04-28 10:13:40,205 INFO L290 TraceCheckUtils]: 33: Hoare triple {74355#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {74355#false} is VALID [2022-04-28 10:13:40,205 INFO L290 TraceCheckUtils]: 34: Hoare triple {74355#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {74355#false} is VALID [2022-04-28 10:13:40,205 INFO L290 TraceCheckUtils]: 35: Hoare triple {74355#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {74355#false} is VALID [2022-04-28 10:13:40,205 INFO L290 TraceCheckUtils]: 36: Hoare triple {74355#false} assume !(~y~0 % 4294967296 > 0); {74355#false} is VALID [2022-04-28 10:13:40,205 INFO L272 TraceCheckUtils]: 37: Hoare triple {74355#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {74355#false} is VALID [2022-04-28 10:13:40,205 INFO L290 TraceCheckUtils]: 38: Hoare triple {74355#false} ~cond := #in~cond; {74355#false} is VALID [2022-04-28 10:13:40,205 INFO L290 TraceCheckUtils]: 39: Hoare triple {74355#false} assume 0 == ~cond; {74355#false} is VALID [2022-04-28 10:13:40,205 INFO L290 TraceCheckUtils]: 40: Hoare triple {74355#false} assume !false; {74355#false} is VALID [2022-04-28 10:13:40,205 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-04-28 10:13:40,205 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:13:40,675 INFO L290 TraceCheckUtils]: 40: Hoare triple {74355#false} assume !false; {74355#false} is VALID [2022-04-28 10:13:40,675 INFO L290 TraceCheckUtils]: 39: Hoare triple {74355#false} assume 0 == ~cond; {74355#false} is VALID [2022-04-28 10:13:40,675 INFO L290 TraceCheckUtils]: 38: Hoare triple {74355#false} ~cond := #in~cond; {74355#false} is VALID [2022-04-28 10:13:40,675 INFO L272 TraceCheckUtils]: 37: Hoare triple {74355#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {74355#false} is VALID [2022-04-28 10:13:40,675 INFO L290 TraceCheckUtils]: 36: Hoare triple {74355#false} assume !(~y~0 % 4294967296 > 0); {74355#false} is VALID [2022-04-28 10:13:40,675 INFO L290 TraceCheckUtils]: 35: Hoare triple {74355#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {74355#false} is VALID [2022-04-28 10:13:40,676 INFO L290 TraceCheckUtils]: 34: Hoare triple {74355#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {74355#false} is VALID [2022-04-28 10:13:40,676 INFO L290 TraceCheckUtils]: 33: Hoare triple {74355#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {74355#false} is VALID [2022-04-28 10:13:40,676 INFO L290 TraceCheckUtils]: 32: Hoare triple {74355#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {74355#false} is VALID [2022-04-28 10:13:40,676 INFO L290 TraceCheckUtils]: 31: Hoare triple {74355#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {74355#false} is VALID [2022-04-28 10:13:40,676 INFO L290 TraceCheckUtils]: 30: Hoare triple {74355#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {74355#false} is VALID [2022-04-28 10:13:40,676 INFO L290 TraceCheckUtils]: 29: Hoare triple {74355#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {74355#false} is VALID [2022-04-28 10:13:40,676 INFO L290 TraceCheckUtils]: 28: Hoare triple {74355#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {74355#false} is VALID [2022-04-28 10:13:40,676 INFO L290 TraceCheckUtils]: 27: Hoare triple {74355#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {74355#false} is VALID [2022-04-28 10:13:40,676 INFO L290 TraceCheckUtils]: 26: Hoare triple {74355#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {74355#false} is VALID [2022-04-28 10:13:40,676 INFO L290 TraceCheckUtils]: 25: Hoare triple {74355#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {74355#false} is VALID [2022-04-28 10:13:40,676 INFO L290 TraceCheckUtils]: 24: Hoare triple {74355#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {74355#false} is VALID [2022-04-28 10:13:40,676 INFO L290 TraceCheckUtils]: 23: Hoare triple {74355#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {74355#false} is VALID [2022-04-28 10:13:40,676 INFO L290 TraceCheckUtils]: 22: Hoare triple {74554#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {74355#false} is VALID [2022-04-28 10:13:40,678 INFO L290 TraceCheckUtils]: 21: Hoare triple {74558#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {74554#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:13:40,678 INFO L290 TraceCheckUtils]: 20: Hoare triple {74562#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} ~z~0 := ~y~0; {74558#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:13:40,678 INFO L290 TraceCheckUtils]: 19: Hoare triple {74562#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {74562#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:13:40,679 INFO L290 TraceCheckUtils]: 18: Hoare triple {74569#(< 0 (mod main_~y~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; {74562#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:13:40,680 INFO L290 TraceCheckUtils]: 17: Hoare triple {74573#(< 0 (mod (+ main_~y~0 1) 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; {74569#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:13:40,680 INFO L290 TraceCheckUtils]: 16: Hoare triple {74577#(< 0 (mod (+ main_~y~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; {74573#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:13:40,681 INFO L290 TraceCheckUtils]: 15: Hoare triple {74581#(< 0 (mod (+ main_~y~0 3) 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; {74577#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:13:40,682 INFO L290 TraceCheckUtils]: 14: Hoare triple {74585#(< 0 (mod (+ main_~y~0 4) 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; {74581#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:13:40,682 INFO L290 TraceCheckUtils]: 13: Hoare triple {74589#(< 0 (mod (+ 5 main_~y~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; {74585#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:13:40,683 INFO L290 TraceCheckUtils]: 12: Hoare triple {74593#(< 0 (mod (+ main_~y~0 6) 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; {74589#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:13:40,684 INFO L290 TraceCheckUtils]: 11: Hoare triple {74597#(< 0 (mod (+ 7 main_~y~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; {74593#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:13:40,684 INFO L290 TraceCheckUtils]: 10: Hoare triple {74601#(< 0 (mod (+ main_~y~0 8) 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; {74597#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:13:40,685 INFO L290 TraceCheckUtils]: 9: Hoare triple {74605#(< 0 (mod (+ main_~y~0 9) 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; {74601#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:13:40,686 INFO L290 TraceCheckUtils]: 8: Hoare triple {74609#(< 0 (mod (+ main_~y~0 10) 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; {74605#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:13:40,686 INFO L290 TraceCheckUtils]: 7: Hoare triple {74613#(< 0 (mod (+ main_~y~0 11) 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; {74609#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-28 10:13:40,687 INFO L290 TraceCheckUtils]: 6: Hoare triple {74617#(< 0 (mod (+ main_~y~0 12) 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; {74613#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-28 10:13:40,687 INFO L290 TraceCheckUtils]: 5: Hoare triple {74354#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {74617#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-28 10:13:40,687 INFO L272 TraceCheckUtils]: 4: Hoare triple {74354#true} call #t~ret11 := main(); {74354#true} is VALID [2022-04-28 10:13:40,687 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {74354#true} {74354#true} #61#return; {74354#true} is VALID [2022-04-28 10:13:40,687 INFO L290 TraceCheckUtils]: 2: Hoare triple {74354#true} assume true; {74354#true} is VALID [2022-04-28 10:13:40,687 INFO L290 TraceCheckUtils]: 1: Hoare triple {74354#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(10, 2);call #Ultimate.allocInit(12, 3); {74354#true} is VALID [2022-04-28 10:13:40,688 INFO L272 TraceCheckUtils]: 0: Hoare triple {74354#true} call ULTIMATE.init(); {74354#true} is VALID [2022-04-28 10:13:40,688 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-04-28 10:13:40,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1743356044] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:13:40,688 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:13:40,688 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 36 [2022-04-28 10:13:40,688 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:13:40,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1204150677] [2022-04-28 10:13:40,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1204150677] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:13:40,688 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:13:40,688 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-28 10:13:40,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516976428] [2022-04-28 10:13:40,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:13:40,688 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 states have internal predecessors, (25), 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 41 [2022-04-28 10:13:40,689 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:13:40,689 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 states have internal predecessors, (25), 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-28 10:13:40,706 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-28 10:13:40,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-28 10:13:40,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:13:40,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-28 10:13:40,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=989, Unknown=0, NotChecked=0, Total=1260 [2022-04-28 10:13:40,706 INFO L87 Difference]: Start difference. First operand 135 states and 171 transitions. Second operand has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 states have internal predecessors, (25), 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-28 10:13:42,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:13:42,255 INFO L93 Difference]: Finished difference Result 170 states and 206 transitions. [2022-04-28 10:13:42,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-28 10:13:42,255 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 states have internal predecessors, (25), 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 41 [2022-04-28 10:13:42,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:13:42,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 states have internal predecessors, (25), 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-28 10:13:42,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 72 transitions. [2022-04-28 10:13:42,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 states have internal predecessors, (25), 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-28 10:13:42,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 72 transitions. [2022-04-28 10:13:42,257 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 72 transitions. [2022-04-28 10:13:42,310 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:13:42,312 INFO L225 Difference]: With dead ends: 170 [2022-04-28 10:13:42,312 INFO L226 Difference]: Without dead ends: 151 [2022-04-28 10:13:42,312 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=589, Invalid=2167, Unknown=0, NotChecked=0, Total=2756 [2022-04-28 10:13:42,312 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 39 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 806 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 844 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 806 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-28 10:13:42,313 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 104 Invalid, 844 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 806 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-28 10:13:42,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-04-28 10:13:42,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 136. [2022-04-28 10:13:42,457 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:13:42,458 INFO L82 GeneralOperation]: Start isEquivalent. First operand 151 states. Second operand has 136 states, 131 states have (on average 1.282442748091603) internal successors, (168), 131 states have internal predecessors, (168), 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-28 10:13:42,458 INFO L74 IsIncluded]: Start isIncluded. First operand 151 states. Second operand has 136 states, 131 states have (on average 1.282442748091603) internal successors, (168), 131 states have internal predecessors, (168), 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-28 10:13:42,458 INFO L87 Difference]: Start difference. First operand 151 states. Second operand has 136 states, 131 states have (on average 1.282442748091603) internal successors, (168), 131 states have internal predecessors, (168), 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-28 10:13:42,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:13:42,459 INFO L93 Difference]: Finished difference Result 151 states and 187 transitions. [2022-04-28 10:13:42,459 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 187 transitions. [2022-04-28 10:13:42,459 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:13:42,459 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:13:42,459 INFO L74 IsIncluded]: Start isIncluded. First operand has 136 states, 131 states have (on average 1.282442748091603) internal successors, (168), 131 states have internal predecessors, (168), 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 151 states. [2022-04-28 10:13:42,459 INFO L87 Difference]: Start difference. First operand has 136 states, 131 states have (on average 1.282442748091603) internal successors, (168), 131 states have internal predecessors, (168), 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 151 states. [2022-04-28 10:13:42,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:13:42,461 INFO L93 Difference]: Finished difference Result 151 states and 187 transitions. [2022-04-28 10:13:42,461 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 187 transitions. [2022-04-28 10:13:42,461 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:13:42,461 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:13:42,461 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:13:42,461 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:13:42,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 131 states have (on average 1.282442748091603) internal successors, (168), 131 states have internal predecessors, (168), 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-28 10:13:42,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 172 transitions. [2022-04-28 10:13:42,462 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 172 transitions. Word has length 41 [2022-04-28 10:13:42,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:13:42,462 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 172 transitions. [2022-04-28 10:13:42,462 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 states have internal predecessors, (25), 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-28 10:13:42,462 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 136 states and 172 transitions. [2022-04-28 10:13:44,483 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 172 edges. 172 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:13:44,484 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 172 transitions. [2022-04-28 10:13:44,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-28 10:13:44,484 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:13:44,484 INFO L195 NwaCegarLoop]: trace histogram [27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:13:44,500 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (89)] Forceful destruction successful, exit code 0 [2022-04-28 10:13:44,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 89 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable88 [2022-04-28 10:13:44,684 INFO L420 AbstractCegarLoop]: === Iteration 90 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:13:44,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:13:44,685 INFO L85 PathProgramCache]: Analyzing trace with hash -2026195186, now seen corresponding path program 53 times [2022-04-28 10:13:44,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:13:44,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1085976341] [2022-04-28 10:13:44,687 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:13:44,687 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:13:44,687 INFO L85 PathProgramCache]: Analyzing trace with hash -2026195186, now seen corresponding path program 54 times [2022-04-28 10:13:44,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:13:44,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449983246] [2022-04-28 10:13:44,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:13:44,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:13:44,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:13:45,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:13:45,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:13:45,219 INFO L290 TraceCheckUtils]: 0: Hoare triple {75620#(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(10, 2);call #Ultimate.allocInit(12, 3); {75586#true} is VALID [2022-04-28 10:13:45,219 INFO L290 TraceCheckUtils]: 1: Hoare triple {75586#true} assume true; {75586#true} is VALID [2022-04-28 10:13:45,219 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {75586#true} {75586#true} #61#return; {75586#true} is VALID [2022-04-28 10:13:45,219 INFO L272 TraceCheckUtils]: 0: Hoare triple {75586#true} call ULTIMATE.init(); {75620#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:13:45,219 INFO L290 TraceCheckUtils]: 1: Hoare triple {75620#(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(10, 2);call #Ultimate.allocInit(12, 3); {75586#true} is VALID [2022-04-28 10:13:45,219 INFO L290 TraceCheckUtils]: 2: Hoare triple {75586#true} assume true; {75586#true} is VALID [2022-04-28 10:13:45,219 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {75586#true} {75586#true} #61#return; {75586#true} is VALID [2022-04-28 10:13:45,219 INFO L272 TraceCheckUtils]: 4: Hoare triple {75586#true} call #t~ret11 := main(); {75586#true} is VALID [2022-04-28 10:13:45,220 INFO L290 TraceCheckUtils]: 5: Hoare triple {75586#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {75591#(= main_~y~0 0)} is VALID [2022-04-28 10:13:45,220 INFO L290 TraceCheckUtils]: 6: Hoare triple {75591#(= 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; {75592#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:13:45,221 INFO L290 TraceCheckUtils]: 7: Hoare triple {75592#(and (<= 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; {75593#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:13:45,221 INFO L290 TraceCheckUtils]: 8: Hoare triple {75593#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {75594#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:13:45,222 INFO L290 TraceCheckUtils]: 9: Hoare triple {75594#(and (<= main_~y~0 3) (<= 3 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; {75595#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:13:45,222 INFO L290 TraceCheckUtils]: 10: Hoare triple {75595#(and (<= main_~y~0 4) (<= 4 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; {75596#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:13:45,222 INFO L290 TraceCheckUtils]: 11: Hoare triple {75596#(and (<= 5 main_~y~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; {75597#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:13:45,223 INFO L290 TraceCheckUtils]: 12: Hoare triple {75597#(and (<= main_~y~0 6) (<= 6 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; {75598#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:13:45,223 INFO L290 TraceCheckUtils]: 13: Hoare triple {75598#(and (<= 7 main_~y~0) (<= main_~y~0 7))} 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; {75599#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:13:45,224 INFO L290 TraceCheckUtils]: 14: Hoare triple {75599#(and (<= main_~y~0 8) (<= 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; {75600#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:13:45,224 INFO L290 TraceCheckUtils]: 15: Hoare triple {75600#(and (<= 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; {75601#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:13:45,225 INFO L290 TraceCheckUtils]: 16: Hoare triple {75601#(and (<= main_~y~0 10) (<= 10 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; {75602#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:13:45,225 INFO L290 TraceCheckUtils]: 17: Hoare triple {75602#(and (<= main_~y~0 11) (<= 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; {75603#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:13:45,226 INFO L290 TraceCheckUtils]: 18: Hoare triple {75603#(and (<= 12 main_~y~0) (<= main_~y~0 12))} 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; {75604#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:13:45,226 INFO L290 TraceCheckUtils]: 19: Hoare triple {75604#(and (<= main_~y~0 13) (<= 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; {75605#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:13:45,227 INFO L290 TraceCheckUtils]: 20: Hoare triple {75605#(and (<= 14 main_~y~0) (<= main_~y~0 14))} 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; {75606#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:13:45,227 INFO L290 TraceCheckUtils]: 21: Hoare triple {75606#(and (<= main_~y~0 15) (<= 15 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; {75607#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:13:45,228 INFO L290 TraceCheckUtils]: 22: Hoare triple {75607#(and (<= 16 main_~y~0) (<= main_~y~0 16))} 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; {75608#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:13:45,228 INFO L290 TraceCheckUtils]: 23: Hoare triple {75608#(and (<= main_~y~0 17) (<= 17 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; {75609#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 10:13:45,229 INFO L290 TraceCheckUtils]: 24: Hoare triple {75609#(and (<= 18 main_~y~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; {75610#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 10:13:45,229 INFO L290 TraceCheckUtils]: 25: Hoare triple {75610#(and (<= 19 main_~y~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; {75611#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 10:13:45,230 INFO L290 TraceCheckUtils]: 26: Hoare triple {75611#(and (<= 20 main_~y~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; {75612#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 10:13:45,230 INFO L290 TraceCheckUtils]: 27: Hoare triple {75612#(and (<= main_~y~0 21) (<= 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; {75613#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 10:13:45,231 INFO L290 TraceCheckUtils]: 28: Hoare triple {75613#(and (<= main_~y~0 22) (<= 22 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; {75614#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 10:13:45,231 INFO L290 TraceCheckUtils]: 29: Hoare triple {75614#(and (<= main_~y~0 23) (<= 23 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; {75615#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-28 10:13:45,232 INFO L290 TraceCheckUtils]: 30: Hoare triple {75615#(and (<= 24 main_~y~0) (<= main_~y~0 24))} 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; {75616#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-28 10:13:45,232 INFO L290 TraceCheckUtils]: 31: Hoare triple {75616#(and (<= 25 main_~y~0) (<= main_~y~0 25))} 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; {75617#(and (<= main_~y~0 26) (<= 26 main_~y~0))} is VALID [2022-04-28 10:13:45,233 INFO L290 TraceCheckUtils]: 32: Hoare triple {75617#(and (<= main_~y~0 26) (<= 26 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; {75618#(and (<= main_~y~0 27) (<= 27 main_~y~0))} is VALID [2022-04-28 10:13:45,233 INFO L290 TraceCheckUtils]: 33: Hoare triple {75618#(and (<= main_~y~0 27) (<= 27 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {75618#(and (<= main_~y~0 27) (<= 27 main_~y~0))} is VALID [2022-04-28 10:13:45,233 INFO L290 TraceCheckUtils]: 34: Hoare triple {75618#(and (<= main_~y~0 27) (<= 27 main_~y~0))} ~z~0 := ~y~0; {75619#(and (<= (div main_~z~0 4294967296) 0) (<= 27 main_~z~0))} is VALID [2022-04-28 10:13:45,234 INFO L290 TraceCheckUtils]: 35: Hoare triple {75619#(and (<= (div main_~z~0 4294967296) 0) (<= 27 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {75587#false} is VALID [2022-04-28 10:13:45,234 INFO L290 TraceCheckUtils]: 36: Hoare triple {75587#false} assume !(~y~0 % 4294967296 > 0); {75587#false} is VALID [2022-04-28 10:13:45,234 INFO L272 TraceCheckUtils]: 37: Hoare triple {75587#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {75587#false} is VALID [2022-04-28 10:13:45,234 INFO L290 TraceCheckUtils]: 38: Hoare triple {75587#false} ~cond := #in~cond; {75587#false} is VALID [2022-04-28 10:13:45,234 INFO L290 TraceCheckUtils]: 39: Hoare triple {75587#false} assume 0 == ~cond; {75587#false} is VALID [2022-04-28 10:13:45,234 INFO L290 TraceCheckUtils]: 40: Hoare triple {75587#false} assume !false; {75587#false} is VALID [2022-04-28 10:13:45,234 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:13:45,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:13:45,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449983246] [2022-04-28 10:13:45,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449983246] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:13:45,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1852938688] [2022-04-28 10:13:45,235 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:13:45,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:13:45,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:13:45,235 INFO L229 MonitoredProcess]: Starting monitored process 90 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:13:45,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (90)] Waiting until timeout for monitored process [2022-04-28 10:13:46,481 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 15 check-sat command(s) [2022-04-28 10:13:46,481 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:13:46,484 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 59 conjunts are in the unsatisfiable core [2022-04-28 10:13:46,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:13:46,494 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:13:46,851 INFO L272 TraceCheckUtils]: 0: Hoare triple {75586#true} call ULTIMATE.init(); {75586#true} is VALID [2022-04-28 10:13:46,851 INFO L290 TraceCheckUtils]: 1: Hoare triple {75586#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(10, 2);call #Ultimate.allocInit(12, 3); {75586#true} is VALID [2022-04-28 10:13:46,851 INFO L290 TraceCheckUtils]: 2: Hoare triple {75586#true} assume true; {75586#true} is VALID [2022-04-28 10:13:46,851 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {75586#true} {75586#true} #61#return; {75586#true} is VALID [2022-04-28 10:13:46,852 INFO L272 TraceCheckUtils]: 4: Hoare triple {75586#true} call #t~ret11 := main(); {75586#true} is VALID [2022-04-28 10:13:46,852 INFO L290 TraceCheckUtils]: 5: Hoare triple {75586#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {75591#(= main_~y~0 0)} is VALID [2022-04-28 10:13:46,852 INFO L290 TraceCheckUtils]: 6: Hoare triple {75591#(= 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; {75592#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:13:46,853 INFO L290 TraceCheckUtils]: 7: Hoare triple {75592#(and (<= 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; {75593#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:13:46,853 INFO L290 TraceCheckUtils]: 8: Hoare triple {75593#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {75594#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:13:46,854 INFO L290 TraceCheckUtils]: 9: Hoare triple {75594#(and (<= main_~y~0 3) (<= 3 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; {75595#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:13:46,854 INFO L290 TraceCheckUtils]: 10: Hoare triple {75595#(and (<= main_~y~0 4) (<= 4 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; {75596#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:13:46,855 INFO L290 TraceCheckUtils]: 11: Hoare triple {75596#(and (<= 5 main_~y~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; {75597#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:13:46,855 INFO L290 TraceCheckUtils]: 12: Hoare triple {75597#(and (<= main_~y~0 6) (<= 6 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; {75598#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:13:46,856 INFO L290 TraceCheckUtils]: 13: Hoare triple {75598#(and (<= 7 main_~y~0) (<= main_~y~0 7))} 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; {75599#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:13:46,856 INFO L290 TraceCheckUtils]: 14: Hoare triple {75599#(and (<= main_~y~0 8) (<= 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; {75600#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:13:46,857 INFO L290 TraceCheckUtils]: 15: Hoare triple {75600#(and (<= 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; {75601#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:13:46,857 INFO L290 TraceCheckUtils]: 16: Hoare triple {75601#(and (<= main_~y~0 10) (<= 10 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; {75602#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:13:46,858 INFO L290 TraceCheckUtils]: 17: Hoare triple {75602#(and (<= main_~y~0 11) (<= 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; {75603#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:13:46,858 INFO L290 TraceCheckUtils]: 18: Hoare triple {75603#(and (<= 12 main_~y~0) (<= main_~y~0 12))} 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; {75604#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:13:46,859 INFO L290 TraceCheckUtils]: 19: Hoare triple {75604#(and (<= main_~y~0 13) (<= 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; {75605#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:13:46,859 INFO L290 TraceCheckUtils]: 20: Hoare triple {75605#(and (<= 14 main_~y~0) (<= main_~y~0 14))} 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; {75606#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:13:46,860 INFO L290 TraceCheckUtils]: 21: Hoare triple {75606#(and (<= main_~y~0 15) (<= 15 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; {75607#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:13:46,860 INFO L290 TraceCheckUtils]: 22: Hoare triple {75607#(and (<= 16 main_~y~0) (<= main_~y~0 16))} 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; {75608#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:13:46,861 INFO L290 TraceCheckUtils]: 23: Hoare triple {75608#(and (<= main_~y~0 17) (<= 17 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; {75609#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 10:13:46,861 INFO L290 TraceCheckUtils]: 24: Hoare triple {75609#(and (<= 18 main_~y~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; {75610#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 10:13:46,862 INFO L290 TraceCheckUtils]: 25: Hoare triple {75610#(and (<= 19 main_~y~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; {75611#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 10:13:46,862 INFO L290 TraceCheckUtils]: 26: Hoare triple {75611#(and (<= 20 main_~y~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; {75612#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 10:13:46,863 INFO L290 TraceCheckUtils]: 27: Hoare triple {75612#(and (<= main_~y~0 21) (<= 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; {75613#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 10:13:46,863 INFO L290 TraceCheckUtils]: 28: Hoare triple {75613#(and (<= main_~y~0 22) (<= 22 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; {75614#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 10:13:46,864 INFO L290 TraceCheckUtils]: 29: Hoare triple {75614#(and (<= main_~y~0 23) (<= 23 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; {75615#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-28 10:13:46,864 INFO L290 TraceCheckUtils]: 30: Hoare triple {75615#(and (<= 24 main_~y~0) (<= main_~y~0 24))} 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; {75616#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-28 10:13:46,865 INFO L290 TraceCheckUtils]: 31: Hoare triple {75616#(and (<= 25 main_~y~0) (<= main_~y~0 25))} 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; {75617#(and (<= main_~y~0 26) (<= 26 main_~y~0))} is VALID [2022-04-28 10:13:46,865 INFO L290 TraceCheckUtils]: 32: Hoare triple {75617#(and (<= main_~y~0 26) (<= 26 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; {75618#(and (<= main_~y~0 27) (<= 27 main_~y~0))} is VALID [2022-04-28 10:13:46,865 INFO L290 TraceCheckUtils]: 33: Hoare triple {75618#(and (<= main_~y~0 27) (<= 27 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {75618#(and (<= main_~y~0 27) (<= 27 main_~y~0))} is VALID [2022-04-28 10:13:46,866 INFO L290 TraceCheckUtils]: 34: Hoare triple {75618#(and (<= main_~y~0 27) (<= 27 main_~y~0))} ~z~0 := ~y~0; {75726#(and (<= main_~z~0 27) (<= 27 main_~z~0))} is VALID [2022-04-28 10:13:46,866 INFO L290 TraceCheckUtils]: 35: Hoare triple {75726#(and (<= main_~z~0 27) (<= 27 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {75587#false} is VALID [2022-04-28 10:13:46,866 INFO L290 TraceCheckUtils]: 36: Hoare triple {75587#false} assume !(~y~0 % 4294967296 > 0); {75587#false} is VALID [2022-04-28 10:13:46,866 INFO L272 TraceCheckUtils]: 37: Hoare triple {75587#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {75587#false} is VALID [2022-04-28 10:13:46,866 INFO L290 TraceCheckUtils]: 38: Hoare triple {75587#false} ~cond := #in~cond; {75587#false} is VALID [2022-04-28 10:13:46,866 INFO L290 TraceCheckUtils]: 39: Hoare triple {75587#false} assume 0 == ~cond; {75587#false} is VALID [2022-04-28 10:13:46,866 INFO L290 TraceCheckUtils]: 40: Hoare triple {75587#false} assume !false; {75587#false} is VALID [2022-04-28 10:13:46,866 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:13:46,867 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:13:48,177 INFO L290 TraceCheckUtils]: 40: Hoare triple {75587#false} assume !false; {75587#false} is VALID [2022-04-28 10:13:48,177 INFO L290 TraceCheckUtils]: 39: Hoare triple {75587#false} assume 0 == ~cond; {75587#false} is VALID [2022-04-28 10:13:48,177 INFO L290 TraceCheckUtils]: 38: Hoare triple {75587#false} ~cond := #in~cond; {75587#false} is VALID [2022-04-28 10:13:48,177 INFO L272 TraceCheckUtils]: 37: Hoare triple {75587#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {75587#false} is VALID [2022-04-28 10:13:48,177 INFO L290 TraceCheckUtils]: 36: Hoare triple {75587#false} assume !(~y~0 % 4294967296 > 0); {75587#false} is VALID [2022-04-28 10:13:48,177 INFO L290 TraceCheckUtils]: 35: Hoare triple {75760#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {75587#false} is VALID [2022-04-28 10:13:48,178 INFO L290 TraceCheckUtils]: 34: Hoare triple {75764#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {75760#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:13:48,178 INFO L290 TraceCheckUtils]: 33: Hoare triple {75764#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {75764#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:13:48,179 INFO L290 TraceCheckUtils]: 32: Hoare triple {75771#(< 0 (mod (+ main_~y~0 1) 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; {75764#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:13:48,179 INFO L290 TraceCheckUtils]: 31: Hoare triple {75775#(< 0 (mod (+ main_~y~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; {75771#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:13:48,180 INFO L290 TraceCheckUtils]: 30: Hoare triple {75779#(< 0 (mod (+ main_~y~0 3) 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; {75775#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:13:48,181 INFO L290 TraceCheckUtils]: 29: Hoare triple {75783#(< 0 (mod (+ main_~y~0 4) 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; {75779#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:13:48,181 INFO L290 TraceCheckUtils]: 28: Hoare triple {75787#(< 0 (mod (+ 5 main_~y~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; {75783#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:13:48,182 INFO L290 TraceCheckUtils]: 27: Hoare triple {75791#(< 0 (mod (+ main_~y~0 6) 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; {75787#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:13:48,182 INFO L290 TraceCheckUtils]: 26: Hoare triple {75795#(< 0 (mod (+ 7 main_~y~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; {75791#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:13:48,183 INFO L290 TraceCheckUtils]: 25: Hoare triple {75799#(< 0 (mod (+ main_~y~0 8) 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; {75795#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:13:48,184 INFO L290 TraceCheckUtils]: 24: Hoare triple {75803#(< 0 (mod (+ main_~y~0 9) 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; {75799#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:13:48,184 INFO L290 TraceCheckUtils]: 23: Hoare triple {75807#(< 0 (mod (+ main_~y~0 10) 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; {75803#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:13:48,185 INFO L290 TraceCheckUtils]: 22: Hoare triple {75811#(< 0 (mod (+ main_~y~0 11) 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; {75807#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-28 10:13:48,186 INFO L290 TraceCheckUtils]: 21: Hoare triple {75815#(< 0 (mod (+ main_~y~0 12) 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; {75811#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-28 10:13:48,186 INFO L290 TraceCheckUtils]: 20: Hoare triple {75819#(< 0 (mod (+ main_~y~0 13) 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; {75815#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-28 10:13:48,187 INFO L290 TraceCheckUtils]: 19: Hoare triple {75823#(< 0 (mod (+ main_~y~0 14) 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; {75819#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-28 10:13:48,188 INFO L290 TraceCheckUtils]: 18: Hoare triple {75827#(< 0 (mod (+ main_~y~0 15) 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; {75823#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-28 10:13:48,188 INFO L290 TraceCheckUtils]: 17: Hoare triple {75831#(< 0 (mod (+ main_~y~0 16) 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; {75827#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID [2022-04-28 10:13:48,189 INFO L290 TraceCheckUtils]: 16: Hoare triple {75835#(< 0 (mod (+ main_~y~0 17) 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; {75831#(< 0 (mod (+ main_~y~0 16) 4294967296))} is VALID [2022-04-28 10:13:48,189 INFO L290 TraceCheckUtils]: 15: Hoare triple {75839#(< 0 (mod (+ main_~y~0 18) 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; {75835#(< 0 (mod (+ main_~y~0 17) 4294967296))} is VALID [2022-04-28 10:13:48,190 INFO L290 TraceCheckUtils]: 14: Hoare triple {75843#(< 0 (mod (+ 19 main_~y~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; {75839#(< 0 (mod (+ main_~y~0 18) 4294967296))} is VALID [2022-04-28 10:13:48,191 INFO L290 TraceCheckUtils]: 13: Hoare triple {75847#(< 0 (mod (+ main_~y~0 20) 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; {75843#(< 0 (mod (+ 19 main_~y~0) 4294967296))} is VALID [2022-04-28 10:13:48,191 INFO L290 TraceCheckUtils]: 12: Hoare triple {75851#(< 0 (mod (+ main_~y~0 21) 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; {75847#(< 0 (mod (+ main_~y~0 20) 4294967296))} is VALID [2022-04-28 10:13:48,192 INFO L290 TraceCheckUtils]: 11: Hoare triple {75855#(< 0 (mod (+ main_~y~0 22) 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; {75851#(< 0 (mod (+ main_~y~0 21) 4294967296))} is VALID [2022-04-28 10:13:48,192 INFO L290 TraceCheckUtils]: 10: Hoare triple {75859#(< 0 (mod (+ 23 main_~y~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; {75855#(< 0 (mod (+ main_~y~0 22) 4294967296))} is VALID [2022-04-28 10:13:48,193 INFO L290 TraceCheckUtils]: 9: Hoare triple {75863#(< 0 (mod (+ main_~y~0 24) 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; {75859#(< 0 (mod (+ 23 main_~y~0) 4294967296))} is VALID [2022-04-28 10:13:48,194 INFO L290 TraceCheckUtils]: 8: Hoare triple {75867#(< 0 (mod (+ main_~y~0 25) 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; {75863#(< 0 (mod (+ main_~y~0 24) 4294967296))} is VALID [2022-04-28 10:13:48,194 INFO L290 TraceCheckUtils]: 7: Hoare triple {75871#(< 0 (mod (+ main_~y~0 26) 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; {75867#(< 0 (mod (+ main_~y~0 25) 4294967296))} is VALID [2022-04-28 10:13:48,195 INFO L290 TraceCheckUtils]: 6: Hoare triple {75875#(< 0 (mod (+ main_~y~0 27) 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; {75871#(< 0 (mod (+ main_~y~0 26) 4294967296))} is VALID [2022-04-28 10:13:48,195 INFO L290 TraceCheckUtils]: 5: Hoare triple {75586#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {75875#(< 0 (mod (+ main_~y~0 27) 4294967296))} is VALID [2022-04-28 10:13:48,195 INFO L272 TraceCheckUtils]: 4: Hoare triple {75586#true} call #t~ret11 := main(); {75586#true} is VALID [2022-04-28 10:13:48,195 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {75586#true} {75586#true} #61#return; {75586#true} is VALID [2022-04-28 10:13:48,195 INFO L290 TraceCheckUtils]: 2: Hoare triple {75586#true} assume true; {75586#true} is VALID [2022-04-28 10:13:48,196 INFO L290 TraceCheckUtils]: 1: Hoare triple {75586#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(10, 2);call #Ultimate.allocInit(12, 3); {75586#true} is VALID [2022-04-28 10:13:48,196 INFO L272 TraceCheckUtils]: 0: Hoare triple {75586#true} call ULTIMATE.init(); {75586#true} is VALID [2022-04-28 10:13:48,196 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:13:48,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1852938688] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:13:48,196 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:13:48,196 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 31, 31] total 62 [2022-04-28 10:13:48,196 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:13:48,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1085976341] [2022-04-28 10:13:48,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1085976341] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:13:48,196 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:13:48,196 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-04-28 10:13:48,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222743306] [2022-04-28 10:13:48,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:13:48,197 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.15625) internal successors, (37), 31 states have internal predecessors, (37), 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 41 [2022-04-28 10:13:48,197 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:13:48,197 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 32 states, 32 states have (on average 1.15625) internal successors, (37), 31 states have internal predecessors, (37), 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-28 10:13:48,219 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:13:48,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-04-28 10:13:48,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:13:48,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-04-28 10:13:48,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=907, Invalid=2875, Unknown=0, NotChecked=0, Total=3782 [2022-04-28 10:13:48,220 INFO L87 Difference]: Start difference. First operand 136 states and 172 transitions. Second operand has 32 states, 32 states have (on average 1.15625) internal successors, (37), 31 states have internal predecessors, (37), 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-28 10:13:54,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:13:54,119 INFO L93 Difference]: Finished difference Result 175 states and 242 transitions. [2022-04-28 10:13:54,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-04-28 10:13:54,119 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.15625) internal successors, (37), 31 states have internal predecessors, (37), 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 41 [2022-04-28 10:13:54,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:13:54,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.15625) internal successors, (37), 31 states have internal predecessors, (37), 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-28 10:13:54,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 182 transitions. [2022-04-28 10:13:54,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.15625) internal successors, (37), 31 states have internal predecessors, (37), 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-28 10:13:54,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 182 transitions. [2022-04-28 10:13:54,121 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 182 transitions. [2022-04-28 10:13:54,259 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 182 edges. 182 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:13:54,261 INFO L225 Difference]: With dead ends: 175 [2022-04-28 10:13:54,261 INFO L226 Difference]: Without dead ends: 169 [2022-04-28 10:13:54,261 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 491 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1837, Invalid=6353, Unknown=0, NotChecked=0, Total=8190 [2022-04-28 10:13:54,262 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 156 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 3805 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 3920 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 3805 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-04-28 10:13:54,262 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 210 Invalid, 3920 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 3805 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-04-28 10:13:54,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2022-04-28 10:13:54,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 141. [2022-04-28 10:13:54,417 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:13:54,417 INFO L82 GeneralOperation]: Start isEquivalent. First operand 169 states. Second operand has 141 states, 136 states have (on average 1.286764705882353) internal successors, (175), 136 states have internal predecessors, (175), 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-28 10:13:54,417 INFO L74 IsIncluded]: Start isIncluded. First operand 169 states. Second operand has 141 states, 136 states have (on average 1.286764705882353) internal successors, (175), 136 states have internal predecessors, (175), 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-28 10:13:54,418 INFO L87 Difference]: Start difference. First operand 169 states. Second operand has 141 states, 136 states have (on average 1.286764705882353) internal successors, (175), 136 states have internal predecessors, (175), 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-28 10:13:54,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:13:54,419 INFO L93 Difference]: Finished difference Result 169 states and 207 transitions. [2022-04-28 10:13:54,419 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 207 transitions. [2022-04-28 10:13:54,419 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:13:54,419 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:13:54,419 INFO L74 IsIncluded]: Start isIncluded. First operand has 141 states, 136 states have (on average 1.286764705882353) internal successors, (175), 136 states have internal predecessors, (175), 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 169 states. [2022-04-28 10:13:54,419 INFO L87 Difference]: Start difference. First operand has 141 states, 136 states have (on average 1.286764705882353) internal successors, (175), 136 states have internal predecessors, (175), 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 169 states. [2022-04-28 10:13:54,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:13:54,421 INFO L93 Difference]: Finished difference Result 169 states and 207 transitions. [2022-04-28 10:13:54,421 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 207 transitions. [2022-04-28 10:13:54,421 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:13:54,421 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:13:54,421 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:13:54,421 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:13:54,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 136 states have (on average 1.286764705882353) internal successors, (175), 136 states have internal predecessors, (175), 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-28 10:13:54,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 179 transitions. [2022-04-28 10:13:54,422 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 179 transitions. Word has length 41 [2022-04-28 10:13:54,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:13:54,422 INFO L495 AbstractCegarLoop]: Abstraction has 141 states and 179 transitions. [2022-04-28 10:13:54,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 1.15625) internal successors, (37), 31 states have internal predecessors, (37), 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-28 10:13:54,423 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 141 states and 179 transitions. [2022-04-28 10:13:57,743 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 179 edges. 178 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 10:13:57,743 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 179 transitions. [2022-04-28 10:13:57,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-28 10:13:57,743 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:13:57,743 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:13:57,750 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (90)] Forceful destruction successful, exit code 0 [2022-04-28 10:13:57,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 90 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable89 [2022-04-28 10:13:57,944 INFO L420 AbstractCegarLoop]: === Iteration 91 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:13:57,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:13:57,944 INFO L85 PathProgramCache]: Analyzing trace with hash -647408947, now seen corresponding path program 125 times [2022-04-28 10:13:57,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:13:57,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1552964152] [2022-04-28 10:13:57,946 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:13:57,946 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:13:57,946 INFO L85 PathProgramCache]: Analyzing trace with hash -647408947, now seen corresponding path program 126 times [2022-04-28 10:13:57,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:13:57,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419553708] [2022-04-28 10:13:57,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:13:57,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:13:57,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:13:58,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:13:58,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:13:58,258 INFO L290 TraceCheckUtils]: 0: Hoare triple {76949#(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(10, 2);call #Ultimate.allocInit(12, 3); {76924#true} is VALID [2022-04-28 10:13:58,258 INFO L290 TraceCheckUtils]: 1: Hoare triple {76924#true} assume true; {76924#true} is VALID [2022-04-28 10:13:58,258 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {76924#true} {76924#true} #61#return; {76924#true} is VALID [2022-04-28 10:13:58,259 INFO L272 TraceCheckUtils]: 0: Hoare triple {76924#true} call ULTIMATE.init(); {76949#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:13:58,259 INFO L290 TraceCheckUtils]: 1: Hoare triple {76949#(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(10, 2);call #Ultimate.allocInit(12, 3); {76924#true} is VALID [2022-04-28 10:13:58,259 INFO L290 TraceCheckUtils]: 2: Hoare triple {76924#true} assume true; {76924#true} is VALID [2022-04-28 10:13:58,259 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {76924#true} {76924#true} #61#return; {76924#true} is VALID [2022-04-28 10:13:58,259 INFO L272 TraceCheckUtils]: 4: Hoare triple {76924#true} call #t~ret11 := main(); {76924#true} is VALID [2022-04-28 10:13:58,259 INFO L290 TraceCheckUtils]: 5: Hoare triple {76924#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {76929#(= main_~y~0 0)} is VALID [2022-04-28 10:13:58,260 INFO L290 TraceCheckUtils]: 6: Hoare triple {76929#(= 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; {76930#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:13:58,260 INFO L290 TraceCheckUtils]: 7: Hoare triple {76930#(and (<= 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; {76931#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:13:58,261 INFO L290 TraceCheckUtils]: 8: Hoare triple {76931#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {76932#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:13:58,261 INFO L290 TraceCheckUtils]: 9: Hoare triple {76932#(and (<= main_~y~0 3) (<= 3 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; {76933#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:13:58,262 INFO L290 TraceCheckUtils]: 10: Hoare triple {76933#(and (<= main_~y~0 4) (<= 4 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; {76934#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:13:58,262 INFO L290 TraceCheckUtils]: 11: Hoare triple {76934#(and (<= 5 main_~y~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; {76935#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:13:58,263 INFO L290 TraceCheckUtils]: 12: Hoare triple {76935#(and (<= main_~y~0 6) (<= 6 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; {76936#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:13:58,263 INFO L290 TraceCheckUtils]: 13: Hoare triple {76936#(and (<= 7 main_~y~0) (<= main_~y~0 7))} 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; {76937#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:13:58,264 INFO L290 TraceCheckUtils]: 14: Hoare triple {76937#(and (<= main_~y~0 8) (<= 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; {76938#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:13:58,264 INFO L290 TraceCheckUtils]: 15: Hoare triple {76938#(and (<= 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; {76939#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:13:58,264 INFO L290 TraceCheckUtils]: 16: Hoare triple {76939#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {76939#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:13:58,265 INFO L290 TraceCheckUtils]: 17: Hoare triple {76939#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {76940#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:13:58,265 INFO L290 TraceCheckUtils]: 18: Hoare triple {76940#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {76941#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:13:58,266 INFO L290 TraceCheckUtils]: 19: Hoare triple {76941#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {76942#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:13:58,266 INFO L290 TraceCheckUtils]: 20: Hoare triple {76942#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {76943#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:13:58,267 INFO L290 TraceCheckUtils]: 21: Hoare triple {76943#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {76944#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:13:58,267 INFO L290 TraceCheckUtils]: 22: Hoare triple {76944#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {76945#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:13:58,268 INFO L290 TraceCheckUtils]: 23: Hoare triple {76945#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {76946#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:13:58,268 INFO L290 TraceCheckUtils]: 24: Hoare triple {76946#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {76947#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:13:58,269 INFO L290 TraceCheckUtils]: 25: Hoare triple {76947#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {76948#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} is VALID [2022-04-28 10:13:58,269 INFO L290 TraceCheckUtils]: 26: Hoare triple {76948#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {76925#false} is VALID [2022-04-28 10:13:58,269 INFO L290 TraceCheckUtils]: 27: Hoare triple {76925#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {76925#false} is VALID [2022-04-28 10:13:58,269 INFO L290 TraceCheckUtils]: 28: Hoare triple {76925#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {76925#false} is VALID [2022-04-28 10:13:58,269 INFO L290 TraceCheckUtils]: 29: Hoare triple {76925#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {76925#false} is VALID [2022-04-28 10:13:58,269 INFO L290 TraceCheckUtils]: 30: Hoare triple {76925#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {76925#false} is VALID [2022-04-28 10:13:58,269 INFO L290 TraceCheckUtils]: 31: Hoare triple {76925#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {76925#false} is VALID [2022-04-28 10:13:58,269 INFO L290 TraceCheckUtils]: 32: Hoare triple {76925#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {76925#false} is VALID [2022-04-28 10:13:58,269 INFO L290 TraceCheckUtils]: 33: Hoare triple {76925#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {76925#false} is VALID [2022-04-28 10:13:58,269 INFO L290 TraceCheckUtils]: 34: Hoare triple {76925#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {76925#false} is VALID [2022-04-28 10:13:58,270 INFO L290 TraceCheckUtils]: 35: Hoare triple {76925#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {76925#false} is VALID [2022-04-28 10:13:58,270 INFO L290 TraceCheckUtils]: 36: Hoare triple {76925#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {76925#false} is VALID [2022-04-28 10:13:58,270 INFO L290 TraceCheckUtils]: 37: Hoare triple {76925#false} assume !(~y~0 % 4294967296 > 0); {76925#false} is VALID [2022-04-28 10:13:58,270 INFO L272 TraceCheckUtils]: 38: Hoare triple {76925#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {76925#false} is VALID [2022-04-28 10:13:58,270 INFO L290 TraceCheckUtils]: 39: Hoare triple {76925#false} ~cond := #in~cond; {76925#false} is VALID [2022-04-28 10:13:58,270 INFO L290 TraceCheckUtils]: 40: Hoare triple {76925#false} assume 0 == ~cond; {76925#false} is VALID [2022-04-28 10:13:58,270 INFO L290 TraceCheckUtils]: 41: Hoare triple {76925#false} assume !false; {76925#false} is VALID [2022-04-28 10:13:58,270 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-04-28 10:13:58,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:13:58,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419553708] [2022-04-28 10:13:58,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419553708] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:13:58,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [210620384] [2022-04-28 10:13:58,270 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:13:58,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:13:58,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:13:58,271 INFO L229 MonitoredProcess]: Starting monitored process 91 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:13:58,272 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (91)] Waiting until timeout for monitored process [2022-04-28 10:13:58,473 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-04-28 10:13:58,473 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:13:58,475 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 58 conjunts are in the unsatisfiable core [2022-04-28 10:13:58,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:13:58,485 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:13:58,900 INFO L272 TraceCheckUtils]: 0: Hoare triple {76924#true} call ULTIMATE.init(); {76924#true} is VALID [2022-04-28 10:13:58,900 INFO L290 TraceCheckUtils]: 1: Hoare triple {76924#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(10, 2);call #Ultimate.allocInit(12, 3); {76924#true} is VALID [2022-04-28 10:13:58,900 INFO L290 TraceCheckUtils]: 2: Hoare triple {76924#true} assume true; {76924#true} is VALID [2022-04-28 10:13:58,900 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {76924#true} {76924#true} #61#return; {76924#true} is VALID [2022-04-28 10:13:58,900 INFO L272 TraceCheckUtils]: 4: Hoare triple {76924#true} call #t~ret11 := main(); {76924#true} is VALID [2022-04-28 10:13:58,900 INFO L290 TraceCheckUtils]: 5: Hoare triple {76924#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {76929#(= main_~y~0 0)} is VALID [2022-04-28 10:13:58,901 INFO L290 TraceCheckUtils]: 6: Hoare triple {76929#(= 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; {76930#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:13:58,901 INFO L290 TraceCheckUtils]: 7: Hoare triple {76930#(and (<= 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; {76931#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:13:58,902 INFO L290 TraceCheckUtils]: 8: Hoare triple {76931#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {76932#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:13:58,902 INFO L290 TraceCheckUtils]: 9: Hoare triple {76932#(and (<= main_~y~0 3) (<= 3 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; {76933#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:13:58,903 INFO L290 TraceCheckUtils]: 10: Hoare triple {76933#(and (<= main_~y~0 4) (<= 4 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; {76934#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:13:58,903 INFO L290 TraceCheckUtils]: 11: Hoare triple {76934#(and (<= 5 main_~y~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; {76935#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:13:58,904 INFO L290 TraceCheckUtils]: 12: Hoare triple {76935#(and (<= main_~y~0 6) (<= 6 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; {76936#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:13:58,904 INFO L290 TraceCheckUtils]: 13: Hoare triple {76936#(and (<= 7 main_~y~0) (<= main_~y~0 7))} 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; {76937#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:13:58,904 INFO L290 TraceCheckUtils]: 14: Hoare triple {76937#(and (<= main_~y~0 8) (<= 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; {76938#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:13:58,905 INFO L290 TraceCheckUtils]: 15: Hoare triple {76938#(and (<= 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; {76939#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:13:58,905 INFO L290 TraceCheckUtils]: 16: Hoare triple {76939#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {76939#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:13:58,906 INFO L290 TraceCheckUtils]: 17: Hoare triple {76939#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {77004#(and (= main_~z~0 main_~y~0) (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:13:58,906 INFO L290 TraceCheckUtils]: 18: Hoare triple {77004#(and (= main_~z~0 main_~y~0) (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {77008#(and (<= main_~y~0 10) (<= 10 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-28 10:13:58,907 INFO L290 TraceCheckUtils]: 19: Hoare triple {77008#(and (<= main_~y~0 10) (<= 10 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {77012#(and (= main_~y~0 (+ main_~z~0 2)) (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:13:58,907 INFO L290 TraceCheckUtils]: 20: Hoare triple {77012#(and (= main_~y~0 (+ main_~z~0 2)) (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {77016#(and (<= main_~y~0 10) (<= 10 main_~y~0) (= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-28 10:13:58,908 INFO L290 TraceCheckUtils]: 21: Hoare triple {77016#(and (<= main_~y~0 10) (<= 10 main_~y~0) (= main_~y~0 (+ main_~z~0 3)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {77020#(and (= (+ main_~y~0 (- 3)) (+ main_~z~0 1)) (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:13:58,908 INFO L290 TraceCheckUtils]: 22: Hoare triple {77020#(and (= (+ main_~y~0 (- 3)) (+ main_~z~0 1)) (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {77024#(and (<= main_~y~0 10) (<= 10 main_~y~0) (= (+ main_~y~0 (- 3)) (+ main_~z~0 2)))} is VALID [2022-04-28 10:13:58,909 INFO L290 TraceCheckUtils]: 23: Hoare triple {77024#(and (<= main_~y~0 10) (<= 10 main_~y~0) (= (+ main_~y~0 (- 3)) (+ main_~z~0 2)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {77028#(and (<= main_~y~0 10) (<= 10 main_~y~0) (= (+ main_~y~0 (- 3)) (+ main_~z~0 3)))} is VALID [2022-04-28 10:13:58,909 INFO L290 TraceCheckUtils]: 24: Hoare triple {77028#(and (<= main_~y~0 10) (<= 10 main_~y~0) (= (+ main_~y~0 (- 3)) (+ main_~z~0 3)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {77032#(and (<= main_~y~0 10) (<= 10 main_~y~0) (= (+ main_~y~0 (- 6)) (+ main_~z~0 1)))} is VALID [2022-04-28 10:13:58,910 INFO L290 TraceCheckUtils]: 25: Hoare triple {77032#(and (<= main_~y~0 10) (<= 10 main_~y~0) (= (+ main_~y~0 (- 6)) (+ main_~z~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {77036#(and (<= main_~y~0 10) (<= 10 main_~y~0) (= (+ main_~y~0 (- 6)) (+ main_~z~0 2)))} is VALID [2022-04-28 10:13:58,910 INFO L290 TraceCheckUtils]: 26: Hoare triple {77036#(and (<= main_~y~0 10) (<= 10 main_~y~0) (= (+ main_~y~0 (- 6)) (+ main_~z~0 2)))} assume !(~z~0 % 4294967296 > 0); {76925#false} is VALID [2022-04-28 10:13:58,910 INFO L290 TraceCheckUtils]: 27: Hoare triple {76925#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {76925#false} is VALID [2022-04-28 10:13:58,911 INFO L290 TraceCheckUtils]: 28: Hoare triple {76925#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {76925#false} is VALID [2022-04-28 10:13:58,911 INFO L290 TraceCheckUtils]: 29: Hoare triple {76925#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {76925#false} is VALID [2022-04-28 10:13:58,911 INFO L290 TraceCheckUtils]: 30: Hoare triple {76925#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {76925#false} is VALID [2022-04-28 10:13:58,911 INFO L290 TraceCheckUtils]: 31: Hoare triple {76925#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {76925#false} is VALID [2022-04-28 10:13:58,911 INFO L290 TraceCheckUtils]: 32: Hoare triple {76925#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {76925#false} is VALID [2022-04-28 10:13:58,911 INFO L290 TraceCheckUtils]: 33: Hoare triple {76925#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {76925#false} is VALID [2022-04-28 10:13:58,911 INFO L290 TraceCheckUtils]: 34: Hoare triple {76925#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {76925#false} is VALID [2022-04-28 10:13:58,911 INFO L290 TraceCheckUtils]: 35: Hoare triple {76925#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {76925#false} is VALID [2022-04-28 10:13:58,911 INFO L290 TraceCheckUtils]: 36: Hoare triple {76925#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {76925#false} is VALID [2022-04-28 10:13:58,911 INFO L290 TraceCheckUtils]: 37: Hoare triple {76925#false} assume !(~y~0 % 4294967296 > 0); {76925#false} is VALID [2022-04-28 10:13:58,911 INFO L272 TraceCheckUtils]: 38: Hoare triple {76925#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {76925#false} is VALID [2022-04-28 10:13:58,911 INFO L290 TraceCheckUtils]: 39: Hoare triple {76925#false} ~cond := #in~cond; {76925#false} is VALID [2022-04-28 10:13:58,911 INFO L290 TraceCheckUtils]: 40: Hoare triple {76925#false} assume 0 == ~cond; {76925#false} is VALID [2022-04-28 10:13:58,911 INFO L290 TraceCheckUtils]: 41: Hoare triple {76925#false} assume !false; {76925#false} is VALID [2022-04-28 10:13:58,911 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-04-28 10:13:58,911 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:13:59,583 INFO L290 TraceCheckUtils]: 41: Hoare triple {76925#false} assume !false; {76925#false} is VALID [2022-04-28 10:13:59,583 INFO L290 TraceCheckUtils]: 40: Hoare triple {76925#false} assume 0 == ~cond; {76925#false} is VALID [2022-04-28 10:13:59,583 INFO L290 TraceCheckUtils]: 39: Hoare triple {76925#false} ~cond := #in~cond; {76925#false} is VALID [2022-04-28 10:13:59,583 INFO L272 TraceCheckUtils]: 38: Hoare triple {76925#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {76925#false} is VALID [2022-04-28 10:13:59,583 INFO L290 TraceCheckUtils]: 37: Hoare triple {76925#false} assume !(~y~0 % 4294967296 > 0); {76925#false} is VALID [2022-04-28 10:13:59,583 INFO L290 TraceCheckUtils]: 36: Hoare triple {76925#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {76925#false} is VALID [2022-04-28 10:13:59,583 INFO L290 TraceCheckUtils]: 35: Hoare triple {77103#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {76925#false} is VALID [2022-04-28 10:13:59,584 INFO L290 TraceCheckUtils]: 34: Hoare triple {77107#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {77103#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:13:59,585 INFO L290 TraceCheckUtils]: 33: Hoare triple {77111#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {77107#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:13:59,586 INFO L290 TraceCheckUtils]: 32: Hoare triple {77115#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {77111#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-28 10:13:59,586 INFO L290 TraceCheckUtils]: 31: Hoare triple {77119#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {77115#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-28 10:13:59,587 INFO L290 TraceCheckUtils]: 30: Hoare triple {77123#(not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {77119#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:13:59,588 INFO L290 TraceCheckUtils]: 29: Hoare triple {77127#(not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {77123#(not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:13:59,589 INFO L290 TraceCheckUtils]: 28: Hoare triple {77131#(not (< 0 (mod (+ main_~y~0 4294967289) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {77127#(not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:13:59,589 INFO L290 TraceCheckUtils]: 27: Hoare triple {77135#(not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {77131#(not (< 0 (mod (+ main_~y~0 4294967289) 4294967296)))} is VALID [2022-04-28 10:13:59,589 INFO L290 TraceCheckUtils]: 26: Hoare triple {77139#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod main_~z~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {77135#(not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:13:59,590 INFO L290 TraceCheckUtils]: 25: Hoare triple {77143#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {77139#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-28 10:13:59,591 INFO L290 TraceCheckUtils]: 24: Hoare triple {77147#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {77143#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:13:59,592 INFO L290 TraceCheckUtils]: 23: Hoare triple {77151#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {77147#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))))} is VALID [2022-04-28 10:13:59,593 INFO L290 TraceCheckUtils]: 22: Hoare triple {77155#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {77151#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} is VALID [2022-04-28 10:13:59,595 INFO L290 TraceCheckUtils]: 21: Hoare triple {77159#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {77155#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)))} is VALID [2022-04-28 10:13:59,595 INFO L290 TraceCheckUtils]: 20: Hoare triple {77163#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod (+ 4294967290 main_~z~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {77159#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)))} is VALID [2022-04-28 10:13:59,596 INFO L290 TraceCheckUtils]: 19: Hoare triple {77167#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod (+ main_~z~0 4294967289) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {77163#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod (+ 4294967290 main_~z~0) 4294967296)))} is VALID [2022-04-28 10:13:59,597 INFO L290 TraceCheckUtils]: 18: Hoare triple {77171#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod (+ 4294967288 main_~z~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {77167#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod (+ main_~z~0 4294967289) 4294967296)))} is VALID [2022-04-28 10:13:59,597 INFO L290 TraceCheckUtils]: 17: Hoare triple {76924#true} ~z~0 := ~y~0; {77171#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod (+ 4294967288 main_~z~0) 4294967296)))} is VALID [2022-04-28 10:13:59,597 INFO L290 TraceCheckUtils]: 16: Hoare triple {76924#true} assume !(~x~0 % 4294967296 > 0); {76924#true} is VALID [2022-04-28 10:13:59,597 INFO L290 TraceCheckUtils]: 15: Hoare triple {76924#true} 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; {76924#true} is VALID [2022-04-28 10:13:59,598 INFO L290 TraceCheckUtils]: 14: Hoare triple {76924#true} 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; {76924#true} is VALID [2022-04-28 10:13:59,598 INFO L290 TraceCheckUtils]: 13: Hoare triple {76924#true} 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; {76924#true} is VALID [2022-04-28 10:13:59,598 INFO L290 TraceCheckUtils]: 12: Hoare triple {76924#true} 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; {76924#true} is VALID [2022-04-28 10:13:59,598 INFO L290 TraceCheckUtils]: 11: Hoare triple {76924#true} 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; {76924#true} is VALID [2022-04-28 10:13:59,598 INFO L290 TraceCheckUtils]: 10: Hoare triple {76924#true} 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; {76924#true} is VALID [2022-04-28 10:13:59,598 INFO L290 TraceCheckUtils]: 9: Hoare triple {76924#true} 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; {76924#true} is VALID [2022-04-28 10:13:59,598 INFO L290 TraceCheckUtils]: 8: Hoare triple {76924#true} 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; {76924#true} is VALID [2022-04-28 10:13:59,598 INFO L290 TraceCheckUtils]: 7: Hoare triple {76924#true} 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; {76924#true} is VALID [2022-04-28 10:13:59,598 INFO L290 TraceCheckUtils]: 6: Hoare triple {76924#true} 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; {76924#true} is VALID [2022-04-28 10:13:59,598 INFO L290 TraceCheckUtils]: 5: Hoare triple {76924#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {76924#true} is VALID [2022-04-28 10:13:59,598 INFO L272 TraceCheckUtils]: 4: Hoare triple {76924#true} call #t~ret11 := main(); {76924#true} is VALID [2022-04-28 10:13:59,598 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {76924#true} {76924#true} #61#return; {76924#true} is VALID [2022-04-28 10:13:59,598 INFO L290 TraceCheckUtils]: 2: Hoare triple {76924#true} assume true; {76924#true} is VALID [2022-04-28 10:13:59,598 INFO L290 TraceCheckUtils]: 1: Hoare triple {76924#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(10, 2);call #Ultimate.allocInit(12, 3); {76924#true} is VALID [2022-04-28 10:13:59,598 INFO L272 TraceCheckUtils]: 0: Hoare triple {76924#true} call ULTIMATE.init(); {76924#true} is VALID [2022-04-28 10:13:59,598 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 18 proven. 72 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-04-28 10:13:59,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [210620384] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:13:59,598 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:13:59,599 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 20] total 50 [2022-04-28 10:13:59,599 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:13:59,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1552964152] [2022-04-28 10:13:59,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1552964152] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:13:59,599 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:13:59,599 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-28 10:13:59,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517572750] [2022-04-28 10:13:59,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:13:59,599 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 22 states have internal predecessors, (29), 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 42 [2022-04-28 10:13:59,599 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:13:59,599 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 23 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 22 states have internal predecessors, (29), 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-28 10:13:59,620 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:13:59,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-28 10:13:59,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:13:59,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-28 10:13:59,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=2150, Unknown=0, NotChecked=0, Total=2450 [2022-04-28 10:13:59,621 INFO L87 Difference]: Start difference. First operand 141 states and 179 transitions. Second operand has 23 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 22 states have internal predecessors, (29), 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-28 10:14:01,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:01,056 INFO L93 Difference]: Finished difference Result 170 states and 208 transitions. [2022-04-28 10:14:01,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-28 10:14:01,057 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 22 states have internal predecessors, (29), 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 42 [2022-04-28 10:14:01,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:14:01,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 22 states have internal predecessors, (29), 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-28 10:14:01,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 60 transitions. [2022-04-28 10:14:01,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 22 states have internal predecessors, (29), 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-28 10:14:01,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 60 transitions. [2022-04-28 10:14:01,058 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 60 transitions. [2022-04-28 10:14:01,104 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:14:01,106 INFO L225 Difference]: With dead ends: 170 [2022-04-28 10:14:01,106 INFO L226 Difference]: Without dead ends: 154 [2022-04-28 10:14:01,106 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 786 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=508, Invalid=4322, Unknown=0, NotChecked=0, Total=4830 [2022-04-28 10:14:01,106 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 17 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 564 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 10:14:01,107 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 78 Invalid, 606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 564 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 10:14:01,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2022-04-28 10:14:01,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 142. [2022-04-28 10:14:01,258 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:14:01,258 INFO L82 GeneralOperation]: Start isEquivalent. First operand 154 states. Second operand has 142 states, 137 states have (on average 1.2846715328467153) internal successors, (176), 137 states have internal predecessors, (176), 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-28 10:14:01,258 INFO L74 IsIncluded]: Start isIncluded. First operand 154 states. Second operand has 142 states, 137 states have (on average 1.2846715328467153) internal successors, (176), 137 states have internal predecessors, (176), 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-28 10:14:01,258 INFO L87 Difference]: Start difference. First operand 154 states. Second operand has 142 states, 137 states have (on average 1.2846715328467153) internal successors, (176), 137 states have internal predecessors, (176), 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-28 10:14:01,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:01,259 INFO L93 Difference]: Finished difference Result 154 states and 192 transitions. [2022-04-28 10:14:01,259 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 192 transitions. [2022-04-28 10:14:01,260 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:14:01,260 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:14:01,260 INFO L74 IsIncluded]: Start isIncluded. First operand has 142 states, 137 states have (on average 1.2846715328467153) internal successors, (176), 137 states have internal predecessors, (176), 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 154 states. [2022-04-28 10:14:01,260 INFO L87 Difference]: Start difference. First operand has 142 states, 137 states have (on average 1.2846715328467153) internal successors, (176), 137 states have internal predecessors, (176), 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 154 states. [2022-04-28 10:14:01,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:01,261 INFO L93 Difference]: Finished difference Result 154 states and 192 transitions. [2022-04-28 10:14:01,261 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 192 transitions. [2022-04-28 10:14:01,261 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:14:01,261 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:14:01,261 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:14:01,261 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:14:01,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 137 states have (on average 1.2846715328467153) internal successors, (176), 137 states have internal predecessors, (176), 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-28 10:14:01,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 180 transitions. [2022-04-28 10:14:01,263 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 180 transitions. Word has length 42 [2022-04-28 10:14:01,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:14:01,263 INFO L495 AbstractCegarLoop]: Abstraction has 142 states and 180 transitions. [2022-04-28 10:14:01,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 22 states have internal predecessors, (29), 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-28 10:14:01,263 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 142 states and 180 transitions. [2022-04-28 10:14:04,215 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 180 edges. 180 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:14:04,215 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 180 transitions. [2022-04-28 10:14:04,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-28 10:14:04,216 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:14:04,216 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:14:04,222 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (91)] Forceful destruction successful, exit code 0 [2022-04-28 10:14:04,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90,91 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:14:04,416 INFO L420 AbstractCegarLoop]: === Iteration 92 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:14:04,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:14:04,417 INFO L85 PathProgramCache]: Analyzing trace with hash -1157583489, now seen corresponding path program 127 times [2022-04-28 10:14:04,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:14:04,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1501361860] [2022-04-28 10:14:04,418 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:14:04,419 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:14:04,419 INFO L85 PathProgramCache]: Analyzing trace with hash -1157583489, now seen corresponding path program 128 times [2022-04-28 10:14:04,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:14:04,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268685586] [2022-04-28 10:14:04,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:14:04,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:14:04,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:14:04,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:14:04,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:14:04,712 INFO L290 TraceCheckUtils]: 0: Hoare triple {78224#(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(10, 2);call #Ultimate.allocInit(12, 3); {78200#true} is VALID [2022-04-28 10:14:04,712 INFO L290 TraceCheckUtils]: 1: Hoare triple {78200#true} assume true; {78200#true} is VALID [2022-04-28 10:14:04,712 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {78200#true} {78200#true} #61#return; {78200#true} is VALID [2022-04-28 10:14:04,712 INFO L272 TraceCheckUtils]: 0: Hoare triple {78200#true} call ULTIMATE.init(); {78224#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:14:04,712 INFO L290 TraceCheckUtils]: 1: Hoare triple {78224#(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(10, 2);call #Ultimate.allocInit(12, 3); {78200#true} is VALID [2022-04-28 10:14:04,712 INFO L290 TraceCheckUtils]: 2: Hoare triple {78200#true} assume true; {78200#true} is VALID [2022-04-28 10:14:04,712 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {78200#true} {78200#true} #61#return; {78200#true} is VALID [2022-04-28 10:14:04,712 INFO L272 TraceCheckUtils]: 4: Hoare triple {78200#true} call #t~ret11 := main(); {78200#true} is VALID [2022-04-28 10:14:04,712 INFO L290 TraceCheckUtils]: 5: Hoare triple {78200#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {78205#(= main_~y~0 0)} is VALID [2022-04-28 10:14:04,713 INFO L290 TraceCheckUtils]: 6: Hoare triple {78205#(= 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; {78206#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:14:04,713 INFO L290 TraceCheckUtils]: 7: Hoare triple {78206#(and (<= 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; {78207#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:14:04,714 INFO L290 TraceCheckUtils]: 8: Hoare triple {78207#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {78208#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:14:04,714 INFO L290 TraceCheckUtils]: 9: Hoare triple {78208#(and (<= main_~y~0 3) (<= 3 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; {78209#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:14:04,715 INFO L290 TraceCheckUtils]: 10: Hoare triple {78209#(and (<= main_~y~0 4) (<= 4 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; {78210#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:14:04,715 INFO L290 TraceCheckUtils]: 11: Hoare triple {78210#(and (<= 5 main_~y~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; {78211#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:14:04,716 INFO L290 TraceCheckUtils]: 12: Hoare triple {78211#(and (<= main_~y~0 6) (<= 6 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; {78212#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:14:04,716 INFO L290 TraceCheckUtils]: 13: Hoare triple {78212#(and (<= 7 main_~y~0) (<= main_~y~0 7))} 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; {78213#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:14:04,717 INFO L290 TraceCheckUtils]: 14: Hoare triple {78213#(and (<= main_~y~0 8) (<= 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; {78214#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:14:04,717 INFO L290 TraceCheckUtils]: 15: Hoare triple {78214#(and (<= 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; {78215#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:14:04,718 INFO L290 TraceCheckUtils]: 16: Hoare triple {78215#(and (<= main_~y~0 10) (<= 10 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; {78216#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:14:04,718 INFO L290 TraceCheckUtils]: 17: Hoare triple {78216#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {78216#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:14:04,718 INFO L290 TraceCheckUtils]: 18: Hoare triple {78216#(and (<= main_~y~0 11) (<= 11 main_~y~0))} ~z~0 := ~y~0; {78217#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-28 10:14:04,719 INFO L290 TraceCheckUtils]: 19: Hoare triple {78217#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {78218#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:14:04,719 INFO L290 TraceCheckUtils]: 20: Hoare triple {78218#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {78219#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:14:04,720 INFO L290 TraceCheckUtils]: 21: Hoare triple {78219#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {78220#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:14:04,720 INFO L290 TraceCheckUtils]: 22: Hoare triple {78220#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {78221#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:14:04,721 INFO L290 TraceCheckUtils]: 23: Hoare triple {78221#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {78222#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:14:04,721 INFO L290 TraceCheckUtils]: 24: Hoare triple {78222#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {78223#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:14:04,722 INFO L290 TraceCheckUtils]: 25: Hoare triple {78223#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {78201#false} is VALID [2022-04-28 10:14:04,722 INFO L290 TraceCheckUtils]: 26: Hoare triple {78201#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {78201#false} is VALID [2022-04-28 10:14:04,722 INFO L290 TraceCheckUtils]: 27: Hoare triple {78201#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {78201#false} is VALID [2022-04-28 10:14:04,722 INFO L290 TraceCheckUtils]: 28: Hoare triple {78201#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {78201#false} is VALID [2022-04-28 10:14:04,722 INFO L290 TraceCheckUtils]: 29: Hoare triple {78201#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {78201#false} is VALID [2022-04-28 10:14:04,722 INFO L290 TraceCheckUtils]: 30: Hoare triple {78201#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {78201#false} is VALID [2022-04-28 10:14:04,722 INFO L290 TraceCheckUtils]: 31: Hoare triple {78201#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {78201#false} is VALID [2022-04-28 10:14:04,722 INFO L290 TraceCheckUtils]: 32: Hoare triple {78201#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {78201#false} is VALID [2022-04-28 10:14:04,722 INFO L290 TraceCheckUtils]: 33: Hoare triple {78201#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {78201#false} is VALID [2022-04-28 10:14:04,722 INFO L290 TraceCheckUtils]: 34: Hoare triple {78201#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {78201#false} is VALID [2022-04-28 10:14:04,722 INFO L290 TraceCheckUtils]: 35: Hoare triple {78201#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {78201#false} is VALID [2022-04-28 10:14:04,722 INFO L290 TraceCheckUtils]: 36: Hoare triple {78201#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {78201#false} is VALID [2022-04-28 10:14:04,722 INFO L290 TraceCheckUtils]: 37: Hoare triple {78201#false} assume !(~y~0 % 4294967296 > 0); {78201#false} is VALID [2022-04-28 10:14:04,722 INFO L272 TraceCheckUtils]: 38: Hoare triple {78201#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {78201#false} is VALID [2022-04-28 10:14:04,723 INFO L290 TraceCheckUtils]: 39: Hoare triple {78201#false} ~cond := #in~cond; {78201#false} is VALID [2022-04-28 10:14:04,723 INFO L290 TraceCheckUtils]: 40: Hoare triple {78201#false} assume 0 == ~cond; {78201#false} is VALID [2022-04-28 10:14:04,723 INFO L290 TraceCheckUtils]: 41: Hoare triple {78201#false} assume !false; {78201#false} is VALID [2022-04-28 10:14:04,723 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-04-28 10:14:04,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:14:04,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268685586] [2022-04-28 10:14:04,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268685586] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:14:04,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [455688176] [2022-04-28 10:14:04,723 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:14:04,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:14:04,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:14:04,724 INFO L229 MonitoredProcess]: Starting monitored process 92 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:14:04,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (92)] Waiting until timeout for monitored process [2022-04-28 10:14:04,769 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:14:04,769 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:14:04,770 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 39 conjunts are in the unsatisfiable core [2022-04-28 10:14:04,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:14:04,779 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:14:05,057 INFO L272 TraceCheckUtils]: 0: Hoare triple {78200#true} call ULTIMATE.init(); {78200#true} is VALID [2022-04-28 10:14:05,057 INFO L290 TraceCheckUtils]: 1: Hoare triple {78200#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(10, 2);call #Ultimate.allocInit(12, 3); {78200#true} is VALID [2022-04-28 10:14:05,058 INFO L290 TraceCheckUtils]: 2: Hoare triple {78200#true} assume true; {78200#true} is VALID [2022-04-28 10:14:05,058 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {78200#true} {78200#true} #61#return; {78200#true} is VALID [2022-04-28 10:14:05,058 INFO L272 TraceCheckUtils]: 4: Hoare triple {78200#true} call #t~ret11 := main(); {78200#true} is VALID [2022-04-28 10:14:05,058 INFO L290 TraceCheckUtils]: 5: Hoare triple {78200#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {78205#(= main_~y~0 0)} is VALID [2022-04-28 10:14:05,058 INFO L290 TraceCheckUtils]: 6: Hoare triple {78205#(= 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; {78206#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:14:05,059 INFO L290 TraceCheckUtils]: 7: Hoare triple {78206#(and (<= 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; {78207#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:14:05,059 INFO L290 TraceCheckUtils]: 8: Hoare triple {78207#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {78208#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:14:05,060 INFO L290 TraceCheckUtils]: 9: Hoare triple {78208#(and (<= main_~y~0 3) (<= 3 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; {78209#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:14:05,060 INFO L290 TraceCheckUtils]: 10: Hoare triple {78209#(and (<= main_~y~0 4) (<= 4 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; {78210#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:14:05,061 INFO L290 TraceCheckUtils]: 11: Hoare triple {78210#(and (<= 5 main_~y~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; {78211#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:14:05,061 INFO L290 TraceCheckUtils]: 12: Hoare triple {78211#(and (<= main_~y~0 6) (<= 6 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; {78212#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:14:05,062 INFO L290 TraceCheckUtils]: 13: Hoare triple {78212#(and (<= 7 main_~y~0) (<= main_~y~0 7))} 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; {78213#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:14:05,062 INFO L290 TraceCheckUtils]: 14: Hoare triple {78213#(and (<= main_~y~0 8) (<= 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; {78214#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:14:05,063 INFO L290 TraceCheckUtils]: 15: Hoare triple {78214#(and (<= 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; {78215#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:14:05,063 INFO L290 TraceCheckUtils]: 16: Hoare triple {78215#(and (<= main_~y~0 10) (<= 10 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; {78216#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:14:05,064 INFO L290 TraceCheckUtils]: 17: Hoare triple {78216#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {78216#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:14:05,064 INFO L290 TraceCheckUtils]: 18: Hoare triple {78216#(and (<= main_~y~0 11) (<= 11 main_~y~0))} ~z~0 := ~y~0; {78217#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-28 10:14:05,064 INFO L290 TraceCheckUtils]: 19: Hoare triple {78217#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {78218#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:14:05,065 INFO L290 TraceCheckUtils]: 20: Hoare triple {78218#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {78219#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:14:05,065 INFO L290 TraceCheckUtils]: 21: Hoare triple {78219#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {78220#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:14:05,066 INFO L290 TraceCheckUtils]: 22: Hoare triple {78220#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {78221#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:14:05,066 INFO L290 TraceCheckUtils]: 23: Hoare triple {78221#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {78222#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:14:05,067 INFO L290 TraceCheckUtils]: 24: Hoare triple {78222#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {78300#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:14:05,067 INFO L290 TraceCheckUtils]: 25: Hoare triple {78300#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {78201#false} is VALID [2022-04-28 10:14:05,067 INFO L290 TraceCheckUtils]: 26: Hoare triple {78201#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {78201#false} is VALID [2022-04-28 10:14:05,067 INFO L290 TraceCheckUtils]: 27: Hoare triple {78201#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {78201#false} is VALID [2022-04-28 10:14:05,067 INFO L290 TraceCheckUtils]: 28: Hoare triple {78201#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {78201#false} is VALID [2022-04-28 10:14:05,067 INFO L290 TraceCheckUtils]: 29: Hoare triple {78201#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {78201#false} is VALID [2022-04-28 10:14:05,068 INFO L290 TraceCheckUtils]: 30: Hoare triple {78201#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {78201#false} is VALID [2022-04-28 10:14:05,068 INFO L290 TraceCheckUtils]: 31: Hoare triple {78201#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {78201#false} is VALID [2022-04-28 10:14:05,068 INFO L290 TraceCheckUtils]: 32: Hoare triple {78201#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {78201#false} is VALID [2022-04-28 10:14:05,068 INFO L290 TraceCheckUtils]: 33: Hoare triple {78201#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {78201#false} is VALID [2022-04-28 10:14:05,068 INFO L290 TraceCheckUtils]: 34: Hoare triple {78201#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {78201#false} is VALID [2022-04-28 10:14:05,068 INFO L290 TraceCheckUtils]: 35: Hoare triple {78201#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {78201#false} is VALID [2022-04-28 10:14:05,068 INFO L290 TraceCheckUtils]: 36: Hoare triple {78201#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {78201#false} is VALID [2022-04-28 10:14:05,068 INFO L290 TraceCheckUtils]: 37: Hoare triple {78201#false} assume !(~y~0 % 4294967296 > 0); {78201#false} is VALID [2022-04-28 10:14:05,068 INFO L272 TraceCheckUtils]: 38: Hoare triple {78201#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {78201#false} is VALID [2022-04-28 10:14:05,068 INFO L290 TraceCheckUtils]: 39: Hoare triple {78201#false} ~cond := #in~cond; {78201#false} is VALID [2022-04-28 10:14:05,068 INFO L290 TraceCheckUtils]: 40: Hoare triple {78201#false} assume 0 == ~cond; {78201#false} is VALID [2022-04-28 10:14:05,068 INFO L290 TraceCheckUtils]: 41: Hoare triple {78201#false} assume !false; {78201#false} is VALID [2022-04-28 10:14:05,068 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-04-28 10:14:05,068 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:14:05,664 INFO L290 TraceCheckUtils]: 41: Hoare triple {78201#false} assume !false; {78201#false} is VALID [2022-04-28 10:14:05,664 INFO L290 TraceCheckUtils]: 40: Hoare triple {78201#false} assume 0 == ~cond; {78201#false} is VALID [2022-04-28 10:14:05,664 INFO L290 TraceCheckUtils]: 39: Hoare triple {78201#false} ~cond := #in~cond; {78201#false} is VALID [2022-04-28 10:14:05,664 INFO L272 TraceCheckUtils]: 38: Hoare triple {78201#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {78201#false} is VALID [2022-04-28 10:14:05,664 INFO L290 TraceCheckUtils]: 37: Hoare triple {78201#false} assume !(~y~0 % 4294967296 > 0); {78201#false} is VALID [2022-04-28 10:14:05,664 INFO L290 TraceCheckUtils]: 36: Hoare triple {78201#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {78201#false} is VALID [2022-04-28 10:14:05,664 INFO L290 TraceCheckUtils]: 35: Hoare triple {78201#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {78201#false} is VALID [2022-04-28 10:14:05,664 INFO L290 TraceCheckUtils]: 34: Hoare triple {78201#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {78201#false} is VALID [2022-04-28 10:14:05,665 INFO L290 TraceCheckUtils]: 33: Hoare triple {78201#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {78201#false} is VALID [2022-04-28 10:14:05,665 INFO L290 TraceCheckUtils]: 32: Hoare triple {78201#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {78201#false} is VALID [2022-04-28 10:14:05,665 INFO L290 TraceCheckUtils]: 31: Hoare triple {78201#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {78201#false} is VALID [2022-04-28 10:14:05,665 INFO L290 TraceCheckUtils]: 30: Hoare triple {78201#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {78201#false} is VALID [2022-04-28 10:14:05,665 INFO L290 TraceCheckUtils]: 29: Hoare triple {78201#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {78201#false} is VALID [2022-04-28 10:14:05,665 INFO L290 TraceCheckUtils]: 28: Hoare triple {78201#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {78201#false} is VALID [2022-04-28 10:14:05,665 INFO L290 TraceCheckUtils]: 27: Hoare triple {78201#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {78201#false} is VALID [2022-04-28 10:14:05,665 INFO L290 TraceCheckUtils]: 26: Hoare triple {78201#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {78201#false} is VALID [2022-04-28 10:14:05,665 INFO L290 TraceCheckUtils]: 25: Hoare triple {78400#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {78201#false} is VALID [2022-04-28 10:14:05,666 INFO L290 TraceCheckUtils]: 24: Hoare triple {78404#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {78400#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:14:05,667 INFO L290 TraceCheckUtils]: 23: Hoare triple {78408#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {78404#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:14:05,668 INFO L290 TraceCheckUtils]: 22: Hoare triple {78412#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {78408#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-28 10:14:05,668 INFO L290 TraceCheckUtils]: 21: Hoare triple {78416#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {78412#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-28 10:14:05,669 INFO L290 TraceCheckUtils]: 20: Hoare triple {78420#(< 0 (mod (+ 4294967291 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {78416#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID [2022-04-28 10:14:05,670 INFO L290 TraceCheckUtils]: 19: Hoare triple {78424#(< 0 (mod (+ 4294967290 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {78420#(< 0 (mod (+ 4294967291 main_~z~0) 4294967296))} is VALID [2022-04-28 10:14:05,670 INFO L290 TraceCheckUtils]: 18: Hoare triple {78428#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} ~z~0 := ~y~0; {78424#(< 0 (mod (+ 4294967290 main_~z~0) 4294967296))} is VALID [2022-04-28 10:14:05,671 INFO L290 TraceCheckUtils]: 17: Hoare triple {78428#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {78428#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-28 10:14:05,671 INFO L290 TraceCheckUtils]: 16: Hoare triple {78435#(< 0 (mod (+ 4294967291 main_~y~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; {78428#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-28 10:14:05,672 INFO L290 TraceCheckUtils]: 15: Hoare triple {78439#(< 0 (mod (+ 4294967292 main_~y~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; {78435#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-28 10:14:05,673 INFO L290 TraceCheckUtils]: 14: Hoare triple {78443#(< 0 (mod (+ main_~y~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; {78439#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-28 10:14:05,673 INFO L290 TraceCheckUtils]: 13: Hoare triple {78447#(< 0 (mod (+ main_~y~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; {78443#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 10:14:05,674 INFO L290 TraceCheckUtils]: 12: Hoare triple {78451#(< 0 (mod (+ main_~y~0 4294967295) 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; {78447#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:14:05,675 INFO L290 TraceCheckUtils]: 11: Hoare triple {78455#(< 0 (mod main_~y~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; {78451#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:14:05,675 INFO L290 TraceCheckUtils]: 10: Hoare triple {78459#(< 0 (mod (+ main_~y~0 1) 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; {78455#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:14:05,676 INFO L290 TraceCheckUtils]: 9: Hoare triple {78463#(< 0 (mod (+ main_~y~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; {78459#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:14:05,676 INFO L290 TraceCheckUtils]: 8: Hoare triple {78467#(< 0 (mod (+ main_~y~0 3) 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; {78463#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:14:05,677 INFO L290 TraceCheckUtils]: 7: Hoare triple {78471#(< 0 (mod (+ main_~y~0 4) 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; {78467#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:14:05,678 INFO L290 TraceCheckUtils]: 6: Hoare triple {78475#(< 0 (mod (+ 5 main_~y~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; {78471#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:14:05,678 INFO L290 TraceCheckUtils]: 5: Hoare triple {78200#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {78475#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:14:05,678 INFO L272 TraceCheckUtils]: 4: Hoare triple {78200#true} call #t~ret11 := main(); {78200#true} is VALID [2022-04-28 10:14:05,678 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {78200#true} {78200#true} #61#return; {78200#true} is VALID [2022-04-28 10:14:05,678 INFO L290 TraceCheckUtils]: 2: Hoare triple {78200#true} assume true; {78200#true} is VALID [2022-04-28 10:14:05,678 INFO L290 TraceCheckUtils]: 1: Hoare triple {78200#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(10, 2);call #Ultimate.allocInit(12, 3); {78200#true} is VALID [2022-04-28 10:14:05,678 INFO L272 TraceCheckUtils]: 0: Hoare triple {78200#true} call ULTIMATE.init(); {78200#true} is VALID [2022-04-28 10:14:05,678 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-04-28 10:14:05,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [455688176] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:14:05,679 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:14:05,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 21] total 42 [2022-04-28 10:14:05,679 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:14:05,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1501361860] [2022-04-28 10:14:05,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1501361860] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:14:05,679 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:14:05,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-28 10:14:05,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042171752] [2022-04-28 10:14:05,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:14:05,679 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 states have internal predecessors, (28), 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 42 [2022-04-28 10:14:05,679 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:14:05,679 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 states have internal predecessors, (28), 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-28 10:14:05,699 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:14:05,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-28 10:14:05,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:14:05,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-28 10:14:05,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=277, Invalid=1445, Unknown=0, NotChecked=0, Total=1722 [2022-04-28 10:14:05,700 INFO L87 Difference]: Start difference. First operand 142 states and 180 transitions. Second operand has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 states have internal predecessors, (28), 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-28 10:14:07,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:07,476 INFO L93 Difference]: Finished difference Result 173 states and 211 transitions. [2022-04-28 10:14:07,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-28 10:14:07,476 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 states have internal predecessors, (28), 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 42 [2022-04-28 10:14:07,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:14:07,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 states have internal predecessors, (28), 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-28 10:14:07,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 70 transitions. [2022-04-28 10:14:07,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 states have internal predecessors, (28), 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-28 10:14:07,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 70 transitions. [2022-04-28 10:14:07,477 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 70 transitions. [2022-04-28 10:14:07,532 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:14:07,533 INFO L225 Difference]: With dead ends: 173 [2022-04-28 10:14:07,533 INFO L226 Difference]: Without dead ends: 156 [2022-04-28 10:14:07,534 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 454 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=803, Invalid=3619, Unknown=0, NotChecked=0, Total=4422 [2022-04-28 10:14:07,534 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 23 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 779 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 779 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-28 10:14:07,534 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 95 Invalid, 833 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 779 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-28 10:14:07,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2022-04-28 10:14:07,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 143. [2022-04-28 10:14:07,687 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:14:07,688 INFO L82 GeneralOperation]: Start isEquivalent. First operand 156 states. Second operand has 143 states, 138 states have (on average 1.2826086956521738) internal successors, (177), 138 states have internal predecessors, (177), 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-28 10:14:07,688 INFO L74 IsIncluded]: Start isIncluded. First operand 156 states. Second operand has 143 states, 138 states have (on average 1.2826086956521738) internal successors, (177), 138 states have internal predecessors, (177), 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-28 10:14:07,688 INFO L87 Difference]: Start difference. First operand 156 states. Second operand has 143 states, 138 states have (on average 1.2826086956521738) internal successors, (177), 138 states have internal predecessors, (177), 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-28 10:14:07,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:07,689 INFO L93 Difference]: Finished difference Result 156 states and 194 transitions. [2022-04-28 10:14:07,689 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 194 transitions. [2022-04-28 10:14:07,689 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:14:07,689 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:14:07,690 INFO L74 IsIncluded]: Start isIncluded. First operand has 143 states, 138 states have (on average 1.2826086956521738) internal successors, (177), 138 states have internal predecessors, (177), 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 156 states. [2022-04-28 10:14:07,690 INFO L87 Difference]: Start difference. First operand has 143 states, 138 states have (on average 1.2826086956521738) internal successors, (177), 138 states have internal predecessors, (177), 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 156 states. [2022-04-28 10:14:07,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:07,691 INFO L93 Difference]: Finished difference Result 156 states and 194 transitions. [2022-04-28 10:14:07,691 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 194 transitions. [2022-04-28 10:14:07,691 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:14:07,691 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:14:07,691 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:14:07,691 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:14:07,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 138 states have (on average 1.2826086956521738) internal successors, (177), 138 states have internal predecessors, (177), 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-28 10:14:07,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 181 transitions. [2022-04-28 10:14:07,693 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 181 transitions. Word has length 42 [2022-04-28 10:14:07,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:14:07,693 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 181 transitions. [2022-04-28 10:14:07,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 states have internal predecessors, (28), 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-28 10:14:07,693 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 143 states and 181 transitions. [2022-04-28 10:14:09,503 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 181 edges. 181 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:14:09,503 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 181 transitions. [2022-04-28 10:14:09,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-28 10:14:09,503 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:14:09,503 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:14:09,519 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (92)] Ended with exit code 0 [2022-04-28 10:14:09,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91,92 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:14:09,704 INFO L420 AbstractCegarLoop]: === Iteration 93 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:14:09,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:14:09,704 INFO L85 PathProgramCache]: Analyzing trace with hash -820638515, now seen corresponding path program 129 times [2022-04-28 10:14:09,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:14:09,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1019941433] [2022-04-28 10:14:09,706 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:14:09,706 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:14:09,706 INFO L85 PathProgramCache]: Analyzing trace with hash -820638515, now seen corresponding path program 130 times [2022-04-28 10:14:09,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:14:09,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362960874] [2022-04-28 10:14:09,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:14:09,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:14:09,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:14:09,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:14:09,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:14:09,990 INFO L290 TraceCheckUtils]: 0: Hoare triple {79513#(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(10, 2);call #Ultimate.allocInit(12, 3); {79490#true} is VALID [2022-04-28 10:14:09,990 INFO L290 TraceCheckUtils]: 1: Hoare triple {79490#true} assume true; {79490#true} is VALID [2022-04-28 10:14:09,990 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {79490#true} {79490#true} #61#return; {79490#true} is VALID [2022-04-28 10:14:09,990 INFO L272 TraceCheckUtils]: 0: Hoare triple {79490#true} call ULTIMATE.init(); {79513#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:14:09,990 INFO L290 TraceCheckUtils]: 1: Hoare triple {79513#(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(10, 2);call #Ultimate.allocInit(12, 3); {79490#true} is VALID [2022-04-28 10:14:09,990 INFO L290 TraceCheckUtils]: 2: Hoare triple {79490#true} assume true; {79490#true} is VALID [2022-04-28 10:14:09,990 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {79490#true} {79490#true} #61#return; {79490#true} is VALID [2022-04-28 10:14:09,991 INFO L272 TraceCheckUtils]: 4: Hoare triple {79490#true} call #t~ret11 := main(); {79490#true} is VALID [2022-04-28 10:14:09,991 INFO L290 TraceCheckUtils]: 5: Hoare triple {79490#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {79495#(= main_~y~0 0)} is VALID [2022-04-28 10:14:09,991 INFO L290 TraceCheckUtils]: 6: Hoare triple {79495#(= 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; {79496#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:14:09,992 INFO L290 TraceCheckUtils]: 7: Hoare triple {79496#(and (<= 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; {79497#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:14:09,992 INFO L290 TraceCheckUtils]: 8: Hoare triple {79497#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {79498#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:14:09,993 INFO L290 TraceCheckUtils]: 9: Hoare triple {79498#(and (<= main_~y~0 3) (<= 3 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; {79499#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:14:09,993 INFO L290 TraceCheckUtils]: 10: Hoare triple {79499#(and (<= main_~y~0 4) (<= 4 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; {79500#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:14:09,994 INFO L290 TraceCheckUtils]: 11: Hoare triple {79500#(and (<= 5 main_~y~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; {79501#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:14:09,994 INFO L290 TraceCheckUtils]: 12: Hoare triple {79501#(and (<= main_~y~0 6) (<= 6 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; {79502#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:14:09,995 INFO L290 TraceCheckUtils]: 13: Hoare triple {79502#(and (<= 7 main_~y~0) (<= main_~y~0 7))} 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; {79503#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:14:09,995 INFO L290 TraceCheckUtils]: 14: Hoare triple {79503#(and (<= main_~y~0 8) (<= 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; {79504#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:14:09,996 INFO L290 TraceCheckUtils]: 15: Hoare triple {79504#(and (<= 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; {79505#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:14:09,996 INFO L290 TraceCheckUtils]: 16: Hoare triple {79505#(and (<= main_~y~0 10) (<= 10 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; {79506#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:14:09,997 INFO L290 TraceCheckUtils]: 17: Hoare triple {79506#(and (<= main_~y~0 11) (<= 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; {79507#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:14:09,997 INFO L290 TraceCheckUtils]: 18: Hoare triple {79507#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !(~x~0 % 4294967296 > 0); {79507#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:14:09,997 INFO L290 TraceCheckUtils]: 19: Hoare triple {79507#(and (<= 12 main_~y~0) (<= main_~y~0 12))} ~z~0 := ~y~0; {79508#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-28 10:14:09,998 INFO L290 TraceCheckUtils]: 20: Hoare triple {79508#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {79509#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-28 10:14:09,998 INFO L290 TraceCheckUtils]: 21: Hoare triple {79509#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {79510#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:14:09,999 INFO L290 TraceCheckUtils]: 22: Hoare triple {79510#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {79511#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:14:09,999 INFO L290 TraceCheckUtils]: 23: Hoare triple {79511#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {79512#(and (<= 8 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:14:10,000 INFO L290 TraceCheckUtils]: 24: Hoare triple {79512#(and (<= 8 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {79491#false} is VALID [2022-04-28 10:14:10,000 INFO L290 TraceCheckUtils]: 25: Hoare triple {79491#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {79491#false} is VALID [2022-04-28 10:14:10,000 INFO L290 TraceCheckUtils]: 26: Hoare triple {79491#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {79491#false} is VALID [2022-04-28 10:14:10,000 INFO L290 TraceCheckUtils]: 27: Hoare triple {79491#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {79491#false} is VALID [2022-04-28 10:14:10,000 INFO L290 TraceCheckUtils]: 28: Hoare triple {79491#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {79491#false} is VALID [2022-04-28 10:14:10,000 INFO L290 TraceCheckUtils]: 29: Hoare triple {79491#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {79491#false} is VALID [2022-04-28 10:14:10,000 INFO L290 TraceCheckUtils]: 30: Hoare triple {79491#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {79491#false} is VALID [2022-04-28 10:14:10,000 INFO L290 TraceCheckUtils]: 31: Hoare triple {79491#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {79491#false} is VALID [2022-04-28 10:14:10,000 INFO L290 TraceCheckUtils]: 32: Hoare triple {79491#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {79491#false} is VALID [2022-04-28 10:14:10,000 INFO L290 TraceCheckUtils]: 33: Hoare triple {79491#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {79491#false} is VALID [2022-04-28 10:14:10,000 INFO L290 TraceCheckUtils]: 34: Hoare triple {79491#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {79491#false} is VALID [2022-04-28 10:14:10,000 INFO L290 TraceCheckUtils]: 35: Hoare triple {79491#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {79491#false} is VALID [2022-04-28 10:14:10,000 INFO L290 TraceCheckUtils]: 36: Hoare triple {79491#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {79491#false} is VALID [2022-04-28 10:14:10,000 INFO L290 TraceCheckUtils]: 37: Hoare triple {79491#false} assume !(~y~0 % 4294967296 > 0); {79491#false} is VALID [2022-04-28 10:14:10,000 INFO L272 TraceCheckUtils]: 38: Hoare triple {79491#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {79491#false} is VALID [2022-04-28 10:14:10,000 INFO L290 TraceCheckUtils]: 39: Hoare triple {79491#false} ~cond := #in~cond; {79491#false} is VALID [2022-04-28 10:14:10,001 INFO L290 TraceCheckUtils]: 40: Hoare triple {79491#false} assume 0 == ~cond; {79491#false} is VALID [2022-04-28 10:14:10,001 INFO L290 TraceCheckUtils]: 41: Hoare triple {79491#false} assume !false; {79491#false} is VALID [2022-04-28 10:14:10,001 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 0 proven. 88 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-04-28 10:14:10,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:14:10,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362960874] [2022-04-28 10:14:10,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362960874] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:14:10,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1018396146] [2022-04-28 10:14:10,001 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:14:10,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:14:10,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:14:10,002 INFO L229 MonitoredProcess]: Starting monitored process 93 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:14:10,003 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (93)] Waiting until timeout for monitored process [2022-04-28 10:14:10,046 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:14:10,046 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:14:10,047 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-28 10:14:10,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:14:10,056 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:14:10,319 INFO L272 TraceCheckUtils]: 0: Hoare triple {79490#true} call ULTIMATE.init(); {79490#true} is VALID [2022-04-28 10:14:10,320 INFO L290 TraceCheckUtils]: 1: Hoare triple {79490#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(10, 2);call #Ultimate.allocInit(12, 3); {79490#true} is VALID [2022-04-28 10:14:10,320 INFO L290 TraceCheckUtils]: 2: Hoare triple {79490#true} assume true; {79490#true} is VALID [2022-04-28 10:14:10,320 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {79490#true} {79490#true} #61#return; {79490#true} is VALID [2022-04-28 10:14:10,320 INFO L272 TraceCheckUtils]: 4: Hoare triple {79490#true} call #t~ret11 := main(); {79490#true} is VALID [2022-04-28 10:14:10,320 INFO L290 TraceCheckUtils]: 5: Hoare triple {79490#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {79495#(= main_~y~0 0)} is VALID [2022-04-28 10:14:10,320 INFO L290 TraceCheckUtils]: 6: Hoare triple {79495#(= 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; {79496#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:14:10,321 INFO L290 TraceCheckUtils]: 7: Hoare triple {79496#(and (<= 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; {79497#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:14:10,321 INFO L290 TraceCheckUtils]: 8: Hoare triple {79497#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {79498#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:14:10,322 INFO L290 TraceCheckUtils]: 9: Hoare triple {79498#(and (<= main_~y~0 3) (<= 3 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; {79499#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:14:10,322 INFO L290 TraceCheckUtils]: 10: Hoare triple {79499#(and (<= main_~y~0 4) (<= 4 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; {79500#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:14:10,323 INFO L290 TraceCheckUtils]: 11: Hoare triple {79500#(and (<= 5 main_~y~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; {79501#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:14:10,323 INFO L290 TraceCheckUtils]: 12: Hoare triple {79501#(and (<= main_~y~0 6) (<= 6 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; {79502#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:14:10,324 INFO L290 TraceCheckUtils]: 13: Hoare triple {79502#(and (<= 7 main_~y~0) (<= main_~y~0 7))} 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; {79503#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:14:10,324 INFO L290 TraceCheckUtils]: 14: Hoare triple {79503#(and (<= main_~y~0 8) (<= 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; {79504#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:14:10,325 INFO L290 TraceCheckUtils]: 15: Hoare triple {79504#(and (<= 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; {79505#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:14:10,325 INFO L290 TraceCheckUtils]: 16: Hoare triple {79505#(and (<= main_~y~0 10) (<= 10 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; {79506#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:14:10,326 INFO L290 TraceCheckUtils]: 17: Hoare triple {79506#(and (<= main_~y~0 11) (<= 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; {79507#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:14:10,326 INFO L290 TraceCheckUtils]: 18: Hoare triple {79507#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !(~x~0 % 4294967296 > 0); {79507#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:14:10,326 INFO L290 TraceCheckUtils]: 19: Hoare triple {79507#(and (<= 12 main_~y~0) (<= main_~y~0 12))} ~z~0 := ~y~0; {79508#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-28 10:14:10,327 INFO L290 TraceCheckUtils]: 20: Hoare triple {79508#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {79509#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-28 10:14:10,328 INFO L290 TraceCheckUtils]: 21: Hoare triple {79509#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {79510#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:14:10,328 INFO L290 TraceCheckUtils]: 22: Hoare triple {79510#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {79511#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:14:10,329 INFO L290 TraceCheckUtils]: 23: Hoare triple {79511#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {79586#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:14:10,329 INFO L290 TraceCheckUtils]: 24: Hoare triple {79586#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !(~z~0 % 4294967296 > 0); {79491#false} is VALID [2022-04-28 10:14:10,329 INFO L290 TraceCheckUtils]: 25: Hoare triple {79491#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {79491#false} is VALID [2022-04-28 10:14:10,329 INFO L290 TraceCheckUtils]: 26: Hoare triple {79491#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {79491#false} is VALID [2022-04-28 10:14:10,329 INFO L290 TraceCheckUtils]: 27: Hoare triple {79491#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {79491#false} is VALID [2022-04-28 10:14:10,329 INFO L290 TraceCheckUtils]: 28: Hoare triple {79491#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {79491#false} is VALID [2022-04-28 10:14:10,329 INFO L290 TraceCheckUtils]: 29: Hoare triple {79491#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {79491#false} is VALID [2022-04-28 10:14:10,329 INFO L290 TraceCheckUtils]: 30: Hoare triple {79491#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {79491#false} is VALID [2022-04-28 10:14:10,329 INFO L290 TraceCheckUtils]: 31: Hoare triple {79491#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {79491#false} is VALID [2022-04-28 10:14:10,329 INFO L290 TraceCheckUtils]: 32: Hoare triple {79491#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {79491#false} is VALID [2022-04-28 10:14:10,329 INFO L290 TraceCheckUtils]: 33: Hoare triple {79491#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {79491#false} is VALID [2022-04-28 10:14:10,329 INFO L290 TraceCheckUtils]: 34: Hoare triple {79491#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {79491#false} is VALID [2022-04-28 10:14:10,329 INFO L290 TraceCheckUtils]: 35: Hoare triple {79491#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {79491#false} is VALID [2022-04-28 10:14:10,330 INFO L290 TraceCheckUtils]: 36: Hoare triple {79491#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {79491#false} is VALID [2022-04-28 10:14:10,330 INFO L290 TraceCheckUtils]: 37: Hoare triple {79491#false} assume !(~y~0 % 4294967296 > 0); {79491#false} is VALID [2022-04-28 10:14:10,330 INFO L272 TraceCheckUtils]: 38: Hoare triple {79491#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {79491#false} is VALID [2022-04-28 10:14:10,330 INFO L290 TraceCheckUtils]: 39: Hoare triple {79491#false} ~cond := #in~cond; {79491#false} is VALID [2022-04-28 10:14:10,330 INFO L290 TraceCheckUtils]: 40: Hoare triple {79491#false} assume 0 == ~cond; {79491#false} is VALID [2022-04-28 10:14:10,330 INFO L290 TraceCheckUtils]: 41: Hoare triple {79491#false} assume !false; {79491#false} is VALID [2022-04-28 10:14:10,330 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 0 proven. 88 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-04-28 10:14:10,330 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:14:10,878 INFO L290 TraceCheckUtils]: 41: Hoare triple {79491#false} assume !false; {79491#false} is VALID [2022-04-28 10:14:10,878 INFO L290 TraceCheckUtils]: 40: Hoare triple {79491#false} assume 0 == ~cond; {79491#false} is VALID [2022-04-28 10:14:10,878 INFO L290 TraceCheckUtils]: 39: Hoare triple {79491#false} ~cond := #in~cond; {79491#false} is VALID [2022-04-28 10:14:10,878 INFO L272 TraceCheckUtils]: 38: Hoare triple {79491#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {79491#false} is VALID [2022-04-28 10:14:10,878 INFO L290 TraceCheckUtils]: 37: Hoare triple {79491#false} assume !(~y~0 % 4294967296 > 0); {79491#false} is VALID [2022-04-28 10:14:10,878 INFO L290 TraceCheckUtils]: 36: Hoare triple {79491#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {79491#false} is VALID [2022-04-28 10:14:10,878 INFO L290 TraceCheckUtils]: 35: Hoare triple {79491#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {79491#false} is VALID [2022-04-28 10:14:10,878 INFO L290 TraceCheckUtils]: 34: Hoare triple {79491#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {79491#false} is VALID [2022-04-28 10:14:10,878 INFO L290 TraceCheckUtils]: 33: Hoare triple {79491#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {79491#false} is VALID [2022-04-28 10:14:10,878 INFO L290 TraceCheckUtils]: 32: Hoare triple {79491#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {79491#false} is VALID [2022-04-28 10:14:10,878 INFO L290 TraceCheckUtils]: 31: Hoare triple {79491#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {79491#false} is VALID [2022-04-28 10:14:10,879 INFO L290 TraceCheckUtils]: 30: Hoare triple {79491#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {79491#false} is VALID [2022-04-28 10:14:10,879 INFO L290 TraceCheckUtils]: 29: Hoare triple {79491#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {79491#false} is VALID [2022-04-28 10:14:10,879 INFO L290 TraceCheckUtils]: 28: Hoare triple {79491#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {79491#false} is VALID [2022-04-28 10:14:10,879 INFO L290 TraceCheckUtils]: 27: Hoare triple {79491#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {79491#false} is VALID [2022-04-28 10:14:10,879 INFO L290 TraceCheckUtils]: 26: Hoare triple {79491#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {79491#false} is VALID [2022-04-28 10:14:10,879 INFO L290 TraceCheckUtils]: 25: Hoare triple {79491#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {79491#false} is VALID [2022-04-28 10:14:10,879 INFO L290 TraceCheckUtils]: 24: Hoare triple {79692#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {79491#false} is VALID [2022-04-28 10:14:10,880 INFO L290 TraceCheckUtils]: 23: Hoare triple {79696#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {79692#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:14:10,881 INFO L290 TraceCheckUtils]: 22: Hoare triple {79700#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {79696#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:14:10,881 INFO L290 TraceCheckUtils]: 21: Hoare triple {79704#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {79700#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-28 10:14:10,882 INFO L290 TraceCheckUtils]: 20: Hoare triple {79708#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {79704#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-28 10:14:10,882 INFO L290 TraceCheckUtils]: 19: Hoare triple {79712#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} ~z~0 := ~y~0; {79708#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID [2022-04-28 10:14:10,883 INFO L290 TraceCheckUtils]: 18: Hoare triple {79712#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {79712#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-28 10:14:10,883 INFO L290 TraceCheckUtils]: 17: Hoare triple {79719#(< 0 (mod (+ main_~y~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; {79712#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-28 10:14:10,884 INFO L290 TraceCheckUtils]: 16: Hoare triple {79723#(< 0 (mod (+ main_~y~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; {79719#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 10:14:10,885 INFO L290 TraceCheckUtils]: 15: Hoare triple {79727#(< 0 (mod (+ main_~y~0 4294967295) 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; {79723#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:14:10,886 INFO L290 TraceCheckUtils]: 14: Hoare triple {79731#(< 0 (mod main_~y~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; {79727#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:14:10,886 INFO L290 TraceCheckUtils]: 13: Hoare triple {79735#(< 0 (mod (+ main_~y~0 1) 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; {79731#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:14:10,887 INFO L290 TraceCheckUtils]: 12: Hoare triple {79739#(< 0 (mod (+ main_~y~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; {79735#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:14:10,887 INFO L290 TraceCheckUtils]: 11: Hoare triple {79743#(< 0 (mod (+ main_~y~0 3) 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; {79739#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:14:10,888 INFO L290 TraceCheckUtils]: 10: Hoare triple {79747#(< 0 (mod (+ main_~y~0 4) 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; {79743#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:14:10,889 INFO L290 TraceCheckUtils]: 9: Hoare triple {79751#(< 0 (mod (+ 5 main_~y~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; {79747#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:14:10,889 INFO L290 TraceCheckUtils]: 8: Hoare triple {79755#(< 0 (mod (+ main_~y~0 6) 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; {79751#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:14:10,890 INFO L290 TraceCheckUtils]: 7: Hoare triple {79759#(< 0 (mod (+ 7 main_~y~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; {79755#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:14:10,891 INFO L290 TraceCheckUtils]: 6: Hoare triple {79763#(< 0 (mod (+ main_~y~0 8) 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; {79759#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:14:10,891 INFO L290 TraceCheckUtils]: 5: Hoare triple {79490#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {79763#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:14:10,891 INFO L272 TraceCheckUtils]: 4: Hoare triple {79490#true} call #t~ret11 := main(); {79490#true} is VALID [2022-04-28 10:14:10,891 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {79490#true} {79490#true} #61#return; {79490#true} is VALID [2022-04-28 10:14:10,891 INFO L290 TraceCheckUtils]: 2: Hoare triple {79490#true} assume true; {79490#true} is VALID [2022-04-28 10:14:10,891 INFO L290 TraceCheckUtils]: 1: Hoare triple {79490#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(10, 2);call #Ultimate.allocInit(12, 3); {79490#true} is VALID [2022-04-28 10:14:10,891 INFO L272 TraceCheckUtils]: 0: Hoare triple {79490#true} call ULTIMATE.init(); {79490#true} is VALID [2022-04-28 10:14:10,891 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 0 proven. 88 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-04-28 10:14:10,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1018396146] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:14:10,892 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:14:10,892 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 40 [2022-04-28 10:14:10,892 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:14:10,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1019941433] [2022-04-28 10:14:10,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1019941433] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:14:10,892 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:14:10,892 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-28 10:14:10,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810044049] [2022-04-28 10:14:10,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:14:10,892 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 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 42 [2022-04-28 10:14:10,892 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:14:10,892 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 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-28 10:14:10,912 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:14:10,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-28 10:14:10,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:14:10,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-28 10:14:10,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=1284, Unknown=0, NotChecked=0, Total=1560 [2022-04-28 10:14:10,913 INFO L87 Difference]: Start difference. First operand 143 states and 181 transitions. Second operand has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 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-28 10:14:12,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:12,805 INFO L93 Difference]: Finished difference Result 176 states and 214 transitions. [2022-04-28 10:14:12,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-28 10:14:12,805 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 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 42 [2022-04-28 10:14:12,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:14:12,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 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-28 10:14:12,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 75 transitions. [2022-04-28 10:14:12,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 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-28 10:14:12,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 75 transitions. [2022-04-28 10:14:12,806 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 75 transitions. [2022-04-28 10:14:12,869 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:14:12,870 INFO L225 Difference]: With dead ends: 176 [2022-04-28 10:14:12,870 INFO L226 Difference]: Without dead ends: 158 [2022-04-28 10:14:12,871 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 414 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=798, Invalid=3362, Unknown=0, NotChecked=0, Total=4160 [2022-04-28 10:14:12,871 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 30 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 891 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 948 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 891 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-28 10:14:12,871 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 107 Invalid, 948 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 891 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-28 10:14:12,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2022-04-28 10:14:13,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 144. [2022-04-28 10:14:13,032 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:14:13,032 INFO L82 GeneralOperation]: Start isEquivalent. First operand 158 states. Second operand has 144 states, 139 states have (on average 1.2805755395683454) internal successors, (178), 139 states have internal predecessors, (178), 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-28 10:14:13,032 INFO L74 IsIncluded]: Start isIncluded. First operand 158 states. Second operand has 144 states, 139 states have (on average 1.2805755395683454) internal successors, (178), 139 states have internal predecessors, (178), 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-28 10:14:13,032 INFO L87 Difference]: Start difference. First operand 158 states. Second operand has 144 states, 139 states have (on average 1.2805755395683454) internal successors, (178), 139 states have internal predecessors, (178), 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-28 10:14:13,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:13,034 INFO L93 Difference]: Finished difference Result 158 states and 196 transitions. [2022-04-28 10:14:13,034 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 196 transitions. [2022-04-28 10:14:13,034 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:14:13,034 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:14:13,034 INFO L74 IsIncluded]: Start isIncluded. First operand has 144 states, 139 states have (on average 1.2805755395683454) internal successors, (178), 139 states have internal predecessors, (178), 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 158 states. [2022-04-28 10:14:13,034 INFO L87 Difference]: Start difference. First operand has 144 states, 139 states have (on average 1.2805755395683454) internal successors, (178), 139 states have internal predecessors, (178), 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 158 states. [2022-04-28 10:14:13,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:13,035 INFO L93 Difference]: Finished difference Result 158 states and 196 transitions. [2022-04-28 10:14:13,035 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 196 transitions. [2022-04-28 10:14:13,035 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:14:13,035 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:14:13,035 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:14:13,035 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:14:13,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 139 states have (on average 1.2805755395683454) internal successors, (178), 139 states have internal predecessors, (178), 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-28 10:14:13,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 182 transitions. [2022-04-28 10:14:13,037 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 182 transitions. Word has length 42 [2022-04-28 10:14:13,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:14:13,037 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 182 transitions. [2022-04-28 10:14:13,037 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 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-28 10:14:13,037 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 144 states and 182 transitions. [2022-04-28 10:14:19,337 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 182 edges. 180 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-28 10:14:19,338 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 182 transitions. [2022-04-28 10:14:19,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-28 10:14:19,338 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:14:19,338 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:14:19,354 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (93)] Forceful destruction successful, exit code 0 [2022-04-28 10:14:19,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92,93 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:14:19,538 INFO L420 AbstractCegarLoop]: === Iteration 94 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:14:19,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:14:19,539 INFO L85 PathProgramCache]: Analyzing trace with hash -1353729153, now seen corresponding path program 131 times [2022-04-28 10:14:19,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:14:19,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1423051696] [2022-04-28 10:14:19,541 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:14:19,541 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:14:19,541 INFO L85 PathProgramCache]: Analyzing trace with hash -1353729153, now seen corresponding path program 132 times [2022-04-28 10:14:19,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:14:19,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098031684] [2022-04-28 10:14:19,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:14:19,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:14:19,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:14:19,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:14:19,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:14:19,816 INFO L290 TraceCheckUtils]: 0: Hoare triple {80812#(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(10, 2);call #Ultimate.allocInit(12, 3); {80790#true} is VALID [2022-04-28 10:14:19,816 INFO L290 TraceCheckUtils]: 1: Hoare triple {80790#true} assume true; {80790#true} is VALID [2022-04-28 10:14:19,816 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {80790#true} {80790#true} #61#return; {80790#true} is VALID [2022-04-28 10:14:19,817 INFO L272 TraceCheckUtils]: 0: Hoare triple {80790#true} call ULTIMATE.init(); {80812#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:14:19,817 INFO L290 TraceCheckUtils]: 1: Hoare triple {80812#(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(10, 2);call #Ultimate.allocInit(12, 3); {80790#true} is VALID [2022-04-28 10:14:19,817 INFO L290 TraceCheckUtils]: 2: Hoare triple {80790#true} assume true; {80790#true} is VALID [2022-04-28 10:14:19,817 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {80790#true} {80790#true} #61#return; {80790#true} is VALID [2022-04-28 10:14:19,817 INFO L272 TraceCheckUtils]: 4: Hoare triple {80790#true} call #t~ret11 := main(); {80790#true} is VALID [2022-04-28 10:14:19,817 INFO L290 TraceCheckUtils]: 5: Hoare triple {80790#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {80795#(= main_~y~0 0)} is VALID [2022-04-28 10:14:19,817 INFO L290 TraceCheckUtils]: 6: Hoare triple {80795#(= 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; {80796#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:14:19,818 INFO L290 TraceCheckUtils]: 7: Hoare triple {80796#(and (<= 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; {80797#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:14:19,819 INFO L290 TraceCheckUtils]: 8: Hoare triple {80797#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {80798#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:14:19,819 INFO L290 TraceCheckUtils]: 9: Hoare triple {80798#(and (<= main_~y~0 3) (<= 3 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; {80799#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:14:19,820 INFO L290 TraceCheckUtils]: 10: Hoare triple {80799#(and (<= main_~y~0 4) (<= 4 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; {80800#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:14:19,820 INFO L290 TraceCheckUtils]: 11: Hoare triple {80800#(and (<= 5 main_~y~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; {80801#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:14:19,821 INFO L290 TraceCheckUtils]: 12: Hoare triple {80801#(and (<= main_~y~0 6) (<= 6 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; {80802#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:14:19,821 INFO L290 TraceCheckUtils]: 13: Hoare triple {80802#(and (<= 7 main_~y~0) (<= main_~y~0 7))} 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; {80803#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:14:19,822 INFO L290 TraceCheckUtils]: 14: Hoare triple {80803#(and (<= main_~y~0 8) (<= 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; {80804#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:14:19,822 INFO L290 TraceCheckUtils]: 15: Hoare triple {80804#(and (<= 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; {80805#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:14:19,823 INFO L290 TraceCheckUtils]: 16: Hoare triple {80805#(and (<= main_~y~0 10) (<= 10 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; {80806#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:14:19,823 INFO L290 TraceCheckUtils]: 17: Hoare triple {80806#(and (<= main_~y~0 11) (<= 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; {80807#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:14:19,824 INFO L290 TraceCheckUtils]: 18: Hoare triple {80807#(and (<= 12 main_~y~0) (<= main_~y~0 12))} 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; {80808#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:14:19,824 INFO L290 TraceCheckUtils]: 19: Hoare triple {80808#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {80808#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:14:19,824 INFO L290 TraceCheckUtils]: 20: Hoare triple {80808#(and (<= main_~y~0 13) (<= 13 main_~y~0))} ~z~0 := ~y~0; {80809#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-28 10:14:19,825 INFO L290 TraceCheckUtils]: 21: Hoare triple {80809#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {80810#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-28 10:14:19,825 INFO L290 TraceCheckUtils]: 22: Hoare triple {80810#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {80811#(and (<= (div main_~z~0 4294967296) 0) (<= 11 main_~z~0))} is VALID [2022-04-28 10:14:19,826 INFO L290 TraceCheckUtils]: 23: Hoare triple {80811#(and (<= (div main_~z~0 4294967296) 0) (<= 11 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {80791#false} is VALID [2022-04-28 10:14:19,826 INFO L290 TraceCheckUtils]: 24: Hoare triple {80791#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {80791#false} is VALID [2022-04-28 10:14:19,826 INFO L290 TraceCheckUtils]: 25: Hoare triple {80791#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {80791#false} is VALID [2022-04-28 10:14:19,826 INFO L290 TraceCheckUtils]: 26: Hoare triple {80791#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {80791#false} is VALID [2022-04-28 10:14:19,826 INFO L290 TraceCheckUtils]: 27: Hoare triple {80791#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {80791#false} is VALID [2022-04-28 10:14:19,826 INFO L290 TraceCheckUtils]: 28: Hoare triple {80791#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {80791#false} is VALID [2022-04-28 10:14:19,826 INFO L290 TraceCheckUtils]: 29: Hoare triple {80791#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {80791#false} is VALID [2022-04-28 10:14:19,826 INFO L290 TraceCheckUtils]: 30: Hoare triple {80791#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {80791#false} is VALID [2022-04-28 10:14:19,826 INFO L290 TraceCheckUtils]: 31: Hoare triple {80791#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {80791#false} is VALID [2022-04-28 10:14:19,826 INFO L290 TraceCheckUtils]: 32: Hoare triple {80791#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {80791#false} is VALID [2022-04-28 10:14:19,826 INFO L290 TraceCheckUtils]: 33: Hoare triple {80791#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {80791#false} is VALID [2022-04-28 10:14:19,826 INFO L290 TraceCheckUtils]: 34: Hoare triple {80791#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {80791#false} is VALID [2022-04-28 10:14:19,826 INFO L290 TraceCheckUtils]: 35: Hoare triple {80791#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {80791#false} is VALID [2022-04-28 10:14:19,826 INFO L290 TraceCheckUtils]: 36: Hoare triple {80791#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {80791#false} is VALID [2022-04-28 10:14:19,827 INFO L290 TraceCheckUtils]: 37: Hoare triple {80791#false} assume !(~y~0 % 4294967296 > 0); {80791#false} is VALID [2022-04-28 10:14:19,827 INFO L272 TraceCheckUtils]: 38: Hoare triple {80791#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {80791#false} is VALID [2022-04-28 10:14:19,827 INFO L290 TraceCheckUtils]: 39: Hoare triple {80791#false} ~cond := #in~cond; {80791#false} is VALID [2022-04-28 10:14:19,827 INFO L290 TraceCheckUtils]: 40: Hoare triple {80791#false} assume 0 == ~cond; {80791#false} is VALID [2022-04-28 10:14:19,827 INFO L290 TraceCheckUtils]: 41: Hoare triple {80791#false} assume !false; {80791#false} is VALID [2022-04-28 10:14:19,827 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 0 proven. 94 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-04-28 10:14:19,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:14:19,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098031684] [2022-04-28 10:14:19,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098031684] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:14:19,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1318697269] [2022-04-28 10:14:19,827 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:14:19,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:14:19,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:14:19,828 INFO L229 MonitoredProcess]: Starting monitored process 94 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:14:19,829 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (94)] Waiting until timeout for monitored process [2022-04-28 10:14:20,077 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-28 10:14:20,078 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:14:20,079 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-28 10:14:20,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:14:20,093 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:14:20,288 INFO L272 TraceCheckUtils]: 0: Hoare triple {80790#true} call ULTIMATE.init(); {80790#true} is VALID [2022-04-28 10:14:20,288 INFO L290 TraceCheckUtils]: 1: Hoare triple {80790#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(10, 2);call #Ultimate.allocInit(12, 3); {80790#true} is VALID [2022-04-28 10:14:20,288 INFO L290 TraceCheckUtils]: 2: Hoare triple {80790#true} assume true; {80790#true} is VALID [2022-04-28 10:14:20,288 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {80790#true} {80790#true} #61#return; {80790#true} is VALID [2022-04-28 10:14:20,288 INFO L272 TraceCheckUtils]: 4: Hoare triple {80790#true} call #t~ret11 := main(); {80790#true} is VALID [2022-04-28 10:14:20,288 INFO L290 TraceCheckUtils]: 5: Hoare triple {80790#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {80790#true} is VALID [2022-04-28 10:14:20,289 INFO L290 TraceCheckUtils]: 6: Hoare triple {80790#true} 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; {80790#true} is VALID [2022-04-28 10:14:20,289 INFO L290 TraceCheckUtils]: 7: Hoare triple {80790#true} 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; {80790#true} is VALID [2022-04-28 10:14:20,289 INFO L290 TraceCheckUtils]: 8: Hoare triple {80790#true} 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; {80790#true} is VALID [2022-04-28 10:14:20,289 INFO L290 TraceCheckUtils]: 9: Hoare triple {80790#true} 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; {80790#true} is VALID [2022-04-28 10:14:20,289 INFO L290 TraceCheckUtils]: 10: Hoare triple {80790#true} 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; {80790#true} is VALID [2022-04-28 10:14:20,289 INFO L290 TraceCheckUtils]: 11: Hoare triple {80790#true} 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; {80790#true} is VALID [2022-04-28 10:14:20,289 INFO L290 TraceCheckUtils]: 12: Hoare triple {80790#true} 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; {80790#true} is VALID [2022-04-28 10:14:20,289 INFO L290 TraceCheckUtils]: 13: Hoare triple {80790#true} 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; {80790#true} is VALID [2022-04-28 10:14:20,289 INFO L290 TraceCheckUtils]: 14: Hoare triple {80790#true} 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; {80790#true} is VALID [2022-04-28 10:14:20,289 INFO L290 TraceCheckUtils]: 15: Hoare triple {80790#true} 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; {80790#true} is VALID [2022-04-28 10:14:20,289 INFO L290 TraceCheckUtils]: 16: Hoare triple {80790#true} 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; {80790#true} is VALID [2022-04-28 10:14:20,289 INFO L290 TraceCheckUtils]: 17: Hoare triple {80790#true} 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; {80790#true} is VALID [2022-04-28 10:14:20,289 INFO L290 TraceCheckUtils]: 18: Hoare triple {80790#true} 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; {80790#true} is VALID [2022-04-28 10:14:20,289 INFO L290 TraceCheckUtils]: 19: Hoare triple {80790#true} assume !(~x~0 % 4294967296 > 0); {80790#true} is VALID [2022-04-28 10:14:20,289 INFO L290 TraceCheckUtils]: 20: Hoare triple {80790#true} ~z~0 := ~y~0; {80876#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 10:14:20,290 INFO L290 TraceCheckUtils]: 21: Hoare triple {80876#(= main_~z~0 main_~y~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {80880#(and (= main_~y~0 (+ main_~z~0 1)) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:14:20,290 INFO L290 TraceCheckUtils]: 22: Hoare triple {80880#(and (= main_~y~0 (+ main_~z~0 1)) (< 0 (mod main_~y~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {80884#(and (= main_~y~0 (+ main_~z~0 2)) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:14:20,291 INFO L290 TraceCheckUtils]: 23: Hoare triple {80884#(and (= main_~y~0 (+ main_~z~0 2)) (< 0 (mod main_~y~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {80888#(<= (mod (+ main_~y~0 4294967294) 4294967296) 0)} is VALID [2022-04-28 10:14:20,292 INFO L290 TraceCheckUtils]: 24: Hoare triple {80888#(<= (mod (+ main_~y~0 4294967294) 4294967296) 0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {80892#(<= (mod (+ main_~y~0 4294967295) 4294967296) 0)} is VALID [2022-04-28 10:14:20,292 INFO L290 TraceCheckUtils]: 25: Hoare triple {80892#(<= (mod (+ main_~y~0 4294967295) 4294967296) 0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {80896#(<= (mod main_~y~0 4294967296) 0)} is VALID [2022-04-28 10:14:20,293 INFO L290 TraceCheckUtils]: 26: Hoare triple {80896#(<= (mod main_~y~0 4294967296) 0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {80791#false} is VALID [2022-04-28 10:14:20,293 INFO L290 TraceCheckUtils]: 27: Hoare triple {80791#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {80791#false} is VALID [2022-04-28 10:14:20,293 INFO L290 TraceCheckUtils]: 28: Hoare triple {80791#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {80791#false} is VALID [2022-04-28 10:14:20,293 INFO L290 TraceCheckUtils]: 29: Hoare triple {80791#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {80791#false} is VALID [2022-04-28 10:14:20,293 INFO L290 TraceCheckUtils]: 30: Hoare triple {80791#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {80791#false} is VALID [2022-04-28 10:14:20,293 INFO L290 TraceCheckUtils]: 31: Hoare triple {80791#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {80791#false} is VALID [2022-04-28 10:14:20,293 INFO L290 TraceCheckUtils]: 32: Hoare triple {80791#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {80791#false} is VALID [2022-04-28 10:14:20,293 INFO L290 TraceCheckUtils]: 33: Hoare triple {80791#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {80791#false} is VALID [2022-04-28 10:14:20,293 INFO L290 TraceCheckUtils]: 34: Hoare triple {80791#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {80791#false} is VALID [2022-04-28 10:14:20,293 INFO L290 TraceCheckUtils]: 35: Hoare triple {80791#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {80791#false} is VALID [2022-04-28 10:14:20,293 INFO L290 TraceCheckUtils]: 36: Hoare triple {80791#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {80791#false} is VALID [2022-04-28 10:14:20,293 INFO L290 TraceCheckUtils]: 37: Hoare triple {80791#false} assume !(~y~0 % 4294967296 > 0); {80791#false} is VALID [2022-04-28 10:14:20,293 INFO L272 TraceCheckUtils]: 38: Hoare triple {80791#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {80791#false} is VALID [2022-04-28 10:14:20,293 INFO L290 TraceCheckUtils]: 39: Hoare triple {80791#false} ~cond := #in~cond; {80791#false} is VALID [2022-04-28 10:14:20,293 INFO L290 TraceCheckUtils]: 40: Hoare triple {80791#false} assume 0 == ~cond; {80791#false} is VALID [2022-04-28 10:14:20,293 INFO L290 TraceCheckUtils]: 41: Hoare triple {80791#false} assume !false; {80791#false} is VALID [2022-04-28 10:14:20,294 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 33 proven. 6 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2022-04-28 10:14:20,294 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:14:20,489 INFO L290 TraceCheckUtils]: 41: Hoare triple {80791#false} assume !false; {80791#false} is VALID [2022-04-28 10:14:20,489 INFO L290 TraceCheckUtils]: 40: Hoare triple {80791#false} assume 0 == ~cond; {80791#false} is VALID [2022-04-28 10:14:20,489 INFO L290 TraceCheckUtils]: 39: Hoare triple {80791#false} ~cond := #in~cond; {80791#false} is VALID [2022-04-28 10:14:20,489 INFO L272 TraceCheckUtils]: 38: Hoare triple {80791#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {80791#false} is VALID [2022-04-28 10:14:20,489 INFO L290 TraceCheckUtils]: 37: Hoare triple {80791#false} assume !(~y~0 % 4294967296 > 0); {80791#false} is VALID [2022-04-28 10:14:20,489 INFO L290 TraceCheckUtils]: 36: Hoare triple {80791#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {80791#false} is VALID [2022-04-28 10:14:20,489 INFO L290 TraceCheckUtils]: 35: Hoare triple {80791#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {80791#false} is VALID [2022-04-28 10:14:20,489 INFO L290 TraceCheckUtils]: 34: Hoare triple {80791#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {80791#false} is VALID [2022-04-28 10:14:20,489 INFO L290 TraceCheckUtils]: 33: Hoare triple {80791#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {80791#false} is VALID [2022-04-28 10:14:20,490 INFO L290 TraceCheckUtils]: 32: Hoare triple {80791#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {80791#false} is VALID [2022-04-28 10:14:20,490 INFO L290 TraceCheckUtils]: 31: Hoare triple {80791#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {80791#false} is VALID [2022-04-28 10:14:20,490 INFO L290 TraceCheckUtils]: 30: Hoare triple {80791#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {80791#false} is VALID [2022-04-28 10:14:20,490 INFO L290 TraceCheckUtils]: 29: Hoare triple {80791#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {80791#false} is VALID [2022-04-28 10:14:20,490 INFO L290 TraceCheckUtils]: 28: Hoare triple {80791#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {80791#false} is VALID [2022-04-28 10:14:20,490 INFO L290 TraceCheckUtils]: 27: Hoare triple {80791#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {80791#false} is VALID [2022-04-28 10:14:20,490 INFO L290 TraceCheckUtils]: 26: Hoare triple {80896#(<= (mod main_~y~0 4294967296) 0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {80791#false} is VALID [2022-04-28 10:14:20,491 INFO L290 TraceCheckUtils]: 25: Hoare triple {80892#(<= (mod (+ main_~y~0 4294967295) 4294967296) 0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {80896#(<= (mod main_~y~0 4294967296) 0)} is VALID [2022-04-28 10:14:20,492 INFO L290 TraceCheckUtils]: 24: Hoare triple {80888#(<= (mod (+ main_~y~0 4294967294) 4294967296) 0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {80892#(<= (mod (+ main_~y~0 4294967295) 4294967296) 0)} is VALID [2022-04-28 10:14:20,492 INFO L290 TraceCheckUtils]: 23: Hoare triple {80999#(or (< 0 (mod main_~z~0 4294967296)) (<= (mod (+ main_~y~0 4294967294) 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {80888#(<= (mod (+ main_~y~0 4294967294) 4294967296) 0)} is VALID [2022-04-28 10:14:20,493 INFO L290 TraceCheckUtils]: 22: Hoare triple {81003#(or (<= (mod (+ main_~y~0 4294967294) 4294967296) 0) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {80999#(or (< 0 (mod main_~z~0 4294967296)) (<= (mod (+ main_~y~0 4294967294) 4294967296) 0))} is VALID [2022-04-28 10:14:20,494 INFO L290 TraceCheckUtils]: 21: Hoare triple {81007#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (<= (mod (+ main_~y~0 4294967294) 4294967296) 0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {81003#(or (<= (mod (+ main_~y~0 4294967294) 4294967296) 0) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:14:20,494 INFO L290 TraceCheckUtils]: 20: Hoare triple {80790#true} ~z~0 := ~y~0; {81007#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (<= (mod (+ main_~y~0 4294967294) 4294967296) 0))} is VALID [2022-04-28 10:14:20,494 INFO L290 TraceCheckUtils]: 19: Hoare triple {80790#true} assume !(~x~0 % 4294967296 > 0); {80790#true} is VALID [2022-04-28 10:14:20,494 INFO L290 TraceCheckUtils]: 18: Hoare triple {80790#true} 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; {80790#true} is VALID [2022-04-28 10:14:20,494 INFO L290 TraceCheckUtils]: 17: Hoare triple {80790#true} 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; {80790#true} is VALID [2022-04-28 10:14:20,494 INFO L290 TraceCheckUtils]: 16: Hoare triple {80790#true} 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; {80790#true} is VALID [2022-04-28 10:14:20,494 INFO L290 TraceCheckUtils]: 15: Hoare triple {80790#true} 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; {80790#true} is VALID [2022-04-28 10:14:20,494 INFO L290 TraceCheckUtils]: 14: Hoare triple {80790#true} 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; {80790#true} is VALID [2022-04-28 10:14:20,494 INFO L290 TraceCheckUtils]: 13: Hoare triple {80790#true} 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; {80790#true} is VALID [2022-04-28 10:14:20,494 INFO L290 TraceCheckUtils]: 12: Hoare triple {80790#true} 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; {80790#true} is VALID [2022-04-28 10:14:20,495 INFO L290 TraceCheckUtils]: 11: Hoare triple {80790#true} 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; {80790#true} is VALID [2022-04-28 10:14:20,495 INFO L290 TraceCheckUtils]: 10: Hoare triple {80790#true} 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; {80790#true} is VALID [2022-04-28 10:14:20,495 INFO L290 TraceCheckUtils]: 9: Hoare triple {80790#true} 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; {80790#true} is VALID [2022-04-28 10:14:20,495 INFO L290 TraceCheckUtils]: 8: Hoare triple {80790#true} 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; {80790#true} is VALID [2022-04-28 10:14:20,495 INFO L290 TraceCheckUtils]: 7: Hoare triple {80790#true} 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; {80790#true} is VALID [2022-04-28 10:14:20,495 INFO L290 TraceCheckUtils]: 6: Hoare triple {80790#true} 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; {80790#true} is VALID [2022-04-28 10:14:20,495 INFO L290 TraceCheckUtils]: 5: Hoare triple {80790#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {80790#true} is VALID [2022-04-28 10:14:20,495 INFO L272 TraceCheckUtils]: 4: Hoare triple {80790#true} call #t~ret11 := main(); {80790#true} is VALID [2022-04-28 10:14:20,495 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {80790#true} {80790#true} #61#return; {80790#true} is VALID [2022-04-28 10:14:20,495 INFO L290 TraceCheckUtils]: 2: Hoare triple {80790#true} assume true; {80790#true} is VALID [2022-04-28 10:14:20,495 INFO L290 TraceCheckUtils]: 1: Hoare triple {80790#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(10, 2);call #Ultimate.allocInit(12, 3); {80790#true} is VALID [2022-04-28 10:14:20,495 INFO L272 TraceCheckUtils]: 0: Hoare triple {80790#true} call ULTIMATE.init(); {80790#true} is VALID [2022-04-28 10:14:20,495 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 33 proven. 6 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2022-04-28 10:14:20,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1318697269] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:14:20,495 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:14:20,495 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 8, 8] total 29 [2022-04-28 10:14:20,495 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:14:20,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1423051696] [2022-04-28 10:14:20,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1423051696] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:14:20,496 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:14:20,496 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-28 10:14:20,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448256189] [2022-04-28 10:14:20,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:14:20,496 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 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 42 [2022-04-28 10:14:20,496 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:14:20,496 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 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-28 10:14:20,514 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:14:20,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-28 10:14:20,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:14:20,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-28 10:14:20,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=734, Unknown=0, NotChecked=0, Total=812 [2022-04-28 10:14:20,514 INFO L87 Difference]: Start difference. First operand 144 states and 182 transitions. Second operand has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 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-28 10:14:22,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:22,299 INFO L93 Difference]: Finished difference Result 179 states and 217 transitions. [2022-04-28 10:14:22,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-28 10:14:22,299 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 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 42 [2022-04-28 10:14:22,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:14:22,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 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-28 10:14:22,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 75 transitions. [2022-04-28 10:14:22,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 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-28 10:14:22,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 75 transitions. [2022-04-28 10:14:22,300 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 75 transitions. [2022-04-28 10:14:22,358 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:14:22,359 INFO L225 Difference]: With dead ends: 179 [2022-04-28 10:14:22,360 INFO L226 Difference]: Without dead ends: 160 [2022-04-28 10:14:22,360 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 77 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=203, Invalid=2149, Unknown=0, NotChecked=0, Total=2352 [2022-04-28 10:14:22,360 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 38 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 855 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 900 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 855 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-28 10:14:22,360 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 105 Invalid, 900 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 855 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-28 10:14:22,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2022-04-28 10:14:22,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 145. [2022-04-28 10:14:22,516 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:14:22,517 INFO L82 GeneralOperation]: Start isEquivalent. First operand 160 states. Second operand has 145 states, 140 states have (on average 1.2785714285714285) internal successors, (179), 140 states have internal predecessors, (179), 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-28 10:14:22,517 INFO L74 IsIncluded]: Start isIncluded. First operand 160 states. Second operand has 145 states, 140 states have (on average 1.2785714285714285) internal successors, (179), 140 states have internal predecessors, (179), 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-28 10:14:22,517 INFO L87 Difference]: Start difference. First operand 160 states. Second operand has 145 states, 140 states have (on average 1.2785714285714285) internal successors, (179), 140 states have internal predecessors, (179), 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-28 10:14:22,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:22,518 INFO L93 Difference]: Finished difference Result 160 states and 198 transitions. [2022-04-28 10:14:22,518 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 198 transitions. [2022-04-28 10:14:22,518 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:14:22,518 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:14:22,519 INFO L74 IsIncluded]: Start isIncluded. First operand has 145 states, 140 states have (on average 1.2785714285714285) internal successors, (179), 140 states have internal predecessors, (179), 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 160 states. [2022-04-28 10:14:22,519 INFO L87 Difference]: Start difference. First operand has 145 states, 140 states have (on average 1.2785714285714285) internal successors, (179), 140 states have internal predecessors, (179), 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 160 states. [2022-04-28 10:14:22,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:22,520 INFO L93 Difference]: Finished difference Result 160 states and 198 transitions. [2022-04-28 10:14:22,520 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 198 transitions. [2022-04-28 10:14:22,520 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:14:22,520 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:14:22,520 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:14:22,520 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:14:22,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 140 states have (on average 1.2785714285714285) internal successors, (179), 140 states have internal predecessors, (179), 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-28 10:14:22,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 183 transitions. [2022-04-28 10:14:22,522 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 183 transitions. Word has length 42 [2022-04-28 10:14:22,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:14:22,522 INFO L495 AbstractCegarLoop]: Abstraction has 145 states and 183 transitions. [2022-04-28 10:14:22,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 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-28 10:14:22,522 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 145 states and 183 transitions. [2022-04-28 10:14:29,091 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 183 edges. 181 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-28 10:14:29,092 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 183 transitions. [2022-04-28 10:14:29,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-28 10:14:29,092 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:14:29,092 INFO L195 NwaCegarLoop]: trace histogram [28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:14:29,096 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (94)] Forceful destruction successful, exit code 0 [2022-04-28 10:14:29,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93,94 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:14:29,293 INFO L420 AbstractCegarLoop]: === Iteration 95 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:14:29,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:14:29,293 INFO L85 PathProgramCache]: Analyzing trace with hash -1829652723, now seen corresponding path program 55 times [2022-04-28 10:14:29,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:14:29,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [662962418] [2022-04-28 10:14:29,296 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:14:29,296 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:14:29,297 INFO L85 PathProgramCache]: Analyzing trace with hash -1829652723, now seen corresponding path program 56 times [2022-04-28 10:14:29,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:14:29,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402400066] [2022-04-28 10:14:29,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:14:29,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:14:29,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:14:29,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:14:29,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:14:29,857 INFO L290 TraceCheckUtils]: 0: Hoare triple {82116#(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(10, 2);call #Ultimate.allocInit(12, 3); {82081#true} is VALID [2022-04-28 10:14:29,857 INFO L290 TraceCheckUtils]: 1: Hoare triple {82081#true} assume true; {82081#true} is VALID [2022-04-28 10:14:29,857 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {82081#true} {82081#true} #61#return; {82081#true} is VALID [2022-04-28 10:14:29,857 INFO L272 TraceCheckUtils]: 0: Hoare triple {82081#true} call ULTIMATE.init(); {82116#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:14:29,857 INFO L290 TraceCheckUtils]: 1: Hoare triple {82116#(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(10, 2);call #Ultimate.allocInit(12, 3); {82081#true} is VALID [2022-04-28 10:14:29,857 INFO L290 TraceCheckUtils]: 2: Hoare triple {82081#true} assume true; {82081#true} is VALID [2022-04-28 10:14:29,857 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {82081#true} {82081#true} #61#return; {82081#true} is VALID [2022-04-28 10:14:29,858 INFO L272 TraceCheckUtils]: 4: Hoare triple {82081#true} call #t~ret11 := main(); {82081#true} is VALID [2022-04-28 10:14:29,858 INFO L290 TraceCheckUtils]: 5: Hoare triple {82081#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {82086#(= main_~y~0 0)} is VALID [2022-04-28 10:14:29,858 INFO L290 TraceCheckUtils]: 6: Hoare triple {82086#(= 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; {82087#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:14:29,859 INFO L290 TraceCheckUtils]: 7: Hoare triple {82087#(and (<= 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; {82088#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:14:29,859 INFO L290 TraceCheckUtils]: 8: Hoare triple {82088#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {82089#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:14:29,860 INFO L290 TraceCheckUtils]: 9: Hoare triple {82089#(and (<= main_~y~0 3) (<= 3 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; {82090#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:14:29,860 INFO L290 TraceCheckUtils]: 10: Hoare triple {82090#(and (<= main_~y~0 4) (<= 4 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; {82091#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:14:29,861 INFO L290 TraceCheckUtils]: 11: Hoare triple {82091#(and (<= 5 main_~y~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; {82092#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:14:29,861 INFO L290 TraceCheckUtils]: 12: Hoare triple {82092#(and (<= main_~y~0 6) (<= 6 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; {82093#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:14:29,862 INFO L290 TraceCheckUtils]: 13: Hoare triple {82093#(and (<= 7 main_~y~0) (<= main_~y~0 7))} 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; {82094#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:14:29,862 INFO L290 TraceCheckUtils]: 14: Hoare triple {82094#(and (<= main_~y~0 8) (<= 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; {82095#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:14:29,863 INFO L290 TraceCheckUtils]: 15: Hoare triple {82095#(and (<= 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; {82096#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:14:29,863 INFO L290 TraceCheckUtils]: 16: Hoare triple {82096#(and (<= main_~y~0 10) (<= 10 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; {82097#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:14:29,864 INFO L290 TraceCheckUtils]: 17: Hoare triple {82097#(and (<= main_~y~0 11) (<= 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; {82098#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:14:29,864 INFO L290 TraceCheckUtils]: 18: Hoare triple {82098#(and (<= 12 main_~y~0) (<= main_~y~0 12))} 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; {82099#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:14:29,865 INFO L290 TraceCheckUtils]: 19: Hoare triple {82099#(and (<= main_~y~0 13) (<= 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; {82100#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:14:29,865 INFO L290 TraceCheckUtils]: 20: Hoare triple {82100#(and (<= 14 main_~y~0) (<= main_~y~0 14))} 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; {82101#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:14:29,866 INFO L290 TraceCheckUtils]: 21: Hoare triple {82101#(and (<= main_~y~0 15) (<= 15 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; {82102#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:14:29,866 INFO L290 TraceCheckUtils]: 22: Hoare triple {82102#(and (<= 16 main_~y~0) (<= main_~y~0 16))} 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; {82103#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:14:29,867 INFO L290 TraceCheckUtils]: 23: Hoare triple {82103#(and (<= main_~y~0 17) (<= 17 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; {82104#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 10:14:29,867 INFO L290 TraceCheckUtils]: 24: Hoare triple {82104#(and (<= 18 main_~y~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; {82105#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 10:14:29,868 INFO L290 TraceCheckUtils]: 25: Hoare triple {82105#(and (<= 19 main_~y~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; {82106#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 10:14:29,868 INFO L290 TraceCheckUtils]: 26: Hoare triple {82106#(and (<= 20 main_~y~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; {82107#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 10:14:29,869 INFO L290 TraceCheckUtils]: 27: Hoare triple {82107#(and (<= main_~y~0 21) (<= 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; {82108#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 10:14:29,869 INFO L290 TraceCheckUtils]: 28: Hoare triple {82108#(and (<= main_~y~0 22) (<= 22 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; {82109#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 10:14:29,870 INFO L290 TraceCheckUtils]: 29: Hoare triple {82109#(and (<= main_~y~0 23) (<= 23 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; {82110#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-28 10:14:29,870 INFO L290 TraceCheckUtils]: 30: Hoare triple {82110#(and (<= 24 main_~y~0) (<= main_~y~0 24))} 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; {82111#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-28 10:14:29,871 INFO L290 TraceCheckUtils]: 31: Hoare triple {82111#(and (<= 25 main_~y~0) (<= main_~y~0 25))} 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; {82112#(and (<= main_~y~0 26) (<= 26 main_~y~0))} is VALID [2022-04-28 10:14:29,871 INFO L290 TraceCheckUtils]: 32: Hoare triple {82112#(and (<= main_~y~0 26) (<= 26 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; {82113#(and (<= main_~y~0 27) (<= 27 main_~y~0))} is VALID [2022-04-28 10:14:29,872 INFO L290 TraceCheckUtils]: 33: Hoare triple {82113#(and (<= main_~y~0 27) (<= 27 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; {82114#(and (<= main_~y~0 28) (<= 28 main_~y~0))} is VALID [2022-04-28 10:14:29,872 INFO L290 TraceCheckUtils]: 34: Hoare triple {82114#(and (<= main_~y~0 28) (<= 28 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {82114#(and (<= main_~y~0 28) (<= 28 main_~y~0))} is VALID [2022-04-28 10:14:29,872 INFO L290 TraceCheckUtils]: 35: Hoare triple {82114#(and (<= main_~y~0 28) (<= 28 main_~y~0))} ~z~0 := ~y~0; {82115#(and (<= (div main_~z~0 4294967296) 0) (<= 28 main_~z~0))} is VALID [2022-04-28 10:14:29,873 INFO L290 TraceCheckUtils]: 36: Hoare triple {82115#(and (<= (div main_~z~0 4294967296) 0) (<= 28 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {82082#false} is VALID [2022-04-28 10:14:29,873 INFO L290 TraceCheckUtils]: 37: Hoare triple {82082#false} assume !(~y~0 % 4294967296 > 0); {82082#false} is VALID [2022-04-28 10:14:29,873 INFO L272 TraceCheckUtils]: 38: Hoare triple {82082#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {82082#false} is VALID [2022-04-28 10:14:29,873 INFO L290 TraceCheckUtils]: 39: Hoare triple {82082#false} ~cond := #in~cond; {82082#false} is VALID [2022-04-28 10:14:29,873 INFO L290 TraceCheckUtils]: 40: Hoare triple {82082#false} assume 0 == ~cond; {82082#false} is VALID [2022-04-28 10:14:29,873 INFO L290 TraceCheckUtils]: 41: Hoare triple {82082#false} assume !false; {82082#false} is VALID [2022-04-28 10:14:29,873 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:14:29,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:14:29,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402400066] [2022-04-28 10:14:29,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402400066] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:14:29,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1687280617] [2022-04-28 10:14:29,873 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:14:29,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:14:29,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:14:29,874 INFO L229 MonitoredProcess]: Starting monitored process 95 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:14:29,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (95)] Waiting until timeout for monitored process [2022-04-28 10:14:29,918 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:14:29,919 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:14:29,920 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 61 conjunts are in the unsatisfiable core [2022-04-28 10:14:29,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:14:29,929 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:14:30,294 INFO L272 TraceCheckUtils]: 0: Hoare triple {82081#true} call ULTIMATE.init(); {82081#true} is VALID [2022-04-28 10:14:30,295 INFO L290 TraceCheckUtils]: 1: Hoare triple {82081#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(10, 2);call #Ultimate.allocInit(12, 3); {82081#true} is VALID [2022-04-28 10:14:30,295 INFO L290 TraceCheckUtils]: 2: Hoare triple {82081#true} assume true; {82081#true} is VALID [2022-04-28 10:14:30,295 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {82081#true} {82081#true} #61#return; {82081#true} is VALID [2022-04-28 10:14:30,295 INFO L272 TraceCheckUtils]: 4: Hoare triple {82081#true} call #t~ret11 := main(); {82081#true} is VALID [2022-04-28 10:14:30,295 INFO L290 TraceCheckUtils]: 5: Hoare triple {82081#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {82086#(= main_~y~0 0)} is VALID [2022-04-28 10:14:30,295 INFO L290 TraceCheckUtils]: 6: Hoare triple {82086#(= 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; {82087#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:14:30,296 INFO L290 TraceCheckUtils]: 7: Hoare triple {82087#(and (<= 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; {82088#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:14:30,296 INFO L290 TraceCheckUtils]: 8: Hoare triple {82088#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {82089#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:14:30,297 INFO L290 TraceCheckUtils]: 9: Hoare triple {82089#(and (<= main_~y~0 3) (<= 3 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; {82090#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:14:30,297 INFO L290 TraceCheckUtils]: 10: Hoare triple {82090#(and (<= main_~y~0 4) (<= 4 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; {82091#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:14:30,298 INFO L290 TraceCheckUtils]: 11: Hoare triple {82091#(and (<= 5 main_~y~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; {82092#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:14:30,298 INFO L290 TraceCheckUtils]: 12: Hoare triple {82092#(and (<= main_~y~0 6) (<= 6 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; {82093#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:14:30,299 INFO L290 TraceCheckUtils]: 13: Hoare triple {82093#(and (<= 7 main_~y~0) (<= main_~y~0 7))} 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; {82094#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:14:30,299 INFO L290 TraceCheckUtils]: 14: Hoare triple {82094#(and (<= main_~y~0 8) (<= 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; {82095#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:14:30,300 INFO L290 TraceCheckUtils]: 15: Hoare triple {82095#(and (<= 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; {82096#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:14:30,300 INFO L290 TraceCheckUtils]: 16: Hoare triple {82096#(and (<= main_~y~0 10) (<= 10 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; {82097#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:14:30,301 INFO L290 TraceCheckUtils]: 17: Hoare triple {82097#(and (<= main_~y~0 11) (<= 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; {82098#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:14:30,301 INFO L290 TraceCheckUtils]: 18: Hoare triple {82098#(and (<= 12 main_~y~0) (<= main_~y~0 12))} 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; {82099#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:14:30,302 INFO L290 TraceCheckUtils]: 19: Hoare triple {82099#(and (<= main_~y~0 13) (<= 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; {82100#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:14:30,302 INFO L290 TraceCheckUtils]: 20: Hoare triple {82100#(and (<= 14 main_~y~0) (<= main_~y~0 14))} 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; {82101#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:14:30,303 INFO L290 TraceCheckUtils]: 21: Hoare triple {82101#(and (<= main_~y~0 15) (<= 15 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; {82102#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:14:30,303 INFO L290 TraceCheckUtils]: 22: Hoare triple {82102#(and (<= 16 main_~y~0) (<= main_~y~0 16))} 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; {82103#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:14:30,304 INFO L290 TraceCheckUtils]: 23: Hoare triple {82103#(and (<= main_~y~0 17) (<= 17 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; {82104#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 10:14:30,304 INFO L290 TraceCheckUtils]: 24: Hoare triple {82104#(and (<= 18 main_~y~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; {82105#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 10:14:30,305 INFO L290 TraceCheckUtils]: 25: Hoare triple {82105#(and (<= 19 main_~y~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; {82106#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 10:14:30,305 INFO L290 TraceCheckUtils]: 26: Hoare triple {82106#(and (<= 20 main_~y~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; {82107#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 10:14:30,306 INFO L290 TraceCheckUtils]: 27: Hoare triple {82107#(and (<= main_~y~0 21) (<= 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; {82108#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 10:14:30,306 INFO L290 TraceCheckUtils]: 28: Hoare triple {82108#(and (<= main_~y~0 22) (<= 22 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; {82109#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 10:14:30,307 INFO L290 TraceCheckUtils]: 29: Hoare triple {82109#(and (<= main_~y~0 23) (<= 23 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; {82110#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-28 10:14:30,307 INFO L290 TraceCheckUtils]: 30: Hoare triple {82110#(and (<= 24 main_~y~0) (<= main_~y~0 24))} 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; {82111#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-28 10:14:30,308 INFO L290 TraceCheckUtils]: 31: Hoare triple {82111#(and (<= 25 main_~y~0) (<= main_~y~0 25))} 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; {82112#(and (<= main_~y~0 26) (<= 26 main_~y~0))} is VALID [2022-04-28 10:14:30,308 INFO L290 TraceCheckUtils]: 32: Hoare triple {82112#(and (<= main_~y~0 26) (<= 26 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; {82113#(and (<= main_~y~0 27) (<= 27 main_~y~0))} is VALID [2022-04-28 10:14:30,309 INFO L290 TraceCheckUtils]: 33: Hoare triple {82113#(and (<= main_~y~0 27) (<= 27 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; {82114#(and (<= main_~y~0 28) (<= 28 main_~y~0))} is VALID [2022-04-28 10:14:30,309 INFO L290 TraceCheckUtils]: 34: Hoare triple {82114#(and (<= main_~y~0 28) (<= 28 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {82114#(and (<= main_~y~0 28) (<= 28 main_~y~0))} is VALID [2022-04-28 10:14:30,309 INFO L290 TraceCheckUtils]: 35: Hoare triple {82114#(and (<= main_~y~0 28) (<= 28 main_~y~0))} ~z~0 := ~y~0; {82225#(and (<= 28 main_~z~0) (<= main_~z~0 28))} is VALID [2022-04-28 10:14:30,310 INFO L290 TraceCheckUtils]: 36: Hoare triple {82225#(and (<= 28 main_~z~0) (<= main_~z~0 28))} assume !(~z~0 % 4294967296 > 0); {82082#false} is VALID [2022-04-28 10:14:30,310 INFO L290 TraceCheckUtils]: 37: Hoare triple {82082#false} assume !(~y~0 % 4294967296 > 0); {82082#false} is VALID [2022-04-28 10:14:30,310 INFO L272 TraceCheckUtils]: 38: Hoare triple {82082#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {82082#false} is VALID [2022-04-28 10:14:30,310 INFO L290 TraceCheckUtils]: 39: Hoare triple {82082#false} ~cond := #in~cond; {82082#false} is VALID [2022-04-28 10:14:30,310 INFO L290 TraceCheckUtils]: 40: Hoare triple {82082#false} assume 0 == ~cond; {82082#false} is VALID [2022-04-28 10:14:30,310 INFO L290 TraceCheckUtils]: 41: Hoare triple {82082#false} assume !false; {82082#false} is VALID [2022-04-28 10:14:30,310 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:14:30,310 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:14:31,682 INFO L290 TraceCheckUtils]: 41: Hoare triple {82082#false} assume !false; {82082#false} is VALID [2022-04-28 10:14:31,682 INFO L290 TraceCheckUtils]: 40: Hoare triple {82082#false} assume 0 == ~cond; {82082#false} is VALID [2022-04-28 10:14:31,682 INFO L290 TraceCheckUtils]: 39: Hoare triple {82082#false} ~cond := #in~cond; {82082#false} is VALID [2022-04-28 10:14:31,682 INFO L272 TraceCheckUtils]: 38: Hoare triple {82082#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {82082#false} is VALID [2022-04-28 10:14:31,682 INFO L290 TraceCheckUtils]: 37: Hoare triple {82082#false} assume !(~y~0 % 4294967296 > 0); {82082#false} is VALID [2022-04-28 10:14:31,682 INFO L290 TraceCheckUtils]: 36: Hoare triple {82259#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {82082#false} is VALID [2022-04-28 10:14:31,683 INFO L290 TraceCheckUtils]: 35: Hoare triple {82263#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {82259#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:14:31,683 INFO L290 TraceCheckUtils]: 34: Hoare triple {82263#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {82263#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:14:31,684 INFO L290 TraceCheckUtils]: 33: Hoare triple {82270#(< 0 (mod (+ main_~y~0 1) 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; {82263#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:14:31,684 INFO L290 TraceCheckUtils]: 32: Hoare triple {82274#(< 0 (mod (+ main_~y~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; {82270#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:14:31,685 INFO L290 TraceCheckUtils]: 31: Hoare triple {82278#(< 0 (mod (+ main_~y~0 3) 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; {82274#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:14:31,685 INFO L290 TraceCheckUtils]: 30: Hoare triple {82282#(< 0 (mod (+ main_~y~0 4) 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; {82278#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:14:31,686 INFO L290 TraceCheckUtils]: 29: Hoare triple {82286#(< 0 (mod (+ 5 main_~y~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; {82282#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:14:31,687 INFO L290 TraceCheckUtils]: 28: Hoare triple {82290#(< 0 (mod (+ main_~y~0 6) 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; {82286#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:14:31,687 INFO L290 TraceCheckUtils]: 27: Hoare triple {82294#(< 0 (mod (+ 7 main_~y~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; {82290#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:14:31,688 INFO L290 TraceCheckUtils]: 26: Hoare triple {82298#(< 0 (mod (+ main_~y~0 8) 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; {82294#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:14:31,689 INFO L290 TraceCheckUtils]: 25: Hoare triple {82302#(< 0 (mod (+ main_~y~0 9) 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; {82298#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:14:31,689 INFO L290 TraceCheckUtils]: 24: Hoare triple {82306#(< 0 (mod (+ main_~y~0 10) 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; {82302#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:14:31,690 INFO L290 TraceCheckUtils]: 23: Hoare triple {82310#(< 0 (mod (+ main_~y~0 11) 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; {82306#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-28 10:14:31,691 INFO L290 TraceCheckUtils]: 22: Hoare triple {82314#(< 0 (mod (+ main_~y~0 12) 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; {82310#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-28 10:14:31,691 INFO L290 TraceCheckUtils]: 21: Hoare triple {82318#(< 0 (mod (+ main_~y~0 13) 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; {82314#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-28 10:14:31,692 INFO L290 TraceCheckUtils]: 20: Hoare triple {82322#(< 0 (mod (+ main_~y~0 14) 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; {82318#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-28 10:14:31,692 INFO L290 TraceCheckUtils]: 19: Hoare triple {82326#(< 0 (mod (+ main_~y~0 15) 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; {82322#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-28 10:14:31,693 INFO L290 TraceCheckUtils]: 18: Hoare triple {82330#(< 0 (mod (+ main_~y~0 16) 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; {82326#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID [2022-04-28 10:14:31,694 INFO L290 TraceCheckUtils]: 17: Hoare triple {82334#(< 0 (mod (+ main_~y~0 17) 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; {82330#(< 0 (mod (+ main_~y~0 16) 4294967296))} is VALID [2022-04-28 10:14:31,694 INFO L290 TraceCheckUtils]: 16: Hoare triple {82338#(< 0 (mod (+ main_~y~0 18) 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; {82334#(< 0 (mod (+ main_~y~0 17) 4294967296))} is VALID [2022-04-28 10:14:31,695 INFO L290 TraceCheckUtils]: 15: Hoare triple {82342#(< 0 (mod (+ 19 main_~y~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; {82338#(< 0 (mod (+ main_~y~0 18) 4294967296))} is VALID [2022-04-28 10:14:31,695 INFO L290 TraceCheckUtils]: 14: Hoare triple {82346#(< 0 (mod (+ main_~y~0 20) 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; {82342#(< 0 (mod (+ 19 main_~y~0) 4294967296))} is VALID [2022-04-28 10:14:31,696 INFO L290 TraceCheckUtils]: 13: Hoare triple {82350#(< 0 (mod (+ main_~y~0 21) 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; {82346#(< 0 (mod (+ main_~y~0 20) 4294967296))} is VALID [2022-04-28 10:14:31,697 INFO L290 TraceCheckUtils]: 12: Hoare triple {82354#(< 0 (mod (+ main_~y~0 22) 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; {82350#(< 0 (mod (+ main_~y~0 21) 4294967296))} is VALID [2022-04-28 10:14:31,697 INFO L290 TraceCheckUtils]: 11: Hoare triple {82358#(< 0 (mod (+ 23 main_~y~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; {82354#(< 0 (mod (+ main_~y~0 22) 4294967296))} is VALID [2022-04-28 10:14:31,698 INFO L290 TraceCheckUtils]: 10: Hoare triple {82362#(< 0 (mod (+ main_~y~0 24) 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; {82358#(< 0 (mod (+ 23 main_~y~0) 4294967296))} is VALID [2022-04-28 10:14:31,699 INFO L290 TraceCheckUtils]: 9: Hoare triple {82366#(< 0 (mod (+ main_~y~0 25) 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; {82362#(< 0 (mod (+ main_~y~0 24) 4294967296))} is VALID [2022-04-28 10:14:31,699 INFO L290 TraceCheckUtils]: 8: Hoare triple {82370#(< 0 (mod (+ main_~y~0 26) 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; {82366#(< 0 (mod (+ main_~y~0 25) 4294967296))} is VALID [2022-04-28 10:14:31,700 INFO L290 TraceCheckUtils]: 7: Hoare triple {82374#(< 0 (mod (+ main_~y~0 27) 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; {82370#(< 0 (mod (+ main_~y~0 26) 4294967296))} is VALID [2022-04-28 10:14:31,700 INFO L290 TraceCheckUtils]: 6: Hoare triple {82378#(< 0 (mod (+ main_~y~0 28) 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; {82374#(< 0 (mod (+ main_~y~0 27) 4294967296))} is VALID [2022-04-28 10:14:31,701 INFO L290 TraceCheckUtils]: 5: Hoare triple {82081#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {82378#(< 0 (mod (+ main_~y~0 28) 4294967296))} is VALID [2022-04-28 10:14:31,701 INFO L272 TraceCheckUtils]: 4: Hoare triple {82081#true} call #t~ret11 := main(); {82081#true} is VALID [2022-04-28 10:14:31,701 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {82081#true} {82081#true} #61#return; {82081#true} is VALID [2022-04-28 10:14:31,701 INFO L290 TraceCheckUtils]: 2: Hoare triple {82081#true} assume true; {82081#true} is VALID [2022-04-28 10:14:31,701 INFO L290 TraceCheckUtils]: 1: Hoare triple {82081#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(10, 2);call #Ultimate.allocInit(12, 3); {82081#true} is VALID [2022-04-28 10:14:31,701 INFO L272 TraceCheckUtils]: 0: Hoare triple {82081#true} call ULTIMATE.init(); {82081#true} is VALID [2022-04-28 10:14:31,701 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:14:31,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1687280617] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:14:31,701 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:14:31,701 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 32, 32] total 64 [2022-04-28 10:14:31,702 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:14:31,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [662962418] [2022-04-28 10:14:31,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [662962418] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:14:31,702 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:14:31,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2022-04-28 10:14:31,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323573775] [2022-04-28 10:14:31,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:14:31,702 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 32 states have internal predecessors, (38), 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 42 [2022-04-28 10:14:31,702 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:14:31,702 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 33 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 32 states have internal predecessors, (38), 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-28 10:14:31,725 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:14:31,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-04-28 10:14:31,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:14:31,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-04-28 10:14:31,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=968, Invalid=3064, Unknown=0, NotChecked=0, Total=4032 [2022-04-28 10:14:31,725 INFO L87 Difference]: Start difference. First operand 145 states and 183 transitions. Second operand has 33 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 32 states have internal predecessors, (38), 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-28 10:14:38,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:38,105 INFO L93 Difference]: Finished difference Result 185 states and 255 transitions. [2022-04-28 10:14:38,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-04-28 10:14:38,106 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 32 states have internal predecessors, (38), 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 42 [2022-04-28 10:14:38,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:14:38,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 32 states have internal predecessors, (38), 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-28 10:14:38,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 189 transitions. [2022-04-28 10:14:38,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 32 states have internal predecessors, (38), 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-28 10:14:38,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 189 transitions. [2022-04-28 10:14:38,108 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 189 transitions. [2022-04-28 10:14:38,250 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 189 edges. 189 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:14:38,252 INFO L225 Difference]: With dead ends: 185 [2022-04-28 10:14:38,252 INFO L226 Difference]: Without dead ends: 179 [2022-04-28 10:14:38,252 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 523 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1960, Invalid=6782, Unknown=0, NotChecked=0, Total=8742 [2022-04-28 10:14:38,253 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 164 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 4115 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 4234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 4115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:14:38,253 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 218 Invalid, 4234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 4115 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-04-28 10:14:38,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2022-04-28 10:14:38,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 150. [2022-04-28 10:14:38,414 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:14:38,414 INFO L82 GeneralOperation]: Start isEquivalent. First operand 179 states. Second operand has 150 states, 145 states have (on average 1.282758620689655) internal successors, (186), 145 states have internal predecessors, (186), 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-28 10:14:38,414 INFO L74 IsIncluded]: Start isIncluded. First operand 179 states. Second operand has 150 states, 145 states have (on average 1.282758620689655) internal successors, (186), 145 states have internal predecessors, (186), 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-28 10:14:38,414 INFO L87 Difference]: Start difference. First operand 179 states. Second operand has 150 states, 145 states have (on average 1.282758620689655) internal successors, (186), 145 states have internal predecessors, (186), 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-28 10:14:38,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:38,416 INFO L93 Difference]: Finished difference Result 179 states and 219 transitions. [2022-04-28 10:14:38,416 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 219 transitions. [2022-04-28 10:14:38,416 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:14:38,416 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:14:38,416 INFO L74 IsIncluded]: Start isIncluded. First operand has 150 states, 145 states have (on average 1.282758620689655) internal successors, (186), 145 states have internal predecessors, (186), 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 179 states. [2022-04-28 10:14:38,416 INFO L87 Difference]: Start difference. First operand has 150 states, 145 states have (on average 1.282758620689655) internal successors, (186), 145 states have internal predecessors, (186), 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 179 states. [2022-04-28 10:14:38,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:38,418 INFO L93 Difference]: Finished difference Result 179 states and 219 transitions. [2022-04-28 10:14:38,418 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 219 transitions. [2022-04-28 10:14:38,418 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:14:38,418 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:14:38,418 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:14:38,418 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:14:38,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 145 states have (on average 1.282758620689655) internal successors, (186), 145 states have internal predecessors, (186), 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-28 10:14:38,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 190 transitions. [2022-04-28 10:14:38,419 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 190 transitions. Word has length 42 [2022-04-28 10:14:38,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:14:38,419 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 190 transitions. [2022-04-28 10:14:38,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 32 states have internal predecessors, (38), 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-28 10:14:38,419 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 150 states and 190 transitions. [2022-04-28 10:14:43,109 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 190 edges. 190 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:14:43,109 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 190 transitions. [2022-04-28 10:14:43,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-28 10:14:43,110 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:14:43,110 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:14:43,126 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (95)] Forceful destruction successful, exit code 0 [2022-04-28 10:14:43,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94,95 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:14:43,310 INFO L420 AbstractCegarLoop]: === Iteration 96 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:14:43,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:14:43,311 INFO L85 PathProgramCache]: Analyzing trace with hash -2101683985, now seen corresponding path program 133 times [2022-04-28 10:14:43,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:14:43,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1229054431] [2022-04-28 10:14:43,313 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:14:43,313 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:14:43,313 INFO L85 PathProgramCache]: Analyzing trace with hash -2101683985, now seen corresponding path program 134 times [2022-04-28 10:14:43,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:14:43,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930052909] [2022-04-28 10:14:43,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:14:43,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:14:43,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:14:43,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:14:43,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:14:43,662 INFO L290 TraceCheckUtils]: 0: Hoare triple {83513#(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(10, 2);call #Ultimate.allocInit(12, 3); {83487#true} is VALID [2022-04-28 10:14:43,662 INFO L290 TraceCheckUtils]: 1: Hoare triple {83487#true} assume true; {83487#true} is VALID [2022-04-28 10:14:43,662 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {83487#true} {83487#true} #61#return; {83487#true} is VALID [2022-04-28 10:14:43,662 INFO L272 TraceCheckUtils]: 0: Hoare triple {83487#true} call ULTIMATE.init(); {83513#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:14:43,662 INFO L290 TraceCheckUtils]: 1: Hoare triple {83513#(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(10, 2);call #Ultimate.allocInit(12, 3); {83487#true} is VALID [2022-04-28 10:14:43,662 INFO L290 TraceCheckUtils]: 2: Hoare triple {83487#true} assume true; {83487#true} is VALID [2022-04-28 10:14:43,662 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {83487#true} {83487#true} #61#return; {83487#true} is VALID [2022-04-28 10:14:43,662 INFO L272 TraceCheckUtils]: 4: Hoare triple {83487#true} call #t~ret11 := main(); {83487#true} is VALID [2022-04-28 10:14:43,663 INFO L290 TraceCheckUtils]: 5: Hoare triple {83487#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {83492#(= main_~y~0 0)} is VALID [2022-04-28 10:14:43,663 INFO L290 TraceCheckUtils]: 6: Hoare triple {83492#(= 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; {83493#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:14:43,663 INFO L290 TraceCheckUtils]: 7: Hoare triple {83493#(and (<= 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; {83494#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:14:43,664 INFO L290 TraceCheckUtils]: 8: Hoare triple {83494#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {83495#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:14:43,664 INFO L290 TraceCheckUtils]: 9: Hoare triple {83495#(and (<= main_~y~0 3) (<= 3 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; {83496#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:14:43,665 INFO L290 TraceCheckUtils]: 10: Hoare triple {83496#(and (<= main_~y~0 4) (<= 4 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; {83497#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:14:43,665 INFO L290 TraceCheckUtils]: 11: Hoare triple {83497#(and (<= 5 main_~y~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; {83498#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:14:43,666 INFO L290 TraceCheckUtils]: 12: Hoare triple {83498#(and (<= main_~y~0 6) (<= 6 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; {83499#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:14:43,666 INFO L290 TraceCheckUtils]: 13: Hoare triple {83499#(and (<= 7 main_~y~0) (<= main_~y~0 7))} 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; {83500#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:14:43,667 INFO L290 TraceCheckUtils]: 14: Hoare triple {83500#(and (<= main_~y~0 8) (<= 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; {83501#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:14:43,667 INFO L290 TraceCheckUtils]: 15: Hoare triple {83501#(and (<= 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; {83502#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:14:43,668 INFO L290 TraceCheckUtils]: 16: Hoare triple {83502#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {83502#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:14:43,668 INFO L290 TraceCheckUtils]: 17: Hoare triple {83502#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {83503#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:14:43,668 INFO L290 TraceCheckUtils]: 18: Hoare triple {83503#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {83504#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:14:43,669 INFO L290 TraceCheckUtils]: 19: Hoare triple {83504#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {83505#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:14:43,669 INFO L290 TraceCheckUtils]: 20: Hoare triple {83505#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {83506#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:14:43,670 INFO L290 TraceCheckUtils]: 21: Hoare triple {83506#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {83507#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:14:43,670 INFO L290 TraceCheckUtils]: 22: Hoare triple {83507#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {83508#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:14:43,671 INFO L290 TraceCheckUtils]: 23: Hoare triple {83508#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {83509#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:14:43,671 INFO L290 TraceCheckUtils]: 24: Hoare triple {83509#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {83510#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-28 10:14:43,672 INFO L290 TraceCheckUtils]: 25: Hoare triple {83510#(and (<= main_~z~0 3) (<= 3 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {83511#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-28 10:14:43,672 INFO L290 TraceCheckUtils]: 26: Hoare triple {83511#(and (<= main_~z~0 2) (<= 2 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {83512#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-28 10:14:43,673 INFO L290 TraceCheckUtils]: 27: Hoare triple {83512#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {83488#false} is VALID [2022-04-28 10:14:43,673 INFO L290 TraceCheckUtils]: 28: Hoare triple {83488#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {83488#false} is VALID [2022-04-28 10:14:43,673 INFO L290 TraceCheckUtils]: 29: Hoare triple {83488#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {83488#false} is VALID [2022-04-28 10:14:43,673 INFO L290 TraceCheckUtils]: 30: Hoare triple {83488#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {83488#false} is VALID [2022-04-28 10:14:43,673 INFO L290 TraceCheckUtils]: 31: Hoare triple {83488#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {83488#false} is VALID [2022-04-28 10:14:43,673 INFO L290 TraceCheckUtils]: 32: Hoare triple {83488#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {83488#false} is VALID [2022-04-28 10:14:43,673 INFO L290 TraceCheckUtils]: 33: Hoare triple {83488#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {83488#false} is VALID [2022-04-28 10:14:43,673 INFO L290 TraceCheckUtils]: 34: Hoare triple {83488#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {83488#false} is VALID [2022-04-28 10:14:43,673 INFO L290 TraceCheckUtils]: 35: Hoare triple {83488#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {83488#false} is VALID [2022-04-28 10:14:43,673 INFO L290 TraceCheckUtils]: 36: Hoare triple {83488#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {83488#false} is VALID [2022-04-28 10:14:43,673 INFO L290 TraceCheckUtils]: 37: Hoare triple {83488#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {83488#false} is VALID [2022-04-28 10:14:43,673 INFO L290 TraceCheckUtils]: 38: Hoare triple {83488#false} assume !(~y~0 % 4294967296 > 0); {83488#false} is VALID [2022-04-28 10:14:43,673 INFO L272 TraceCheckUtils]: 39: Hoare triple {83488#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {83488#false} is VALID [2022-04-28 10:14:43,673 INFO L290 TraceCheckUtils]: 40: Hoare triple {83488#false} ~cond := #in~cond; {83488#false} is VALID [2022-04-28 10:14:43,673 INFO L290 TraceCheckUtils]: 41: Hoare triple {83488#false} assume 0 == ~cond; {83488#false} is VALID [2022-04-28 10:14:43,674 INFO L290 TraceCheckUtils]: 42: Hoare triple {83488#false} assume !false; {83488#false} is VALID [2022-04-28 10:14:43,674 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-04-28 10:14:43,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:14:43,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930052909] [2022-04-28 10:14:43,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930052909] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:14:43,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1455427096] [2022-04-28 10:14:43,674 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:14:43,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:14:43,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:14:43,675 INFO L229 MonitoredProcess]: Starting monitored process 96 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:14:43,675 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (96)] Waiting until timeout for monitored process [2022-04-28 10:14:43,720 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:14:43,720 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:14:43,721 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 62 conjunts are in the unsatisfiable core [2022-04-28 10:14:43,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:14:43,731 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:14:44,165 INFO L272 TraceCheckUtils]: 0: Hoare triple {83487#true} call ULTIMATE.init(); {83487#true} is VALID [2022-04-28 10:14:44,165 INFO L290 TraceCheckUtils]: 1: Hoare triple {83487#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(10, 2);call #Ultimate.allocInit(12, 3); {83487#true} is VALID [2022-04-28 10:14:44,165 INFO L290 TraceCheckUtils]: 2: Hoare triple {83487#true} assume true; {83487#true} is VALID [2022-04-28 10:14:44,165 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {83487#true} {83487#true} #61#return; {83487#true} is VALID [2022-04-28 10:14:44,165 INFO L272 TraceCheckUtils]: 4: Hoare triple {83487#true} call #t~ret11 := main(); {83487#true} is VALID [2022-04-28 10:14:44,165 INFO L290 TraceCheckUtils]: 5: Hoare triple {83487#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {83492#(= main_~y~0 0)} is VALID [2022-04-28 10:14:44,166 INFO L290 TraceCheckUtils]: 6: Hoare triple {83492#(= 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; {83493#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:14:44,166 INFO L290 TraceCheckUtils]: 7: Hoare triple {83493#(and (<= 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; {83494#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:14:44,167 INFO L290 TraceCheckUtils]: 8: Hoare triple {83494#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {83495#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:14:44,167 INFO L290 TraceCheckUtils]: 9: Hoare triple {83495#(and (<= main_~y~0 3) (<= 3 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; {83496#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:14:44,168 INFO L290 TraceCheckUtils]: 10: Hoare triple {83496#(and (<= main_~y~0 4) (<= 4 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; {83497#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:14:44,168 INFO L290 TraceCheckUtils]: 11: Hoare triple {83497#(and (<= 5 main_~y~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; {83498#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:14:44,169 INFO L290 TraceCheckUtils]: 12: Hoare triple {83498#(and (<= main_~y~0 6) (<= 6 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; {83499#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:14:44,169 INFO L290 TraceCheckUtils]: 13: Hoare triple {83499#(and (<= 7 main_~y~0) (<= main_~y~0 7))} 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; {83500#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:14:44,170 INFO L290 TraceCheckUtils]: 14: Hoare triple {83500#(and (<= main_~y~0 8) (<= 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; {83501#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:14:44,170 INFO L290 TraceCheckUtils]: 15: Hoare triple {83501#(and (<= 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; {83502#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:14:44,170 INFO L290 TraceCheckUtils]: 16: Hoare triple {83502#(and (<= main_~y~0 10) (<= 10 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {83502#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:14:44,171 INFO L290 TraceCheckUtils]: 17: Hoare triple {83502#(and (<= main_~y~0 10) (<= 10 main_~y~0))} ~z~0 := ~y~0; {83568#(and (= main_~z~0 main_~y~0) (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:14:44,171 INFO L290 TraceCheckUtils]: 18: Hoare triple {83568#(and (= main_~z~0 main_~y~0) (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {83572#(and (<= main_~y~0 10) (<= 10 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-28 10:14:44,172 INFO L290 TraceCheckUtils]: 19: Hoare triple {83572#(and (<= main_~y~0 10) (<= 10 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {83576#(and (= main_~y~0 (+ main_~z~0 2)) (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:14:44,172 INFO L290 TraceCheckUtils]: 20: Hoare triple {83576#(and (= main_~y~0 (+ main_~z~0 2)) (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {83580#(and (<= main_~y~0 10) (<= 10 main_~y~0) (= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-28 10:14:44,173 INFO L290 TraceCheckUtils]: 21: Hoare triple {83580#(and (<= main_~y~0 10) (<= 10 main_~y~0) (= main_~y~0 (+ main_~z~0 3)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {83584#(and (<= main_~y~0 10) (<= 10 main_~y~0) (= main_~y~0 (+ main_~z~0 4)))} is VALID [2022-04-28 10:14:44,173 INFO L290 TraceCheckUtils]: 22: Hoare triple {83584#(and (<= main_~y~0 10) (<= 10 main_~y~0) (= main_~y~0 (+ main_~z~0 4)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {83588#(and (= (+ 5 main_~z~0) main_~y~0) (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:14:44,174 INFO L290 TraceCheckUtils]: 23: Hoare triple {83588#(and (= (+ 5 main_~z~0) main_~y~0) (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {83592#(and (= (+ main_~y~0 (- 5)) (+ main_~z~0 1)) (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:14:44,175 INFO L290 TraceCheckUtils]: 24: Hoare triple {83592#(and (= (+ main_~y~0 (- 5)) (+ main_~z~0 1)) (<= main_~y~0 10) (<= 10 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {83596#(and (<= main_~y~0 10) (<= 10 main_~y~0) (= (+ main_~z~0 2) (+ main_~y~0 (- 5))))} is VALID [2022-04-28 10:14:44,175 INFO L290 TraceCheckUtils]: 25: Hoare triple {83596#(and (<= main_~y~0 10) (<= 10 main_~y~0) (= (+ main_~z~0 2) (+ main_~y~0 (- 5))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {83600#(and (<= main_~y~0 10) (<= 10 main_~y~0) (= (+ main_~z~0 1) (+ main_~y~0 (- 7))))} is VALID [2022-04-28 10:14:44,176 INFO L290 TraceCheckUtils]: 26: Hoare triple {83600#(and (<= main_~y~0 10) (<= 10 main_~y~0) (= (+ main_~z~0 1) (+ main_~y~0 (- 7))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {83604#(and (<= main_~y~0 10) (<= 10 main_~y~0) (= (+ main_~z~0 1) (+ main_~y~0 (- 8))))} is VALID [2022-04-28 10:14:44,176 INFO L290 TraceCheckUtils]: 27: Hoare triple {83604#(and (<= main_~y~0 10) (<= 10 main_~y~0) (= (+ main_~z~0 1) (+ main_~y~0 (- 8))))} assume !(~z~0 % 4294967296 > 0); {83488#false} is VALID [2022-04-28 10:14:44,176 INFO L290 TraceCheckUtils]: 28: Hoare triple {83488#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {83488#false} is VALID [2022-04-28 10:14:44,176 INFO L290 TraceCheckUtils]: 29: Hoare triple {83488#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {83488#false} is VALID [2022-04-28 10:14:44,176 INFO L290 TraceCheckUtils]: 30: Hoare triple {83488#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {83488#false} is VALID [2022-04-28 10:14:44,176 INFO L290 TraceCheckUtils]: 31: Hoare triple {83488#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {83488#false} is VALID [2022-04-28 10:14:44,176 INFO L290 TraceCheckUtils]: 32: Hoare triple {83488#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {83488#false} is VALID [2022-04-28 10:14:44,176 INFO L290 TraceCheckUtils]: 33: Hoare triple {83488#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {83488#false} is VALID [2022-04-28 10:14:44,176 INFO L290 TraceCheckUtils]: 34: Hoare triple {83488#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {83488#false} is VALID [2022-04-28 10:14:44,177 INFO L290 TraceCheckUtils]: 35: Hoare triple {83488#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {83488#false} is VALID [2022-04-28 10:14:44,177 INFO L290 TraceCheckUtils]: 36: Hoare triple {83488#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {83488#false} is VALID [2022-04-28 10:14:44,177 INFO L290 TraceCheckUtils]: 37: Hoare triple {83488#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {83488#false} is VALID [2022-04-28 10:14:44,177 INFO L290 TraceCheckUtils]: 38: Hoare triple {83488#false} assume !(~y~0 % 4294967296 > 0); {83488#false} is VALID [2022-04-28 10:14:44,177 INFO L272 TraceCheckUtils]: 39: Hoare triple {83488#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {83488#false} is VALID [2022-04-28 10:14:44,177 INFO L290 TraceCheckUtils]: 40: Hoare triple {83488#false} ~cond := #in~cond; {83488#false} is VALID [2022-04-28 10:14:44,177 INFO L290 TraceCheckUtils]: 41: Hoare triple {83488#false} assume 0 == ~cond; {83488#false} is VALID [2022-04-28 10:14:44,177 INFO L290 TraceCheckUtils]: 42: Hoare triple {83488#false} assume !false; {83488#false} is VALID [2022-04-28 10:14:44,177 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-04-28 10:14:44,177 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:14:44,973 INFO L290 TraceCheckUtils]: 42: Hoare triple {83488#false} assume !false; {83488#false} is VALID [2022-04-28 10:14:44,973 INFO L290 TraceCheckUtils]: 41: Hoare triple {83488#false} assume 0 == ~cond; {83488#false} is VALID [2022-04-28 10:14:44,973 INFO L290 TraceCheckUtils]: 40: Hoare triple {83488#false} ~cond := #in~cond; {83488#false} is VALID [2022-04-28 10:14:44,973 INFO L272 TraceCheckUtils]: 39: Hoare triple {83488#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {83488#false} is VALID [2022-04-28 10:14:44,973 INFO L290 TraceCheckUtils]: 38: Hoare triple {83488#false} assume !(~y~0 % 4294967296 > 0); {83488#false} is VALID [2022-04-28 10:14:44,974 INFO L290 TraceCheckUtils]: 37: Hoare triple {83668#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {83488#false} is VALID [2022-04-28 10:14:44,975 INFO L290 TraceCheckUtils]: 36: Hoare triple {83672#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {83668#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:14:44,975 INFO L290 TraceCheckUtils]: 35: Hoare triple {83676#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {83672#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:14:44,976 INFO L290 TraceCheckUtils]: 34: Hoare triple {83680#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {83676#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-28 10:14:44,977 INFO L290 TraceCheckUtils]: 33: Hoare triple {83684#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {83680#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-28 10:14:44,977 INFO L290 TraceCheckUtils]: 32: Hoare triple {83688#(not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {83684#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:14:44,978 INFO L290 TraceCheckUtils]: 31: Hoare triple {83692#(not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {83688#(not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:14:44,979 INFO L290 TraceCheckUtils]: 30: Hoare triple {83696#(not (< 0 (mod (+ main_~y~0 4294967289) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {83692#(not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:14:44,980 INFO L290 TraceCheckUtils]: 29: Hoare triple {83700#(not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {83696#(not (< 0 (mod (+ main_~y~0 4294967289) 4294967296)))} is VALID [2022-04-28 10:14:44,981 INFO L290 TraceCheckUtils]: 28: Hoare triple {83704#(not (< 0 (mod (+ main_~y~0 4294967287) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {83700#(not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:14:44,981 INFO L290 TraceCheckUtils]: 27: Hoare triple {83708#(or (not (< 0 (mod (+ main_~y~0 4294967287) 4294967296))) (< 0 (mod main_~z~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {83704#(not (< 0 (mod (+ main_~y~0 4294967287) 4294967296)))} is VALID [2022-04-28 10:14:44,982 INFO L290 TraceCheckUtils]: 26: Hoare triple {83712#(or (not (< 0 (mod (+ main_~y~0 4294967287) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {83708#(or (not (< 0 (mod (+ main_~y~0 4294967287) 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-28 10:14:44,983 INFO L290 TraceCheckUtils]: 25: Hoare triple {83716#(or (not (< 0 (mod (+ main_~y~0 4294967287) 4294967296))) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {83712#(or (not (< 0 (mod (+ main_~y~0 4294967287) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:14:44,984 INFO L290 TraceCheckUtils]: 24: Hoare triple {83720#(or (not (< 0 (mod (+ main_~y~0 4294967287) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {83716#(or (not (< 0 (mod (+ main_~y~0 4294967287) 4294967296))) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)))} is VALID [2022-04-28 10:14:44,985 INFO L290 TraceCheckUtils]: 23: Hoare triple {83724#(or (not (< 0 (mod (+ main_~y~0 4294967287) 4294967296))) (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {83720#(or (not (< 0 (mod (+ main_~y~0 4294967287) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} is VALID [2022-04-28 10:14:44,986 INFO L290 TraceCheckUtils]: 22: Hoare triple {83728#(or (not (< 0 (mod (+ main_~y~0 4294967287) 4294967296))) (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {83724#(or (not (< 0 (mod (+ main_~y~0 4294967287) 4294967296))) (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)))} is VALID [2022-04-28 10:14:44,986 INFO L290 TraceCheckUtils]: 21: Hoare triple {83732#(or (not (< 0 (mod (+ main_~y~0 4294967287) 4294967296))) (< 0 (mod (+ 4294967290 main_~z~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {83728#(or (not (< 0 (mod (+ main_~y~0 4294967287) 4294967296))) (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)))} is VALID [2022-04-28 10:14:44,987 INFO L290 TraceCheckUtils]: 20: Hoare triple {83736#(or (not (< 0 (mod (+ main_~y~0 4294967287) 4294967296))) (< 0 (mod (+ main_~z~0 4294967289) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {83732#(or (not (< 0 (mod (+ main_~y~0 4294967287) 4294967296))) (< 0 (mod (+ 4294967290 main_~z~0) 4294967296)))} is VALID [2022-04-28 10:14:44,988 INFO L290 TraceCheckUtils]: 19: Hoare triple {83740#(or (not (< 0 (mod (+ main_~y~0 4294967287) 4294967296))) (< 0 (mod (+ 4294967288 main_~z~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {83736#(or (not (< 0 (mod (+ main_~y~0 4294967287) 4294967296))) (< 0 (mod (+ main_~z~0 4294967289) 4294967296)))} is VALID [2022-04-28 10:14:44,989 INFO L290 TraceCheckUtils]: 18: Hoare triple {83744#(or (not (< 0 (mod (+ main_~y~0 4294967287) 4294967296))) (< 0 (mod (+ main_~z~0 4294967287) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {83740#(or (not (< 0 (mod (+ main_~y~0 4294967287) 4294967296))) (< 0 (mod (+ 4294967288 main_~z~0) 4294967296)))} is VALID [2022-04-28 10:14:44,989 INFO L290 TraceCheckUtils]: 17: Hoare triple {83487#true} ~z~0 := ~y~0; {83744#(or (not (< 0 (mod (+ main_~y~0 4294967287) 4294967296))) (< 0 (mod (+ main_~z~0 4294967287) 4294967296)))} is VALID [2022-04-28 10:14:44,989 INFO L290 TraceCheckUtils]: 16: Hoare triple {83487#true} assume !(~x~0 % 4294967296 > 0); {83487#true} is VALID [2022-04-28 10:14:44,989 INFO L290 TraceCheckUtils]: 15: Hoare triple {83487#true} 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; {83487#true} is VALID [2022-04-28 10:14:44,989 INFO L290 TraceCheckUtils]: 14: Hoare triple {83487#true} 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; {83487#true} is VALID [2022-04-28 10:14:44,989 INFO L290 TraceCheckUtils]: 13: Hoare triple {83487#true} 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; {83487#true} is VALID [2022-04-28 10:14:44,990 INFO L290 TraceCheckUtils]: 12: Hoare triple {83487#true} 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; {83487#true} is VALID [2022-04-28 10:14:44,990 INFO L290 TraceCheckUtils]: 11: Hoare triple {83487#true} 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; {83487#true} is VALID [2022-04-28 10:14:44,990 INFO L290 TraceCheckUtils]: 10: Hoare triple {83487#true} 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; {83487#true} is VALID [2022-04-28 10:14:44,990 INFO L290 TraceCheckUtils]: 9: Hoare triple {83487#true} 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; {83487#true} is VALID [2022-04-28 10:14:44,990 INFO L290 TraceCheckUtils]: 8: Hoare triple {83487#true} 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; {83487#true} is VALID [2022-04-28 10:14:44,990 INFO L290 TraceCheckUtils]: 7: Hoare triple {83487#true} 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; {83487#true} is VALID [2022-04-28 10:14:44,990 INFO L290 TraceCheckUtils]: 6: Hoare triple {83487#true} 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; {83487#true} is VALID [2022-04-28 10:14:44,990 INFO L290 TraceCheckUtils]: 5: Hoare triple {83487#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {83487#true} is VALID [2022-04-28 10:14:44,990 INFO L272 TraceCheckUtils]: 4: Hoare triple {83487#true} call #t~ret11 := main(); {83487#true} is VALID [2022-04-28 10:14:44,990 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {83487#true} {83487#true} #61#return; {83487#true} is VALID [2022-04-28 10:14:44,990 INFO L290 TraceCheckUtils]: 2: Hoare triple {83487#true} assume true; {83487#true} is VALID [2022-04-28 10:14:44,990 INFO L290 TraceCheckUtils]: 1: Hoare triple {83487#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(10, 2);call #Ultimate.allocInit(12, 3); {83487#true} is VALID [2022-04-28 10:14:44,990 INFO L272 TraceCheckUtils]: 0: Hoare triple {83487#true} call ULTIMATE.init(); {83487#true} is VALID [2022-04-28 10:14:44,990 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 10 proven. 90 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2022-04-28 10:14:44,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1455427096] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:14:44,990 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:14:44,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 22] total 54 [2022-04-28 10:14:44,991 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:14:44,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1229054431] [2022-04-28 10:14:44,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1229054431] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:14:44,991 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:14:44,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-04-28 10:14:44,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315122724] [2022-04-28 10:14:44,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:14:44,991 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.25) internal successors, (30), 23 states have internal predecessors, (30), 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 43 [2022-04-28 10:14:44,991 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:14:44,991 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 24 states, 24 states have (on average 1.25) internal successors, (30), 23 states have internal predecessors, (30), 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-28 10:14:45,012 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:14:45,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-28 10:14:45,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:14:45,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-28 10:14:45,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=347, Invalid=2515, Unknown=0, NotChecked=0, Total=2862 [2022-04-28 10:14:45,013 INFO L87 Difference]: Start difference. First operand 150 states and 190 transitions. Second operand has 24 states, 24 states have (on average 1.25) internal successors, (30), 23 states have internal predecessors, (30), 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-28 10:14:46,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:46,574 INFO L93 Difference]: Finished difference Result 179 states and 219 transitions. [2022-04-28 10:14:46,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-28 10:14:46,575 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.25) internal successors, (30), 23 states have internal predecessors, (30), 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 43 [2022-04-28 10:14:46,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:14:46,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.25) internal successors, (30), 23 states have internal predecessors, (30), 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-28 10:14:46,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 61 transitions. [2022-04-28 10:14:46,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.25) internal successors, (30), 23 states have internal predecessors, (30), 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-28 10:14:46,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 61 transitions. [2022-04-28 10:14:46,580 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 61 transitions. [2022-04-28 10:14:46,626 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:14:46,628 INFO L225 Difference]: With dead ends: 179 [2022-04-28 10:14:46,628 INFO L226 Difference]: Without dead ends: 163 [2022-04-28 10:14:46,628 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 937 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=581, Invalid=4969, Unknown=0, NotChecked=0, Total=5550 [2022-04-28 10:14:46,628 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 17 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 592 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 636 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 10:14:46,629 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 78 Invalid, 636 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 592 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 10:14:46,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2022-04-28 10:14:46,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 151. [2022-04-28 10:14:46,792 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:14:46,792 INFO L82 GeneralOperation]: Start isEquivalent. First operand 163 states. Second operand has 151 states, 146 states have (on average 1.2808219178082192) internal successors, (187), 146 states have internal predecessors, (187), 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-28 10:14:46,793 INFO L74 IsIncluded]: Start isIncluded. First operand 163 states. Second operand has 151 states, 146 states have (on average 1.2808219178082192) internal successors, (187), 146 states have internal predecessors, (187), 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-28 10:14:46,793 INFO L87 Difference]: Start difference. First operand 163 states. Second operand has 151 states, 146 states have (on average 1.2808219178082192) internal successors, (187), 146 states have internal predecessors, (187), 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-28 10:14:46,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:46,794 INFO L93 Difference]: Finished difference Result 163 states and 203 transitions. [2022-04-28 10:14:46,794 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 203 transitions. [2022-04-28 10:14:46,794 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:14:46,794 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:14:46,794 INFO L74 IsIncluded]: Start isIncluded. First operand has 151 states, 146 states have (on average 1.2808219178082192) internal successors, (187), 146 states have internal predecessors, (187), 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 163 states. [2022-04-28 10:14:46,795 INFO L87 Difference]: Start difference. First operand has 151 states, 146 states have (on average 1.2808219178082192) internal successors, (187), 146 states have internal predecessors, (187), 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 163 states. [2022-04-28 10:14:46,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:46,796 INFO L93 Difference]: Finished difference Result 163 states and 203 transitions. [2022-04-28 10:14:46,796 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 203 transitions. [2022-04-28 10:14:46,796 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:14:46,796 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:14:46,796 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:14:46,796 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:14:46,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 146 states have (on average 1.2808219178082192) internal successors, (187), 146 states have internal predecessors, (187), 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-28 10:14:46,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 191 transitions. [2022-04-28 10:14:46,797 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 191 transitions. Word has length 43 [2022-04-28 10:14:46,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:14:46,798 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 191 transitions. [2022-04-28 10:14:46,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.25) internal successors, (30), 23 states have internal predecessors, (30), 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-28 10:14:46,798 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 151 states and 191 transitions. [2022-04-28 10:14:53,971 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 191 edges. 189 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-28 10:14:53,972 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 191 transitions. [2022-04-28 10:14:53,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-28 10:14:53,972 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:14:53,972 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:14:53,988 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (96)] Forceful destruction successful, exit code 0 [2022-04-28 10:14:54,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 96 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable95 [2022-04-28 10:14:54,172 INFO L420 AbstractCegarLoop]: === Iteration 97 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:14:54,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:14:54,173 INFO L85 PathProgramCache]: Analyzing trace with hash 396811007, now seen corresponding path program 135 times [2022-04-28 10:14:54,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:14:54,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1675609974] [2022-04-28 10:14:54,175 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:14:54,175 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:14:54,175 INFO L85 PathProgramCache]: Analyzing trace with hash 396811007, now seen corresponding path program 136 times [2022-04-28 10:14:54,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:14:54,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227014615] [2022-04-28 10:14:54,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:14:54,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:14:54,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:14:54,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:14:54,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:14:54,485 INFO L290 TraceCheckUtils]: 0: Hoare triple {84854#(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(10, 2);call #Ultimate.allocInit(12, 3); {84829#true} is VALID [2022-04-28 10:14:54,485 INFO L290 TraceCheckUtils]: 1: Hoare triple {84829#true} assume true; {84829#true} is VALID [2022-04-28 10:14:54,485 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {84829#true} {84829#true} #61#return; {84829#true} is VALID [2022-04-28 10:14:54,485 INFO L272 TraceCheckUtils]: 0: Hoare triple {84829#true} call ULTIMATE.init(); {84854#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:14:54,485 INFO L290 TraceCheckUtils]: 1: Hoare triple {84854#(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(10, 2);call #Ultimate.allocInit(12, 3); {84829#true} is VALID [2022-04-28 10:14:54,485 INFO L290 TraceCheckUtils]: 2: Hoare triple {84829#true} assume true; {84829#true} is VALID [2022-04-28 10:14:54,486 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {84829#true} {84829#true} #61#return; {84829#true} is VALID [2022-04-28 10:14:54,486 INFO L272 TraceCheckUtils]: 4: Hoare triple {84829#true} call #t~ret11 := main(); {84829#true} is VALID [2022-04-28 10:14:54,486 INFO L290 TraceCheckUtils]: 5: Hoare triple {84829#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {84834#(= main_~y~0 0)} is VALID [2022-04-28 10:14:54,486 INFO L290 TraceCheckUtils]: 6: Hoare triple {84834#(= 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; {84835#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:14:54,487 INFO L290 TraceCheckUtils]: 7: Hoare triple {84835#(and (<= 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; {84836#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:14:54,487 INFO L290 TraceCheckUtils]: 8: Hoare triple {84836#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {84837#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:14:54,488 INFO L290 TraceCheckUtils]: 9: Hoare triple {84837#(and (<= main_~y~0 3) (<= 3 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; {84838#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:14:54,488 INFO L290 TraceCheckUtils]: 10: Hoare triple {84838#(and (<= main_~y~0 4) (<= 4 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; {84839#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:14:54,489 INFO L290 TraceCheckUtils]: 11: Hoare triple {84839#(and (<= 5 main_~y~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; {84840#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:14:54,489 INFO L290 TraceCheckUtils]: 12: Hoare triple {84840#(and (<= main_~y~0 6) (<= 6 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; {84841#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:14:54,490 INFO L290 TraceCheckUtils]: 13: Hoare triple {84841#(and (<= 7 main_~y~0) (<= main_~y~0 7))} 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; {84842#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:14:54,490 INFO L290 TraceCheckUtils]: 14: Hoare triple {84842#(and (<= main_~y~0 8) (<= 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; {84843#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:14:54,491 INFO L290 TraceCheckUtils]: 15: Hoare triple {84843#(and (<= 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; {84844#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:14:54,491 INFO L290 TraceCheckUtils]: 16: Hoare triple {84844#(and (<= main_~y~0 10) (<= 10 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; {84845#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:14:54,492 INFO L290 TraceCheckUtils]: 17: Hoare triple {84845#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {84845#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:14:54,492 INFO L290 TraceCheckUtils]: 18: Hoare triple {84845#(and (<= main_~y~0 11) (<= 11 main_~y~0))} ~z~0 := ~y~0; {84846#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-28 10:14:54,492 INFO L290 TraceCheckUtils]: 19: Hoare triple {84846#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {84847#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:14:54,493 INFO L290 TraceCheckUtils]: 20: Hoare triple {84847#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {84848#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:14:54,493 INFO L290 TraceCheckUtils]: 21: Hoare triple {84848#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {84849#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:14:54,494 INFO L290 TraceCheckUtils]: 22: Hoare triple {84849#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {84850#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:14:54,494 INFO L290 TraceCheckUtils]: 23: Hoare triple {84850#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {84851#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:14:54,495 INFO L290 TraceCheckUtils]: 24: Hoare triple {84851#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {84852#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:14:54,495 INFO L290 TraceCheckUtils]: 25: Hoare triple {84852#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {84853#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:14:54,496 INFO L290 TraceCheckUtils]: 26: Hoare triple {84853#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {84830#false} is VALID [2022-04-28 10:14:54,496 INFO L290 TraceCheckUtils]: 27: Hoare triple {84830#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {84830#false} is VALID [2022-04-28 10:14:54,496 INFO L290 TraceCheckUtils]: 28: Hoare triple {84830#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {84830#false} is VALID [2022-04-28 10:14:54,496 INFO L290 TraceCheckUtils]: 29: Hoare triple {84830#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {84830#false} is VALID [2022-04-28 10:14:54,496 INFO L290 TraceCheckUtils]: 30: Hoare triple {84830#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {84830#false} is VALID [2022-04-28 10:14:54,496 INFO L290 TraceCheckUtils]: 31: Hoare triple {84830#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {84830#false} is VALID [2022-04-28 10:14:54,496 INFO L290 TraceCheckUtils]: 32: Hoare triple {84830#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {84830#false} is VALID [2022-04-28 10:14:54,496 INFO L290 TraceCheckUtils]: 33: Hoare triple {84830#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {84830#false} is VALID [2022-04-28 10:14:54,496 INFO L290 TraceCheckUtils]: 34: Hoare triple {84830#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {84830#false} is VALID [2022-04-28 10:14:54,496 INFO L290 TraceCheckUtils]: 35: Hoare triple {84830#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {84830#false} is VALID [2022-04-28 10:14:54,496 INFO L290 TraceCheckUtils]: 36: Hoare triple {84830#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {84830#false} is VALID [2022-04-28 10:14:54,496 INFO L290 TraceCheckUtils]: 37: Hoare triple {84830#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {84830#false} is VALID [2022-04-28 10:14:54,496 INFO L290 TraceCheckUtils]: 38: Hoare triple {84830#false} assume !(~y~0 % 4294967296 > 0); {84830#false} is VALID [2022-04-28 10:14:54,496 INFO L272 TraceCheckUtils]: 39: Hoare triple {84830#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {84830#false} is VALID [2022-04-28 10:14:54,496 INFO L290 TraceCheckUtils]: 40: Hoare triple {84830#false} ~cond := #in~cond; {84830#false} is VALID [2022-04-28 10:14:54,496 INFO L290 TraceCheckUtils]: 41: Hoare triple {84830#false} assume 0 == ~cond; {84830#false} is VALID [2022-04-28 10:14:54,497 INFO L290 TraceCheckUtils]: 42: Hoare triple {84830#false} assume !false; {84830#false} is VALID [2022-04-28 10:14:54,497 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 0 proven. 94 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-04-28 10:14:54,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:14:54,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227014615] [2022-04-28 10:14:54,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227014615] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:14:54,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2045220915] [2022-04-28 10:14:54,497 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:14:54,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:14:54,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:14:54,498 INFO L229 MonitoredProcess]: Starting monitored process 97 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:14:54,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (97)] Waiting until timeout for monitored process [2022-04-28 10:14:54,558 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:14:54,558 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:14:54,559 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 41 conjunts are in the unsatisfiable core [2022-04-28 10:14:54,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:14:54,568 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:14:54,845 INFO L272 TraceCheckUtils]: 0: Hoare triple {84829#true} call ULTIMATE.init(); {84829#true} is VALID [2022-04-28 10:14:54,845 INFO L290 TraceCheckUtils]: 1: Hoare triple {84829#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(10, 2);call #Ultimate.allocInit(12, 3); {84829#true} is VALID [2022-04-28 10:14:54,845 INFO L290 TraceCheckUtils]: 2: Hoare triple {84829#true} assume true; {84829#true} is VALID [2022-04-28 10:14:54,845 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {84829#true} {84829#true} #61#return; {84829#true} is VALID [2022-04-28 10:14:54,845 INFO L272 TraceCheckUtils]: 4: Hoare triple {84829#true} call #t~ret11 := main(); {84829#true} is VALID [2022-04-28 10:14:54,846 INFO L290 TraceCheckUtils]: 5: Hoare triple {84829#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {84834#(= main_~y~0 0)} is VALID [2022-04-28 10:14:54,846 INFO L290 TraceCheckUtils]: 6: Hoare triple {84834#(= 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; {84835#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:14:54,847 INFO L290 TraceCheckUtils]: 7: Hoare triple {84835#(and (<= 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; {84836#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:14:54,847 INFO L290 TraceCheckUtils]: 8: Hoare triple {84836#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {84837#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:14:54,848 INFO L290 TraceCheckUtils]: 9: Hoare triple {84837#(and (<= main_~y~0 3) (<= 3 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; {84838#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:14:54,848 INFO L290 TraceCheckUtils]: 10: Hoare triple {84838#(and (<= main_~y~0 4) (<= 4 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; {84839#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:14:54,849 INFO L290 TraceCheckUtils]: 11: Hoare triple {84839#(and (<= 5 main_~y~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; {84840#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:14:54,849 INFO L290 TraceCheckUtils]: 12: Hoare triple {84840#(and (<= main_~y~0 6) (<= 6 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; {84841#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:14:54,850 INFO L290 TraceCheckUtils]: 13: Hoare triple {84841#(and (<= 7 main_~y~0) (<= main_~y~0 7))} 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; {84842#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:14:54,850 INFO L290 TraceCheckUtils]: 14: Hoare triple {84842#(and (<= main_~y~0 8) (<= 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; {84843#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:14:54,851 INFO L290 TraceCheckUtils]: 15: Hoare triple {84843#(and (<= 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; {84844#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:14:54,851 INFO L290 TraceCheckUtils]: 16: Hoare triple {84844#(and (<= main_~y~0 10) (<= 10 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; {84845#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:14:54,851 INFO L290 TraceCheckUtils]: 17: Hoare triple {84845#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {84845#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:14:54,852 INFO L290 TraceCheckUtils]: 18: Hoare triple {84845#(and (<= main_~y~0 11) (<= 11 main_~y~0))} ~z~0 := ~y~0; {84846#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-28 10:14:54,852 INFO L290 TraceCheckUtils]: 19: Hoare triple {84846#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {84847#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:14:54,853 INFO L290 TraceCheckUtils]: 20: Hoare triple {84847#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {84848#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:14:54,853 INFO L290 TraceCheckUtils]: 21: Hoare triple {84848#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {84849#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:14:54,854 INFO L290 TraceCheckUtils]: 22: Hoare triple {84849#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {84850#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:14:54,854 INFO L290 TraceCheckUtils]: 23: Hoare triple {84850#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {84851#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:14:54,855 INFO L290 TraceCheckUtils]: 24: Hoare triple {84851#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {84852#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:14:54,855 INFO L290 TraceCheckUtils]: 25: Hoare triple {84852#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {84933#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:14:54,855 INFO L290 TraceCheckUtils]: 26: Hoare triple {84933#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !(~z~0 % 4294967296 > 0); {84830#false} is VALID [2022-04-28 10:14:54,856 INFO L290 TraceCheckUtils]: 27: Hoare triple {84830#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {84830#false} is VALID [2022-04-28 10:14:54,856 INFO L290 TraceCheckUtils]: 28: Hoare triple {84830#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {84830#false} is VALID [2022-04-28 10:14:54,856 INFO L290 TraceCheckUtils]: 29: Hoare triple {84830#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {84830#false} is VALID [2022-04-28 10:14:54,856 INFO L290 TraceCheckUtils]: 30: Hoare triple {84830#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {84830#false} is VALID [2022-04-28 10:14:54,856 INFO L290 TraceCheckUtils]: 31: Hoare triple {84830#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {84830#false} is VALID [2022-04-28 10:14:54,856 INFO L290 TraceCheckUtils]: 32: Hoare triple {84830#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {84830#false} is VALID [2022-04-28 10:14:54,856 INFO L290 TraceCheckUtils]: 33: Hoare triple {84830#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {84830#false} is VALID [2022-04-28 10:14:54,856 INFO L290 TraceCheckUtils]: 34: Hoare triple {84830#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {84830#false} is VALID [2022-04-28 10:14:54,856 INFO L290 TraceCheckUtils]: 35: Hoare triple {84830#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {84830#false} is VALID [2022-04-28 10:14:54,856 INFO L290 TraceCheckUtils]: 36: Hoare triple {84830#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {84830#false} is VALID [2022-04-28 10:14:54,856 INFO L290 TraceCheckUtils]: 37: Hoare triple {84830#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {84830#false} is VALID [2022-04-28 10:14:54,856 INFO L290 TraceCheckUtils]: 38: Hoare triple {84830#false} assume !(~y~0 % 4294967296 > 0); {84830#false} is VALID [2022-04-28 10:14:54,856 INFO L272 TraceCheckUtils]: 39: Hoare triple {84830#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {84830#false} is VALID [2022-04-28 10:14:54,856 INFO L290 TraceCheckUtils]: 40: Hoare triple {84830#false} ~cond := #in~cond; {84830#false} is VALID [2022-04-28 10:14:54,856 INFO L290 TraceCheckUtils]: 41: Hoare triple {84830#false} assume 0 == ~cond; {84830#false} is VALID [2022-04-28 10:14:54,856 INFO L290 TraceCheckUtils]: 42: Hoare triple {84830#false} assume !false; {84830#false} is VALID [2022-04-28 10:14:54,856 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 0 proven. 94 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-04-28 10:14:54,856 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:14:55,482 INFO L290 TraceCheckUtils]: 42: Hoare triple {84830#false} assume !false; {84830#false} is VALID [2022-04-28 10:14:55,482 INFO L290 TraceCheckUtils]: 41: Hoare triple {84830#false} assume 0 == ~cond; {84830#false} is VALID [2022-04-28 10:14:55,482 INFO L290 TraceCheckUtils]: 40: Hoare triple {84830#false} ~cond := #in~cond; {84830#false} is VALID [2022-04-28 10:14:55,482 INFO L272 TraceCheckUtils]: 39: Hoare triple {84830#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {84830#false} is VALID [2022-04-28 10:14:55,482 INFO L290 TraceCheckUtils]: 38: Hoare triple {84830#false} assume !(~y~0 % 4294967296 > 0); {84830#false} is VALID [2022-04-28 10:14:55,483 INFO L290 TraceCheckUtils]: 37: Hoare triple {84830#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {84830#false} is VALID [2022-04-28 10:14:55,483 INFO L290 TraceCheckUtils]: 36: Hoare triple {84830#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {84830#false} is VALID [2022-04-28 10:14:55,483 INFO L290 TraceCheckUtils]: 35: Hoare triple {84830#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {84830#false} is VALID [2022-04-28 10:14:55,483 INFO L290 TraceCheckUtils]: 34: Hoare triple {84830#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {84830#false} is VALID [2022-04-28 10:14:55,483 INFO L290 TraceCheckUtils]: 33: Hoare triple {84830#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {84830#false} is VALID [2022-04-28 10:14:55,483 INFO L290 TraceCheckUtils]: 32: Hoare triple {84830#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {84830#false} is VALID [2022-04-28 10:14:55,483 INFO L290 TraceCheckUtils]: 31: Hoare triple {84830#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {84830#false} is VALID [2022-04-28 10:14:55,483 INFO L290 TraceCheckUtils]: 30: Hoare triple {84830#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {84830#false} is VALID [2022-04-28 10:14:55,483 INFO L290 TraceCheckUtils]: 29: Hoare triple {84830#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {84830#false} is VALID [2022-04-28 10:14:55,483 INFO L290 TraceCheckUtils]: 28: Hoare triple {84830#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {84830#false} is VALID [2022-04-28 10:14:55,483 INFO L290 TraceCheckUtils]: 27: Hoare triple {84830#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {84830#false} is VALID [2022-04-28 10:14:55,483 INFO L290 TraceCheckUtils]: 26: Hoare triple {85033#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {84830#false} is VALID [2022-04-28 10:14:55,484 INFO L290 TraceCheckUtils]: 25: Hoare triple {85037#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {85033#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:14:55,485 INFO L290 TraceCheckUtils]: 24: Hoare triple {85041#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {85037#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:14:55,485 INFO L290 TraceCheckUtils]: 23: Hoare triple {85045#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {85041#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-28 10:14:55,486 INFO L290 TraceCheckUtils]: 22: Hoare triple {85049#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {85045#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-28 10:14:55,487 INFO L290 TraceCheckUtils]: 21: Hoare triple {85053#(< 0 (mod (+ 4294967291 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {85049#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID [2022-04-28 10:14:55,487 INFO L290 TraceCheckUtils]: 20: Hoare triple {85057#(< 0 (mod (+ 4294967290 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {85053#(< 0 (mod (+ 4294967291 main_~z~0) 4294967296))} is VALID [2022-04-28 10:14:55,488 INFO L290 TraceCheckUtils]: 19: Hoare triple {85061#(< 0 (mod (+ main_~z~0 4294967289) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {85057#(< 0 (mod (+ 4294967290 main_~z~0) 4294967296))} is VALID [2022-04-28 10:14:55,488 INFO L290 TraceCheckUtils]: 18: Hoare triple {85065#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} ~z~0 := ~y~0; {85061#(< 0 (mod (+ main_~z~0 4294967289) 4294967296))} is VALID [2022-04-28 10:14:55,489 INFO L290 TraceCheckUtils]: 17: Hoare triple {85065#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} assume !(~x~0 % 4294967296 > 0); {85065#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} is VALID [2022-04-28 10:14:55,489 INFO L290 TraceCheckUtils]: 16: Hoare triple {85072#(< 0 (mod (+ 4294967290 main_~y~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; {85065#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} is VALID [2022-04-28 10:14:55,490 INFO L290 TraceCheckUtils]: 15: Hoare triple {85076#(< 0 (mod (+ 4294967291 main_~y~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; {85072#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-28 10:14:55,491 INFO L290 TraceCheckUtils]: 14: Hoare triple {85080#(< 0 (mod (+ 4294967292 main_~y~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; {85076#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-28 10:14:55,491 INFO L290 TraceCheckUtils]: 13: Hoare triple {85084#(< 0 (mod (+ main_~y~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; {85080#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-28 10:14:55,492 INFO L290 TraceCheckUtils]: 12: Hoare triple {85088#(< 0 (mod (+ main_~y~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; {85084#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 10:14:55,493 INFO L290 TraceCheckUtils]: 11: Hoare triple {85092#(< 0 (mod (+ main_~y~0 4294967295) 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; {85088#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:14:55,493 INFO L290 TraceCheckUtils]: 10: Hoare triple {85096#(< 0 (mod main_~y~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; {85092#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:14:55,494 INFO L290 TraceCheckUtils]: 9: Hoare triple {85100#(< 0 (mod (+ main_~y~0 1) 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; {85096#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:14:55,495 INFO L290 TraceCheckUtils]: 8: Hoare triple {85104#(< 0 (mod (+ main_~y~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; {85100#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:14:55,495 INFO L290 TraceCheckUtils]: 7: Hoare triple {85108#(< 0 (mod (+ main_~y~0 3) 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; {85104#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:14:55,496 INFO L290 TraceCheckUtils]: 6: Hoare triple {85112#(< 0 (mod (+ main_~y~0 4) 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; {85108#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:14:55,496 INFO L290 TraceCheckUtils]: 5: Hoare triple {84829#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {85112#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:14:55,496 INFO L272 TraceCheckUtils]: 4: Hoare triple {84829#true} call #t~ret11 := main(); {84829#true} is VALID [2022-04-28 10:14:55,496 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {84829#true} {84829#true} #61#return; {84829#true} is VALID [2022-04-28 10:14:55,496 INFO L290 TraceCheckUtils]: 2: Hoare triple {84829#true} assume true; {84829#true} is VALID [2022-04-28 10:14:55,496 INFO L290 TraceCheckUtils]: 1: Hoare triple {84829#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(10, 2);call #Ultimate.allocInit(12, 3); {84829#true} is VALID [2022-04-28 10:14:55,496 INFO L272 TraceCheckUtils]: 0: Hoare triple {84829#true} call ULTIMATE.init(); {84829#true} is VALID [2022-04-28 10:14:55,497 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 0 proven. 94 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-04-28 10:14:55,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2045220915] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:14:55,497 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:14:55,497 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 44 [2022-04-28 10:14:55,497 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:14:55,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1675609974] [2022-04-28 10:14:55,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1675609974] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:14:55,497 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:14:55,497 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-28 10:14:55,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932079192] [2022-04-28 10:14:55,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:14:55,497 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 22 states have internal predecessors, (29), 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 43 [2022-04-28 10:14:55,498 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:14:55,498 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 23 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 22 states have internal predecessors, (29), 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-28 10:14:55,519 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:14:55,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-28 10:14:55,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:14:55,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-28 10:14:55,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=293, Invalid=1599, Unknown=0, NotChecked=0, Total=1892 [2022-04-28 10:14:55,520 INFO L87 Difference]: Start difference. First operand 151 states and 191 transitions. Second operand has 23 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 22 states have internal predecessors, (29), 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-28 10:14:57,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:57,403 INFO L93 Difference]: Finished difference Result 182 states and 222 transitions. [2022-04-28 10:14:57,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-04-28 10:14:57,403 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 22 states have internal predecessors, (29), 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 43 [2022-04-28 10:14:57,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:14:57,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 22 states have internal predecessors, (29), 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-28 10:14:57,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 72 transitions. [2022-04-28 10:14:57,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 22 states have internal predecessors, (29), 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-28 10:14:57,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 72 transitions. [2022-04-28 10:14:57,404 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 72 transitions. [2022-04-28 10:14:57,457 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:14:57,459 INFO L225 Difference]: With dead ends: 182 [2022-04-28 10:14:57,459 INFO L226 Difference]: Without dead ends: 165 [2022-04-28 10:14:57,459 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 535 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=879, Invalid=4091, Unknown=0, NotChecked=0, Total=4970 [2022-04-28 10:14:57,459 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 23 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 828 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 887 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 828 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-28 10:14:57,460 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 95 Invalid, 887 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 828 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-28 10:14:57,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2022-04-28 10:14:57,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 152. [2022-04-28 10:14:57,625 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:14:57,625 INFO L82 GeneralOperation]: Start isEquivalent. First operand 165 states. Second operand has 152 states, 147 states have (on average 1.2789115646258504) internal successors, (188), 147 states have internal predecessors, (188), 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-28 10:14:57,626 INFO L74 IsIncluded]: Start isIncluded. First operand 165 states. Second operand has 152 states, 147 states have (on average 1.2789115646258504) internal successors, (188), 147 states have internal predecessors, (188), 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-28 10:14:57,626 INFO L87 Difference]: Start difference. First operand 165 states. Second operand has 152 states, 147 states have (on average 1.2789115646258504) internal successors, (188), 147 states have internal predecessors, (188), 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-28 10:14:57,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:57,627 INFO L93 Difference]: Finished difference Result 165 states and 205 transitions. [2022-04-28 10:14:57,627 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 205 transitions. [2022-04-28 10:14:57,627 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:14:57,627 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:14:57,627 INFO L74 IsIncluded]: Start isIncluded. First operand has 152 states, 147 states have (on average 1.2789115646258504) internal successors, (188), 147 states have internal predecessors, (188), 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 165 states. [2022-04-28 10:14:57,628 INFO L87 Difference]: Start difference. First operand has 152 states, 147 states have (on average 1.2789115646258504) internal successors, (188), 147 states have internal predecessors, (188), 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 165 states. [2022-04-28 10:14:57,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:14:57,635 INFO L93 Difference]: Finished difference Result 165 states and 205 transitions. [2022-04-28 10:14:57,635 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 205 transitions. [2022-04-28 10:14:57,636 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:14:57,636 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:14:57,636 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:14:57,636 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:14:57,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 147 states have (on average 1.2789115646258504) internal successors, (188), 147 states have internal predecessors, (188), 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-28 10:14:57,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 192 transitions. [2022-04-28 10:14:57,637 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 192 transitions. Word has length 43 [2022-04-28 10:14:57,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:14:57,637 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 192 transitions. [2022-04-28 10:14:57,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 22 states have internal predecessors, (29), 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-28 10:14:57,637 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 152 states and 192 transitions. [2022-04-28 10:15:01,664 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 192 edges. 191 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 10:15:01,664 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 192 transitions. [2022-04-28 10:15:01,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-28 10:15:01,665 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:15:01,665 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:15:01,681 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (97)] Forceful destruction successful, exit code 0 [2022-04-28 10:15:01,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96,97 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:15:01,865 INFO L420 AbstractCegarLoop]: === Iteration 98 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:15:01,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:15:01,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1247400145, now seen corresponding path program 137 times [2022-04-28 10:15:01,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:15:01,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [893106616] [2022-04-28 10:15:01,867 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:15:01,867 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:15:01,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1247400145, now seen corresponding path program 138 times [2022-04-28 10:15:01,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:15:01,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172284935] [2022-04-28 10:15:01,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:15:01,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:15:01,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:15:02,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:15:02,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:15:02,170 INFO L290 TraceCheckUtils]: 0: Hoare triple {86209#(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(10, 2);call #Ultimate.allocInit(12, 3); {86185#true} is VALID [2022-04-28 10:15:02,170 INFO L290 TraceCheckUtils]: 1: Hoare triple {86185#true} assume true; {86185#true} is VALID [2022-04-28 10:15:02,170 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {86185#true} {86185#true} #61#return; {86185#true} is VALID [2022-04-28 10:15:02,170 INFO L272 TraceCheckUtils]: 0: Hoare triple {86185#true} call ULTIMATE.init(); {86209#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:15:02,170 INFO L290 TraceCheckUtils]: 1: Hoare triple {86209#(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(10, 2);call #Ultimate.allocInit(12, 3); {86185#true} is VALID [2022-04-28 10:15:02,170 INFO L290 TraceCheckUtils]: 2: Hoare triple {86185#true} assume true; {86185#true} is VALID [2022-04-28 10:15:02,170 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {86185#true} {86185#true} #61#return; {86185#true} is VALID [2022-04-28 10:15:02,170 INFO L272 TraceCheckUtils]: 4: Hoare triple {86185#true} call #t~ret11 := main(); {86185#true} is VALID [2022-04-28 10:15:02,170 INFO L290 TraceCheckUtils]: 5: Hoare triple {86185#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {86190#(= main_~y~0 0)} is VALID [2022-04-28 10:15:02,171 INFO L290 TraceCheckUtils]: 6: Hoare triple {86190#(= 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; {86191#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:15:02,171 INFO L290 TraceCheckUtils]: 7: Hoare triple {86191#(and (<= 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; {86192#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:15:02,172 INFO L290 TraceCheckUtils]: 8: Hoare triple {86192#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {86193#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:15:02,172 INFO L290 TraceCheckUtils]: 9: Hoare triple {86193#(and (<= main_~y~0 3) (<= 3 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; {86194#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:15:02,173 INFO L290 TraceCheckUtils]: 10: Hoare triple {86194#(and (<= main_~y~0 4) (<= 4 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; {86195#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:15:02,173 INFO L290 TraceCheckUtils]: 11: Hoare triple {86195#(and (<= 5 main_~y~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; {86196#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:15:02,174 INFO L290 TraceCheckUtils]: 12: Hoare triple {86196#(and (<= main_~y~0 6) (<= 6 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; {86197#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:15:02,174 INFO L290 TraceCheckUtils]: 13: Hoare triple {86197#(and (<= 7 main_~y~0) (<= main_~y~0 7))} 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; {86198#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:15:02,175 INFO L290 TraceCheckUtils]: 14: Hoare triple {86198#(and (<= main_~y~0 8) (<= 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; {86199#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:15:02,175 INFO L290 TraceCheckUtils]: 15: Hoare triple {86199#(and (<= 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; {86200#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:15:02,176 INFO L290 TraceCheckUtils]: 16: Hoare triple {86200#(and (<= main_~y~0 10) (<= 10 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; {86201#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:15:02,176 INFO L290 TraceCheckUtils]: 17: Hoare triple {86201#(and (<= main_~y~0 11) (<= 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; {86202#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:15:02,177 INFO L290 TraceCheckUtils]: 18: Hoare triple {86202#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !(~x~0 % 4294967296 > 0); {86202#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:15:02,177 INFO L290 TraceCheckUtils]: 19: Hoare triple {86202#(and (<= 12 main_~y~0) (<= main_~y~0 12))} ~z~0 := ~y~0; {86203#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-28 10:15:02,177 INFO L290 TraceCheckUtils]: 20: Hoare triple {86203#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {86204#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-28 10:15:02,178 INFO L290 TraceCheckUtils]: 21: Hoare triple {86204#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {86205#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:15:02,178 INFO L290 TraceCheckUtils]: 22: Hoare triple {86205#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {86206#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:15:02,179 INFO L290 TraceCheckUtils]: 23: Hoare triple {86206#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {86207#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:15:02,179 INFO L290 TraceCheckUtils]: 24: Hoare triple {86207#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {86208#(and (<= 7 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:15:02,180 INFO L290 TraceCheckUtils]: 25: Hoare triple {86208#(and (<= 7 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {86186#false} is VALID [2022-04-28 10:15:02,180 INFO L290 TraceCheckUtils]: 26: Hoare triple {86186#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {86186#false} is VALID [2022-04-28 10:15:02,180 INFO L290 TraceCheckUtils]: 27: Hoare triple {86186#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {86186#false} is VALID [2022-04-28 10:15:02,180 INFO L290 TraceCheckUtils]: 28: Hoare triple {86186#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {86186#false} is VALID [2022-04-28 10:15:02,180 INFO L290 TraceCheckUtils]: 29: Hoare triple {86186#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {86186#false} is VALID [2022-04-28 10:15:02,180 INFO L290 TraceCheckUtils]: 30: Hoare triple {86186#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {86186#false} is VALID [2022-04-28 10:15:02,180 INFO L290 TraceCheckUtils]: 31: Hoare triple {86186#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {86186#false} is VALID [2022-04-28 10:15:02,180 INFO L290 TraceCheckUtils]: 32: Hoare triple {86186#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {86186#false} is VALID [2022-04-28 10:15:02,180 INFO L290 TraceCheckUtils]: 33: Hoare triple {86186#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {86186#false} is VALID [2022-04-28 10:15:02,180 INFO L290 TraceCheckUtils]: 34: Hoare triple {86186#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {86186#false} is VALID [2022-04-28 10:15:02,180 INFO L290 TraceCheckUtils]: 35: Hoare triple {86186#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {86186#false} is VALID [2022-04-28 10:15:02,180 INFO L290 TraceCheckUtils]: 36: Hoare triple {86186#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {86186#false} is VALID [2022-04-28 10:15:02,180 INFO L290 TraceCheckUtils]: 37: Hoare triple {86186#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {86186#false} is VALID [2022-04-28 10:15:02,180 INFO L290 TraceCheckUtils]: 38: Hoare triple {86186#false} assume !(~y~0 % 4294967296 > 0); {86186#false} is VALID [2022-04-28 10:15:02,180 INFO L272 TraceCheckUtils]: 39: Hoare triple {86186#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {86186#false} is VALID [2022-04-28 10:15:02,180 INFO L290 TraceCheckUtils]: 40: Hoare triple {86186#false} ~cond := #in~cond; {86186#false} is VALID [2022-04-28 10:15:02,181 INFO L290 TraceCheckUtils]: 41: Hoare triple {86186#false} assume 0 == ~cond; {86186#false} is VALID [2022-04-28 10:15:02,181 INFO L290 TraceCheckUtils]: 42: Hoare triple {86186#false} assume !false; {86186#false} is VALID [2022-04-28 10:15:02,181 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-04-28 10:15:02,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:15:02,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172284935] [2022-04-28 10:15:02,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172284935] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:15:02,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1568814059] [2022-04-28 10:15:02,181 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:15:02,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:15:02,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:15:02,182 INFO L229 MonitoredProcess]: Starting monitored process 98 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:15:02,182 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (98)] Waiting until timeout for monitored process [2022-04-28 10:15:02,664 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-28 10:15:02,664 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:15:02,666 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 39 conjunts are in the unsatisfiable core [2022-04-28 10:15:02,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:15:02,675 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:15:02,944 INFO L272 TraceCheckUtils]: 0: Hoare triple {86185#true} call ULTIMATE.init(); {86185#true} is VALID [2022-04-28 10:15:02,945 INFO L290 TraceCheckUtils]: 1: Hoare triple {86185#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(10, 2);call #Ultimate.allocInit(12, 3); {86185#true} is VALID [2022-04-28 10:15:02,945 INFO L290 TraceCheckUtils]: 2: Hoare triple {86185#true} assume true; {86185#true} is VALID [2022-04-28 10:15:02,945 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {86185#true} {86185#true} #61#return; {86185#true} is VALID [2022-04-28 10:15:02,945 INFO L272 TraceCheckUtils]: 4: Hoare triple {86185#true} call #t~ret11 := main(); {86185#true} is VALID [2022-04-28 10:15:02,945 INFO L290 TraceCheckUtils]: 5: Hoare triple {86185#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {86190#(= main_~y~0 0)} is VALID [2022-04-28 10:15:02,945 INFO L290 TraceCheckUtils]: 6: Hoare triple {86190#(= 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; {86191#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:15:02,946 INFO L290 TraceCheckUtils]: 7: Hoare triple {86191#(and (<= 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; {86192#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:15:02,946 INFO L290 TraceCheckUtils]: 8: Hoare triple {86192#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {86193#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:15:02,947 INFO L290 TraceCheckUtils]: 9: Hoare triple {86193#(and (<= main_~y~0 3) (<= 3 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; {86194#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:15:02,947 INFO L290 TraceCheckUtils]: 10: Hoare triple {86194#(and (<= main_~y~0 4) (<= 4 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; {86195#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:15:02,948 INFO L290 TraceCheckUtils]: 11: Hoare triple {86195#(and (<= 5 main_~y~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; {86196#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:15:02,948 INFO L290 TraceCheckUtils]: 12: Hoare triple {86196#(and (<= main_~y~0 6) (<= 6 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; {86197#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:15:02,949 INFO L290 TraceCheckUtils]: 13: Hoare triple {86197#(and (<= 7 main_~y~0) (<= main_~y~0 7))} 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; {86198#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:15:02,949 INFO L290 TraceCheckUtils]: 14: Hoare triple {86198#(and (<= main_~y~0 8) (<= 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; {86199#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:15:02,950 INFO L290 TraceCheckUtils]: 15: Hoare triple {86199#(and (<= 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; {86200#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:15:02,950 INFO L290 TraceCheckUtils]: 16: Hoare triple {86200#(and (<= main_~y~0 10) (<= 10 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; {86201#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:15:02,951 INFO L290 TraceCheckUtils]: 17: Hoare triple {86201#(and (<= main_~y~0 11) (<= 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; {86202#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:15:02,951 INFO L290 TraceCheckUtils]: 18: Hoare triple {86202#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !(~x~0 % 4294967296 > 0); {86202#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:15:02,951 INFO L290 TraceCheckUtils]: 19: Hoare triple {86202#(and (<= 12 main_~y~0) (<= main_~y~0 12))} ~z~0 := ~y~0; {86203#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-28 10:15:02,952 INFO L290 TraceCheckUtils]: 20: Hoare triple {86203#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {86204#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-28 10:15:02,952 INFO L290 TraceCheckUtils]: 21: Hoare triple {86204#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {86205#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:15:02,953 INFO L290 TraceCheckUtils]: 22: Hoare triple {86205#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {86206#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:15:02,953 INFO L290 TraceCheckUtils]: 23: Hoare triple {86206#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {86207#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:15:02,954 INFO L290 TraceCheckUtils]: 24: Hoare triple {86207#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {86285#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:15:02,954 INFO L290 TraceCheckUtils]: 25: Hoare triple {86285#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {86186#false} is VALID [2022-04-28 10:15:02,954 INFO L290 TraceCheckUtils]: 26: Hoare triple {86186#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {86186#false} is VALID [2022-04-28 10:15:02,954 INFO L290 TraceCheckUtils]: 27: Hoare triple {86186#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {86186#false} is VALID [2022-04-28 10:15:02,954 INFO L290 TraceCheckUtils]: 28: Hoare triple {86186#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {86186#false} is VALID [2022-04-28 10:15:02,955 INFO L290 TraceCheckUtils]: 29: Hoare triple {86186#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {86186#false} is VALID [2022-04-28 10:15:02,955 INFO L290 TraceCheckUtils]: 30: Hoare triple {86186#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {86186#false} is VALID [2022-04-28 10:15:02,955 INFO L290 TraceCheckUtils]: 31: Hoare triple {86186#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {86186#false} is VALID [2022-04-28 10:15:02,955 INFO L290 TraceCheckUtils]: 32: Hoare triple {86186#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {86186#false} is VALID [2022-04-28 10:15:02,955 INFO L290 TraceCheckUtils]: 33: Hoare triple {86186#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {86186#false} is VALID [2022-04-28 10:15:02,955 INFO L290 TraceCheckUtils]: 34: Hoare triple {86186#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {86186#false} is VALID [2022-04-28 10:15:02,955 INFO L290 TraceCheckUtils]: 35: Hoare triple {86186#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {86186#false} is VALID [2022-04-28 10:15:02,955 INFO L290 TraceCheckUtils]: 36: Hoare triple {86186#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {86186#false} is VALID [2022-04-28 10:15:02,955 INFO L290 TraceCheckUtils]: 37: Hoare triple {86186#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {86186#false} is VALID [2022-04-28 10:15:02,955 INFO L290 TraceCheckUtils]: 38: Hoare triple {86186#false} assume !(~y~0 % 4294967296 > 0); {86186#false} is VALID [2022-04-28 10:15:02,955 INFO L272 TraceCheckUtils]: 39: Hoare triple {86186#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {86186#false} is VALID [2022-04-28 10:15:02,955 INFO L290 TraceCheckUtils]: 40: Hoare triple {86186#false} ~cond := #in~cond; {86186#false} is VALID [2022-04-28 10:15:02,955 INFO L290 TraceCheckUtils]: 41: Hoare triple {86186#false} assume 0 == ~cond; {86186#false} is VALID [2022-04-28 10:15:02,955 INFO L290 TraceCheckUtils]: 42: Hoare triple {86186#false} assume !false; {86186#false} is VALID [2022-04-28 10:15:02,955 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-04-28 10:15:02,955 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:15:03,552 INFO L290 TraceCheckUtils]: 42: Hoare triple {86186#false} assume !false; {86186#false} is VALID [2022-04-28 10:15:03,552 INFO L290 TraceCheckUtils]: 41: Hoare triple {86186#false} assume 0 == ~cond; {86186#false} is VALID [2022-04-28 10:15:03,553 INFO L290 TraceCheckUtils]: 40: Hoare triple {86186#false} ~cond := #in~cond; {86186#false} is VALID [2022-04-28 10:15:03,553 INFO L272 TraceCheckUtils]: 39: Hoare triple {86186#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {86186#false} is VALID [2022-04-28 10:15:03,553 INFO L290 TraceCheckUtils]: 38: Hoare triple {86186#false} assume !(~y~0 % 4294967296 > 0); {86186#false} is VALID [2022-04-28 10:15:03,553 INFO L290 TraceCheckUtils]: 37: Hoare triple {86186#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {86186#false} is VALID [2022-04-28 10:15:03,553 INFO L290 TraceCheckUtils]: 36: Hoare triple {86186#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {86186#false} is VALID [2022-04-28 10:15:03,553 INFO L290 TraceCheckUtils]: 35: Hoare triple {86186#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {86186#false} is VALID [2022-04-28 10:15:03,553 INFO L290 TraceCheckUtils]: 34: Hoare triple {86186#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {86186#false} is VALID [2022-04-28 10:15:03,553 INFO L290 TraceCheckUtils]: 33: Hoare triple {86186#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {86186#false} is VALID [2022-04-28 10:15:03,553 INFO L290 TraceCheckUtils]: 32: Hoare triple {86186#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {86186#false} is VALID [2022-04-28 10:15:03,553 INFO L290 TraceCheckUtils]: 31: Hoare triple {86186#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {86186#false} is VALID [2022-04-28 10:15:03,553 INFO L290 TraceCheckUtils]: 30: Hoare triple {86186#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {86186#false} is VALID [2022-04-28 10:15:03,553 INFO L290 TraceCheckUtils]: 29: Hoare triple {86186#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {86186#false} is VALID [2022-04-28 10:15:03,553 INFO L290 TraceCheckUtils]: 28: Hoare triple {86186#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {86186#false} is VALID [2022-04-28 10:15:03,553 INFO L290 TraceCheckUtils]: 27: Hoare triple {86186#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {86186#false} is VALID [2022-04-28 10:15:03,553 INFO L290 TraceCheckUtils]: 26: Hoare triple {86186#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {86186#false} is VALID [2022-04-28 10:15:03,554 INFO L290 TraceCheckUtils]: 25: Hoare triple {86391#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {86186#false} is VALID [2022-04-28 10:15:03,567 INFO L290 TraceCheckUtils]: 24: Hoare triple {86395#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {86391#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:15:03,568 INFO L290 TraceCheckUtils]: 23: Hoare triple {86399#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {86395#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:15:03,568 INFO L290 TraceCheckUtils]: 22: Hoare triple {86403#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {86399#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-28 10:15:03,569 INFO L290 TraceCheckUtils]: 21: Hoare triple {86407#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {86403#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-28 10:15:03,570 INFO L290 TraceCheckUtils]: 20: Hoare triple {86411#(< 0 (mod (+ 4294967291 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {86407#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID [2022-04-28 10:15:03,570 INFO L290 TraceCheckUtils]: 19: Hoare triple {86415#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} ~z~0 := ~y~0; {86411#(< 0 (mod (+ 4294967291 main_~z~0) 4294967296))} is VALID [2022-04-28 10:15:03,570 INFO L290 TraceCheckUtils]: 18: Hoare triple {86415#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {86415#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-28 10:15:03,571 INFO L290 TraceCheckUtils]: 17: Hoare triple {86422#(< 0 (mod (+ 4294967292 main_~y~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; {86415#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-28 10:15:03,572 INFO L290 TraceCheckUtils]: 16: Hoare triple {86426#(< 0 (mod (+ main_~y~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; {86422#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-28 10:15:03,573 INFO L290 TraceCheckUtils]: 15: Hoare triple {86430#(< 0 (mod (+ main_~y~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; {86426#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 10:15:03,573 INFO L290 TraceCheckUtils]: 14: Hoare triple {86434#(< 0 (mod (+ main_~y~0 4294967295) 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; {86430#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:15:03,574 INFO L290 TraceCheckUtils]: 13: Hoare triple {86438#(< 0 (mod main_~y~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; {86434#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:15:03,575 INFO L290 TraceCheckUtils]: 12: Hoare triple {86442#(< 0 (mod (+ main_~y~0 1) 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; {86438#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:15:03,575 INFO L290 TraceCheckUtils]: 11: Hoare triple {86446#(< 0 (mod (+ main_~y~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; {86442#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:15:03,576 INFO L290 TraceCheckUtils]: 10: Hoare triple {86450#(< 0 (mod (+ main_~y~0 3) 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; {86446#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:15:03,577 INFO L290 TraceCheckUtils]: 9: Hoare triple {86454#(< 0 (mod (+ main_~y~0 4) 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; {86450#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:15:03,577 INFO L290 TraceCheckUtils]: 8: Hoare triple {86458#(< 0 (mod (+ 5 main_~y~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; {86454#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:15:03,578 INFO L290 TraceCheckUtils]: 7: Hoare triple {86462#(< 0 (mod (+ main_~y~0 6) 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; {86458#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:15:03,579 INFO L290 TraceCheckUtils]: 6: Hoare triple {86466#(< 0 (mod (+ 7 main_~y~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; {86462#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:15:03,579 INFO L290 TraceCheckUtils]: 5: Hoare triple {86185#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {86466#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:15:03,579 INFO L272 TraceCheckUtils]: 4: Hoare triple {86185#true} call #t~ret11 := main(); {86185#true} is VALID [2022-04-28 10:15:03,579 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {86185#true} {86185#true} #61#return; {86185#true} is VALID [2022-04-28 10:15:03,579 INFO L290 TraceCheckUtils]: 2: Hoare triple {86185#true} assume true; {86185#true} is VALID [2022-04-28 10:15:03,579 INFO L290 TraceCheckUtils]: 1: Hoare triple {86185#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(10, 2);call #Ultimate.allocInit(12, 3); {86185#true} is VALID [2022-04-28 10:15:03,579 INFO L272 TraceCheckUtils]: 0: Hoare triple {86185#true} call ULTIMATE.init(); {86185#true} is VALID [2022-04-28 10:15:03,579 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-04-28 10:15:03,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1568814059] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:15:03,580 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:15:03,580 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 21] total 42 [2022-04-28 10:15:03,580 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:15:03,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [893106616] [2022-04-28 10:15:03,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [893106616] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:15:03,580 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:15:03,580 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-28 10:15:03,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929281429] [2022-04-28 10:15:03,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:15:03,580 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 states have internal predecessors, (28), 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 43 [2022-04-28 10:15:03,580 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:15:03,580 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 states have internal predecessors, (28), 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-28 10:15:03,600 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:15:03,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-28 10:15:03,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:15:03,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-28 10:15:03,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=292, Invalid=1430, Unknown=0, NotChecked=0, Total=1722 [2022-04-28 10:15:03,601 INFO L87 Difference]: Start difference. First operand 152 states and 192 transitions. Second operand has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 states have internal predecessors, (28), 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-28 10:15:05,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:15:05,747 INFO L93 Difference]: Finished difference Result 185 states and 225 transitions. [2022-04-28 10:15:05,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-28 10:15:05,747 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 states have internal predecessors, (28), 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 43 [2022-04-28 10:15:05,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:15:05,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 states have internal predecessors, (28), 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-28 10:15:05,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 78 transitions. [2022-04-28 10:15:05,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 states have internal predecessors, (28), 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-28 10:15:05,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 78 transitions. [2022-04-28 10:15:05,749 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 78 transitions. [2022-04-28 10:15:05,807 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:15:05,808 INFO L225 Difference]: With dead ends: 185 [2022-04-28 10:15:05,808 INFO L226 Difference]: Without dead ends: 167 [2022-04-28 10:15:05,809 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 509 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=906, Invalid=3924, Unknown=0, NotChecked=0, Total=4830 [2022-04-28 10:15:05,809 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 29 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 1036 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 1099 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 1036 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-28 10:15:05,809 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 117 Invalid, 1099 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 1036 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-28 10:15:05,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2022-04-28 10:15:05,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 153. [2022-04-28 10:15:05,974 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:15:05,974 INFO L82 GeneralOperation]: Start isEquivalent. First operand 167 states. Second operand has 153 states, 148 states have (on average 1.277027027027027) internal successors, (189), 148 states have internal predecessors, (189), 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-28 10:15:05,974 INFO L74 IsIncluded]: Start isIncluded. First operand 167 states. Second operand has 153 states, 148 states have (on average 1.277027027027027) internal successors, (189), 148 states have internal predecessors, (189), 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-28 10:15:05,974 INFO L87 Difference]: Start difference. First operand 167 states. Second operand has 153 states, 148 states have (on average 1.277027027027027) internal successors, (189), 148 states have internal predecessors, (189), 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-28 10:15:05,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:15:05,976 INFO L93 Difference]: Finished difference Result 167 states and 207 transitions. [2022-04-28 10:15:05,976 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 207 transitions. [2022-04-28 10:15:05,976 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:15:05,976 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:15:05,976 INFO L74 IsIncluded]: Start isIncluded. First operand has 153 states, 148 states have (on average 1.277027027027027) internal successors, (189), 148 states have internal predecessors, (189), 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 167 states. [2022-04-28 10:15:05,976 INFO L87 Difference]: Start difference. First operand has 153 states, 148 states have (on average 1.277027027027027) internal successors, (189), 148 states have internal predecessors, (189), 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 167 states. [2022-04-28 10:15:05,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:15:05,977 INFO L93 Difference]: Finished difference Result 167 states and 207 transitions. [2022-04-28 10:15:05,977 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 207 transitions. [2022-04-28 10:15:05,977 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:15:05,978 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:15:05,978 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:15:05,978 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:15:05,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 148 states have (on average 1.277027027027027) internal successors, (189), 148 states have internal predecessors, (189), 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-28 10:15:05,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 193 transitions. [2022-04-28 10:15:05,979 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 193 transitions. Word has length 43 [2022-04-28 10:15:05,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:15:05,979 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 193 transitions. [2022-04-28 10:15:05,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 states have internal predecessors, (28), 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-28 10:15:05,979 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 153 states and 193 transitions. [2022-04-28 10:15:08,450 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 193 edges. 193 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:15:08,450 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 193 transitions. [2022-04-28 10:15:08,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-28 10:15:08,450 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:15:08,450 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:15:08,454 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (98)] Forceful destruction successful, exit code 0 [2022-04-28 10:15:08,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97,98 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:15:08,651 INFO L420 AbstractCegarLoop]: === Iteration 99 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:15:08,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:15:08,651 INFO L85 PathProgramCache]: Analyzing trace with hash -1705851713, now seen corresponding path program 139 times [2022-04-28 10:15:08,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:15:08,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [209787734] [2022-04-28 10:15:08,653 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:15:08,653 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:15:08,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1705851713, now seen corresponding path program 140 times [2022-04-28 10:15:08,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:15:08,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164659013] [2022-04-28 10:15:08,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:15:08,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:15:08,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:15:08,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:15:08,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:15:08,922 INFO L290 TraceCheckUtils]: 0: Hoare triple {87576#(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(10, 2);call #Ultimate.allocInit(12, 3); {87553#true} is VALID [2022-04-28 10:15:08,922 INFO L290 TraceCheckUtils]: 1: Hoare triple {87553#true} assume true; {87553#true} is VALID [2022-04-28 10:15:08,922 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {87553#true} {87553#true} #61#return; {87553#true} is VALID [2022-04-28 10:15:08,922 INFO L272 TraceCheckUtils]: 0: Hoare triple {87553#true} call ULTIMATE.init(); {87576#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:15:08,922 INFO L290 TraceCheckUtils]: 1: Hoare triple {87576#(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(10, 2);call #Ultimate.allocInit(12, 3); {87553#true} is VALID [2022-04-28 10:15:08,923 INFO L290 TraceCheckUtils]: 2: Hoare triple {87553#true} assume true; {87553#true} is VALID [2022-04-28 10:15:08,923 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {87553#true} {87553#true} #61#return; {87553#true} is VALID [2022-04-28 10:15:08,923 INFO L272 TraceCheckUtils]: 4: Hoare triple {87553#true} call #t~ret11 := main(); {87553#true} is VALID [2022-04-28 10:15:08,923 INFO L290 TraceCheckUtils]: 5: Hoare triple {87553#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {87558#(= main_~y~0 0)} is VALID [2022-04-28 10:15:08,923 INFO L290 TraceCheckUtils]: 6: Hoare triple {87558#(= 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; {87559#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:15:08,924 INFO L290 TraceCheckUtils]: 7: Hoare triple {87559#(and (<= 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; {87560#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:15:08,924 INFO L290 TraceCheckUtils]: 8: Hoare triple {87560#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {87561#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:15:08,925 INFO L290 TraceCheckUtils]: 9: Hoare triple {87561#(and (<= main_~y~0 3) (<= 3 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; {87562#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:15:08,925 INFO L290 TraceCheckUtils]: 10: Hoare triple {87562#(and (<= main_~y~0 4) (<= 4 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; {87563#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:15:08,926 INFO L290 TraceCheckUtils]: 11: Hoare triple {87563#(and (<= 5 main_~y~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; {87564#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:15:08,926 INFO L290 TraceCheckUtils]: 12: Hoare triple {87564#(and (<= main_~y~0 6) (<= 6 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; {87565#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:15:08,927 INFO L290 TraceCheckUtils]: 13: Hoare triple {87565#(and (<= 7 main_~y~0) (<= main_~y~0 7))} 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; {87566#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:15:08,927 INFO L290 TraceCheckUtils]: 14: Hoare triple {87566#(and (<= main_~y~0 8) (<= 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; {87567#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:15:08,928 INFO L290 TraceCheckUtils]: 15: Hoare triple {87567#(and (<= 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; {87568#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:15:08,928 INFO L290 TraceCheckUtils]: 16: Hoare triple {87568#(and (<= main_~y~0 10) (<= 10 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; {87569#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:15:08,929 INFO L290 TraceCheckUtils]: 17: Hoare triple {87569#(and (<= main_~y~0 11) (<= 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; {87570#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:15:08,929 INFO L290 TraceCheckUtils]: 18: Hoare triple {87570#(and (<= 12 main_~y~0) (<= main_~y~0 12))} 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; {87571#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:15:08,930 INFO L290 TraceCheckUtils]: 19: Hoare triple {87571#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {87571#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:15:08,930 INFO L290 TraceCheckUtils]: 20: Hoare triple {87571#(and (<= main_~y~0 13) (<= 13 main_~y~0))} ~z~0 := ~y~0; {87572#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-28 10:15:08,930 INFO L290 TraceCheckUtils]: 21: Hoare triple {87572#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {87573#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-28 10:15:08,931 INFO L290 TraceCheckUtils]: 22: Hoare triple {87573#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {87574#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-28 10:15:08,931 INFO L290 TraceCheckUtils]: 23: Hoare triple {87574#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {87575#(and (<= 10 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:15:08,932 INFO L290 TraceCheckUtils]: 24: Hoare triple {87575#(and (<= 10 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {87554#false} is VALID [2022-04-28 10:15:08,932 INFO L290 TraceCheckUtils]: 25: Hoare triple {87554#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {87554#false} is VALID [2022-04-28 10:15:08,932 INFO L290 TraceCheckUtils]: 26: Hoare triple {87554#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {87554#false} is VALID [2022-04-28 10:15:08,932 INFO L290 TraceCheckUtils]: 27: Hoare triple {87554#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {87554#false} is VALID [2022-04-28 10:15:08,932 INFO L290 TraceCheckUtils]: 28: Hoare triple {87554#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {87554#false} is VALID [2022-04-28 10:15:08,932 INFO L290 TraceCheckUtils]: 29: Hoare triple {87554#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {87554#false} is VALID [2022-04-28 10:15:08,932 INFO L290 TraceCheckUtils]: 30: Hoare triple {87554#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {87554#false} is VALID [2022-04-28 10:15:08,932 INFO L290 TraceCheckUtils]: 31: Hoare triple {87554#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {87554#false} is VALID [2022-04-28 10:15:08,932 INFO L290 TraceCheckUtils]: 32: Hoare triple {87554#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {87554#false} is VALID [2022-04-28 10:15:08,932 INFO L290 TraceCheckUtils]: 33: Hoare triple {87554#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {87554#false} is VALID [2022-04-28 10:15:08,932 INFO L290 TraceCheckUtils]: 34: Hoare triple {87554#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {87554#false} is VALID [2022-04-28 10:15:08,932 INFO L290 TraceCheckUtils]: 35: Hoare triple {87554#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {87554#false} is VALID [2022-04-28 10:15:08,932 INFO L290 TraceCheckUtils]: 36: Hoare triple {87554#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {87554#false} is VALID [2022-04-28 10:15:08,932 INFO L290 TraceCheckUtils]: 37: Hoare triple {87554#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {87554#false} is VALID [2022-04-28 10:15:08,932 INFO L290 TraceCheckUtils]: 38: Hoare triple {87554#false} assume !(~y~0 % 4294967296 > 0); {87554#false} is VALID [2022-04-28 10:15:08,932 INFO L272 TraceCheckUtils]: 39: Hoare triple {87554#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {87554#false} is VALID [2022-04-28 10:15:08,932 INFO L290 TraceCheckUtils]: 40: Hoare triple {87554#false} ~cond := #in~cond; {87554#false} is VALID [2022-04-28 10:15:08,933 INFO L290 TraceCheckUtils]: 41: Hoare triple {87554#false} assume 0 == ~cond; {87554#false} is VALID [2022-04-28 10:15:08,933 INFO L290 TraceCheckUtils]: 42: Hoare triple {87554#false} assume !false; {87554#false} is VALID [2022-04-28 10:15:08,933 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 0 proven. 97 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-04-28 10:15:08,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:15:08,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164659013] [2022-04-28 10:15:08,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164659013] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:15:08,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1407755201] [2022-04-28 10:15:08,933 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:15:08,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:15:08,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:15:08,934 INFO L229 MonitoredProcess]: Starting monitored process 99 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:15:08,934 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (99)] Waiting until timeout for monitored process [2022-04-28 10:15:08,979 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:15:08,979 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:15:08,980 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-28 10:15:08,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:15:08,989 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:15:09,252 INFO L272 TraceCheckUtils]: 0: Hoare triple {87553#true} call ULTIMATE.init(); {87553#true} is VALID [2022-04-28 10:15:09,252 INFO L290 TraceCheckUtils]: 1: Hoare triple {87553#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(10, 2);call #Ultimate.allocInit(12, 3); {87553#true} is VALID [2022-04-28 10:15:09,252 INFO L290 TraceCheckUtils]: 2: Hoare triple {87553#true} assume true; {87553#true} is VALID [2022-04-28 10:15:09,252 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {87553#true} {87553#true} #61#return; {87553#true} is VALID [2022-04-28 10:15:09,252 INFO L272 TraceCheckUtils]: 4: Hoare triple {87553#true} call #t~ret11 := main(); {87553#true} is VALID [2022-04-28 10:15:09,252 INFO L290 TraceCheckUtils]: 5: Hoare triple {87553#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {87558#(= main_~y~0 0)} is VALID [2022-04-28 10:15:09,253 INFO L290 TraceCheckUtils]: 6: Hoare triple {87558#(= 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; {87559#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:15:09,253 INFO L290 TraceCheckUtils]: 7: Hoare triple {87559#(and (<= 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; {87560#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:15:09,254 INFO L290 TraceCheckUtils]: 8: Hoare triple {87560#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {87561#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:15:09,254 INFO L290 TraceCheckUtils]: 9: Hoare triple {87561#(and (<= main_~y~0 3) (<= 3 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; {87562#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:15:09,255 INFO L290 TraceCheckUtils]: 10: Hoare triple {87562#(and (<= main_~y~0 4) (<= 4 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; {87563#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:15:09,255 INFO L290 TraceCheckUtils]: 11: Hoare triple {87563#(and (<= 5 main_~y~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; {87564#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:15:09,256 INFO L290 TraceCheckUtils]: 12: Hoare triple {87564#(and (<= main_~y~0 6) (<= 6 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; {87565#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:15:09,256 INFO L290 TraceCheckUtils]: 13: Hoare triple {87565#(and (<= 7 main_~y~0) (<= main_~y~0 7))} 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; {87566#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:15:09,257 INFO L290 TraceCheckUtils]: 14: Hoare triple {87566#(and (<= main_~y~0 8) (<= 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; {87567#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:15:09,257 INFO L290 TraceCheckUtils]: 15: Hoare triple {87567#(and (<= 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; {87568#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:15:09,258 INFO L290 TraceCheckUtils]: 16: Hoare triple {87568#(and (<= main_~y~0 10) (<= 10 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; {87569#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:15:09,258 INFO L290 TraceCheckUtils]: 17: Hoare triple {87569#(and (<= main_~y~0 11) (<= 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; {87570#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:15:09,259 INFO L290 TraceCheckUtils]: 18: Hoare triple {87570#(and (<= 12 main_~y~0) (<= main_~y~0 12))} 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; {87571#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:15:09,259 INFO L290 TraceCheckUtils]: 19: Hoare triple {87571#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {87571#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:15:09,259 INFO L290 TraceCheckUtils]: 20: Hoare triple {87571#(and (<= main_~y~0 13) (<= 13 main_~y~0))} ~z~0 := ~y~0; {87572#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-28 10:15:09,260 INFO L290 TraceCheckUtils]: 21: Hoare triple {87572#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {87573#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-28 10:15:09,260 INFO L290 TraceCheckUtils]: 22: Hoare triple {87573#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {87574#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-28 10:15:09,261 INFO L290 TraceCheckUtils]: 23: Hoare triple {87574#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {87649#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:15:09,261 INFO L290 TraceCheckUtils]: 24: Hoare triple {87649#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {87554#false} is VALID [2022-04-28 10:15:09,261 INFO L290 TraceCheckUtils]: 25: Hoare triple {87554#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {87554#false} is VALID [2022-04-28 10:15:09,261 INFO L290 TraceCheckUtils]: 26: Hoare triple {87554#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {87554#false} is VALID [2022-04-28 10:15:09,261 INFO L290 TraceCheckUtils]: 27: Hoare triple {87554#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {87554#false} is VALID [2022-04-28 10:15:09,261 INFO L290 TraceCheckUtils]: 28: Hoare triple {87554#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {87554#false} is VALID [2022-04-28 10:15:09,261 INFO L290 TraceCheckUtils]: 29: Hoare triple {87554#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {87554#false} is VALID [2022-04-28 10:15:09,261 INFO L290 TraceCheckUtils]: 30: Hoare triple {87554#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {87554#false} is VALID [2022-04-28 10:15:09,261 INFO L290 TraceCheckUtils]: 31: Hoare triple {87554#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {87554#false} is VALID [2022-04-28 10:15:09,261 INFO L290 TraceCheckUtils]: 32: Hoare triple {87554#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {87554#false} is VALID [2022-04-28 10:15:09,262 INFO L290 TraceCheckUtils]: 33: Hoare triple {87554#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {87554#false} is VALID [2022-04-28 10:15:09,262 INFO L290 TraceCheckUtils]: 34: Hoare triple {87554#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {87554#false} is VALID [2022-04-28 10:15:09,262 INFO L290 TraceCheckUtils]: 35: Hoare triple {87554#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {87554#false} is VALID [2022-04-28 10:15:09,262 INFO L290 TraceCheckUtils]: 36: Hoare triple {87554#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {87554#false} is VALID [2022-04-28 10:15:09,262 INFO L290 TraceCheckUtils]: 37: Hoare triple {87554#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {87554#false} is VALID [2022-04-28 10:15:09,262 INFO L290 TraceCheckUtils]: 38: Hoare triple {87554#false} assume !(~y~0 % 4294967296 > 0); {87554#false} is VALID [2022-04-28 10:15:09,262 INFO L272 TraceCheckUtils]: 39: Hoare triple {87554#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {87554#false} is VALID [2022-04-28 10:15:09,262 INFO L290 TraceCheckUtils]: 40: Hoare triple {87554#false} ~cond := #in~cond; {87554#false} is VALID [2022-04-28 10:15:09,262 INFO L290 TraceCheckUtils]: 41: Hoare triple {87554#false} assume 0 == ~cond; {87554#false} is VALID [2022-04-28 10:15:09,262 INFO L290 TraceCheckUtils]: 42: Hoare triple {87554#false} assume !false; {87554#false} is VALID [2022-04-28 10:15:09,262 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 0 proven. 97 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-04-28 10:15:09,262 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:15:09,805 INFO L290 TraceCheckUtils]: 42: Hoare triple {87554#false} assume !false; {87554#false} is VALID [2022-04-28 10:15:09,805 INFO L290 TraceCheckUtils]: 41: Hoare triple {87554#false} assume 0 == ~cond; {87554#false} is VALID [2022-04-28 10:15:09,805 INFO L290 TraceCheckUtils]: 40: Hoare triple {87554#false} ~cond := #in~cond; {87554#false} is VALID [2022-04-28 10:15:09,805 INFO L272 TraceCheckUtils]: 39: Hoare triple {87554#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {87554#false} is VALID [2022-04-28 10:15:09,805 INFO L290 TraceCheckUtils]: 38: Hoare triple {87554#false} assume !(~y~0 % 4294967296 > 0); {87554#false} is VALID [2022-04-28 10:15:09,805 INFO L290 TraceCheckUtils]: 37: Hoare triple {87554#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {87554#false} is VALID [2022-04-28 10:15:09,805 INFO L290 TraceCheckUtils]: 36: Hoare triple {87554#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {87554#false} is VALID [2022-04-28 10:15:09,805 INFO L290 TraceCheckUtils]: 35: Hoare triple {87554#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {87554#false} is VALID [2022-04-28 10:15:09,806 INFO L290 TraceCheckUtils]: 34: Hoare triple {87554#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {87554#false} is VALID [2022-04-28 10:15:09,806 INFO L290 TraceCheckUtils]: 33: Hoare triple {87554#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {87554#false} is VALID [2022-04-28 10:15:09,806 INFO L290 TraceCheckUtils]: 32: Hoare triple {87554#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {87554#false} is VALID [2022-04-28 10:15:09,806 INFO L290 TraceCheckUtils]: 31: Hoare triple {87554#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {87554#false} is VALID [2022-04-28 10:15:09,806 INFO L290 TraceCheckUtils]: 30: Hoare triple {87554#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {87554#false} is VALID [2022-04-28 10:15:09,806 INFO L290 TraceCheckUtils]: 29: Hoare triple {87554#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {87554#false} is VALID [2022-04-28 10:15:09,806 INFO L290 TraceCheckUtils]: 28: Hoare triple {87554#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {87554#false} is VALID [2022-04-28 10:15:09,806 INFO L290 TraceCheckUtils]: 27: Hoare triple {87554#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {87554#false} is VALID [2022-04-28 10:15:09,806 INFO L290 TraceCheckUtils]: 26: Hoare triple {87554#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {87554#false} is VALID [2022-04-28 10:15:09,806 INFO L290 TraceCheckUtils]: 25: Hoare triple {87554#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {87554#false} is VALID [2022-04-28 10:15:09,806 INFO L290 TraceCheckUtils]: 24: Hoare triple {87761#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {87554#false} is VALID [2022-04-28 10:15:09,807 INFO L290 TraceCheckUtils]: 23: Hoare triple {87765#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {87761#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:15:09,808 INFO L290 TraceCheckUtils]: 22: Hoare triple {87769#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {87765#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:15:09,808 INFO L290 TraceCheckUtils]: 21: Hoare triple {87773#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {87769#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-28 10:15:09,809 INFO L290 TraceCheckUtils]: 20: Hoare triple {87777#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} ~z~0 := ~y~0; {87773#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-28 10:15:09,809 INFO L290 TraceCheckUtils]: 19: Hoare triple {87777#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !(~x~0 % 4294967296 > 0); {87777#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 10:15:09,810 INFO L290 TraceCheckUtils]: 18: Hoare triple {87784#(< 0 (mod (+ main_~y~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; {87777#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 10:15:09,810 INFO L290 TraceCheckUtils]: 17: Hoare triple {87788#(< 0 (mod (+ main_~y~0 4294967295) 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; {87784#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:15:09,811 INFO L290 TraceCheckUtils]: 16: Hoare triple {87792#(< 0 (mod main_~y~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; {87788#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:15:09,812 INFO L290 TraceCheckUtils]: 15: Hoare triple {87796#(< 0 (mod (+ main_~y~0 1) 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; {87792#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:15:09,812 INFO L290 TraceCheckUtils]: 14: Hoare triple {87800#(< 0 (mod (+ main_~y~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; {87796#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:15:09,813 INFO L290 TraceCheckUtils]: 13: Hoare triple {87804#(< 0 (mod (+ main_~y~0 3) 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; {87800#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:15:09,814 INFO L290 TraceCheckUtils]: 12: Hoare triple {87808#(< 0 (mod (+ main_~y~0 4) 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; {87804#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:15:09,814 INFO L290 TraceCheckUtils]: 11: Hoare triple {87812#(< 0 (mod (+ 5 main_~y~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; {87808#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:15:09,815 INFO L290 TraceCheckUtils]: 10: Hoare triple {87816#(< 0 (mod (+ main_~y~0 6) 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; {87812#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:15:09,816 INFO L290 TraceCheckUtils]: 9: Hoare triple {87820#(< 0 (mod (+ 7 main_~y~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; {87816#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:15:09,816 INFO L290 TraceCheckUtils]: 8: Hoare triple {87824#(< 0 (mod (+ main_~y~0 8) 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; {87820#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:15:09,817 INFO L290 TraceCheckUtils]: 7: Hoare triple {87828#(< 0 (mod (+ main_~y~0 9) 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; {87824#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:15:09,818 INFO L290 TraceCheckUtils]: 6: Hoare triple {87832#(< 0 (mod (+ main_~y~0 10) 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; {87828#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:15:09,818 INFO L290 TraceCheckUtils]: 5: Hoare triple {87553#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {87832#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-28 10:15:09,818 INFO L272 TraceCheckUtils]: 4: Hoare triple {87553#true} call #t~ret11 := main(); {87553#true} is VALID [2022-04-28 10:15:09,818 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {87553#true} {87553#true} #61#return; {87553#true} is VALID [2022-04-28 10:15:09,818 INFO L290 TraceCheckUtils]: 2: Hoare triple {87553#true} assume true; {87553#true} is VALID [2022-04-28 10:15:09,818 INFO L290 TraceCheckUtils]: 1: Hoare triple {87553#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(10, 2);call #Ultimate.allocInit(12, 3); {87553#true} is VALID [2022-04-28 10:15:09,818 INFO L272 TraceCheckUtils]: 0: Hoare triple {87553#true} call ULTIMATE.init(); {87553#true} is VALID [2022-04-28 10:15:09,818 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 0 proven. 97 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-04-28 10:15:09,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1407755201] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:15:09,819 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:15:09,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 40 [2022-04-28 10:15:09,819 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:15:09,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [209787734] [2022-04-28 10:15:09,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [209787734] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:15:09,819 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:15:09,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-28 10:15:09,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066795582] [2022-04-28 10:15:09,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:15:09,819 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 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 43 [2022-04-28 10:15:09,819 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:15:09,819 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 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-28 10:15:09,838 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:15:09,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-28 10:15:09,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:15:09,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-28 10:15:09,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=293, Invalid=1267, Unknown=0, NotChecked=0, Total=1560 [2022-04-28 10:15:09,839 INFO L87 Difference]: Start difference. First operand 153 states and 193 transitions. Second operand has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 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-28 10:15:11,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:15:11,626 INFO L93 Difference]: Finished difference Result 188 states and 228 transitions. [2022-04-28 10:15:11,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-28 10:15:11,626 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 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 43 [2022-04-28 10:15:11,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:15:11,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 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-28 10:15:11,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 79 transitions. [2022-04-28 10:15:11,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 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-28 10:15:11,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 79 transitions. [2022-04-28 10:15:11,627 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 79 transitions. [2022-04-28 10:15:11,686 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:15:11,687 INFO L225 Difference]: With dead ends: 188 [2022-04-28 10:15:11,687 INFO L226 Difference]: Without dead ends: 169 [2022-04-28 10:15:11,688 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=793, Invalid=3239, Unknown=0, NotChecked=0, Total=4032 [2022-04-28 10:15:11,688 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 37 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 851 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 907 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 851 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-28 10:15:11,688 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 99 Invalid, 907 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 851 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-28 10:15:11,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2022-04-28 10:15:11,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 154. [2022-04-28 10:15:11,855 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:15:11,855 INFO L82 GeneralOperation]: Start isEquivalent. First operand 169 states. Second operand has 154 states, 149 states have (on average 1.2751677852348993) internal successors, (190), 149 states have internal predecessors, (190), 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-28 10:15:11,855 INFO L74 IsIncluded]: Start isIncluded. First operand 169 states. Second operand has 154 states, 149 states have (on average 1.2751677852348993) internal successors, (190), 149 states have internal predecessors, (190), 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-28 10:15:11,855 INFO L87 Difference]: Start difference. First operand 169 states. Second operand has 154 states, 149 states have (on average 1.2751677852348993) internal successors, (190), 149 states have internal predecessors, (190), 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-28 10:15:11,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:15:11,856 INFO L93 Difference]: Finished difference Result 169 states and 209 transitions. [2022-04-28 10:15:11,857 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 209 transitions. [2022-04-28 10:15:11,857 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:15:11,857 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:15:11,857 INFO L74 IsIncluded]: Start isIncluded. First operand has 154 states, 149 states have (on average 1.2751677852348993) internal successors, (190), 149 states have internal predecessors, (190), 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 169 states. [2022-04-28 10:15:11,857 INFO L87 Difference]: Start difference. First operand has 154 states, 149 states have (on average 1.2751677852348993) internal successors, (190), 149 states have internal predecessors, (190), 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 169 states. [2022-04-28 10:15:11,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:15:11,858 INFO L93 Difference]: Finished difference Result 169 states and 209 transitions. [2022-04-28 10:15:11,858 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 209 transitions. [2022-04-28 10:15:11,858 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:15:11,858 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:15:11,858 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:15:11,858 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:15:11,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 149 states have (on average 1.2751677852348993) internal successors, (190), 149 states have internal predecessors, (190), 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-28 10:15:11,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 194 transitions. [2022-04-28 10:15:11,860 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 194 transitions. Word has length 43 [2022-04-28 10:15:11,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:15:11,860 INFO L495 AbstractCegarLoop]: Abstraction has 154 states and 194 transitions. [2022-04-28 10:15:11,860 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 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-28 10:15:11,860 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 154 states and 194 transitions. [2022-04-28 10:15:14,938 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 194 edges. 194 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:15:14,939 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 194 transitions. [2022-04-28 10:15:14,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-28 10:15:14,939 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:15:14,939 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:15:14,957 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (99)] Forceful destruction successful, exit code 0 [2022-04-28 10:15:15,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 99 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable98 [2022-04-28 10:15:15,139 INFO L420 AbstractCegarLoop]: === Iteration 100 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:15:15,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:15:15,140 INFO L85 PathProgramCache]: Analyzing trace with hash -1126431377, now seen corresponding path program 141 times [2022-04-28 10:15:15,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:15:15,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [485102816] [2022-04-28 10:15:15,142 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:15:15,142 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:15:15,142 INFO L85 PathProgramCache]: Analyzing trace with hash -1126431377, now seen corresponding path program 142 times [2022-04-28 10:15:15,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:15:15,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103312511] [2022-04-28 10:15:15,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:15:15,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:15:15,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:15:15,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:15:15,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:15:15,395 INFO L290 TraceCheckUtils]: 0: Hoare triple {88945#(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(10, 2);call #Ultimate.allocInit(12, 3); {88923#true} is VALID [2022-04-28 10:15:15,395 INFO L290 TraceCheckUtils]: 1: Hoare triple {88923#true} assume true; {88923#true} is VALID [2022-04-28 10:15:15,395 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {88923#true} {88923#true} #61#return; {88923#true} is VALID [2022-04-28 10:15:15,395 INFO L272 TraceCheckUtils]: 0: Hoare triple {88923#true} call ULTIMATE.init(); {88945#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:15:15,395 INFO L290 TraceCheckUtils]: 1: Hoare triple {88945#(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(10, 2);call #Ultimate.allocInit(12, 3); {88923#true} is VALID [2022-04-28 10:15:15,395 INFO L290 TraceCheckUtils]: 2: Hoare triple {88923#true} assume true; {88923#true} is VALID [2022-04-28 10:15:15,395 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {88923#true} {88923#true} #61#return; {88923#true} is VALID [2022-04-28 10:15:15,396 INFO L272 TraceCheckUtils]: 4: Hoare triple {88923#true} call #t~ret11 := main(); {88923#true} is VALID [2022-04-28 10:15:15,396 INFO L290 TraceCheckUtils]: 5: Hoare triple {88923#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {88928#(= main_~y~0 0)} is VALID [2022-04-28 10:15:15,396 INFO L290 TraceCheckUtils]: 6: Hoare triple {88928#(= 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; {88929#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:15:15,397 INFO L290 TraceCheckUtils]: 7: Hoare triple {88929#(and (<= 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; {88930#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:15:15,397 INFO L290 TraceCheckUtils]: 8: Hoare triple {88930#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {88931#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:15:15,398 INFO L290 TraceCheckUtils]: 9: Hoare triple {88931#(and (<= main_~y~0 3) (<= 3 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; {88932#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:15:15,398 INFO L290 TraceCheckUtils]: 10: Hoare triple {88932#(and (<= main_~y~0 4) (<= 4 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; {88933#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:15:15,399 INFO L290 TraceCheckUtils]: 11: Hoare triple {88933#(and (<= 5 main_~y~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; {88934#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:15:15,399 INFO L290 TraceCheckUtils]: 12: Hoare triple {88934#(and (<= main_~y~0 6) (<= 6 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; {88935#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:15:15,400 INFO L290 TraceCheckUtils]: 13: Hoare triple {88935#(and (<= 7 main_~y~0) (<= main_~y~0 7))} 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; {88936#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:15:15,400 INFO L290 TraceCheckUtils]: 14: Hoare triple {88936#(and (<= main_~y~0 8) (<= 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; {88937#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:15:15,401 INFO L290 TraceCheckUtils]: 15: Hoare triple {88937#(and (<= 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; {88938#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:15:15,401 INFO L290 TraceCheckUtils]: 16: Hoare triple {88938#(and (<= main_~y~0 10) (<= 10 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; {88939#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:15:15,402 INFO L290 TraceCheckUtils]: 17: Hoare triple {88939#(and (<= main_~y~0 11) (<= 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; {88940#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:15:15,402 INFO L290 TraceCheckUtils]: 18: Hoare triple {88940#(and (<= 12 main_~y~0) (<= main_~y~0 12))} 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; {88941#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:15:15,402 INFO L290 TraceCheckUtils]: 19: Hoare triple {88941#(and (<= main_~y~0 13) (<= 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; {88942#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:15:15,403 INFO L290 TraceCheckUtils]: 20: Hoare triple {88942#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !(~x~0 % 4294967296 > 0); {88942#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:15:15,403 INFO L290 TraceCheckUtils]: 21: Hoare triple {88942#(and (<= 14 main_~y~0) (<= main_~y~0 14))} ~z~0 := ~y~0; {88943#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-28 10:15:15,404 INFO L290 TraceCheckUtils]: 22: Hoare triple {88943#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {88944#(and (<= 13 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:15:15,404 INFO L290 TraceCheckUtils]: 23: Hoare triple {88944#(and (<= 13 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {88924#false} is VALID [2022-04-28 10:15:15,404 INFO L290 TraceCheckUtils]: 24: Hoare triple {88924#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {88924#false} is VALID [2022-04-28 10:15:15,404 INFO L290 TraceCheckUtils]: 25: Hoare triple {88924#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {88924#false} is VALID [2022-04-28 10:15:15,404 INFO L290 TraceCheckUtils]: 26: Hoare triple {88924#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {88924#false} is VALID [2022-04-28 10:15:15,404 INFO L290 TraceCheckUtils]: 27: Hoare triple {88924#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {88924#false} is VALID [2022-04-28 10:15:15,404 INFO L290 TraceCheckUtils]: 28: Hoare triple {88924#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {88924#false} is VALID [2022-04-28 10:15:15,404 INFO L290 TraceCheckUtils]: 29: Hoare triple {88924#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {88924#false} is VALID [2022-04-28 10:15:15,404 INFO L290 TraceCheckUtils]: 30: Hoare triple {88924#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {88924#false} is VALID [2022-04-28 10:15:15,404 INFO L290 TraceCheckUtils]: 31: Hoare triple {88924#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {88924#false} is VALID [2022-04-28 10:15:15,404 INFO L290 TraceCheckUtils]: 32: Hoare triple {88924#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {88924#false} is VALID [2022-04-28 10:15:15,405 INFO L290 TraceCheckUtils]: 33: Hoare triple {88924#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {88924#false} is VALID [2022-04-28 10:15:15,405 INFO L290 TraceCheckUtils]: 34: Hoare triple {88924#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {88924#false} is VALID [2022-04-28 10:15:15,405 INFO L290 TraceCheckUtils]: 35: Hoare triple {88924#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {88924#false} is VALID [2022-04-28 10:15:15,405 INFO L290 TraceCheckUtils]: 36: Hoare triple {88924#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {88924#false} is VALID [2022-04-28 10:15:15,405 INFO L290 TraceCheckUtils]: 37: Hoare triple {88924#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {88924#false} is VALID [2022-04-28 10:15:15,405 INFO L290 TraceCheckUtils]: 38: Hoare triple {88924#false} assume !(~y~0 % 4294967296 > 0); {88924#false} is VALID [2022-04-28 10:15:15,405 INFO L272 TraceCheckUtils]: 39: Hoare triple {88924#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {88924#false} is VALID [2022-04-28 10:15:15,405 INFO L290 TraceCheckUtils]: 40: Hoare triple {88924#false} ~cond := #in~cond; {88924#false} is VALID [2022-04-28 10:15:15,405 INFO L290 TraceCheckUtils]: 41: Hoare triple {88924#false} assume 0 == ~cond; {88924#false} is VALID [2022-04-28 10:15:15,405 INFO L290 TraceCheckUtils]: 42: Hoare triple {88924#false} assume !false; {88924#false} is VALID [2022-04-28 10:15:15,405 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 0 proven. 106 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-04-28 10:15:15,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:15:15,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103312511] [2022-04-28 10:15:15,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103312511] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:15:15,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1422229486] [2022-04-28 10:15:15,405 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:15:15,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:15:15,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:15:15,407 INFO L229 MonitoredProcess]: Starting monitored process 100 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:15:15,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (100)] Waiting until timeout for monitored process [2022-04-28 10:15:15,451 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:15:15,452 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:15:15,452 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-28 10:15:15,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:15:15,462 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:15:15,723 INFO L272 TraceCheckUtils]: 0: Hoare triple {88923#true} call ULTIMATE.init(); {88923#true} is VALID [2022-04-28 10:15:15,723 INFO L290 TraceCheckUtils]: 1: Hoare triple {88923#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(10, 2);call #Ultimate.allocInit(12, 3); {88923#true} is VALID [2022-04-28 10:15:15,723 INFO L290 TraceCheckUtils]: 2: Hoare triple {88923#true} assume true; {88923#true} is VALID [2022-04-28 10:15:15,723 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {88923#true} {88923#true} #61#return; {88923#true} is VALID [2022-04-28 10:15:15,723 INFO L272 TraceCheckUtils]: 4: Hoare triple {88923#true} call #t~ret11 := main(); {88923#true} is VALID [2022-04-28 10:15:15,723 INFO L290 TraceCheckUtils]: 5: Hoare triple {88923#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {88928#(= main_~y~0 0)} is VALID [2022-04-28 10:15:15,724 INFO L290 TraceCheckUtils]: 6: Hoare triple {88928#(= 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; {88929#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:15:15,724 INFO L290 TraceCheckUtils]: 7: Hoare triple {88929#(and (<= 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; {88930#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:15:15,725 INFO L290 TraceCheckUtils]: 8: Hoare triple {88930#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {88931#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:15:15,725 INFO L290 TraceCheckUtils]: 9: Hoare triple {88931#(and (<= main_~y~0 3) (<= 3 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; {88932#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:15:15,726 INFO L290 TraceCheckUtils]: 10: Hoare triple {88932#(and (<= main_~y~0 4) (<= 4 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; {88933#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:15:15,726 INFO L290 TraceCheckUtils]: 11: Hoare triple {88933#(and (<= 5 main_~y~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; {88934#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:15:15,727 INFO L290 TraceCheckUtils]: 12: Hoare triple {88934#(and (<= main_~y~0 6) (<= 6 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; {88935#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:15:15,727 INFO L290 TraceCheckUtils]: 13: Hoare triple {88935#(and (<= 7 main_~y~0) (<= main_~y~0 7))} 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; {88936#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:15:15,728 INFO L290 TraceCheckUtils]: 14: Hoare triple {88936#(and (<= main_~y~0 8) (<= 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; {88937#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:15:15,728 INFO L290 TraceCheckUtils]: 15: Hoare triple {88937#(and (<= 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; {88938#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:15:15,729 INFO L290 TraceCheckUtils]: 16: Hoare triple {88938#(and (<= main_~y~0 10) (<= 10 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; {88939#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:15:15,729 INFO L290 TraceCheckUtils]: 17: Hoare triple {88939#(and (<= main_~y~0 11) (<= 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; {88940#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:15:15,730 INFO L290 TraceCheckUtils]: 18: Hoare triple {88940#(and (<= 12 main_~y~0) (<= main_~y~0 12))} 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; {88941#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:15:15,730 INFO L290 TraceCheckUtils]: 19: Hoare triple {88941#(and (<= main_~y~0 13) (<= 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; {88942#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:15:15,730 INFO L290 TraceCheckUtils]: 20: Hoare triple {88942#(and (<= 14 main_~y~0) (<= main_~y~0 14))} assume !(~x~0 % 4294967296 > 0); {88942#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:15:15,731 INFO L290 TraceCheckUtils]: 21: Hoare triple {88942#(and (<= 14 main_~y~0) (<= main_~y~0 14))} ~z~0 := ~y~0; {88943#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-28 10:15:15,731 INFO L290 TraceCheckUtils]: 22: Hoare triple {88943#(and (<= 14 main_~z~0) (<= main_~z~0 14))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {89015#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-28 10:15:15,732 INFO L290 TraceCheckUtils]: 23: Hoare triple {89015#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !(~z~0 % 4294967296 > 0); {88924#false} is VALID [2022-04-28 10:15:15,732 INFO L290 TraceCheckUtils]: 24: Hoare triple {88924#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {88924#false} is VALID [2022-04-28 10:15:15,732 INFO L290 TraceCheckUtils]: 25: Hoare triple {88924#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {88924#false} is VALID [2022-04-28 10:15:15,732 INFO L290 TraceCheckUtils]: 26: Hoare triple {88924#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {88924#false} is VALID [2022-04-28 10:15:15,732 INFO L290 TraceCheckUtils]: 27: Hoare triple {88924#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {88924#false} is VALID [2022-04-28 10:15:15,732 INFO L290 TraceCheckUtils]: 28: Hoare triple {88924#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {88924#false} is VALID [2022-04-28 10:15:15,732 INFO L290 TraceCheckUtils]: 29: Hoare triple {88924#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {88924#false} is VALID [2022-04-28 10:15:15,732 INFO L290 TraceCheckUtils]: 30: Hoare triple {88924#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {88924#false} is VALID [2022-04-28 10:15:15,732 INFO L290 TraceCheckUtils]: 31: Hoare triple {88924#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {88924#false} is VALID [2022-04-28 10:15:15,732 INFO L290 TraceCheckUtils]: 32: Hoare triple {88924#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {88924#false} is VALID [2022-04-28 10:15:15,732 INFO L290 TraceCheckUtils]: 33: Hoare triple {88924#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {88924#false} is VALID [2022-04-28 10:15:15,732 INFO L290 TraceCheckUtils]: 34: Hoare triple {88924#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {88924#false} is VALID [2022-04-28 10:15:15,732 INFO L290 TraceCheckUtils]: 35: Hoare triple {88924#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {88924#false} is VALID [2022-04-28 10:15:15,732 INFO L290 TraceCheckUtils]: 36: Hoare triple {88924#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {88924#false} is VALID [2022-04-28 10:15:15,732 INFO L290 TraceCheckUtils]: 37: Hoare triple {88924#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {88924#false} is VALID [2022-04-28 10:15:15,732 INFO L290 TraceCheckUtils]: 38: Hoare triple {88924#false} assume !(~y~0 % 4294967296 > 0); {88924#false} is VALID [2022-04-28 10:15:15,732 INFO L272 TraceCheckUtils]: 39: Hoare triple {88924#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {88924#false} is VALID [2022-04-28 10:15:15,732 INFO L290 TraceCheckUtils]: 40: Hoare triple {88924#false} ~cond := #in~cond; {88924#false} is VALID [2022-04-28 10:15:15,733 INFO L290 TraceCheckUtils]: 41: Hoare triple {88924#false} assume 0 == ~cond; {88924#false} is VALID [2022-04-28 10:15:15,733 INFO L290 TraceCheckUtils]: 42: Hoare triple {88924#false} assume !false; {88924#false} is VALID [2022-04-28 10:15:15,733 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 0 proven. 106 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-04-28 10:15:15,733 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:15:16,237 INFO L290 TraceCheckUtils]: 42: Hoare triple {88924#false} assume !false; {88924#false} is VALID [2022-04-28 10:15:16,238 INFO L290 TraceCheckUtils]: 41: Hoare triple {88924#false} assume 0 == ~cond; {88924#false} is VALID [2022-04-28 10:15:16,238 INFO L290 TraceCheckUtils]: 40: Hoare triple {88924#false} ~cond := #in~cond; {88924#false} is VALID [2022-04-28 10:15:16,238 INFO L272 TraceCheckUtils]: 39: Hoare triple {88924#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {88924#false} is VALID [2022-04-28 10:15:16,238 INFO L290 TraceCheckUtils]: 38: Hoare triple {88924#false} assume !(~y~0 % 4294967296 > 0); {88924#false} is VALID [2022-04-28 10:15:16,238 INFO L290 TraceCheckUtils]: 37: Hoare triple {88924#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {88924#false} is VALID [2022-04-28 10:15:16,238 INFO L290 TraceCheckUtils]: 36: Hoare triple {88924#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {88924#false} is VALID [2022-04-28 10:15:16,238 INFO L290 TraceCheckUtils]: 35: Hoare triple {88924#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {88924#false} is VALID [2022-04-28 10:15:16,238 INFO L290 TraceCheckUtils]: 34: Hoare triple {88924#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {88924#false} is VALID [2022-04-28 10:15:16,238 INFO L290 TraceCheckUtils]: 33: Hoare triple {88924#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {88924#false} is VALID [2022-04-28 10:15:16,238 INFO L290 TraceCheckUtils]: 32: Hoare triple {88924#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {88924#false} is VALID [2022-04-28 10:15:16,238 INFO L290 TraceCheckUtils]: 31: Hoare triple {88924#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {88924#false} is VALID [2022-04-28 10:15:16,238 INFO L290 TraceCheckUtils]: 30: Hoare triple {88924#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {88924#false} is VALID [2022-04-28 10:15:16,238 INFO L290 TraceCheckUtils]: 29: Hoare triple {88924#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {88924#false} is VALID [2022-04-28 10:15:16,238 INFO L290 TraceCheckUtils]: 28: Hoare triple {88924#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {88924#false} is VALID [2022-04-28 10:15:16,238 INFO L290 TraceCheckUtils]: 27: Hoare triple {88924#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {88924#false} is VALID [2022-04-28 10:15:16,238 INFO L290 TraceCheckUtils]: 26: Hoare triple {88924#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {88924#false} is VALID [2022-04-28 10:15:16,238 INFO L290 TraceCheckUtils]: 25: Hoare triple {88924#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {88924#false} is VALID [2022-04-28 10:15:16,238 INFO L290 TraceCheckUtils]: 24: Hoare triple {88924#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {88924#false} is VALID [2022-04-28 10:15:16,239 INFO L290 TraceCheckUtils]: 23: Hoare triple {89133#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {88924#false} is VALID [2022-04-28 10:15:16,239 INFO L290 TraceCheckUtils]: 22: Hoare triple {89137#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {89133#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:15:16,240 INFO L290 TraceCheckUtils]: 21: Hoare triple {89141#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} ~z~0 := ~y~0; {89137#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:15:16,240 INFO L290 TraceCheckUtils]: 20: Hoare triple {89141#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {89141#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:15:16,241 INFO L290 TraceCheckUtils]: 19: Hoare triple {89148#(< 0 (mod main_~y~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; {89141#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:15:16,241 INFO L290 TraceCheckUtils]: 18: Hoare triple {89152#(< 0 (mod (+ main_~y~0 1) 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; {89148#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:15:16,242 INFO L290 TraceCheckUtils]: 17: Hoare triple {89156#(< 0 (mod (+ main_~y~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; {89152#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:15:16,243 INFO L290 TraceCheckUtils]: 16: Hoare triple {89160#(< 0 (mod (+ main_~y~0 3) 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; {89156#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:15:16,243 INFO L290 TraceCheckUtils]: 15: Hoare triple {89164#(< 0 (mod (+ main_~y~0 4) 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; {89160#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:15:16,244 INFO L290 TraceCheckUtils]: 14: Hoare triple {89168#(< 0 (mod (+ 5 main_~y~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; {89164#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:15:16,244 INFO L290 TraceCheckUtils]: 13: Hoare triple {89172#(< 0 (mod (+ main_~y~0 6) 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; {89168#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:15:16,245 INFO L290 TraceCheckUtils]: 12: Hoare triple {89176#(< 0 (mod (+ 7 main_~y~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; {89172#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:15:16,246 INFO L290 TraceCheckUtils]: 11: Hoare triple {89180#(< 0 (mod (+ main_~y~0 8) 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; {89176#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:15:16,246 INFO L290 TraceCheckUtils]: 10: Hoare triple {89184#(< 0 (mod (+ main_~y~0 9) 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; {89180#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:15:16,247 INFO L290 TraceCheckUtils]: 9: Hoare triple {89188#(< 0 (mod (+ main_~y~0 10) 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; {89184#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:15:16,248 INFO L290 TraceCheckUtils]: 8: Hoare triple {89192#(< 0 (mod (+ main_~y~0 11) 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; {89188#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-28 10:15:16,248 INFO L290 TraceCheckUtils]: 7: Hoare triple {89196#(< 0 (mod (+ main_~y~0 12) 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; {89192#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-28 10:15:16,249 INFO L290 TraceCheckUtils]: 6: Hoare triple {89200#(< 0 (mod (+ main_~y~0 13) 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; {89196#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-28 10:15:16,249 INFO L290 TraceCheckUtils]: 5: Hoare triple {88923#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {89200#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-28 10:15:16,249 INFO L272 TraceCheckUtils]: 4: Hoare triple {88923#true} call #t~ret11 := main(); {88923#true} is VALID [2022-04-28 10:15:16,249 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {88923#true} {88923#true} #61#return; {88923#true} is VALID [2022-04-28 10:15:16,249 INFO L290 TraceCheckUtils]: 2: Hoare triple {88923#true} assume true; {88923#true} is VALID [2022-04-28 10:15:16,249 INFO L290 TraceCheckUtils]: 1: Hoare triple {88923#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(10, 2);call #Ultimate.allocInit(12, 3); {88923#true} is VALID [2022-04-28 10:15:16,249 INFO L272 TraceCheckUtils]: 0: Hoare triple {88923#true} call ULTIMATE.init(); {88923#true} is VALID [2022-04-28 10:15:16,249 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 0 proven. 106 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-04-28 10:15:16,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1422229486] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:15:16,250 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:15:16,250 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 19] total 38 [2022-04-28 10:15:16,250 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:15:16,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [485102816] [2022-04-28 10:15:16,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [485102816] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:15:16,250 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:15:16,250 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-28 10:15:16,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380884273] [2022-04-28 10:15:16,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:15:16,250 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 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 43 [2022-04-28 10:15:16,250 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:15:16,250 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 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-28 10:15:16,268 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:15:16,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-28 10:15:16,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:15:16,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-28 10:15:16,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=304, Invalid=1102, Unknown=0, NotChecked=0, Total=1406 [2022-04-28 10:15:16,268 INFO L87 Difference]: Start difference. First operand 154 states and 194 transitions. Second operand has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 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-28 10:15:18,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:15:18,042 INFO L93 Difference]: Finished difference Result 191 states and 231 transitions. [2022-04-28 10:15:18,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-28 10:15:18,043 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 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 43 [2022-04-28 10:15:18,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:15:18,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 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-28 10:15:18,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 78 transitions. [2022-04-28 10:15:18,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 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-28 10:15:18,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 78 transitions. [2022-04-28 10:15:18,044 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 78 transitions. [2022-04-28 10:15:18,106 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:15:18,108 INFO L225 Difference]: With dead ends: 191 [2022-04-28 10:15:18,108 INFO L226 Difference]: Without dead ends: 171 [2022-04-28 10:15:18,108 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=658, Invalid=2422, Unknown=0, NotChecked=0, Total=3080 [2022-04-28 10:15:18,109 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 46 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 956 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 996 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 956 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-28 10:15:18,109 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 112 Invalid, 996 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 956 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-28 10:15:18,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2022-04-28 10:15:18,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 155. [2022-04-28 10:15:18,280 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:15:18,280 INFO L82 GeneralOperation]: Start isEquivalent. First operand 171 states. Second operand has 155 states, 150 states have (on average 1.2733333333333334) internal successors, (191), 150 states have internal predecessors, (191), 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-28 10:15:18,280 INFO L74 IsIncluded]: Start isIncluded. First operand 171 states. Second operand has 155 states, 150 states have (on average 1.2733333333333334) internal successors, (191), 150 states have internal predecessors, (191), 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-28 10:15:18,281 INFO L87 Difference]: Start difference. First operand 171 states. Second operand has 155 states, 150 states have (on average 1.2733333333333334) internal successors, (191), 150 states have internal predecessors, (191), 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-28 10:15:18,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:15:18,282 INFO L93 Difference]: Finished difference Result 171 states and 211 transitions. [2022-04-28 10:15:18,282 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 211 transitions. [2022-04-28 10:15:18,282 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:15:18,282 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:15:18,282 INFO L74 IsIncluded]: Start isIncluded. First operand has 155 states, 150 states have (on average 1.2733333333333334) internal successors, (191), 150 states have internal predecessors, (191), 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 171 states. [2022-04-28 10:15:18,282 INFO L87 Difference]: Start difference. First operand has 155 states, 150 states have (on average 1.2733333333333334) internal successors, (191), 150 states have internal predecessors, (191), 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 171 states. [2022-04-28 10:15:18,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:15:18,284 INFO L93 Difference]: Finished difference Result 171 states and 211 transitions. [2022-04-28 10:15:18,284 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 211 transitions. [2022-04-28 10:15:18,284 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:15:18,284 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:15:18,284 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:15:18,284 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:15:18,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 150 states have (on average 1.2733333333333334) internal successors, (191), 150 states have internal predecessors, (191), 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-28 10:15:18,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 195 transitions. [2022-04-28 10:15:18,285 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 195 transitions. Word has length 43 [2022-04-28 10:15:18,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:15:18,285 INFO L495 AbstractCegarLoop]: Abstraction has 155 states and 195 transitions. [2022-04-28 10:15:18,286 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.3) internal successors, (26), 19 states have internal predecessors, (26), 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-28 10:15:18,286 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 155 states and 195 transitions. [2022-04-28 10:15:24,138 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 195 edges. 193 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-28 10:15:24,139 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 195 transitions. [2022-04-28 10:15:24,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-28 10:15:24,139 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:15:24,139 INFO L195 NwaCegarLoop]: trace histogram [29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:15:24,155 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (100)] Forceful destruction successful, exit code 0 [2022-04-28 10:15:24,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable99,100 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:15:24,339 INFO L420 AbstractCegarLoop]: === Iteration 101 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:15:24,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:15:24,340 INFO L85 PathProgramCache]: Analyzing trace with hash -31803666, now seen corresponding path program 57 times [2022-04-28 10:15:24,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:15:24,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [476270725] [2022-04-28 10:15:24,342 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:15:24,342 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:15:24,342 INFO L85 PathProgramCache]: Analyzing trace with hash -31803666, now seen corresponding path program 58 times [2022-04-28 10:15:24,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:15:24,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042330996] [2022-04-28 10:15:24,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:15:24,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:15:24,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:15:24,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:15:24,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:15:24,932 INFO L290 TraceCheckUtils]: 0: Hoare triple {90327#(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(10, 2);call #Ultimate.allocInit(12, 3); {90291#true} is VALID [2022-04-28 10:15:24,932 INFO L290 TraceCheckUtils]: 1: Hoare triple {90291#true} assume true; {90291#true} is VALID [2022-04-28 10:15:24,932 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {90291#true} {90291#true} #61#return; {90291#true} is VALID [2022-04-28 10:15:24,932 INFO L272 TraceCheckUtils]: 0: Hoare triple {90291#true} call ULTIMATE.init(); {90327#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:15:24,932 INFO L290 TraceCheckUtils]: 1: Hoare triple {90327#(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(10, 2);call #Ultimate.allocInit(12, 3); {90291#true} is VALID [2022-04-28 10:15:24,932 INFO L290 TraceCheckUtils]: 2: Hoare triple {90291#true} assume true; {90291#true} is VALID [2022-04-28 10:15:24,932 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {90291#true} {90291#true} #61#return; {90291#true} is VALID [2022-04-28 10:15:24,932 INFO L272 TraceCheckUtils]: 4: Hoare triple {90291#true} call #t~ret11 := main(); {90291#true} is VALID [2022-04-28 10:15:24,933 INFO L290 TraceCheckUtils]: 5: Hoare triple {90291#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {90296#(= main_~y~0 0)} is VALID [2022-04-28 10:15:24,933 INFO L290 TraceCheckUtils]: 6: Hoare triple {90296#(= 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; {90297#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:15:24,934 INFO L290 TraceCheckUtils]: 7: Hoare triple {90297#(and (<= 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; {90298#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:15:24,934 INFO L290 TraceCheckUtils]: 8: Hoare triple {90298#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {90299#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:15:24,935 INFO L290 TraceCheckUtils]: 9: Hoare triple {90299#(and (<= main_~y~0 3) (<= 3 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; {90300#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:15:24,935 INFO L290 TraceCheckUtils]: 10: Hoare triple {90300#(and (<= main_~y~0 4) (<= 4 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; {90301#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:15:24,936 INFO L290 TraceCheckUtils]: 11: Hoare triple {90301#(and (<= 5 main_~y~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; {90302#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:15:24,936 INFO L290 TraceCheckUtils]: 12: Hoare triple {90302#(and (<= main_~y~0 6) (<= 6 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; {90303#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:15:24,937 INFO L290 TraceCheckUtils]: 13: Hoare triple {90303#(and (<= 7 main_~y~0) (<= main_~y~0 7))} 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; {90304#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:15:24,937 INFO L290 TraceCheckUtils]: 14: Hoare triple {90304#(and (<= main_~y~0 8) (<= 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; {90305#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:15:24,938 INFO L290 TraceCheckUtils]: 15: Hoare triple {90305#(and (<= 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; {90306#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:15:24,938 INFO L290 TraceCheckUtils]: 16: Hoare triple {90306#(and (<= main_~y~0 10) (<= 10 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; {90307#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:15:24,939 INFO L290 TraceCheckUtils]: 17: Hoare triple {90307#(and (<= main_~y~0 11) (<= 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; {90308#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:15:24,939 INFO L290 TraceCheckUtils]: 18: Hoare triple {90308#(and (<= 12 main_~y~0) (<= main_~y~0 12))} 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; {90309#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:15:24,940 INFO L290 TraceCheckUtils]: 19: Hoare triple {90309#(and (<= main_~y~0 13) (<= 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; {90310#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:15:24,940 INFO L290 TraceCheckUtils]: 20: Hoare triple {90310#(and (<= 14 main_~y~0) (<= main_~y~0 14))} 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; {90311#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:15:24,941 INFO L290 TraceCheckUtils]: 21: Hoare triple {90311#(and (<= main_~y~0 15) (<= 15 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; {90312#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:15:24,941 INFO L290 TraceCheckUtils]: 22: Hoare triple {90312#(and (<= 16 main_~y~0) (<= main_~y~0 16))} 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; {90313#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:15:24,942 INFO L290 TraceCheckUtils]: 23: Hoare triple {90313#(and (<= main_~y~0 17) (<= 17 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; {90314#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 10:15:24,943 INFO L290 TraceCheckUtils]: 24: Hoare triple {90314#(and (<= 18 main_~y~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; {90315#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 10:15:24,943 INFO L290 TraceCheckUtils]: 25: Hoare triple {90315#(and (<= 19 main_~y~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; {90316#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 10:15:24,944 INFO L290 TraceCheckUtils]: 26: Hoare triple {90316#(and (<= 20 main_~y~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; {90317#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 10:15:24,944 INFO L290 TraceCheckUtils]: 27: Hoare triple {90317#(and (<= main_~y~0 21) (<= 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; {90318#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 10:15:24,945 INFO L290 TraceCheckUtils]: 28: Hoare triple {90318#(and (<= main_~y~0 22) (<= 22 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; {90319#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 10:15:24,945 INFO L290 TraceCheckUtils]: 29: Hoare triple {90319#(and (<= main_~y~0 23) (<= 23 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; {90320#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-28 10:15:24,946 INFO L290 TraceCheckUtils]: 30: Hoare triple {90320#(and (<= 24 main_~y~0) (<= main_~y~0 24))} 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; {90321#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-28 10:15:24,946 INFO L290 TraceCheckUtils]: 31: Hoare triple {90321#(and (<= 25 main_~y~0) (<= main_~y~0 25))} 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; {90322#(and (<= main_~y~0 26) (<= 26 main_~y~0))} is VALID [2022-04-28 10:15:24,947 INFO L290 TraceCheckUtils]: 32: Hoare triple {90322#(and (<= main_~y~0 26) (<= 26 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; {90323#(and (<= main_~y~0 27) (<= 27 main_~y~0))} is VALID [2022-04-28 10:15:24,947 INFO L290 TraceCheckUtils]: 33: Hoare triple {90323#(and (<= main_~y~0 27) (<= 27 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; {90324#(and (<= main_~y~0 28) (<= 28 main_~y~0))} is VALID [2022-04-28 10:15:24,948 INFO L290 TraceCheckUtils]: 34: Hoare triple {90324#(and (<= main_~y~0 28) (<= 28 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; {90325#(and (<= 29 main_~y~0) (<= main_~y~0 29))} is VALID [2022-04-28 10:15:24,948 INFO L290 TraceCheckUtils]: 35: Hoare triple {90325#(and (<= 29 main_~y~0) (<= main_~y~0 29))} assume !(~x~0 % 4294967296 > 0); {90325#(and (<= 29 main_~y~0) (<= main_~y~0 29))} is VALID [2022-04-28 10:15:24,949 INFO L290 TraceCheckUtils]: 36: Hoare triple {90325#(and (<= 29 main_~y~0) (<= main_~y~0 29))} ~z~0 := ~y~0; {90326#(and (<= (div main_~z~0 4294967296) 0) (<= 29 main_~z~0))} is VALID [2022-04-28 10:15:24,949 INFO L290 TraceCheckUtils]: 37: Hoare triple {90326#(and (<= (div main_~z~0 4294967296) 0) (<= 29 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {90292#false} is VALID [2022-04-28 10:15:24,949 INFO L290 TraceCheckUtils]: 38: Hoare triple {90292#false} assume !(~y~0 % 4294967296 > 0); {90292#false} is VALID [2022-04-28 10:15:24,949 INFO L272 TraceCheckUtils]: 39: Hoare triple {90292#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {90292#false} is VALID [2022-04-28 10:15:24,949 INFO L290 TraceCheckUtils]: 40: Hoare triple {90292#false} ~cond := #in~cond; {90292#false} is VALID [2022-04-28 10:15:24,949 INFO L290 TraceCheckUtils]: 41: Hoare triple {90292#false} assume 0 == ~cond; {90292#false} is VALID [2022-04-28 10:15:24,949 INFO L290 TraceCheckUtils]: 42: Hoare triple {90292#false} assume !false; {90292#false} is VALID [2022-04-28 10:15:24,949 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:15:24,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:15:24,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042330996] [2022-04-28 10:15:24,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042330996] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:15:24,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [975722947] [2022-04-28 10:15:24,950 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:15:24,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:15:24,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:15:24,951 INFO L229 MonitoredProcess]: Starting monitored process 101 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:15:24,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (101)] Waiting until timeout for monitored process [2022-04-28 10:15:25,006 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:15:25,006 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:15:25,008 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 63 conjunts are in the unsatisfiable core [2022-04-28 10:15:25,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:15:25,017 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:15:25,409 INFO L272 TraceCheckUtils]: 0: Hoare triple {90291#true} call ULTIMATE.init(); {90291#true} is VALID [2022-04-28 10:15:25,409 INFO L290 TraceCheckUtils]: 1: Hoare triple {90291#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(10, 2);call #Ultimate.allocInit(12, 3); {90291#true} is VALID [2022-04-28 10:15:25,409 INFO L290 TraceCheckUtils]: 2: Hoare triple {90291#true} assume true; {90291#true} is VALID [2022-04-28 10:15:25,409 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {90291#true} {90291#true} #61#return; {90291#true} is VALID [2022-04-28 10:15:25,409 INFO L272 TraceCheckUtils]: 4: Hoare triple {90291#true} call #t~ret11 := main(); {90291#true} is VALID [2022-04-28 10:15:25,409 INFO L290 TraceCheckUtils]: 5: Hoare triple {90291#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {90296#(= main_~y~0 0)} is VALID [2022-04-28 10:15:25,409 INFO L290 TraceCheckUtils]: 6: Hoare triple {90296#(= 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; {90297#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:15:25,410 INFO L290 TraceCheckUtils]: 7: Hoare triple {90297#(and (<= 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; {90298#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:15:25,410 INFO L290 TraceCheckUtils]: 8: Hoare triple {90298#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {90299#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:15:25,411 INFO L290 TraceCheckUtils]: 9: Hoare triple {90299#(and (<= main_~y~0 3) (<= 3 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; {90300#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:15:25,411 INFO L290 TraceCheckUtils]: 10: Hoare triple {90300#(and (<= main_~y~0 4) (<= 4 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; {90301#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:15:25,412 INFO L290 TraceCheckUtils]: 11: Hoare triple {90301#(and (<= 5 main_~y~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; {90302#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:15:25,412 INFO L290 TraceCheckUtils]: 12: Hoare triple {90302#(and (<= main_~y~0 6) (<= 6 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; {90303#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:15:25,413 INFO L290 TraceCheckUtils]: 13: Hoare triple {90303#(and (<= 7 main_~y~0) (<= main_~y~0 7))} 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; {90304#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:15:25,413 INFO L290 TraceCheckUtils]: 14: Hoare triple {90304#(and (<= main_~y~0 8) (<= 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; {90305#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:15:25,414 INFO L290 TraceCheckUtils]: 15: Hoare triple {90305#(and (<= 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; {90306#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:15:25,414 INFO L290 TraceCheckUtils]: 16: Hoare triple {90306#(and (<= main_~y~0 10) (<= 10 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; {90307#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:15:25,415 INFO L290 TraceCheckUtils]: 17: Hoare triple {90307#(and (<= main_~y~0 11) (<= 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; {90308#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:15:25,415 INFO L290 TraceCheckUtils]: 18: Hoare triple {90308#(and (<= 12 main_~y~0) (<= main_~y~0 12))} 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; {90309#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:15:25,416 INFO L290 TraceCheckUtils]: 19: Hoare triple {90309#(and (<= main_~y~0 13) (<= 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; {90310#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-28 10:15:25,416 INFO L290 TraceCheckUtils]: 20: Hoare triple {90310#(and (<= 14 main_~y~0) (<= main_~y~0 14))} 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; {90311#(and (<= main_~y~0 15) (<= 15 main_~y~0))} is VALID [2022-04-28 10:15:25,417 INFO L290 TraceCheckUtils]: 21: Hoare triple {90311#(and (<= main_~y~0 15) (<= 15 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; {90312#(and (<= 16 main_~y~0) (<= main_~y~0 16))} is VALID [2022-04-28 10:15:25,417 INFO L290 TraceCheckUtils]: 22: Hoare triple {90312#(and (<= 16 main_~y~0) (<= main_~y~0 16))} 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; {90313#(and (<= main_~y~0 17) (<= 17 main_~y~0))} is VALID [2022-04-28 10:15:25,418 INFO L290 TraceCheckUtils]: 23: Hoare triple {90313#(and (<= main_~y~0 17) (<= 17 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; {90314#(and (<= 18 main_~y~0) (<= main_~y~0 18))} is VALID [2022-04-28 10:15:25,418 INFO L290 TraceCheckUtils]: 24: Hoare triple {90314#(and (<= 18 main_~y~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; {90315#(and (<= 19 main_~y~0) (<= main_~y~0 19))} is VALID [2022-04-28 10:15:25,419 INFO L290 TraceCheckUtils]: 25: Hoare triple {90315#(and (<= 19 main_~y~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; {90316#(and (<= 20 main_~y~0) (<= main_~y~0 20))} is VALID [2022-04-28 10:15:25,419 INFO L290 TraceCheckUtils]: 26: Hoare triple {90316#(and (<= 20 main_~y~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; {90317#(and (<= main_~y~0 21) (<= 21 main_~y~0))} is VALID [2022-04-28 10:15:25,420 INFO L290 TraceCheckUtils]: 27: Hoare triple {90317#(and (<= main_~y~0 21) (<= 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; {90318#(and (<= main_~y~0 22) (<= 22 main_~y~0))} is VALID [2022-04-28 10:15:25,420 INFO L290 TraceCheckUtils]: 28: Hoare triple {90318#(and (<= main_~y~0 22) (<= 22 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; {90319#(and (<= main_~y~0 23) (<= 23 main_~y~0))} is VALID [2022-04-28 10:15:25,421 INFO L290 TraceCheckUtils]: 29: Hoare triple {90319#(and (<= main_~y~0 23) (<= 23 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; {90320#(and (<= 24 main_~y~0) (<= main_~y~0 24))} is VALID [2022-04-28 10:15:25,421 INFO L290 TraceCheckUtils]: 30: Hoare triple {90320#(and (<= 24 main_~y~0) (<= main_~y~0 24))} 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; {90321#(and (<= 25 main_~y~0) (<= main_~y~0 25))} is VALID [2022-04-28 10:15:25,422 INFO L290 TraceCheckUtils]: 31: Hoare triple {90321#(and (<= 25 main_~y~0) (<= main_~y~0 25))} 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; {90322#(and (<= main_~y~0 26) (<= 26 main_~y~0))} is VALID [2022-04-28 10:15:25,422 INFO L290 TraceCheckUtils]: 32: Hoare triple {90322#(and (<= main_~y~0 26) (<= 26 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; {90323#(and (<= main_~y~0 27) (<= 27 main_~y~0))} is VALID [2022-04-28 10:15:25,423 INFO L290 TraceCheckUtils]: 33: Hoare triple {90323#(and (<= main_~y~0 27) (<= 27 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; {90324#(and (<= main_~y~0 28) (<= 28 main_~y~0))} is VALID [2022-04-28 10:15:25,423 INFO L290 TraceCheckUtils]: 34: Hoare triple {90324#(and (<= main_~y~0 28) (<= 28 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; {90325#(and (<= 29 main_~y~0) (<= main_~y~0 29))} is VALID [2022-04-28 10:15:25,423 INFO L290 TraceCheckUtils]: 35: Hoare triple {90325#(and (<= 29 main_~y~0) (<= main_~y~0 29))} assume !(~x~0 % 4294967296 > 0); {90325#(and (<= 29 main_~y~0) (<= main_~y~0 29))} is VALID [2022-04-28 10:15:25,424 INFO L290 TraceCheckUtils]: 36: Hoare triple {90325#(and (<= 29 main_~y~0) (<= main_~y~0 29))} ~z~0 := ~y~0; {90439#(and (<= main_~z~0 29) (<= 29 main_~z~0))} is VALID [2022-04-28 10:15:25,424 INFO L290 TraceCheckUtils]: 37: Hoare triple {90439#(and (<= main_~z~0 29) (<= 29 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {90292#false} is VALID [2022-04-28 10:15:25,424 INFO L290 TraceCheckUtils]: 38: Hoare triple {90292#false} assume !(~y~0 % 4294967296 > 0); {90292#false} is VALID [2022-04-28 10:15:25,424 INFO L272 TraceCheckUtils]: 39: Hoare triple {90292#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {90292#false} is VALID [2022-04-28 10:15:25,424 INFO L290 TraceCheckUtils]: 40: Hoare triple {90292#false} ~cond := #in~cond; {90292#false} is VALID [2022-04-28 10:15:25,424 INFO L290 TraceCheckUtils]: 41: Hoare triple {90292#false} assume 0 == ~cond; {90292#false} is VALID [2022-04-28 10:15:25,424 INFO L290 TraceCheckUtils]: 42: Hoare triple {90292#false} assume !false; {90292#false} is VALID [2022-04-28 10:15:25,425 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:15:25,425 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:15:26,904 INFO L290 TraceCheckUtils]: 42: Hoare triple {90292#false} assume !false; {90292#false} is VALID [2022-04-28 10:15:26,904 INFO L290 TraceCheckUtils]: 41: Hoare triple {90292#false} assume 0 == ~cond; {90292#false} is VALID [2022-04-28 10:15:26,904 INFO L290 TraceCheckUtils]: 40: Hoare triple {90292#false} ~cond := #in~cond; {90292#false} is VALID [2022-04-28 10:15:26,904 INFO L272 TraceCheckUtils]: 39: Hoare triple {90292#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {90292#false} is VALID [2022-04-28 10:15:26,904 INFO L290 TraceCheckUtils]: 38: Hoare triple {90292#false} assume !(~y~0 % 4294967296 > 0); {90292#false} is VALID [2022-04-28 10:15:26,904 INFO L290 TraceCheckUtils]: 37: Hoare triple {90473#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {90292#false} is VALID [2022-04-28 10:15:26,905 INFO L290 TraceCheckUtils]: 36: Hoare triple {90477#(< 0 (mod main_~y~0 4294967296))} ~z~0 := ~y~0; {90473#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:15:26,905 INFO L290 TraceCheckUtils]: 35: Hoare triple {90477#(< 0 (mod main_~y~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {90477#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:15:26,906 INFO L290 TraceCheckUtils]: 34: Hoare triple {90484#(< 0 (mod (+ main_~y~0 1) 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; {90477#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:15:26,906 INFO L290 TraceCheckUtils]: 33: Hoare triple {90488#(< 0 (mod (+ main_~y~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; {90484#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:15:26,907 INFO L290 TraceCheckUtils]: 32: Hoare triple {90492#(< 0 (mod (+ main_~y~0 3) 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; {90488#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:15:26,908 INFO L290 TraceCheckUtils]: 31: Hoare triple {90496#(< 0 (mod (+ main_~y~0 4) 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; {90492#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:15:26,908 INFO L290 TraceCheckUtils]: 30: Hoare triple {90500#(< 0 (mod (+ 5 main_~y~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; {90496#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:15:26,909 INFO L290 TraceCheckUtils]: 29: Hoare triple {90504#(< 0 (mod (+ main_~y~0 6) 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; {90500#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:15:26,910 INFO L290 TraceCheckUtils]: 28: Hoare triple {90508#(< 0 (mod (+ 7 main_~y~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; {90504#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:15:26,910 INFO L290 TraceCheckUtils]: 27: Hoare triple {90512#(< 0 (mod (+ main_~y~0 8) 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; {90508#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:15:26,911 INFO L290 TraceCheckUtils]: 26: Hoare triple {90516#(< 0 (mod (+ main_~y~0 9) 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; {90512#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:15:26,911 INFO L290 TraceCheckUtils]: 25: Hoare triple {90520#(< 0 (mod (+ main_~y~0 10) 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; {90516#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:15:26,912 INFO L290 TraceCheckUtils]: 24: Hoare triple {90524#(< 0 (mod (+ main_~y~0 11) 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; {90520#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-28 10:15:26,913 INFO L290 TraceCheckUtils]: 23: Hoare triple {90528#(< 0 (mod (+ main_~y~0 12) 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; {90524#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-28 10:15:26,913 INFO L290 TraceCheckUtils]: 22: Hoare triple {90532#(< 0 (mod (+ main_~y~0 13) 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; {90528#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-28 10:15:26,914 INFO L290 TraceCheckUtils]: 21: Hoare triple {90536#(< 0 (mod (+ main_~y~0 14) 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; {90532#(< 0 (mod (+ main_~y~0 13) 4294967296))} is VALID [2022-04-28 10:15:26,914 INFO L290 TraceCheckUtils]: 20: Hoare triple {90540#(< 0 (mod (+ main_~y~0 15) 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; {90536#(< 0 (mod (+ main_~y~0 14) 4294967296))} is VALID [2022-04-28 10:15:26,915 INFO L290 TraceCheckUtils]: 19: Hoare triple {90544#(< 0 (mod (+ main_~y~0 16) 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; {90540#(< 0 (mod (+ main_~y~0 15) 4294967296))} is VALID [2022-04-28 10:15:26,916 INFO L290 TraceCheckUtils]: 18: Hoare triple {90548#(< 0 (mod (+ main_~y~0 17) 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; {90544#(< 0 (mod (+ main_~y~0 16) 4294967296))} is VALID [2022-04-28 10:15:26,916 INFO L290 TraceCheckUtils]: 17: Hoare triple {90552#(< 0 (mod (+ main_~y~0 18) 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; {90548#(< 0 (mod (+ main_~y~0 17) 4294967296))} is VALID [2022-04-28 10:15:26,917 INFO L290 TraceCheckUtils]: 16: Hoare triple {90556#(< 0 (mod (+ 19 main_~y~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; {90552#(< 0 (mod (+ main_~y~0 18) 4294967296))} is VALID [2022-04-28 10:15:26,918 INFO L290 TraceCheckUtils]: 15: Hoare triple {90560#(< 0 (mod (+ main_~y~0 20) 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; {90556#(< 0 (mod (+ 19 main_~y~0) 4294967296))} is VALID [2022-04-28 10:15:26,918 INFO L290 TraceCheckUtils]: 14: Hoare triple {90564#(< 0 (mod (+ main_~y~0 21) 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; {90560#(< 0 (mod (+ main_~y~0 20) 4294967296))} is VALID [2022-04-28 10:15:26,919 INFO L290 TraceCheckUtils]: 13: Hoare triple {90568#(< 0 (mod (+ main_~y~0 22) 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; {90564#(< 0 (mod (+ main_~y~0 21) 4294967296))} is VALID [2022-04-28 10:15:26,919 INFO L290 TraceCheckUtils]: 12: Hoare triple {90572#(< 0 (mod (+ 23 main_~y~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; {90568#(< 0 (mod (+ main_~y~0 22) 4294967296))} is VALID [2022-04-28 10:15:26,920 INFO L290 TraceCheckUtils]: 11: Hoare triple {90576#(< 0 (mod (+ main_~y~0 24) 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; {90572#(< 0 (mod (+ 23 main_~y~0) 4294967296))} is VALID [2022-04-28 10:15:26,921 INFO L290 TraceCheckUtils]: 10: Hoare triple {90580#(< 0 (mod (+ main_~y~0 25) 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; {90576#(< 0 (mod (+ main_~y~0 24) 4294967296))} is VALID [2022-04-28 10:15:26,921 INFO L290 TraceCheckUtils]: 9: Hoare triple {90584#(< 0 (mod (+ main_~y~0 26) 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; {90580#(< 0 (mod (+ main_~y~0 25) 4294967296))} is VALID [2022-04-28 10:15:26,922 INFO L290 TraceCheckUtils]: 8: Hoare triple {90588#(< 0 (mod (+ main_~y~0 27) 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; {90584#(< 0 (mod (+ main_~y~0 26) 4294967296))} is VALID [2022-04-28 10:15:26,922 INFO L290 TraceCheckUtils]: 7: Hoare triple {90592#(< 0 (mod (+ main_~y~0 28) 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; {90588#(< 0 (mod (+ main_~y~0 27) 4294967296))} is VALID [2022-04-28 10:15:26,923 INFO L290 TraceCheckUtils]: 6: Hoare triple {90596#(< 0 (mod (+ 29 main_~y~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; {90592#(< 0 (mod (+ main_~y~0 28) 4294967296))} is VALID [2022-04-28 10:15:26,923 INFO L290 TraceCheckUtils]: 5: Hoare triple {90291#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {90596#(< 0 (mod (+ 29 main_~y~0) 4294967296))} is VALID [2022-04-28 10:15:26,924 INFO L272 TraceCheckUtils]: 4: Hoare triple {90291#true} call #t~ret11 := main(); {90291#true} is VALID [2022-04-28 10:15:26,924 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {90291#true} {90291#true} #61#return; {90291#true} is VALID [2022-04-28 10:15:26,924 INFO L290 TraceCheckUtils]: 2: Hoare triple {90291#true} assume true; {90291#true} is VALID [2022-04-28 10:15:26,924 INFO L290 TraceCheckUtils]: 1: Hoare triple {90291#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(10, 2);call #Ultimate.allocInit(12, 3); {90291#true} is VALID [2022-04-28 10:15:26,924 INFO L272 TraceCheckUtils]: 0: Hoare triple {90291#true} call ULTIMATE.init(); {90291#true} is VALID [2022-04-28 10:15:26,924 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:15:26,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [975722947] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:15:26,924 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:15:26,924 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 33, 33] total 66 [2022-04-28 10:15:26,924 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:15:26,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [476270725] [2022-04-28 10:15:26,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [476270725] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:15:26,924 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:15:26,924 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2022-04-28 10:15:26,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976991072] [2022-04-28 10:15:26,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:15:26,925 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.1470588235294117) internal successors, (39), 33 states have internal predecessors, (39), 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 43 [2022-04-28 10:15:26,925 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:15:26,925 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 34 states, 34 states have (on average 1.1470588235294117) internal successors, (39), 33 states have internal predecessors, (39), 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-28 10:15:26,947 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:15:26,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-04-28 10:15:26,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:15:26,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-04-28 10:15:26,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1031, Invalid=3259, Unknown=0, NotChecked=0, Total=4290 [2022-04-28 10:15:26,948 INFO L87 Difference]: Start difference. First operand 155 states and 195 transitions. Second operand has 34 states, 34 states have (on average 1.1470588235294117) internal successors, (39), 33 states have internal predecessors, (39), 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-28 10:15:33,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:15:33,691 INFO L93 Difference]: Finished difference Result 196 states and 269 transitions. [2022-04-28 10:15:33,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-04-28 10:15:33,691 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.1470588235294117) internal successors, (39), 33 states have internal predecessors, (39), 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 43 [2022-04-28 10:15:33,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:15:33,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.1470588235294117) internal successors, (39), 33 states have internal predecessors, (39), 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-28 10:15:33,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 196 transitions. [2022-04-28 10:15:33,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.1470588235294117) internal successors, (39), 33 states have internal predecessors, (39), 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-28 10:15:33,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 196 transitions. [2022-04-28 10:15:33,693 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 196 transitions. [2022-04-28 10:15:33,842 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 196 edges. 196 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:15:33,844 INFO L225 Difference]: With dead ends: 196 [2022-04-28 10:15:33,844 INFO L226 Difference]: Without dead ends: 190 [2022-04-28 10:15:33,844 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 556 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2087, Invalid=7225, Unknown=0, NotChecked=0, Total=9312 [2022-04-28 10:15:33,844 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 172 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 4437 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 4560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 4437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-04-28 10:15:33,844 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 226 Invalid, 4560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 4437 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-04-28 10:15:33,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2022-04-28 10:15:34,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 160. [2022-04-28 10:15:34,018 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:15:34,018 INFO L82 GeneralOperation]: Start isEquivalent. First operand 190 states. Second operand has 160 states, 155 states have (on average 1.2774193548387096) internal successors, (198), 155 states have internal predecessors, (198), 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-28 10:15:34,019 INFO L74 IsIncluded]: Start isIncluded. First operand 190 states. Second operand has 160 states, 155 states have (on average 1.2774193548387096) internal successors, (198), 155 states have internal predecessors, (198), 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-28 10:15:34,019 INFO L87 Difference]: Start difference. First operand 190 states. Second operand has 160 states, 155 states have (on average 1.2774193548387096) internal successors, (198), 155 states have internal predecessors, (198), 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-28 10:15:34,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:15:34,020 INFO L93 Difference]: Finished difference Result 190 states and 232 transitions. [2022-04-28 10:15:34,020 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 232 transitions. [2022-04-28 10:15:34,020 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:15:34,021 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:15:34,021 INFO L74 IsIncluded]: Start isIncluded. First operand has 160 states, 155 states have (on average 1.2774193548387096) internal successors, (198), 155 states have internal predecessors, (198), 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 190 states. [2022-04-28 10:15:34,021 INFO L87 Difference]: Start difference. First operand has 160 states, 155 states have (on average 1.2774193548387096) internal successors, (198), 155 states have internal predecessors, (198), 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 190 states. [2022-04-28 10:15:34,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:15:34,022 INFO L93 Difference]: Finished difference Result 190 states and 232 transitions. [2022-04-28 10:15:34,022 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 232 transitions. [2022-04-28 10:15:34,022 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:15:34,022 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:15:34,022 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:15:34,022 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:15:34,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 155 states have (on average 1.2774193548387096) internal successors, (198), 155 states have internal predecessors, (198), 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-28 10:15:34,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 202 transitions. [2022-04-28 10:15:34,024 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 202 transitions. Word has length 43 [2022-04-28 10:15:34,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:15:34,024 INFO L495 AbstractCegarLoop]: Abstraction has 160 states and 202 transitions. [2022-04-28 10:15:34,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 1.1470588235294117) internal successors, (39), 33 states have internal predecessors, (39), 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-28 10:15:34,024 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 160 states and 202 transitions. [2022-04-28 10:15:35,642 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 202 edges. 202 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:15:35,642 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 202 transitions. [2022-04-28 10:15:35,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-28 10:15:35,642 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:15:35,642 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:15:35,659 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (101)] Forceful destruction successful, exit code 0 [2022-04-28 10:15:35,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable100,101 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:15:35,843 INFO L420 AbstractCegarLoop]: === Iteration 102 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:15:35,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:15:35,843 INFO L85 PathProgramCache]: Analyzing trace with hash 60430093, now seen corresponding path program 143 times [2022-04-28 10:15:35,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:15:35,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1866842039] [2022-04-28 10:15:35,845 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:15:35,845 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:15:35,845 INFO L85 PathProgramCache]: Analyzing trace with hash 60430093, now seen corresponding path program 144 times [2022-04-28 10:15:35,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:15:35,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854398833] [2022-04-28 10:15:35,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:15:35,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:15:35,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:15:36,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:15:36,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:15:36,890 INFO L290 TraceCheckUtils]: 0: Hoare triple {91802#(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(10, 2);call #Ultimate.allocInit(12, 3); {91771#true} is VALID [2022-04-28 10:15:36,890 INFO L290 TraceCheckUtils]: 1: Hoare triple {91771#true} assume true; {91771#true} is VALID [2022-04-28 10:15:36,890 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {91771#true} {91771#true} #61#return; {91771#true} is VALID [2022-04-28 10:15:36,890 INFO L272 TraceCheckUtils]: 0: Hoare triple {91771#true} call ULTIMATE.init(); {91802#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:15:36,890 INFO L290 TraceCheckUtils]: 1: Hoare triple {91802#(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(10, 2);call #Ultimate.allocInit(12, 3); {91771#true} is VALID [2022-04-28 10:15:36,890 INFO L290 TraceCheckUtils]: 2: Hoare triple {91771#true} assume true; {91771#true} is VALID [2022-04-28 10:15:36,890 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {91771#true} {91771#true} #61#return; {91771#true} is VALID [2022-04-28 10:15:36,890 INFO L272 TraceCheckUtils]: 4: Hoare triple {91771#true} call #t~ret11 := main(); {91771#true} is VALID [2022-04-28 10:15:36,891 INFO L290 TraceCheckUtils]: 5: Hoare triple {91771#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {91776#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-28 10:15:36,892 INFO L290 TraceCheckUtils]: 6: Hoare triple {91776#(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; {91777#(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-28 10:15:36,900 INFO L290 TraceCheckUtils]: 7: Hoare triple {91777#(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; {91778#(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-28 10:15:37,196 INFO L290 TraceCheckUtils]: 8: Hoare triple {91778#(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; {91779#(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-28 10:15:37,312 INFO L290 TraceCheckUtils]: 9: Hoare triple {91779#(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; {91780#(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-28 10:15:37,369 INFO L290 TraceCheckUtils]: 10: Hoare triple {91780#(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; {91781#(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-28 10:15:37,372 INFO L290 TraceCheckUtils]: 11: Hoare triple {91781#(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; {91782#(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-28 10:15:37,374 INFO L290 TraceCheckUtils]: 12: Hoare triple {91782#(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; {91783#(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-28 10:15:37,382 INFO L290 TraceCheckUtils]: 13: Hoare triple {91783#(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; {91784#(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-28 10:15:37,385 INFO L290 TraceCheckUtils]: 14: Hoare triple {91784#(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; {91785#(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-28 10:15:37,390 INFO L290 TraceCheckUtils]: 15: Hoare triple {91785#(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; {91786#(and (<= main_~y~0 10) (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~x~0) (* (- 1) main_~y~0) (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296) 10) main_~n~0) (<= 10 main_~y~0) (<= main_~n~0 (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) 4294967295)))} is VALID [2022-04-28 10:15:37,391 INFO L290 TraceCheckUtils]: 16: Hoare triple {91786#(and (<= main_~y~0 10) (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~x~0) (* (- 1) main_~y~0) (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296) 10) main_~n~0) (<= 10 main_~y~0) (<= main_~n~0 (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) 4294967295)))} assume !(~x~0 % 4294967296 > 0); {91787#(and (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) 10) main_~n~0) (<= main_~y~0 10))} is VALID [2022-04-28 10:15:37,391 INFO L290 TraceCheckUtils]: 17: Hoare triple {91787#(and (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) 10) main_~n~0) (<= main_~y~0 10))} ~z~0 := ~y~0; {91788#(and (<= main_~z~0 10) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 10) main_~n~0))} is VALID [2022-04-28 10:15:37,392 INFO L290 TraceCheckUtils]: 18: Hoare triple {91788#(and (<= main_~z~0 10) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 10) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {91789#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 10) main_~n~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:15:37,393 INFO L290 TraceCheckUtils]: 19: Hoare triple {91789#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 10) main_~n~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {91790#(and (<= main_~z~0 8) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 10) main_~n~0))} is VALID [2022-04-28 10:15:37,394 INFO L290 TraceCheckUtils]: 20: Hoare triple {91790#(and (<= main_~z~0 8) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 10) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {91791#(and (<= main_~z~0 7) (<= (+ (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 10) main_~n~0))} is VALID [2022-04-28 10:15:37,395 INFO L290 TraceCheckUtils]: 21: Hoare triple {91791#(and (<= main_~z~0 7) (<= (+ (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 10) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {91792#(and (<= main_~z~0 6) (<= (+ (* (div (+ 4294967291 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 10) main_~n~0))} is VALID [2022-04-28 10:15:37,396 INFO L290 TraceCheckUtils]: 22: Hoare triple {91792#(and (<= main_~z~0 6) (<= (+ (* (div (+ 4294967291 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 10) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {91793#(and (<= main_~z~0 5) (<= (+ 10 (* (div (+ 4294967290 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} is VALID [2022-04-28 10:15:37,397 INFO L290 TraceCheckUtils]: 23: Hoare triple {91793#(and (<= main_~z~0 5) (<= (+ 10 (* (div (+ 4294967290 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {91794#(and (<= main_~z~0 4) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967289) 4294967296) 4294967296) 10) main_~n~0))} is VALID [2022-04-28 10:15:37,398 INFO L290 TraceCheckUtils]: 24: Hoare triple {91794#(and (<= main_~z~0 4) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967289) 4294967296) 4294967296) 10) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {91795#(and (<= (+ (* (div (+ 4294967288 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 10) main_~n~0) (<= main_~z~0 3))} is VALID [2022-04-28 10:15:37,399 INFO L290 TraceCheckUtils]: 25: Hoare triple {91795#(and (<= (+ (* (div (+ 4294967288 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 10) main_~n~0) (<= main_~z~0 3))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {91796#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967287) 4294967296) 4294967296) 10) main_~n~0) (<= main_~z~0 2))} is VALID [2022-04-28 10:15:37,400 INFO L290 TraceCheckUtils]: 26: Hoare triple {91796#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967287) 4294967296) 4294967296) 10) main_~n~0) (<= main_~z~0 2))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {91797#(and (<= main_~z~0 1) (<= (+ 10 (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967286) 4294967296) 4294967296)) main_~n~0))} is VALID [2022-04-28 10:15:37,401 INFO L290 TraceCheckUtils]: 27: Hoare triple {91797#(and (<= main_~z~0 1) (<= (+ 10 (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967286) 4294967296) 4294967296)) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {91798#(and (<= main_~z~0 0) (<= (+ 10 (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967285) 4294967296) 4294967296)) main_~n~0))} is VALID [2022-04-28 10:15:37,401 INFO L290 TraceCheckUtils]: 28: Hoare triple {91798#(and (<= main_~z~0 0) (<= (+ 10 (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967285) 4294967296) 4294967296)) main_~n~0))} assume !(~z~0 % 4294967296 > 0); {91798#(and (<= main_~z~0 0) (<= (+ 10 (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967285) 4294967296) 4294967296)) main_~n~0))} is VALID [2022-04-28 10:15:37,402 INFO L290 TraceCheckUtils]: 29: Hoare triple {91798#(and (<= main_~z~0 0) (<= (+ 10 (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967285) 4294967296) 4294967296)) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {91797#(and (<= main_~z~0 1) (<= (+ 10 (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967286) 4294967296) 4294967296)) main_~n~0))} is VALID [2022-04-28 10:15:37,403 INFO L290 TraceCheckUtils]: 30: Hoare triple {91797#(and (<= main_~z~0 1) (<= (+ 10 (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967286) 4294967296) 4294967296)) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {91796#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967287) 4294967296) 4294967296) 10) main_~n~0) (<= main_~z~0 2))} is VALID [2022-04-28 10:15:37,404 INFO L290 TraceCheckUtils]: 31: Hoare triple {91796#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967287) 4294967296) 4294967296) 10) main_~n~0) (<= main_~z~0 2))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {91795#(and (<= (+ (* (div (+ 4294967288 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 10) main_~n~0) (<= main_~z~0 3))} is VALID [2022-04-28 10:15:37,405 INFO L290 TraceCheckUtils]: 32: Hoare triple {91795#(and (<= (+ (* (div (+ 4294967288 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 10) main_~n~0) (<= main_~z~0 3))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {91794#(and (<= main_~z~0 4) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967289) 4294967296) 4294967296) 10) main_~n~0))} is VALID [2022-04-28 10:15:37,405 INFO L290 TraceCheckUtils]: 33: Hoare triple {91794#(and (<= main_~z~0 4) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967289) 4294967296) 4294967296) 10) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {91793#(and (<= main_~z~0 5) (<= (+ 10 (* (div (+ 4294967290 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} is VALID [2022-04-28 10:15:37,406 INFO L290 TraceCheckUtils]: 34: Hoare triple {91793#(and (<= main_~z~0 5) (<= (+ 10 (* (div (+ 4294967290 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {91792#(and (<= main_~z~0 6) (<= (+ (* (div (+ 4294967291 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 10) main_~n~0))} is VALID [2022-04-28 10:15:37,407 INFO L290 TraceCheckUtils]: 35: Hoare triple {91792#(and (<= main_~z~0 6) (<= (+ (* (div (+ 4294967291 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 10) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {91791#(and (<= main_~z~0 7) (<= (+ (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 10) main_~n~0))} is VALID [2022-04-28 10:15:37,408 INFO L290 TraceCheckUtils]: 36: Hoare triple {91791#(and (<= main_~z~0 7) (<= (+ (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 10) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {91790#(and (<= main_~z~0 8) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 10) main_~n~0))} is VALID [2022-04-28 10:15:37,409 INFO L290 TraceCheckUtils]: 37: Hoare triple {91790#(and (<= main_~z~0 8) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 10) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {91789#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 10) main_~n~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:15:37,411 INFO L290 TraceCheckUtils]: 38: Hoare triple {91789#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 10) main_~n~0) (<= main_~z~0 9))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {91799#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-28 10:15:37,411 INFO L290 TraceCheckUtils]: 39: Hoare triple {91799#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {91799#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-28 10:15:37,412 INFO L272 TraceCheckUtils]: 40: Hoare triple {91799#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {91800#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:15:37,412 INFO L290 TraceCheckUtils]: 41: Hoare triple {91800#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {91801#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 10:15:37,412 INFO L290 TraceCheckUtils]: 42: Hoare triple {91801#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {91772#false} is VALID [2022-04-28 10:15:37,412 INFO L290 TraceCheckUtils]: 43: Hoare triple {91772#false} assume !false; {91772#false} is VALID [2022-04-28 10:15:37,413 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 165 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:15:37,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:15:37,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854398833] [2022-04-28 10:15:37,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854398833] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:15:37,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [883424048] [2022-04-28 10:15:37,413 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:15:37,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:15:37,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:15:37,414 INFO L229 MonitoredProcess]: Starting monitored process 102 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:15:37,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (102)] Waiting until timeout for monitored process [2022-04-28 10:15:37,894 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-04-28 10:15:37,894 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:15:37,897 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 93 conjunts are in the unsatisfiable core [2022-04-28 10:15:37,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:15:37,923 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:16:03,854 INFO L272 TraceCheckUtils]: 0: Hoare triple {91771#true} call ULTIMATE.init(); {91771#true} is VALID [2022-04-28 10:16:03,854 INFO L290 TraceCheckUtils]: 1: Hoare triple {91771#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(10, 2);call #Ultimate.allocInit(12, 3); {91771#true} is VALID [2022-04-28 10:16:03,854 INFO L290 TraceCheckUtils]: 2: Hoare triple {91771#true} assume true; {91771#true} is VALID [2022-04-28 10:16:03,854 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {91771#true} {91771#true} #61#return; {91771#true} is VALID [2022-04-28 10:16:03,854 INFO L272 TraceCheckUtils]: 4: Hoare triple {91771#true} call #t~ret11 := main(); {91771#true} is VALID [2022-04-28 10:16:03,855 INFO L290 TraceCheckUtils]: 5: Hoare triple {91771#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {91776#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-28 10:16:03,856 INFO L290 TraceCheckUtils]: 6: Hoare triple {91776#(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; {91777#(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-28 10:16:03,860 INFO L290 TraceCheckUtils]: 7: Hoare triple {91777#(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; {91778#(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-28 10:16:03,864 INFO L290 TraceCheckUtils]: 8: Hoare triple {91778#(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; {91779#(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-28 10:16:03,866 INFO L290 TraceCheckUtils]: 9: Hoare triple {91779#(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; {91833#(and (<= 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-28 10:16:03,868 INFO L290 TraceCheckUtils]: 10: Hoare triple {91833#(and (<= 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);#t~post5 := ~x~0;~x~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~y~0;~y~0 := 1 + #t~post6;havoc #t~post6; {91837#(and (<= (+ 5 main_~x~0) main_~n~0) (<= main_~x~0 (+ 4294967290 (* (div (+ main_~y~0 main_~x~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= main_~y~0 5))} is VALID [2022-04-28 10:16:03,869 INFO L290 TraceCheckUtils]: 11: Hoare triple {91837#(and (<= (+ 5 main_~x~0) main_~n~0) (<= main_~x~0 (+ 4294967290 (* (div (+ main_~y~0 main_~x~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= 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; {91841#(and (<= main_~y~0 6) (<= main_~x~0 (+ (* (div (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~y~0 main_~x~0 (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967289)) (<= (+ main_~x~0 6) main_~n~0))} is VALID [2022-04-28 10:16:03,870 INFO L290 TraceCheckUtils]: 12: Hoare triple {91841#(and (<= main_~y~0 6) (<= main_~x~0 (+ (* (div (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~y~0 main_~x~0 (* (- 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; {91845#(and (<= (+ 7 main_~x~0) main_~n~0) (<= main_~x~0 (+ 4294967288 (* (div (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~y~0 main_~x~0 (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= main_~y~0 7))} is VALID [2022-04-28 10:16:03,872 INFO L290 TraceCheckUtils]: 13: Hoare triple {91845#(and (<= (+ 7 main_~x~0) main_~n~0) (<= main_~x~0 (+ 4294967288 (* (div (+ (* (div (+ main_~x~0 4) 4294967296) 4294967296) main_~y~0 main_~x~0 (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= main_~y~0 7))} 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; {91849#(and (<= (+ main_~x~0 8) main_~n~0) (<= main_~y~0 8) (<= main_~x~0 (+ 4294967287 (* (div (+ main_~y~0 main_~x~0 (* (div (+ 5 main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} is VALID [2022-04-28 10:16:03,873 INFO L290 TraceCheckUtils]: 14: Hoare triple {91849#(and (<= (+ main_~x~0 8) main_~n~0) (<= main_~y~0 8) (<= main_~x~0 (+ 4294967287 (* (div (+ main_~y~0 main_~x~0 (* (div (+ 5 main_~x~0) 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; {91853#(and (<= (+ main_~x~0 9) main_~n~0) (<= main_~x~0 (+ (* 4294967296 (div (+ main_~y~0 main_~x~0 (* 4294967296 (div (+ main_~x~0 6) 4294967296)) (* (- 1) main_~n~0)) 4294967296)) 4294967286)) (<= main_~y~0 9))} is VALID [2022-04-28 10:16:03,876 INFO L290 TraceCheckUtils]: 15: Hoare triple {91853#(and (<= (+ main_~x~0 9) main_~n~0) (<= main_~x~0 (+ (* 4294967296 (div (+ main_~y~0 main_~x~0 (* 4294967296 (div (+ main_~x~0 6) 4294967296)) (* (- 1) main_~n~0)) 4294967296)) 4294967286)) (<= 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; {91857#(and (<= main_~x~0 (+ 4294967285 (* (div (+ (* (div (+ 7 main_~x~0) 4294967296) 4294967296) main_~y~0 main_~x~0 (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= main_~y~0 10) (<= (+ main_~x~0 10) main_~n~0))} is VALID [2022-04-28 10:16:04,075 INFO L290 TraceCheckUtils]: 16: Hoare triple {91857#(and (<= main_~x~0 (+ 4294967285 (* (div (+ (* (div (+ 7 main_~x~0) 4294967296) 4294967296) main_~y~0 main_~x~0 (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= main_~y~0 10) (<= (+ main_~x~0 10) main_~n~0))} assume !(~x~0 % 4294967296 > 0); {91787#(and (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) 10) main_~n~0) (<= main_~y~0 10))} is VALID [2022-04-28 10:16:04,075 INFO L290 TraceCheckUtils]: 17: Hoare triple {91787#(and (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) 10) main_~n~0) (<= main_~y~0 10))} ~z~0 := ~y~0; {91788#(and (<= main_~z~0 10) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 10) main_~n~0))} is VALID [2022-04-28 10:16:04,076 INFO L290 TraceCheckUtils]: 18: Hoare triple {91788#(and (<= main_~z~0 10) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 10) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {91789#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 10) main_~n~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:16:04,077 INFO L290 TraceCheckUtils]: 19: Hoare triple {91789#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 10) main_~n~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {91790#(and (<= main_~z~0 8) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 10) main_~n~0))} is VALID [2022-04-28 10:16:04,078 INFO L290 TraceCheckUtils]: 20: Hoare triple {91790#(and (<= main_~z~0 8) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 10) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {91791#(and (<= main_~z~0 7) (<= (+ (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 10) main_~n~0))} is VALID [2022-04-28 10:16:04,079 INFO L290 TraceCheckUtils]: 21: Hoare triple {91791#(and (<= main_~z~0 7) (<= (+ (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 10) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {91792#(and (<= main_~z~0 6) (<= (+ (* (div (+ 4294967291 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 10) main_~n~0))} is VALID [2022-04-28 10:16:04,080 INFO L290 TraceCheckUtils]: 22: Hoare triple {91792#(and (<= main_~z~0 6) (<= (+ (* (div (+ 4294967291 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 10) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {91793#(and (<= main_~z~0 5) (<= (+ 10 (* (div (+ 4294967290 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} is VALID [2022-04-28 10:16:04,081 INFO L290 TraceCheckUtils]: 23: Hoare triple {91793#(and (<= main_~z~0 5) (<= (+ 10 (* (div (+ 4294967290 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {91794#(and (<= main_~z~0 4) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967289) 4294967296) 4294967296) 10) main_~n~0))} is VALID [2022-04-28 10:16:04,081 INFO L290 TraceCheckUtils]: 24: Hoare triple {91794#(and (<= main_~z~0 4) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967289) 4294967296) 4294967296) 10) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {91795#(and (<= (+ (* (div (+ 4294967288 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 10) main_~n~0) (<= main_~z~0 3))} is VALID [2022-04-28 10:16:04,082 INFO L290 TraceCheckUtils]: 25: Hoare triple {91795#(and (<= (+ (* (div (+ 4294967288 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 10) main_~n~0) (<= main_~z~0 3))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {91796#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967287) 4294967296) 4294967296) 10) main_~n~0) (<= main_~z~0 2))} is VALID [2022-04-28 10:16:04,083 INFO L290 TraceCheckUtils]: 26: Hoare triple {91796#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967287) 4294967296) 4294967296) 10) main_~n~0) (<= main_~z~0 2))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {91797#(and (<= main_~z~0 1) (<= (+ 10 (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967286) 4294967296) 4294967296)) main_~n~0))} is VALID [2022-04-28 10:16:04,084 INFO L290 TraceCheckUtils]: 27: Hoare triple {91797#(and (<= main_~z~0 1) (<= (+ 10 (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967286) 4294967296) 4294967296)) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {91798#(and (<= main_~z~0 0) (<= (+ 10 (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967285) 4294967296) 4294967296)) main_~n~0))} is VALID [2022-04-28 10:16:04,085 INFO L290 TraceCheckUtils]: 28: Hoare triple {91798#(and (<= main_~z~0 0) (<= (+ 10 (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967285) 4294967296) 4294967296)) main_~n~0))} assume !(~z~0 % 4294967296 > 0); {91798#(and (<= main_~z~0 0) (<= (+ 10 (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967285) 4294967296) 4294967296)) main_~n~0))} is VALID [2022-04-28 10:16:04,086 INFO L290 TraceCheckUtils]: 29: Hoare triple {91798#(and (<= main_~z~0 0) (<= (+ 10 (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967285) 4294967296) 4294967296)) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {91797#(and (<= main_~z~0 1) (<= (+ 10 (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967286) 4294967296) 4294967296)) main_~n~0))} is VALID [2022-04-28 10:16:04,086 INFO L290 TraceCheckUtils]: 30: Hoare triple {91797#(and (<= main_~z~0 1) (<= (+ 10 (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967286) 4294967296) 4294967296)) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {91796#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967287) 4294967296) 4294967296) 10) main_~n~0) (<= main_~z~0 2))} is VALID [2022-04-28 10:16:04,087 INFO L290 TraceCheckUtils]: 31: Hoare triple {91796#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967287) 4294967296) 4294967296) 10) main_~n~0) (<= main_~z~0 2))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {91795#(and (<= (+ (* (div (+ 4294967288 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 10) main_~n~0) (<= main_~z~0 3))} is VALID [2022-04-28 10:16:04,088 INFO L290 TraceCheckUtils]: 32: Hoare triple {91795#(and (<= (+ (* (div (+ 4294967288 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 10) main_~n~0) (<= main_~z~0 3))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {91794#(and (<= main_~z~0 4) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967289) 4294967296) 4294967296) 10) main_~n~0))} is VALID [2022-04-28 10:16:04,089 INFO L290 TraceCheckUtils]: 33: Hoare triple {91794#(and (<= main_~z~0 4) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967289) 4294967296) 4294967296) 10) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {91793#(and (<= main_~z~0 5) (<= (+ 10 (* (div (+ 4294967290 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} is VALID [2022-04-28 10:16:04,090 INFO L290 TraceCheckUtils]: 34: Hoare triple {91793#(and (<= main_~z~0 5) (<= (+ 10 (* (div (+ 4294967290 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {91792#(and (<= main_~z~0 6) (<= (+ (* (div (+ 4294967291 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 10) main_~n~0))} is VALID [2022-04-28 10:16:04,091 INFO L290 TraceCheckUtils]: 35: Hoare triple {91792#(and (<= main_~z~0 6) (<= (+ (* (div (+ 4294967291 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 10) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {91791#(and (<= main_~z~0 7) (<= (+ (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 10) main_~n~0))} is VALID [2022-04-28 10:16:04,092 INFO L290 TraceCheckUtils]: 36: Hoare triple {91791#(and (<= main_~z~0 7) (<= (+ (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 10) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {91790#(and (<= main_~z~0 8) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 10) main_~n~0))} is VALID [2022-04-28 10:16:04,092 INFO L290 TraceCheckUtils]: 37: Hoare triple {91790#(and (<= main_~z~0 8) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 10) main_~n~0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {91789#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 10) main_~n~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:16:04,093 INFO L290 TraceCheckUtils]: 38: Hoare triple {91789#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 10) main_~n~0) (<= main_~z~0 9))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {91788#(and (<= main_~z~0 10) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 10) main_~n~0))} is VALID [2022-04-28 10:16:04,094 INFO L290 TraceCheckUtils]: 39: Hoare triple {91788#(and (<= main_~z~0 10) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 10) main_~n~0))} assume !(~y~0 % 4294967296 > 0); {91788#(and (<= main_~z~0 10) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 10) main_~n~0))} is VALID [2022-04-28 10:16:04,095 INFO L272 TraceCheckUtils]: 40: Hoare triple {91788#(and (<= main_~z~0 10) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 10) main_~n~0))} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {91933#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:16:04,095 INFO L290 TraceCheckUtils]: 41: Hoare triple {91933#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {91937#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:16:04,096 INFO L290 TraceCheckUtils]: 42: Hoare triple {91937#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {91772#false} is VALID [2022-04-28 10:16:04,096 INFO L290 TraceCheckUtils]: 43: Hoare triple {91772#false} assume !false; {91772#false} is VALID [2022-04-28 10:16:04,096 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 165 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:16:04,096 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:16:28,785 INFO L290 TraceCheckUtils]: 43: Hoare triple {91772#false} assume !false; {91772#false} is VALID [2022-04-28 10:16:28,786 INFO L290 TraceCheckUtils]: 42: Hoare triple {91937#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {91772#false} is VALID [2022-04-28 10:16:28,786 INFO L290 TraceCheckUtils]: 41: Hoare triple {91933#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {91937#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:16:28,787 INFO L272 TraceCheckUtils]: 40: Hoare triple {91799#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {91933#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:16:28,787 INFO L290 TraceCheckUtils]: 39: Hoare triple {91799#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {91799#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-28 10:16:28,788 INFO L290 TraceCheckUtils]: 38: Hoare triple {91959#(and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {91799#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-28 10:16:28,789 INFO L290 TraceCheckUtils]: 37: Hoare triple {91963#(and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {91959#(and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-28 10:16:28,790 INFO L290 TraceCheckUtils]: 36: Hoare triple {91967#(and (< (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {91963#(and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-28 10:16:28,791 INFO L290 TraceCheckUtils]: 35: Hoare triple {91971#(and (< (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) main_~n~0) (+ 5 main_~z~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) main_~n~0)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {91967#(and (< (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296))))} is VALID [2022-04-28 10:16:28,791 INFO L290 TraceCheckUtils]: 34: Hoare triple {91975#(and (<= (+ 5 main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ 5 main_~z~0) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ 5 main_~z~0) 4294967296) 4294967296)) (+ main_~z~0 6 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {91971#(and (< (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) main_~n~0) (+ 5 main_~z~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-28 10:16:28,792 INFO L290 TraceCheckUtils]: 33: Hoare triple {91979#(and (< (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) main_~n~0) (+ 7 main_~z~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 6 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) main_~n~0)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {91975#(and (<= (+ 5 main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ 5 main_~z~0) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ 5 main_~z~0) 4294967296) 4294967296)) (+ main_~z~0 6 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-28 10:16:28,793 INFO L290 TraceCheckUtils]: 32: Hoare triple {91983#(and (< (+ main_~n~0 (* (div (+ 7 main_~z~0) 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 8)) (<= (+ 7 main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ 7 main_~z~0) 4294967296) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {91979#(and (< (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) main_~n~0) (+ 7 main_~z~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 6 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-28 10:16:28,794 INFO L290 TraceCheckUtils]: 31: Hoare triple {91987#(and (< (+ main_~n~0 (* (div (+ main_~z~0 8) 4294967296) 4294967296)) (+ main_~z~0 9 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 8) (+ main_~n~0 (* (div (+ main_~z~0 8) 4294967296) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {91983#(and (< (+ main_~n~0 (* (div (+ 7 main_~z~0) 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 8)) (<= (+ 7 main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ 7 main_~z~0) 4294967296) 4294967296))))} is VALID [2022-04-28 10:16:28,795 INFO L290 TraceCheckUtils]: 30: Hoare triple {91991#(and (<= (+ main_~z~0 9 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~z~0 9) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 9) 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 10)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {91987#(and (< (+ main_~n~0 (* (div (+ main_~z~0 8) 4294967296) 4294967296)) (+ main_~z~0 9 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 8) (+ main_~n~0 (* (div (+ main_~z~0 8) 4294967296) 4294967296))))} is VALID [2022-04-28 10:16:28,796 INFO L290 TraceCheckUtils]: 29: Hoare triple {91995#(and (< (+ main_~n~0 (* (div (+ main_~z~0 10) 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 11)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 10) (+ main_~n~0 (* (div (+ main_~z~0 10) 4294967296) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {91991#(and (<= (+ main_~z~0 9 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~z~0 9) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 9) 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 10)))} is VALID [2022-04-28 10:16:28,796 INFO L290 TraceCheckUtils]: 28: Hoare triple {91995#(and (< (+ main_~n~0 (* (div (+ main_~z~0 10) 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 11)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 10) (+ main_~n~0 (* (div (+ main_~z~0 10) 4294967296) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {91995#(and (< (+ main_~n~0 (* (div (+ main_~z~0 10) 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 11)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 10) (+ main_~n~0 (* (div (+ main_~z~0 10) 4294967296) 4294967296))))} is VALID [2022-04-28 10:16:28,797 INFO L290 TraceCheckUtils]: 27: Hoare triple {91991#(and (<= (+ main_~z~0 9 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~z~0 9) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 9) 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 10)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {91995#(and (< (+ main_~n~0 (* (div (+ main_~z~0 10) 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 11)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 10) (+ main_~n~0 (* (div (+ main_~z~0 10) 4294967296) 4294967296))))} is VALID [2022-04-28 10:16:28,798 INFO L290 TraceCheckUtils]: 26: Hoare triple {91987#(and (< (+ main_~n~0 (* (div (+ main_~z~0 8) 4294967296) 4294967296)) (+ main_~z~0 9 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 8) (+ main_~n~0 (* (div (+ main_~z~0 8) 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {91991#(and (<= (+ main_~z~0 9 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~z~0 9) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 9) 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 10)))} is VALID [2022-04-28 10:16:28,799 INFO L290 TraceCheckUtils]: 25: Hoare triple {91983#(and (< (+ main_~n~0 (* (div (+ 7 main_~z~0) 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 8)) (<= (+ 7 main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ 7 main_~z~0) 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {91987#(and (< (+ main_~n~0 (* (div (+ main_~z~0 8) 4294967296) 4294967296)) (+ main_~z~0 9 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 8) (+ main_~n~0 (* (div (+ main_~z~0 8) 4294967296) 4294967296))))} is VALID [2022-04-28 10:16:28,800 INFO L290 TraceCheckUtils]: 24: Hoare triple {91979#(and (< (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) main_~n~0) (+ 7 main_~z~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 6 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) main_~n~0)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {91983#(and (< (+ main_~n~0 (* (div (+ 7 main_~z~0) 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 8)) (<= (+ 7 main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ 7 main_~z~0) 4294967296) 4294967296))))} is VALID [2022-04-28 10:16:28,800 INFO L290 TraceCheckUtils]: 23: Hoare triple {91975#(and (<= (+ 5 main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ 5 main_~z~0) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ 5 main_~z~0) 4294967296) 4294967296)) (+ main_~z~0 6 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {91979#(and (< (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) main_~n~0) (+ 7 main_~z~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 6 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 6) 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-28 10:16:28,801 INFO L290 TraceCheckUtils]: 22: Hoare triple {91971#(and (< (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) main_~n~0) (+ 5 main_~z~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) main_~n~0)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {91975#(and (<= (+ 5 main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ 5 main_~z~0) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ 5 main_~z~0) 4294967296) 4294967296)) (+ main_~z~0 6 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-28 10:16:28,802 INFO L290 TraceCheckUtils]: 21: Hoare triple {91967#(and (< (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {91971#(and (< (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) main_~n~0) (+ 5 main_~z~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4) (+ (* (div (+ main_~z~0 4) 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-28 10:16:28,803 INFO L290 TraceCheckUtils]: 20: Hoare triple {91963#(and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {91967#(and (< (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~z~0 3) 4294967296) 4294967296))))} is VALID [2022-04-28 10:16:28,804 INFO L290 TraceCheckUtils]: 19: Hoare triple {91959#(and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {91963#(and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-28 10:16:28,805 INFO L290 TraceCheckUtils]: 18: Hoare triple {91799#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {91959#(and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-28 10:16:28,805 INFO L290 TraceCheckUtils]: 17: Hoare triple {92032#(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)))} ~z~0 := ~y~0; {91799#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-28 10:16:28,806 INFO L290 TraceCheckUtils]: 16: Hoare triple {92036#(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); {92032#(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-28 10:16:28,807 INFO L290 TraceCheckUtils]: 15: Hoare triple {92040#(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; {92036#(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-28 10:16:28,809 INFO L290 TraceCheckUtils]: 14: Hoare triple {92044#(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; {92040#(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-28 10:16:28,810 INFO L290 TraceCheckUtils]: 13: Hoare triple {92048#(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; {92044#(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-28 10:16:28,811 INFO L290 TraceCheckUtils]: 12: Hoare triple {92052#(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; {92048#(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-28 10:16:28,812 INFO L290 TraceCheckUtils]: 11: Hoare triple {92056#(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; {92052#(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-28 10:16:28,813 INFO L290 TraceCheckUtils]: 10: Hoare triple {92060#(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; {92056#(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-28 10:16:28,814 INFO L290 TraceCheckUtils]: 9: Hoare triple {92064#(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; {92060#(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-28 10:16:28,815 INFO L290 TraceCheckUtils]: 8: Hoare triple {92068#(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; {92064#(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-28 10:16:28,816 INFO L290 TraceCheckUtils]: 7: Hoare triple {92072#(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; {92068#(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-28 10:16:28,817 INFO L290 TraceCheckUtils]: 6: Hoare triple {92076#(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; {92072#(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-28 10:16:28,818 INFO L290 TraceCheckUtils]: 5: Hoare triple {91771#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {92076#(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-28 10:16:28,818 INFO L272 TraceCheckUtils]: 4: Hoare triple {91771#true} call #t~ret11 := main(); {91771#true} is VALID [2022-04-28 10:16:28,818 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {91771#true} {91771#true} #61#return; {91771#true} is VALID [2022-04-28 10:16:28,819 INFO L290 TraceCheckUtils]: 2: Hoare triple {91771#true} assume true; {91771#true} is VALID [2022-04-28 10:16:28,819 INFO L290 TraceCheckUtils]: 1: Hoare triple {91771#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(10, 2);call #Ultimate.allocInit(12, 3); {91771#true} is VALID [2022-04-28 10:16:28,819 INFO L272 TraceCheckUtils]: 0: Hoare triple {91771#true} call ULTIMATE.init(); {91771#true} is VALID [2022-04-28 10:16:28,819 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 165 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 10:16:28,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [883424048] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:16:28,819 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:16:28,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 27, 27] total 60 [2022-04-28 10:16:28,819 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:16:28,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1866842039] [2022-04-28 10:16:28,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1866842039] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:16:28,819 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:16:28,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-04-28 10:16:28,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209950327] [2022-04-28 10:16:28,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:16:28,820 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 27 states have internal predecessors, (40), 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 44 [2022-04-28 10:16:28,820 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:16:28,820 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 29 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 27 states have internal predecessors, (40), 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-28 10:16:31,104 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 43 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 10:16:31,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-04-28 10:16:31,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:16:31,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-04-28 10:16:31,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=324, Invalid=3212, Unknown=4, NotChecked=0, Total=3540 [2022-04-28 10:16:31,105 INFO L87 Difference]: Start difference. First operand 160 states and 202 transitions. Second operand has 29 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 27 states have internal predecessors, (40), 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-28 10:16:36,121 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-28 10:16:38,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:16:38,060 INFO L93 Difference]: Finished difference Result 191 states and 233 transitions. [2022-04-28 10:16:38,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-04-28 10:16:38,060 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 27 states have internal predecessors, (40), 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 44 [2022-04-28 10:16:38,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:16:38,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 27 states have internal predecessors, (40), 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-28 10:16:38,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 64 transitions. [2022-04-28 10:16:38,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 27 states have internal predecessors, (40), 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-28 10:16:38,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 64 transitions. [2022-04-28 10:16:38,061 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 64 transitions. [2022-04-28 10:16:38,341 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:16:38,342 INFO L225 Difference]: With dead ends: 191 [2022-04-28 10:16:38,342 INFO L226 Difference]: Without dead ends: 148 [2022-04-28 10:16:38,343 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 61 SyntacticMatches, 7 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 966 ImplicationChecksByTransitivity, 26.9s TimeCoverageRelationStatistics Valid=630, Invalid=7556, Unknown=4, NotChecked=0, Total=8190 [2022-04-28 10:16:38,343 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 20 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 1008 mSolverCounterSat, 29 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 1038 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1008 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-04-28 10:16:38,343 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 134 Invalid, 1038 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1008 Invalid, 1 Unknown, 0 Unchecked, 3.9s Time] [2022-04-28 10:16:38,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2022-04-28 10:16:38,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2022-04-28 10:16:38,502 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:16:38,502 INFO L82 GeneralOperation]: Start isEquivalent. First operand 148 states. Second operand has 148 states, 143 states have (on average 1.2867132867132867) internal successors, (184), 143 states have internal predecessors, (184), 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-28 10:16:38,502 INFO L74 IsIncluded]: Start isIncluded. First operand 148 states. Second operand has 148 states, 143 states have (on average 1.2867132867132867) internal successors, (184), 143 states have internal predecessors, (184), 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-28 10:16:38,502 INFO L87 Difference]: Start difference. First operand 148 states. Second operand has 148 states, 143 states have (on average 1.2867132867132867) internal successors, (184), 143 states have internal predecessors, (184), 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-28 10:16:38,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:16:38,503 INFO L93 Difference]: Finished difference Result 148 states and 188 transitions. [2022-04-28 10:16:38,503 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 188 transitions. [2022-04-28 10:16:38,503 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:16:38,503 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:16:38,504 INFO L74 IsIncluded]: Start isIncluded. First operand has 148 states, 143 states have (on average 1.2867132867132867) internal successors, (184), 143 states have internal predecessors, (184), 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 148 states. [2022-04-28 10:16:38,504 INFO L87 Difference]: Start difference. First operand has 148 states, 143 states have (on average 1.2867132867132867) internal successors, (184), 143 states have internal predecessors, (184), 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 148 states. [2022-04-28 10:16:38,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:16:38,505 INFO L93 Difference]: Finished difference Result 148 states and 188 transitions. [2022-04-28 10:16:38,505 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 188 transitions. [2022-04-28 10:16:38,505 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:16:38,505 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:16:38,505 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:16:38,505 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:16:38,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 143 states have (on average 1.2867132867132867) internal successors, (184), 143 states have internal predecessors, (184), 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-28 10:16:38,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 188 transitions. [2022-04-28 10:16:38,506 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 188 transitions. Word has length 44 [2022-04-28 10:16:38,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:16:38,506 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 188 transitions. [2022-04-28 10:16:38,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 27 states have internal predecessors, (40), 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-28 10:16:38,507 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 148 states and 188 transitions. [2022-04-28 10:16:42,863 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 188 edges. 187 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 10:16:42,863 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 188 transitions. [2022-04-28 10:16:42,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-28 10:16:42,864 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:16:42,864 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:16:42,870 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (102)] Ended with exit code 0 [2022-04-28 10:16:43,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 102 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable101 [2022-04-28 10:16:43,064 INFO L420 AbstractCegarLoop]: === Iteration 103 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:16:43,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:16:43,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1338400127, now seen corresponding path program 145 times [2022-04-28 10:16:43,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:16:43,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1763573489] [2022-04-28 10:16:43,066 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:16:43,066 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:16:43,066 INFO L85 PathProgramCache]: Analyzing trace with hash 1338400127, now seen corresponding path program 146 times [2022-04-28 10:16:43,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:16:43,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064333821] [2022-04-28 10:16:43,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:16:43,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:16:43,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:16:43,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:16:43,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:16:43,401 INFO L290 TraceCheckUtils]: 0: Hoare triple {93159#(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(10, 2);call #Ultimate.allocInit(12, 3); {93133#true} is VALID [2022-04-28 10:16:43,401 INFO L290 TraceCheckUtils]: 1: Hoare triple {93133#true} assume true; {93133#true} is VALID [2022-04-28 10:16:43,401 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {93133#true} {93133#true} #61#return; {93133#true} is VALID [2022-04-28 10:16:43,401 INFO L272 TraceCheckUtils]: 0: Hoare triple {93133#true} call ULTIMATE.init(); {93159#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:16:43,401 INFO L290 TraceCheckUtils]: 1: Hoare triple {93159#(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(10, 2);call #Ultimate.allocInit(12, 3); {93133#true} is VALID [2022-04-28 10:16:43,401 INFO L290 TraceCheckUtils]: 2: Hoare triple {93133#true} assume true; {93133#true} is VALID [2022-04-28 10:16:43,401 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {93133#true} {93133#true} #61#return; {93133#true} is VALID [2022-04-28 10:16:43,401 INFO L272 TraceCheckUtils]: 4: Hoare triple {93133#true} call #t~ret11 := main(); {93133#true} is VALID [2022-04-28 10:16:43,402 INFO L290 TraceCheckUtils]: 5: Hoare triple {93133#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {93138#(= main_~y~0 0)} is VALID [2022-04-28 10:16:43,402 INFO L290 TraceCheckUtils]: 6: Hoare triple {93138#(= 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; {93139#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:16:43,403 INFO L290 TraceCheckUtils]: 7: Hoare triple {93139#(and (<= 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; {93140#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:16:43,403 INFO L290 TraceCheckUtils]: 8: Hoare triple {93140#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {93141#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:16:43,404 INFO L290 TraceCheckUtils]: 9: Hoare triple {93141#(and (<= main_~y~0 3) (<= 3 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; {93142#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:16:43,404 INFO L290 TraceCheckUtils]: 10: Hoare triple {93142#(and (<= main_~y~0 4) (<= 4 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; {93143#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:16:43,405 INFO L290 TraceCheckUtils]: 11: Hoare triple {93143#(and (<= 5 main_~y~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; {93144#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:16:43,405 INFO L290 TraceCheckUtils]: 12: Hoare triple {93144#(and (<= main_~y~0 6) (<= 6 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; {93145#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:16:43,406 INFO L290 TraceCheckUtils]: 13: Hoare triple {93145#(and (<= 7 main_~y~0) (<= main_~y~0 7))} 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; {93146#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:16:43,406 INFO L290 TraceCheckUtils]: 14: Hoare triple {93146#(and (<= main_~y~0 8) (<= 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; {93147#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:16:43,407 INFO L290 TraceCheckUtils]: 15: Hoare triple {93147#(and (<= 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; {93148#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:16:43,407 INFO L290 TraceCheckUtils]: 16: Hoare triple {93148#(and (<= main_~y~0 10) (<= 10 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; {93149#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:16:43,407 INFO L290 TraceCheckUtils]: 17: Hoare triple {93149#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {93149#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:16:43,408 INFO L290 TraceCheckUtils]: 18: Hoare triple {93149#(and (<= main_~y~0 11) (<= 11 main_~y~0))} ~z~0 := ~y~0; {93150#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-28 10:16:43,408 INFO L290 TraceCheckUtils]: 19: Hoare triple {93150#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {93151#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:16:43,409 INFO L290 TraceCheckUtils]: 20: Hoare triple {93151#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {93152#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:16:43,409 INFO L290 TraceCheckUtils]: 21: Hoare triple {93152#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {93153#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:16:43,410 INFO L290 TraceCheckUtils]: 22: Hoare triple {93153#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {93154#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:16:43,410 INFO L290 TraceCheckUtils]: 23: Hoare triple {93154#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {93155#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:16:43,411 INFO L290 TraceCheckUtils]: 24: Hoare triple {93155#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {93156#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-28 10:16:43,411 INFO L290 TraceCheckUtils]: 25: Hoare triple {93156#(and (<= main_~z~0 5) (<= 5 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {93157#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-28 10:16:43,412 INFO L290 TraceCheckUtils]: 26: Hoare triple {93157#(and (<= 4 main_~z~0) (<= main_~z~0 4))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {93158#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:16:43,412 INFO L290 TraceCheckUtils]: 27: Hoare triple {93158#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {93134#false} is VALID [2022-04-28 10:16:43,412 INFO L290 TraceCheckUtils]: 28: Hoare triple {93134#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {93134#false} is VALID [2022-04-28 10:16:43,412 INFO L290 TraceCheckUtils]: 29: Hoare triple {93134#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {93134#false} is VALID [2022-04-28 10:16:43,412 INFO L290 TraceCheckUtils]: 30: Hoare triple {93134#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {93134#false} is VALID [2022-04-28 10:16:43,412 INFO L290 TraceCheckUtils]: 31: Hoare triple {93134#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {93134#false} is VALID [2022-04-28 10:16:43,412 INFO L290 TraceCheckUtils]: 32: Hoare triple {93134#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {93134#false} is VALID [2022-04-28 10:16:43,412 INFO L290 TraceCheckUtils]: 33: Hoare triple {93134#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {93134#false} is VALID [2022-04-28 10:16:43,412 INFO L290 TraceCheckUtils]: 34: Hoare triple {93134#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {93134#false} is VALID [2022-04-28 10:16:43,413 INFO L290 TraceCheckUtils]: 35: Hoare triple {93134#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {93134#false} is VALID [2022-04-28 10:16:43,413 INFO L290 TraceCheckUtils]: 36: Hoare triple {93134#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {93134#false} is VALID [2022-04-28 10:16:43,413 INFO L290 TraceCheckUtils]: 37: Hoare triple {93134#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {93134#false} is VALID [2022-04-28 10:16:43,413 INFO L290 TraceCheckUtils]: 38: Hoare triple {93134#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {93134#false} is VALID [2022-04-28 10:16:43,413 INFO L290 TraceCheckUtils]: 39: Hoare triple {93134#false} assume !(~y~0 % 4294967296 > 0); {93134#false} is VALID [2022-04-28 10:16:43,413 INFO L272 TraceCheckUtils]: 40: Hoare triple {93134#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {93134#false} is VALID [2022-04-28 10:16:43,413 INFO L290 TraceCheckUtils]: 41: Hoare triple {93134#false} ~cond := #in~cond; {93134#false} is VALID [2022-04-28 10:16:43,413 INFO L290 TraceCheckUtils]: 42: Hoare triple {93134#false} assume 0 == ~cond; {93134#false} is VALID [2022-04-28 10:16:43,413 INFO L290 TraceCheckUtils]: 43: Hoare triple {93134#false} assume !false; {93134#false} is VALID [2022-04-28 10:16:43,413 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 102 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-04-28 10:16:43,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:16:43,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064333821] [2022-04-28 10:16:43,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064333821] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:16:43,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [319278622] [2022-04-28 10:16:43,413 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:16:43,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:16:43,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:16:43,414 INFO L229 MonitoredProcess]: Starting monitored process 103 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:16:43,415 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (103)] Waiting until timeout for monitored process [2022-04-28 10:16:43,463 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:16:43,463 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:16:43,464 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 60 conjunts are in the unsatisfiable core [2022-04-28 10:16:43,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:16:43,474 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:16:43,886 INFO L272 TraceCheckUtils]: 0: Hoare triple {93133#true} call ULTIMATE.init(); {93133#true} is VALID [2022-04-28 10:16:43,886 INFO L290 TraceCheckUtils]: 1: Hoare triple {93133#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(10, 2);call #Ultimate.allocInit(12, 3); {93133#true} is VALID [2022-04-28 10:16:43,887 INFO L290 TraceCheckUtils]: 2: Hoare triple {93133#true} assume true; {93133#true} is VALID [2022-04-28 10:16:43,887 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {93133#true} {93133#true} #61#return; {93133#true} is VALID [2022-04-28 10:16:43,887 INFO L272 TraceCheckUtils]: 4: Hoare triple {93133#true} call #t~ret11 := main(); {93133#true} is VALID [2022-04-28 10:16:43,887 INFO L290 TraceCheckUtils]: 5: Hoare triple {93133#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {93138#(= main_~y~0 0)} is VALID [2022-04-28 10:16:43,887 INFO L290 TraceCheckUtils]: 6: Hoare triple {93138#(= 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; {93139#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:16:43,888 INFO L290 TraceCheckUtils]: 7: Hoare triple {93139#(and (<= 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; {93140#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:16:43,888 INFO L290 TraceCheckUtils]: 8: Hoare triple {93140#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {93141#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:16:43,889 INFO L290 TraceCheckUtils]: 9: Hoare triple {93141#(and (<= main_~y~0 3) (<= 3 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; {93142#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:16:43,889 INFO L290 TraceCheckUtils]: 10: Hoare triple {93142#(and (<= main_~y~0 4) (<= 4 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; {93143#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:16:43,890 INFO L290 TraceCheckUtils]: 11: Hoare triple {93143#(and (<= 5 main_~y~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; {93144#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:16:43,890 INFO L290 TraceCheckUtils]: 12: Hoare triple {93144#(and (<= main_~y~0 6) (<= 6 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; {93145#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:16:43,891 INFO L290 TraceCheckUtils]: 13: Hoare triple {93145#(and (<= 7 main_~y~0) (<= main_~y~0 7))} 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; {93146#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:16:43,891 INFO L290 TraceCheckUtils]: 14: Hoare triple {93146#(and (<= main_~y~0 8) (<= 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; {93147#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:16:43,892 INFO L290 TraceCheckUtils]: 15: Hoare triple {93147#(and (<= 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; {93148#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:16:43,892 INFO L290 TraceCheckUtils]: 16: Hoare triple {93148#(and (<= main_~y~0 10) (<= 10 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; {93149#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:16:43,892 INFO L290 TraceCheckUtils]: 17: Hoare triple {93149#(and (<= main_~y~0 11) (<= 11 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {93149#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:16:43,893 INFO L290 TraceCheckUtils]: 18: Hoare triple {93149#(and (<= main_~y~0 11) (<= 11 main_~y~0))} ~z~0 := ~y~0; {93217#(and (<= main_~y~0 11) (= main_~z~0 main_~y~0) (<= 11 main_~y~0))} is VALID [2022-04-28 10:16:43,893 INFO L290 TraceCheckUtils]: 19: Hoare triple {93217#(and (<= main_~y~0 11) (= main_~z~0 main_~y~0) (<= 11 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {93221#(and (<= main_~y~0 11) (<= 11 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-28 10:16:43,894 INFO L290 TraceCheckUtils]: 20: Hoare triple {93221#(and (<= main_~y~0 11) (<= 11 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {93225#(and (<= main_~y~0 11) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)) (<= 11 main_~y~0))} is VALID [2022-04-28 10:16:43,894 INFO L290 TraceCheckUtils]: 21: Hoare triple {93225#(and (<= main_~y~0 11) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)) (<= 11 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {93229#(and (<= main_~y~0 11) (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= 11 main_~y~0))} is VALID [2022-04-28 10:16:43,895 INFO L290 TraceCheckUtils]: 22: Hoare triple {93229#(and (<= main_~y~0 11) (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= 11 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {93233#(and (<= main_~y~0 11) (<= 11 main_~y~0) (= (+ (- 2) main_~y~0) (+ main_~z~0 2)))} is VALID [2022-04-28 10:16:43,895 INFO L290 TraceCheckUtils]: 23: Hoare triple {93233#(and (<= main_~y~0 11) (<= 11 main_~y~0) (= (+ (- 2) main_~y~0) (+ main_~z~0 2)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {93237#(and (<= main_~y~0 11) (= (+ main_~y~0 (- 4)) (+ main_~z~0 1)) (<= 11 main_~y~0))} is VALID [2022-04-28 10:16:43,896 INFO L290 TraceCheckUtils]: 24: Hoare triple {93237#(and (<= main_~y~0 11) (= (+ main_~y~0 (- 4)) (+ main_~z~0 1)) (<= 11 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {93241#(and (<= main_~y~0 11) (= (+ main_~y~0 (- 5)) (+ main_~z~0 1)) (<= 11 main_~y~0))} is VALID [2022-04-28 10:16:43,897 INFO L290 TraceCheckUtils]: 25: Hoare triple {93241#(and (<= main_~y~0 11) (= (+ main_~y~0 (- 5)) (+ main_~z~0 1)) (<= 11 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {93245#(and (<= main_~y~0 11) (= (+ main_~y~0 (- 6)) (+ main_~z~0 1)) (<= 11 main_~y~0))} is VALID [2022-04-28 10:16:43,897 INFO L290 TraceCheckUtils]: 26: Hoare triple {93245#(and (<= main_~y~0 11) (= (+ main_~y~0 (- 6)) (+ main_~z~0 1)) (<= 11 main_~y~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {93249#(and (<= main_~y~0 11) (= (+ main_~z~0 1) (+ main_~y~0 (- 7))) (<= 11 main_~y~0))} is VALID [2022-04-28 10:16:43,898 INFO L290 TraceCheckUtils]: 27: Hoare triple {93249#(and (<= main_~y~0 11) (= (+ main_~z~0 1) (+ main_~y~0 (- 7))) (<= 11 main_~y~0))} assume !(~z~0 % 4294967296 > 0); {93134#false} is VALID [2022-04-28 10:16:43,898 INFO L290 TraceCheckUtils]: 28: Hoare triple {93134#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {93134#false} is VALID [2022-04-28 10:16:43,898 INFO L290 TraceCheckUtils]: 29: Hoare triple {93134#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {93134#false} is VALID [2022-04-28 10:16:43,898 INFO L290 TraceCheckUtils]: 30: Hoare triple {93134#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {93134#false} is VALID [2022-04-28 10:16:43,898 INFO L290 TraceCheckUtils]: 31: Hoare triple {93134#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {93134#false} is VALID [2022-04-28 10:16:43,898 INFO L290 TraceCheckUtils]: 32: Hoare triple {93134#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {93134#false} is VALID [2022-04-28 10:16:43,898 INFO L290 TraceCheckUtils]: 33: Hoare triple {93134#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {93134#false} is VALID [2022-04-28 10:16:43,898 INFO L290 TraceCheckUtils]: 34: Hoare triple {93134#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {93134#false} is VALID [2022-04-28 10:16:43,898 INFO L290 TraceCheckUtils]: 35: Hoare triple {93134#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {93134#false} is VALID [2022-04-28 10:16:43,898 INFO L290 TraceCheckUtils]: 36: Hoare triple {93134#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {93134#false} is VALID [2022-04-28 10:16:43,898 INFO L290 TraceCheckUtils]: 37: Hoare triple {93134#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {93134#false} is VALID [2022-04-28 10:16:43,898 INFO L290 TraceCheckUtils]: 38: Hoare triple {93134#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {93134#false} is VALID [2022-04-28 10:16:43,898 INFO L290 TraceCheckUtils]: 39: Hoare triple {93134#false} assume !(~y~0 % 4294967296 > 0); {93134#false} is VALID [2022-04-28 10:16:43,898 INFO L272 TraceCheckUtils]: 40: Hoare triple {93134#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {93134#false} is VALID [2022-04-28 10:16:43,898 INFO L290 TraceCheckUtils]: 41: Hoare triple {93134#false} ~cond := #in~cond; {93134#false} is VALID [2022-04-28 10:16:43,898 INFO L290 TraceCheckUtils]: 42: Hoare triple {93134#false} assume 0 == ~cond; {93134#false} is VALID [2022-04-28 10:16:43,898 INFO L290 TraceCheckUtils]: 43: Hoare triple {93134#false} assume !false; {93134#false} is VALID [2022-04-28 10:16:43,898 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 102 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-04-28 10:16:43,899 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:16:44,600 INFO L290 TraceCheckUtils]: 43: Hoare triple {93134#false} assume !false; {93134#false} is VALID [2022-04-28 10:16:44,600 INFO L290 TraceCheckUtils]: 42: Hoare triple {93134#false} assume 0 == ~cond; {93134#false} is VALID [2022-04-28 10:16:44,600 INFO L290 TraceCheckUtils]: 41: Hoare triple {93134#false} ~cond := #in~cond; {93134#false} is VALID [2022-04-28 10:16:44,600 INFO L272 TraceCheckUtils]: 40: Hoare triple {93134#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {93134#false} is VALID [2022-04-28 10:16:44,600 INFO L290 TraceCheckUtils]: 39: Hoare triple {93134#false} assume !(~y~0 % 4294967296 > 0); {93134#false} is VALID [2022-04-28 10:16:44,600 INFO L290 TraceCheckUtils]: 38: Hoare triple {93134#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {93134#false} is VALID [2022-04-28 10:16:44,600 INFO L290 TraceCheckUtils]: 37: Hoare triple {93134#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {93134#false} is VALID [2022-04-28 10:16:44,601 INFO L290 TraceCheckUtils]: 36: Hoare triple {93322#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {93134#false} is VALID [2022-04-28 10:16:44,601 INFO L290 TraceCheckUtils]: 35: Hoare triple {93326#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {93322#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 10:16:44,602 INFO L290 TraceCheckUtils]: 34: Hoare triple {93330#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {93326#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:16:44,603 INFO L290 TraceCheckUtils]: 33: Hoare triple {93334#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {93330#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-28 10:16:44,604 INFO L290 TraceCheckUtils]: 32: Hoare triple {93338#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {93334#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-28 10:16:44,605 INFO L290 TraceCheckUtils]: 31: Hoare triple {93342#(not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {93338#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:16:44,605 INFO L290 TraceCheckUtils]: 30: Hoare triple {93346#(not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {93342#(not (< 0 (mod (+ 4294967291 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:16:44,606 INFO L290 TraceCheckUtils]: 29: Hoare triple {93350#(not (< 0 (mod (+ main_~y~0 4294967289) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {93346#(not (< 0 (mod (+ 4294967290 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:16:44,607 INFO L290 TraceCheckUtils]: 28: Hoare triple {93354#(not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {93350#(not (< 0 (mod (+ main_~y~0 4294967289) 4294967296)))} is VALID [2022-04-28 10:16:44,607 INFO L290 TraceCheckUtils]: 27: Hoare triple {93358#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod main_~z~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {93354#(not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296)))} is VALID [2022-04-28 10:16:44,608 INFO L290 TraceCheckUtils]: 26: Hoare triple {93362#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {93358#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-28 10:16:44,609 INFO L290 TraceCheckUtils]: 25: Hoare triple {93366#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {93362#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-28 10:16:44,609 INFO L290 TraceCheckUtils]: 24: Hoare triple {93370#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {93366#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))))} is VALID [2022-04-28 10:16:44,610 INFO L290 TraceCheckUtils]: 23: Hoare triple {93374#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {93370#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} is VALID [2022-04-28 10:16:44,611 INFO L290 TraceCheckUtils]: 22: Hoare triple {93378#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {93374#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)))} is VALID [2022-04-28 10:16:44,612 INFO L290 TraceCheckUtils]: 21: Hoare triple {93382#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod (+ 4294967290 main_~z~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {93378#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod (+ 4294967291 main_~z~0) 4294967296)))} is VALID [2022-04-28 10:16:44,612 INFO L290 TraceCheckUtils]: 20: Hoare triple {93386#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod (+ main_~z~0 4294967289) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {93382#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod (+ 4294967290 main_~z~0) 4294967296)))} is VALID [2022-04-28 10:16:44,613 INFO L290 TraceCheckUtils]: 19: Hoare triple {93390#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod (+ 4294967288 main_~z~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {93386#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod (+ main_~z~0 4294967289) 4294967296)))} is VALID [2022-04-28 10:16:44,614 INFO L290 TraceCheckUtils]: 18: Hoare triple {93133#true} ~z~0 := ~y~0; {93390#(or (not (< 0 (mod (+ 4294967288 main_~y~0) 4294967296))) (< 0 (mod (+ 4294967288 main_~z~0) 4294967296)))} is VALID [2022-04-28 10:16:44,614 INFO L290 TraceCheckUtils]: 17: Hoare triple {93133#true} assume !(~x~0 % 4294967296 > 0); {93133#true} is VALID [2022-04-28 10:16:44,614 INFO L290 TraceCheckUtils]: 16: Hoare triple {93133#true} 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; {93133#true} is VALID [2022-04-28 10:16:44,614 INFO L290 TraceCheckUtils]: 15: Hoare triple {93133#true} 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; {93133#true} is VALID [2022-04-28 10:16:44,614 INFO L290 TraceCheckUtils]: 14: Hoare triple {93133#true} 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; {93133#true} is VALID [2022-04-28 10:16:44,614 INFO L290 TraceCheckUtils]: 13: Hoare triple {93133#true} 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; {93133#true} is VALID [2022-04-28 10:16:44,614 INFO L290 TraceCheckUtils]: 12: Hoare triple {93133#true} 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; {93133#true} is VALID [2022-04-28 10:16:44,614 INFO L290 TraceCheckUtils]: 11: Hoare triple {93133#true} 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; {93133#true} is VALID [2022-04-28 10:16:44,614 INFO L290 TraceCheckUtils]: 10: Hoare triple {93133#true} 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; {93133#true} is VALID [2022-04-28 10:16:44,614 INFO L290 TraceCheckUtils]: 9: Hoare triple {93133#true} 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; {93133#true} is VALID [2022-04-28 10:16:44,614 INFO L290 TraceCheckUtils]: 8: Hoare triple {93133#true} 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; {93133#true} is VALID [2022-04-28 10:16:44,614 INFO L290 TraceCheckUtils]: 7: Hoare triple {93133#true} 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; {93133#true} is VALID [2022-04-28 10:16:44,614 INFO L290 TraceCheckUtils]: 6: Hoare triple {93133#true} 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; {93133#true} is VALID [2022-04-28 10:16:44,614 INFO L290 TraceCheckUtils]: 5: Hoare triple {93133#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {93133#true} is VALID [2022-04-28 10:16:44,614 INFO L272 TraceCheckUtils]: 4: Hoare triple {93133#true} call #t~ret11 := main(); {93133#true} is VALID [2022-04-28 10:16:44,614 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {93133#true} {93133#true} #61#return; {93133#true} is VALID [2022-04-28 10:16:44,614 INFO L290 TraceCheckUtils]: 2: Hoare triple {93133#true} assume true; {93133#true} is VALID [2022-04-28 10:16:44,614 INFO L290 TraceCheckUtils]: 1: Hoare triple {93133#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(10, 2);call #Ultimate.allocInit(12, 3); {93133#true} is VALID [2022-04-28 10:16:44,614 INFO L272 TraceCheckUtils]: 0: Hoare triple {93133#true} call ULTIMATE.init(); {93133#true} is VALID [2022-04-28 10:16:44,615 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 27 proven. 72 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-04-28 10:16:44,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [319278622] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:16:44,615 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:16:44,615 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 20] total 51 [2022-04-28 10:16:44,615 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:16:44,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1763573489] [2022-04-28 10:16:44,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1763573489] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:16:44,615 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:16:44,615 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-04-28 10:16:44,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210854446] [2022-04-28 10:16:44,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:16:44,615 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.25) internal successors, (30), 23 states have internal predecessors, (30), 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 44 [2022-04-28 10:16:44,615 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:16:44,616 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 24 states, 24 states have (on average 1.25) internal successors, (30), 23 states have internal predecessors, (30), 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-28 10:16:44,641 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:16:44,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-28 10:16:44,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:16:44,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-28 10:16:44,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=305, Invalid=2245, Unknown=0, NotChecked=0, Total=2550 [2022-04-28 10:16:44,642 INFO L87 Difference]: Start difference. First operand 148 states and 188 transitions. Second operand has 24 states, 24 states have (on average 1.25) internal successors, (30), 23 states have internal predecessors, (30), 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-28 10:16:46,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:16:46,412 INFO L93 Difference]: Finished difference Result 179 states and 219 transitions. [2022-04-28 10:16:46,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-28 10:16:46,412 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.25) internal successors, (30), 23 states have internal predecessors, (30), 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 44 [2022-04-28 10:16:46,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:16:46,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.25) internal successors, (30), 23 states have internal predecessors, (30), 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-28 10:16:46,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 62 transitions. [2022-04-28 10:16:46,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.25) internal successors, (30), 23 states have internal predecessors, (30), 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-28 10:16:46,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 62 transitions. [2022-04-28 10:16:46,413 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 62 transitions. [2022-04-28 10:16:46,461 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:16:46,462 INFO L225 Difference]: With dead ends: 179 [2022-04-28 10:16:46,462 INFO L226 Difference]: Without dead ends: 162 [2022-04-28 10:16:46,462 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 814 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=519, Invalid=4593, Unknown=0, NotChecked=0, Total=5112 [2022-04-28 10:16:46,463 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 17 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 738 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 782 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 738 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-28 10:16:46,463 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 98 Invalid, 782 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 738 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-28 10:16:46,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2022-04-28 10:16:46,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 149. [2022-04-28 10:16:46,626 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:16:46,626 INFO L82 GeneralOperation]: Start isEquivalent. First operand 162 states. Second operand has 149 states, 144 states have (on average 1.2847222222222223) internal successors, (185), 144 states have internal predecessors, (185), 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-28 10:16:46,626 INFO L74 IsIncluded]: Start isIncluded. First operand 162 states. Second operand has 149 states, 144 states have (on average 1.2847222222222223) internal successors, (185), 144 states have internal predecessors, (185), 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-28 10:16:46,626 INFO L87 Difference]: Start difference. First operand 162 states. Second operand has 149 states, 144 states have (on average 1.2847222222222223) internal successors, (185), 144 states have internal predecessors, (185), 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-28 10:16:46,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:16:46,627 INFO L93 Difference]: Finished difference Result 162 states and 202 transitions. [2022-04-28 10:16:46,627 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 202 transitions. [2022-04-28 10:16:46,627 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:16:46,628 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:16:46,628 INFO L74 IsIncluded]: Start isIncluded. First operand has 149 states, 144 states have (on average 1.2847222222222223) internal successors, (185), 144 states have internal predecessors, (185), 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 162 states. [2022-04-28 10:16:46,628 INFO L87 Difference]: Start difference. First operand has 149 states, 144 states have (on average 1.2847222222222223) internal successors, (185), 144 states have internal predecessors, (185), 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 162 states. [2022-04-28 10:16:46,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:16:46,629 INFO L93 Difference]: Finished difference Result 162 states and 202 transitions. [2022-04-28 10:16:46,629 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 202 transitions. [2022-04-28 10:16:46,629 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:16:46,629 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:16:46,629 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:16:46,629 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:16:46,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 144 states have (on average 1.2847222222222223) internal successors, (185), 144 states have internal predecessors, (185), 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-28 10:16:46,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 189 transitions. [2022-04-28 10:16:46,631 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 189 transitions. Word has length 44 [2022-04-28 10:16:46,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:16:46,631 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 189 transitions. [2022-04-28 10:16:46,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.25) internal successors, (30), 23 states have internal predecessors, (30), 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-28 10:16:46,631 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 149 states and 189 transitions. [2022-04-28 10:16:53,213 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 189 edges. 188 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 10:16:53,213 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 189 transitions. [2022-04-28 10:16:53,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-28 10:16:53,213 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:16:53,213 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:16:53,229 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (103)] Forceful destruction successful, exit code 0 [2022-04-28 10:16:53,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 103 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable102 [2022-04-28 10:16:53,414 INFO L420 AbstractCegarLoop]: === Iteration 104 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:16:53,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:16:53,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1592108787, now seen corresponding path program 147 times [2022-04-28 10:16:53,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:16:53,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1884925904] [2022-04-28 10:16:53,416 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:16:53,416 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:16:53,416 INFO L85 PathProgramCache]: Analyzing trace with hash -1592108787, now seen corresponding path program 148 times [2022-04-28 10:16:53,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:16:53,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264088652] [2022-04-28 10:16:53,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:16:53,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:16:53,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:16:53,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:16:53,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:16:53,727 INFO L290 TraceCheckUtils]: 0: Hoare triple {94497#(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(10, 2);call #Ultimate.allocInit(12, 3); {94472#true} is VALID [2022-04-28 10:16:53,727 INFO L290 TraceCheckUtils]: 1: Hoare triple {94472#true} assume true; {94472#true} is VALID [2022-04-28 10:16:53,727 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {94472#true} {94472#true} #61#return; {94472#true} is VALID [2022-04-28 10:16:53,727 INFO L272 TraceCheckUtils]: 0: Hoare triple {94472#true} call ULTIMATE.init(); {94497#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:16:53,727 INFO L290 TraceCheckUtils]: 1: Hoare triple {94497#(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(10, 2);call #Ultimate.allocInit(12, 3); {94472#true} is VALID [2022-04-28 10:16:53,727 INFO L290 TraceCheckUtils]: 2: Hoare triple {94472#true} assume true; {94472#true} is VALID [2022-04-28 10:16:53,727 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {94472#true} {94472#true} #61#return; {94472#true} is VALID [2022-04-28 10:16:53,727 INFO L272 TraceCheckUtils]: 4: Hoare triple {94472#true} call #t~ret11 := main(); {94472#true} is VALID [2022-04-28 10:16:53,727 INFO L290 TraceCheckUtils]: 5: Hoare triple {94472#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {94477#(= main_~y~0 0)} is VALID [2022-04-28 10:16:53,728 INFO L290 TraceCheckUtils]: 6: Hoare triple {94477#(= 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; {94478#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:16:53,728 INFO L290 TraceCheckUtils]: 7: Hoare triple {94478#(and (<= 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; {94479#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:16:53,729 INFO L290 TraceCheckUtils]: 8: Hoare triple {94479#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {94480#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:16:53,729 INFO L290 TraceCheckUtils]: 9: Hoare triple {94480#(and (<= main_~y~0 3) (<= 3 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; {94481#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:16:53,730 INFO L290 TraceCheckUtils]: 10: Hoare triple {94481#(and (<= main_~y~0 4) (<= 4 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; {94482#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:16:53,730 INFO L290 TraceCheckUtils]: 11: Hoare triple {94482#(and (<= 5 main_~y~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; {94483#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:16:53,731 INFO L290 TraceCheckUtils]: 12: Hoare triple {94483#(and (<= main_~y~0 6) (<= 6 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; {94484#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:16:53,731 INFO L290 TraceCheckUtils]: 13: Hoare triple {94484#(and (<= 7 main_~y~0) (<= main_~y~0 7))} 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; {94485#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:16:53,732 INFO L290 TraceCheckUtils]: 14: Hoare triple {94485#(and (<= main_~y~0 8) (<= 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; {94486#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:16:53,732 INFO L290 TraceCheckUtils]: 15: Hoare triple {94486#(and (<= 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; {94487#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:16:53,733 INFO L290 TraceCheckUtils]: 16: Hoare triple {94487#(and (<= main_~y~0 10) (<= 10 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; {94488#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:16:53,733 INFO L290 TraceCheckUtils]: 17: Hoare triple {94488#(and (<= main_~y~0 11) (<= 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; {94489#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:16:53,733 INFO L290 TraceCheckUtils]: 18: Hoare triple {94489#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !(~x~0 % 4294967296 > 0); {94489#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:16:53,734 INFO L290 TraceCheckUtils]: 19: Hoare triple {94489#(and (<= 12 main_~y~0) (<= main_~y~0 12))} ~z~0 := ~y~0; {94490#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-28 10:16:53,734 INFO L290 TraceCheckUtils]: 20: Hoare triple {94490#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {94491#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-28 10:16:53,735 INFO L290 TraceCheckUtils]: 21: Hoare triple {94491#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {94492#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:16:53,735 INFO L290 TraceCheckUtils]: 22: Hoare triple {94492#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {94493#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:16:53,736 INFO L290 TraceCheckUtils]: 23: Hoare triple {94493#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {94494#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:16:53,736 INFO L290 TraceCheckUtils]: 24: Hoare triple {94494#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {94495#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:16:53,737 INFO L290 TraceCheckUtils]: 25: Hoare triple {94495#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {94496#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} is VALID [2022-04-28 10:16:53,737 INFO L290 TraceCheckUtils]: 26: Hoare triple {94496#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {94473#false} is VALID [2022-04-28 10:16:53,737 INFO L290 TraceCheckUtils]: 27: Hoare triple {94473#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94473#false} is VALID [2022-04-28 10:16:53,737 INFO L290 TraceCheckUtils]: 28: Hoare triple {94473#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94473#false} is VALID [2022-04-28 10:16:53,737 INFO L290 TraceCheckUtils]: 29: Hoare triple {94473#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94473#false} is VALID [2022-04-28 10:16:53,737 INFO L290 TraceCheckUtils]: 30: Hoare triple {94473#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94473#false} is VALID [2022-04-28 10:16:53,737 INFO L290 TraceCheckUtils]: 31: Hoare triple {94473#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94473#false} is VALID [2022-04-28 10:16:53,737 INFO L290 TraceCheckUtils]: 32: Hoare triple {94473#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94473#false} is VALID [2022-04-28 10:16:53,737 INFO L290 TraceCheckUtils]: 33: Hoare triple {94473#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94473#false} is VALID [2022-04-28 10:16:53,738 INFO L290 TraceCheckUtils]: 34: Hoare triple {94473#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94473#false} is VALID [2022-04-28 10:16:53,738 INFO L290 TraceCheckUtils]: 35: Hoare triple {94473#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94473#false} is VALID [2022-04-28 10:16:53,738 INFO L290 TraceCheckUtils]: 36: Hoare triple {94473#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94473#false} is VALID [2022-04-28 10:16:53,738 INFO L290 TraceCheckUtils]: 37: Hoare triple {94473#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94473#false} is VALID [2022-04-28 10:16:53,738 INFO L290 TraceCheckUtils]: 38: Hoare triple {94473#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94473#false} is VALID [2022-04-28 10:16:53,738 INFO L290 TraceCheckUtils]: 39: Hoare triple {94473#false} assume !(~y~0 % 4294967296 > 0); {94473#false} is VALID [2022-04-28 10:16:53,738 INFO L272 TraceCheckUtils]: 40: Hoare triple {94473#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {94473#false} is VALID [2022-04-28 10:16:53,738 INFO L290 TraceCheckUtils]: 41: Hoare triple {94473#false} ~cond := #in~cond; {94473#false} is VALID [2022-04-28 10:16:53,738 INFO L290 TraceCheckUtils]: 42: Hoare triple {94473#false} assume 0 == ~cond; {94473#false} is VALID [2022-04-28 10:16:53,738 INFO L290 TraceCheckUtils]: 43: Hoare triple {94473#false} assume !false; {94473#false} is VALID [2022-04-28 10:16:53,738 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-04-28 10:16:53,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:16:53,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264088652] [2022-04-28 10:16:53,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264088652] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:16:53,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [642249901] [2022-04-28 10:16:53,738 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:16:53,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:16:53,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:16:53,739 INFO L229 MonitoredProcess]: Starting monitored process 104 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:16:53,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (104)] Waiting until timeout for monitored process [2022-04-28 10:16:53,784 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:16:53,784 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:16:53,785 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 41 conjunts are in the unsatisfiable core [2022-04-28 10:16:53,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:16:53,794 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:16:54,074 INFO L272 TraceCheckUtils]: 0: Hoare triple {94472#true} call ULTIMATE.init(); {94472#true} is VALID [2022-04-28 10:16:54,074 INFO L290 TraceCheckUtils]: 1: Hoare triple {94472#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(10, 2);call #Ultimate.allocInit(12, 3); {94472#true} is VALID [2022-04-28 10:16:54,074 INFO L290 TraceCheckUtils]: 2: Hoare triple {94472#true} assume true; {94472#true} is VALID [2022-04-28 10:16:54,074 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {94472#true} {94472#true} #61#return; {94472#true} is VALID [2022-04-28 10:16:54,074 INFO L272 TraceCheckUtils]: 4: Hoare triple {94472#true} call #t~ret11 := main(); {94472#true} is VALID [2022-04-28 10:16:54,074 INFO L290 TraceCheckUtils]: 5: Hoare triple {94472#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {94477#(= main_~y~0 0)} is VALID [2022-04-28 10:16:54,075 INFO L290 TraceCheckUtils]: 6: Hoare triple {94477#(= 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; {94478#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:16:54,075 INFO L290 TraceCheckUtils]: 7: Hoare triple {94478#(and (<= 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; {94479#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:16:54,076 INFO L290 TraceCheckUtils]: 8: Hoare triple {94479#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {94480#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:16:54,076 INFO L290 TraceCheckUtils]: 9: Hoare triple {94480#(and (<= main_~y~0 3) (<= 3 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; {94481#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:16:54,077 INFO L290 TraceCheckUtils]: 10: Hoare triple {94481#(and (<= main_~y~0 4) (<= 4 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; {94482#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:16:54,077 INFO L290 TraceCheckUtils]: 11: Hoare triple {94482#(and (<= 5 main_~y~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; {94483#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:16:54,078 INFO L290 TraceCheckUtils]: 12: Hoare triple {94483#(and (<= main_~y~0 6) (<= 6 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; {94484#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:16:54,078 INFO L290 TraceCheckUtils]: 13: Hoare triple {94484#(and (<= 7 main_~y~0) (<= main_~y~0 7))} 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; {94485#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:16:54,079 INFO L290 TraceCheckUtils]: 14: Hoare triple {94485#(and (<= main_~y~0 8) (<= 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; {94486#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:16:54,079 INFO L290 TraceCheckUtils]: 15: Hoare triple {94486#(and (<= 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; {94487#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:16:54,080 INFO L290 TraceCheckUtils]: 16: Hoare triple {94487#(and (<= main_~y~0 10) (<= 10 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; {94488#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:16:54,080 INFO L290 TraceCheckUtils]: 17: Hoare triple {94488#(and (<= main_~y~0 11) (<= 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; {94489#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:16:54,081 INFO L290 TraceCheckUtils]: 18: Hoare triple {94489#(and (<= 12 main_~y~0) (<= main_~y~0 12))} assume !(~x~0 % 4294967296 > 0); {94489#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:16:54,081 INFO L290 TraceCheckUtils]: 19: Hoare triple {94489#(and (<= 12 main_~y~0) (<= main_~y~0 12))} ~z~0 := ~y~0; {94490#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-28 10:16:54,081 INFO L290 TraceCheckUtils]: 20: Hoare triple {94490#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {94491#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-28 10:16:54,082 INFO L290 TraceCheckUtils]: 21: Hoare triple {94491#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {94492#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:16:54,082 INFO L290 TraceCheckUtils]: 22: Hoare triple {94492#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {94493#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:16:54,083 INFO L290 TraceCheckUtils]: 23: Hoare triple {94493#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {94494#(and (<= 8 main_~z~0) (<= main_~z~0 8))} is VALID [2022-04-28 10:16:54,083 INFO L290 TraceCheckUtils]: 24: Hoare triple {94494#(and (<= 8 main_~z~0) (<= main_~z~0 8))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {94495#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-28 10:16:54,084 INFO L290 TraceCheckUtils]: 25: Hoare triple {94495#(and (<= main_~z~0 7) (<= 7 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {94576#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-28 10:16:54,084 INFO L290 TraceCheckUtils]: 26: Hoare triple {94576#(and (<= main_~z~0 6) (<= 6 main_~z~0))} assume !(~z~0 % 4294967296 > 0); {94473#false} is VALID [2022-04-28 10:16:54,084 INFO L290 TraceCheckUtils]: 27: Hoare triple {94473#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94473#false} is VALID [2022-04-28 10:16:54,084 INFO L290 TraceCheckUtils]: 28: Hoare triple {94473#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94473#false} is VALID [2022-04-28 10:16:54,084 INFO L290 TraceCheckUtils]: 29: Hoare triple {94473#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94473#false} is VALID [2022-04-28 10:16:54,084 INFO L290 TraceCheckUtils]: 30: Hoare triple {94473#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94473#false} is VALID [2022-04-28 10:16:54,084 INFO L290 TraceCheckUtils]: 31: Hoare triple {94473#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94473#false} is VALID [2022-04-28 10:16:54,085 INFO L290 TraceCheckUtils]: 32: Hoare triple {94473#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94473#false} is VALID [2022-04-28 10:16:54,085 INFO L290 TraceCheckUtils]: 33: Hoare triple {94473#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94473#false} is VALID [2022-04-28 10:16:54,085 INFO L290 TraceCheckUtils]: 34: Hoare triple {94473#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94473#false} is VALID [2022-04-28 10:16:54,085 INFO L290 TraceCheckUtils]: 35: Hoare triple {94473#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94473#false} is VALID [2022-04-28 10:16:54,085 INFO L290 TraceCheckUtils]: 36: Hoare triple {94473#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94473#false} is VALID [2022-04-28 10:16:54,085 INFO L290 TraceCheckUtils]: 37: Hoare triple {94473#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94473#false} is VALID [2022-04-28 10:16:54,085 INFO L290 TraceCheckUtils]: 38: Hoare triple {94473#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94473#false} is VALID [2022-04-28 10:16:54,085 INFO L290 TraceCheckUtils]: 39: Hoare triple {94473#false} assume !(~y~0 % 4294967296 > 0); {94473#false} is VALID [2022-04-28 10:16:54,085 INFO L272 TraceCheckUtils]: 40: Hoare triple {94473#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {94473#false} is VALID [2022-04-28 10:16:54,085 INFO L290 TraceCheckUtils]: 41: Hoare triple {94473#false} ~cond := #in~cond; {94473#false} is VALID [2022-04-28 10:16:54,085 INFO L290 TraceCheckUtils]: 42: Hoare triple {94473#false} assume 0 == ~cond; {94473#false} is VALID [2022-04-28 10:16:54,085 INFO L290 TraceCheckUtils]: 43: Hoare triple {94473#false} assume !false; {94473#false} is VALID [2022-04-28 10:16:54,085 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-04-28 10:16:54,085 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:16:54,722 INFO L290 TraceCheckUtils]: 43: Hoare triple {94473#false} assume !false; {94473#false} is VALID [2022-04-28 10:16:54,722 INFO L290 TraceCheckUtils]: 42: Hoare triple {94473#false} assume 0 == ~cond; {94473#false} is VALID [2022-04-28 10:16:54,722 INFO L290 TraceCheckUtils]: 41: Hoare triple {94473#false} ~cond := #in~cond; {94473#false} is VALID [2022-04-28 10:16:54,722 INFO L272 TraceCheckUtils]: 40: Hoare triple {94473#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {94473#false} is VALID [2022-04-28 10:16:54,722 INFO L290 TraceCheckUtils]: 39: Hoare triple {94473#false} assume !(~y~0 % 4294967296 > 0); {94473#false} is VALID [2022-04-28 10:16:54,722 INFO L290 TraceCheckUtils]: 38: Hoare triple {94473#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94473#false} is VALID [2022-04-28 10:16:54,722 INFO L290 TraceCheckUtils]: 37: Hoare triple {94473#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94473#false} is VALID [2022-04-28 10:16:54,722 INFO L290 TraceCheckUtils]: 36: Hoare triple {94473#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94473#false} is VALID [2022-04-28 10:16:54,722 INFO L290 TraceCheckUtils]: 35: Hoare triple {94473#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94473#false} is VALID [2022-04-28 10:16:54,722 INFO L290 TraceCheckUtils]: 34: Hoare triple {94473#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94473#false} is VALID [2022-04-28 10:16:54,722 INFO L290 TraceCheckUtils]: 33: Hoare triple {94473#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94473#false} is VALID [2022-04-28 10:16:54,723 INFO L290 TraceCheckUtils]: 32: Hoare triple {94473#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94473#false} is VALID [2022-04-28 10:16:54,723 INFO L290 TraceCheckUtils]: 31: Hoare triple {94473#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94473#false} is VALID [2022-04-28 10:16:54,723 INFO L290 TraceCheckUtils]: 30: Hoare triple {94473#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94473#false} is VALID [2022-04-28 10:16:54,723 INFO L290 TraceCheckUtils]: 29: Hoare triple {94473#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94473#false} is VALID [2022-04-28 10:16:54,723 INFO L290 TraceCheckUtils]: 28: Hoare triple {94473#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94473#false} is VALID [2022-04-28 10:16:54,723 INFO L290 TraceCheckUtils]: 27: Hoare triple {94473#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {94473#false} is VALID [2022-04-28 10:16:54,723 INFO L290 TraceCheckUtils]: 26: Hoare triple {94682#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {94473#false} is VALID [2022-04-28 10:16:54,724 INFO L290 TraceCheckUtils]: 25: Hoare triple {94686#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {94682#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:16:54,725 INFO L290 TraceCheckUtils]: 24: Hoare triple {94690#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {94686#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:16:54,725 INFO L290 TraceCheckUtils]: 23: Hoare triple {94694#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {94690#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-28 10:16:54,726 INFO L290 TraceCheckUtils]: 22: Hoare triple {94698#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {94694#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-28 10:16:54,727 INFO L290 TraceCheckUtils]: 21: Hoare triple {94702#(< 0 (mod (+ 4294967291 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {94698#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID [2022-04-28 10:16:54,727 INFO L290 TraceCheckUtils]: 20: Hoare triple {94706#(< 0 (mod (+ 4294967290 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {94702#(< 0 (mod (+ 4294967291 main_~z~0) 4294967296))} is VALID [2022-04-28 10:16:54,728 INFO L290 TraceCheckUtils]: 19: Hoare triple {94710#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} ~z~0 := ~y~0; {94706#(< 0 (mod (+ 4294967290 main_~z~0) 4294967296))} is VALID [2022-04-28 10:16:54,728 INFO L290 TraceCheckUtils]: 18: Hoare triple {94710#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {94710#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-28 10:16:54,729 INFO L290 TraceCheckUtils]: 17: Hoare triple {94717#(< 0 (mod (+ 4294967291 main_~y~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; {94710#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-28 10:16:54,729 INFO L290 TraceCheckUtils]: 16: Hoare triple {94721#(< 0 (mod (+ 4294967292 main_~y~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; {94717#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-28 10:16:54,730 INFO L290 TraceCheckUtils]: 15: Hoare triple {94725#(< 0 (mod (+ main_~y~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; {94721#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-28 10:16:54,731 INFO L290 TraceCheckUtils]: 14: Hoare triple {94729#(< 0 (mod (+ main_~y~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; {94725#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 10:16:54,731 INFO L290 TraceCheckUtils]: 13: Hoare triple {94733#(< 0 (mod (+ main_~y~0 4294967295) 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; {94729#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:16:54,732 INFO L290 TraceCheckUtils]: 12: Hoare triple {94737#(< 0 (mod main_~y~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; {94733#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:16:54,733 INFO L290 TraceCheckUtils]: 11: Hoare triple {94741#(< 0 (mod (+ main_~y~0 1) 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; {94737#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:16:54,733 INFO L290 TraceCheckUtils]: 10: Hoare triple {94745#(< 0 (mod (+ main_~y~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; {94741#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:16:54,734 INFO L290 TraceCheckUtils]: 9: Hoare triple {94749#(< 0 (mod (+ main_~y~0 3) 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; {94745#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:16:54,735 INFO L290 TraceCheckUtils]: 8: Hoare triple {94753#(< 0 (mod (+ main_~y~0 4) 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; {94749#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:16:54,735 INFO L290 TraceCheckUtils]: 7: Hoare triple {94757#(< 0 (mod (+ 5 main_~y~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; {94753#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:16:54,736 INFO L290 TraceCheckUtils]: 6: Hoare triple {94761#(< 0 (mod (+ main_~y~0 6) 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; {94757#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:16:54,736 INFO L290 TraceCheckUtils]: 5: Hoare triple {94472#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {94761#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:16:54,736 INFO L272 TraceCheckUtils]: 4: Hoare triple {94472#true} call #t~ret11 := main(); {94472#true} is VALID [2022-04-28 10:16:54,736 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {94472#true} {94472#true} #61#return; {94472#true} is VALID [2022-04-28 10:16:54,736 INFO L290 TraceCheckUtils]: 2: Hoare triple {94472#true} assume true; {94472#true} is VALID [2022-04-28 10:16:54,736 INFO L290 TraceCheckUtils]: 1: Hoare triple {94472#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(10, 2);call #Ultimate.allocInit(12, 3); {94472#true} is VALID [2022-04-28 10:16:54,736 INFO L272 TraceCheckUtils]: 0: Hoare triple {94472#true} call ULTIMATE.init(); {94472#true} is VALID [2022-04-28 10:16:54,737 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-04-28 10:16:54,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [642249901] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:16:54,737 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:16:54,737 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 44 [2022-04-28 10:16:54,737 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:16:54,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1884925904] [2022-04-28 10:16:54,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1884925904] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:16:54,737 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:16:54,737 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-28 10:16:54,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780782192] [2022-04-28 10:16:54,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:16:54,737 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 22 states have internal predecessors, (29), 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 44 [2022-04-28 10:16:54,737 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:16:54,737 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 23 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 22 states have internal predecessors, (29), 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-28 10:16:54,758 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:16:54,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-28 10:16:54,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:16:54,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-28 10:16:54,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=308, Invalid=1584, Unknown=0, NotChecked=0, Total=1892 [2022-04-28 10:16:54,759 INFO L87 Difference]: Start difference. First operand 149 states and 189 transitions. Second operand has 23 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 22 states have internal predecessors, (29), 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-28 10:16:56,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:16:56,605 INFO L93 Difference]: Finished difference Result 182 states and 222 transitions. [2022-04-28 10:16:56,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-28 10:16:56,605 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 22 states have internal predecessors, (29), 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 44 [2022-04-28 10:16:56,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:16:56,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 22 states have internal predecessors, (29), 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-28 10:16:56,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 72 transitions. [2022-04-28 10:16:56,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 22 states have internal predecessors, (29), 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-28 10:16:56,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 72 transitions. [2022-04-28 10:16:56,606 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 72 transitions. [2022-04-28 10:16:56,661 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:16:56,662 INFO L225 Difference]: With dead ends: 182 [2022-04-28 10:16:56,662 INFO L226 Difference]: Without dead ends: 164 [2022-04-28 10:16:56,662 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 484 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=880, Invalid=3950, Unknown=0, NotChecked=0, Total=4830 [2022-04-28 10:16:56,663 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 23 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 822 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 879 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 822 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-28 10:16:56,663 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 95 Invalid, 879 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 822 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-28 10:16:56,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2022-04-28 10:16:56,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 150. [2022-04-28 10:16:56,830 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:16:56,830 INFO L82 GeneralOperation]: Start isEquivalent. First operand 164 states. Second operand has 150 states, 145 states have (on average 1.282758620689655) internal successors, (186), 145 states have internal predecessors, (186), 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-28 10:16:56,830 INFO L74 IsIncluded]: Start isIncluded. First operand 164 states. Second operand has 150 states, 145 states have (on average 1.282758620689655) internal successors, (186), 145 states have internal predecessors, (186), 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-28 10:16:56,831 INFO L87 Difference]: Start difference. First operand 164 states. Second operand has 150 states, 145 states have (on average 1.282758620689655) internal successors, (186), 145 states have internal predecessors, (186), 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-28 10:16:56,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:16:56,839 INFO L93 Difference]: Finished difference Result 164 states and 204 transitions. [2022-04-28 10:16:56,839 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 204 transitions. [2022-04-28 10:16:56,839 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:16:56,839 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:16:56,839 INFO L74 IsIncluded]: Start isIncluded. First operand has 150 states, 145 states have (on average 1.282758620689655) internal successors, (186), 145 states have internal predecessors, (186), 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 164 states. [2022-04-28 10:16:56,839 INFO L87 Difference]: Start difference. First operand has 150 states, 145 states have (on average 1.282758620689655) internal successors, (186), 145 states have internal predecessors, (186), 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 164 states. [2022-04-28 10:16:56,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:16:56,841 INFO L93 Difference]: Finished difference Result 164 states and 204 transitions. [2022-04-28 10:16:56,841 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 204 transitions. [2022-04-28 10:16:56,841 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:16:56,841 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:16:56,841 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:16:56,841 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:16:56,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 145 states have (on average 1.282758620689655) internal successors, (186), 145 states have internal predecessors, (186), 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-28 10:16:56,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 190 transitions. [2022-04-28 10:16:56,842 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 190 transitions. Word has length 44 [2022-04-28 10:16:56,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:16:56,844 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 190 transitions. [2022-04-28 10:16:56,844 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 22 states have internal predecessors, (29), 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-28 10:16:56,844 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 150 states and 190 transitions. [2022-04-28 10:17:02,809 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 190 edges. 190 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:17:02,810 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 190 transitions. [2022-04-28 10:17:02,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-28 10:17:02,810 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:17:02,810 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:17:02,826 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (104)] Forceful destruction successful, exit code 0 [2022-04-28 10:17:03,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 104 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable103 [2022-04-28 10:17:03,010 INFO L420 AbstractCegarLoop]: === Iteration 105 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:17:03,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:17:03,011 INFO L85 PathProgramCache]: Analyzing trace with hash 263250815, now seen corresponding path program 149 times [2022-04-28 10:17:03,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:17:03,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1497501058] [2022-04-28 10:17:03,013 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:17:03,014 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:17:03,014 INFO L85 PathProgramCache]: Analyzing trace with hash 263250815, now seen corresponding path program 150 times [2022-04-28 10:17:03,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:17:03,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418363562] [2022-04-28 10:17:03,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:17:03,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:17:03,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:17:03,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:17:03,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:17:03,302 INFO L290 TraceCheckUtils]: 0: Hoare triple {95850#(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(10, 2);call #Ultimate.allocInit(12, 3); {95826#true} is VALID [2022-04-28 10:17:03,302 INFO L290 TraceCheckUtils]: 1: Hoare triple {95826#true} assume true; {95826#true} is VALID [2022-04-28 10:17:03,302 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {95826#true} {95826#true} #61#return; {95826#true} is VALID [2022-04-28 10:17:03,302 INFO L272 TraceCheckUtils]: 0: Hoare triple {95826#true} call ULTIMATE.init(); {95850#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:17:03,302 INFO L290 TraceCheckUtils]: 1: Hoare triple {95850#(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(10, 2);call #Ultimate.allocInit(12, 3); {95826#true} is VALID [2022-04-28 10:17:03,302 INFO L290 TraceCheckUtils]: 2: Hoare triple {95826#true} assume true; {95826#true} is VALID [2022-04-28 10:17:03,302 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {95826#true} {95826#true} #61#return; {95826#true} is VALID [2022-04-28 10:17:03,302 INFO L272 TraceCheckUtils]: 4: Hoare triple {95826#true} call #t~ret11 := main(); {95826#true} is VALID [2022-04-28 10:17:03,302 INFO L290 TraceCheckUtils]: 5: Hoare triple {95826#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {95831#(= main_~y~0 0)} is VALID [2022-04-28 10:17:03,303 INFO L290 TraceCheckUtils]: 6: Hoare triple {95831#(= 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; {95832#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:17:03,303 INFO L290 TraceCheckUtils]: 7: Hoare triple {95832#(and (<= 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; {95833#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:17:03,304 INFO L290 TraceCheckUtils]: 8: Hoare triple {95833#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {95834#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:17:03,304 INFO L290 TraceCheckUtils]: 9: Hoare triple {95834#(and (<= main_~y~0 3) (<= 3 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; {95835#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:17:03,305 INFO L290 TraceCheckUtils]: 10: Hoare triple {95835#(and (<= main_~y~0 4) (<= 4 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; {95836#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:17:03,305 INFO L290 TraceCheckUtils]: 11: Hoare triple {95836#(and (<= 5 main_~y~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; {95837#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:17:03,306 INFO L290 TraceCheckUtils]: 12: Hoare triple {95837#(and (<= main_~y~0 6) (<= 6 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; {95838#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:17:03,306 INFO L290 TraceCheckUtils]: 13: Hoare triple {95838#(and (<= 7 main_~y~0) (<= main_~y~0 7))} 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; {95839#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:17:03,307 INFO L290 TraceCheckUtils]: 14: Hoare triple {95839#(and (<= main_~y~0 8) (<= 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; {95840#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:17:03,307 INFO L290 TraceCheckUtils]: 15: Hoare triple {95840#(and (<= 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; {95841#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:17:03,308 INFO L290 TraceCheckUtils]: 16: Hoare triple {95841#(and (<= main_~y~0 10) (<= 10 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; {95842#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:17:03,308 INFO L290 TraceCheckUtils]: 17: Hoare triple {95842#(and (<= main_~y~0 11) (<= 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; {95843#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:17:03,309 INFO L290 TraceCheckUtils]: 18: Hoare triple {95843#(and (<= 12 main_~y~0) (<= main_~y~0 12))} 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; {95844#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:17:03,309 INFO L290 TraceCheckUtils]: 19: Hoare triple {95844#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {95844#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:17:03,309 INFO L290 TraceCheckUtils]: 20: Hoare triple {95844#(and (<= main_~y~0 13) (<= 13 main_~y~0))} ~z~0 := ~y~0; {95845#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-28 10:17:03,310 INFO L290 TraceCheckUtils]: 21: Hoare triple {95845#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {95846#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-28 10:17:03,310 INFO L290 TraceCheckUtils]: 22: Hoare triple {95846#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {95847#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-28 10:17:03,311 INFO L290 TraceCheckUtils]: 23: Hoare triple {95847#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {95848#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:17:03,311 INFO L290 TraceCheckUtils]: 24: Hoare triple {95848#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {95849#(and (<= 9 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-28 10:17:03,312 INFO L290 TraceCheckUtils]: 25: Hoare triple {95849#(and (<= 9 main_~z~0) (<= (div main_~z~0 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {95827#false} is VALID [2022-04-28 10:17:03,312 INFO L290 TraceCheckUtils]: 26: Hoare triple {95827#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {95827#false} is VALID [2022-04-28 10:17:03,312 INFO L290 TraceCheckUtils]: 27: Hoare triple {95827#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {95827#false} is VALID [2022-04-28 10:17:03,312 INFO L290 TraceCheckUtils]: 28: Hoare triple {95827#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {95827#false} is VALID [2022-04-28 10:17:03,312 INFO L290 TraceCheckUtils]: 29: Hoare triple {95827#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {95827#false} is VALID [2022-04-28 10:17:03,312 INFO L290 TraceCheckUtils]: 30: Hoare triple {95827#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {95827#false} is VALID [2022-04-28 10:17:03,312 INFO L290 TraceCheckUtils]: 31: Hoare triple {95827#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {95827#false} is VALID [2022-04-28 10:17:03,312 INFO L290 TraceCheckUtils]: 32: Hoare triple {95827#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {95827#false} is VALID [2022-04-28 10:17:03,312 INFO L290 TraceCheckUtils]: 33: Hoare triple {95827#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {95827#false} is VALID [2022-04-28 10:17:03,312 INFO L290 TraceCheckUtils]: 34: Hoare triple {95827#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {95827#false} is VALID [2022-04-28 10:17:03,312 INFO L290 TraceCheckUtils]: 35: Hoare triple {95827#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {95827#false} is VALID [2022-04-28 10:17:03,312 INFO L290 TraceCheckUtils]: 36: Hoare triple {95827#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {95827#false} is VALID [2022-04-28 10:17:03,312 INFO L290 TraceCheckUtils]: 37: Hoare triple {95827#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {95827#false} is VALID [2022-04-28 10:17:03,312 INFO L290 TraceCheckUtils]: 38: Hoare triple {95827#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {95827#false} is VALID [2022-04-28 10:17:03,312 INFO L290 TraceCheckUtils]: 39: Hoare triple {95827#false} assume !(~y~0 % 4294967296 > 0); {95827#false} is VALID [2022-04-28 10:17:03,312 INFO L272 TraceCheckUtils]: 40: Hoare triple {95827#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {95827#false} is VALID [2022-04-28 10:17:03,313 INFO L290 TraceCheckUtils]: 41: Hoare triple {95827#false} ~cond := #in~cond; {95827#false} is VALID [2022-04-28 10:17:03,313 INFO L290 TraceCheckUtils]: 42: Hoare triple {95827#false} assume 0 == ~cond; {95827#false} is VALID [2022-04-28 10:17:03,313 INFO L290 TraceCheckUtils]: 43: Hoare triple {95827#false} assume !false; {95827#false} is VALID [2022-04-28 10:17:03,313 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 0 proven. 101 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-04-28 10:17:03,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:17:03,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418363562] [2022-04-28 10:17:03,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418363562] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:17:03,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1896780917] [2022-04-28 10:17:03,313 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:17:03,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:17:03,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:17:03,314 INFO L229 MonitoredProcess]: Starting monitored process 105 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 10:17:03,314 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (105)] Waiting until timeout for monitored process [2022-04-28 10:17:03,770 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2022-04-28 10:17:03,771 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:17:03,773 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 39 conjunts are in the unsatisfiable core [2022-04-28 10:17:03,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:17:03,784 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:17:04,061 INFO L272 TraceCheckUtils]: 0: Hoare triple {95826#true} call ULTIMATE.init(); {95826#true} is VALID [2022-04-28 10:17:04,061 INFO L290 TraceCheckUtils]: 1: Hoare triple {95826#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(10, 2);call #Ultimate.allocInit(12, 3); {95826#true} is VALID [2022-04-28 10:17:04,061 INFO L290 TraceCheckUtils]: 2: Hoare triple {95826#true} assume true; {95826#true} is VALID [2022-04-28 10:17:04,061 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {95826#true} {95826#true} #61#return; {95826#true} is VALID [2022-04-28 10:17:04,061 INFO L272 TraceCheckUtils]: 4: Hoare triple {95826#true} call #t~ret11 := main(); {95826#true} is VALID [2022-04-28 10:17:04,061 INFO L290 TraceCheckUtils]: 5: Hoare triple {95826#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {95831#(= main_~y~0 0)} is VALID [2022-04-28 10:17:04,062 INFO L290 TraceCheckUtils]: 6: Hoare triple {95831#(= 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; {95832#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-28 10:17:04,062 INFO L290 TraceCheckUtils]: 7: Hoare triple {95832#(and (<= 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; {95833#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-28 10:17:04,063 INFO L290 TraceCheckUtils]: 8: Hoare triple {95833#(and (<= 2 main_~y~0) (<= main_~y~0 2))} 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; {95834#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-28 10:17:04,063 INFO L290 TraceCheckUtils]: 9: Hoare triple {95834#(and (<= main_~y~0 3) (<= 3 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; {95835#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-28 10:17:04,064 INFO L290 TraceCheckUtils]: 10: Hoare triple {95835#(and (<= main_~y~0 4) (<= 4 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; {95836#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 10:17:04,064 INFO L290 TraceCheckUtils]: 11: Hoare triple {95836#(and (<= 5 main_~y~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; {95837#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-28 10:17:04,065 INFO L290 TraceCheckUtils]: 12: Hoare triple {95837#(and (<= main_~y~0 6) (<= 6 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; {95838#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-28 10:17:04,065 INFO L290 TraceCheckUtils]: 13: Hoare triple {95838#(and (<= 7 main_~y~0) (<= main_~y~0 7))} 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; {95839#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-28 10:17:04,066 INFO L290 TraceCheckUtils]: 14: Hoare triple {95839#(and (<= main_~y~0 8) (<= 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; {95840#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-28 10:17:04,066 INFO L290 TraceCheckUtils]: 15: Hoare triple {95840#(and (<= 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; {95841#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-28 10:17:04,067 INFO L290 TraceCheckUtils]: 16: Hoare triple {95841#(and (<= main_~y~0 10) (<= 10 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; {95842#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-28 10:17:04,067 INFO L290 TraceCheckUtils]: 17: Hoare triple {95842#(and (<= main_~y~0 11) (<= 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; {95843#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-28 10:17:04,068 INFO L290 TraceCheckUtils]: 18: Hoare triple {95843#(and (<= 12 main_~y~0) (<= main_~y~0 12))} 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; {95844#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:17:04,068 INFO L290 TraceCheckUtils]: 19: Hoare triple {95844#(and (<= main_~y~0 13) (<= 13 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {95844#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-28 10:17:04,068 INFO L290 TraceCheckUtils]: 20: Hoare triple {95844#(and (<= main_~y~0 13) (<= 13 main_~y~0))} ~z~0 := ~y~0; {95845#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-28 10:17:04,069 INFO L290 TraceCheckUtils]: 21: Hoare triple {95845#(and (<= 13 main_~z~0) (<= main_~z~0 13))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {95846#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-28 10:17:04,069 INFO L290 TraceCheckUtils]: 22: Hoare triple {95846#(and (<= main_~z~0 12) (<= 12 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {95847#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-28 10:17:04,070 INFO L290 TraceCheckUtils]: 23: Hoare triple {95847#(and (<= main_~z~0 11) (<= 11 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {95848#(and (<= main_~z~0 10) (<= 10 main_~z~0))} is VALID [2022-04-28 10:17:04,070 INFO L290 TraceCheckUtils]: 24: Hoare triple {95848#(and (<= main_~z~0 10) (<= 10 main_~z~0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {95926#(and (<= 9 main_~z~0) (<= main_~z~0 9))} is VALID [2022-04-28 10:17:04,071 INFO L290 TraceCheckUtils]: 25: Hoare triple {95926#(and (<= 9 main_~z~0) (<= main_~z~0 9))} assume !(~z~0 % 4294967296 > 0); {95827#false} is VALID [2022-04-28 10:17:04,071 INFO L290 TraceCheckUtils]: 26: Hoare triple {95827#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {95827#false} is VALID [2022-04-28 10:17:04,071 INFO L290 TraceCheckUtils]: 27: Hoare triple {95827#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {95827#false} is VALID [2022-04-28 10:17:04,071 INFO L290 TraceCheckUtils]: 28: Hoare triple {95827#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {95827#false} is VALID [2022-04-28 10:17:04,071 INFO L290 TraceCheckUtils]: 29: Hoare triple {95827#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {95827#false} is VALID [2022-04-28 10:17:04,071 INFO L290 TraceCheckUtils]: 30: Hoare triple {95827#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {95827#false} is VALID [2022-04-28 10:17:04,071 INFO L290 TraceCheckUtils]: 31: Hoare triple {95827#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {95827#false} is VALID [2022-04-28 10:17:04,071 INFO L290 TraceCheckUtils]: 32: Hoare triple {95827#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {95827#false} is VALID [2022-04-28 10:17:04,071 INFO L290 TraceCheckUtils]: 33: Hoare triple {95827#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {95827#false} is VALID [2022-04-28 10:17:04,071 INFO L290 TraceCheckUtils]: 34: Hoare triple {95827#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {95827#false} is VALID [2022-04-28 10:17:04,071 INFO L290 TraceCheckUtils]: 35: Hoare triple {95827#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {95827#false} is VALID [2022-04-28 10:17:04,071 INFO L290 TraceCheckUtils]: 36: Hoare triple {95827#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {95827#false} is VALID [2022-04-28 10:17:04,071 INFO L290 TraceCheckUtils]: 37: Hoare triple {95827#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {95827#false} is VALID [2022-04-28 10:17:04,071 INFO L290 TraceCheckUtils]: 38: Hoare triple {95827#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {95827#false} is VALID [2022-04-28 10:17:04,072 INFO L290 TraceCheckUtils]: 39: Hoare triple {95827#false} assume !(~y~0 % 4294967296 > 0); {95827#false} is VALID [2022-04-28 10:17:04,072 INFO L272 TraceCheckUtils]: 40: Hoare triple {95827#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {95827#false} is VALID [2022-04-28 10:17:04,072 INFO L290 TraceCheckUtils]: 41: Hoare triple {95827#false} ~cond := #in~cond; {95827#false} is VALID [2022-04-28 10:17:04,072 INFO L290 TraceCheckUtils]: 42: Hoare triple {95827#false} assume 0 == ~cond; {95827#false} is VALID [2022-04-28 10:17:04,072 INFO L290 TraceCheckUtils]: 43: Hoare triple {95827#false} assume !false; {95827#false} is VALID [2022-04-28 10:17:04,072 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 0 proven. 101 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-04-28 10:17:04,072 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:17:04,669 INFO L290 TraceCheckUtils]: 43: Hoare triple {95827#false} assume !false; {95827#false} is VALID [2022-04-28 10:17:04,670 INFO L290 TraceCheckUtils]: 42: Hoare triple {95827#false} assume 0 == ~cond; {95827#false} is VALID [2022-04-28 10:17:04,670 INFO L290 TraceCheckUtils]: 41: Hoare triple {95827#false} ~cond := #in~cond; {95827#false} is VALID [2022-04-28 10:17:04,670 INFO L272 TraceCheckUtils]: 40: Hoare triple {95827#false} call __VERIFIER_assert((if ~z~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {95827#false} is VALID [2022-04-28 10:17:04,670 INFO L290 TraceCheckUtils]: 39: Hoare triple {95827#false} assume !(~y~0 % 4294967296 > 0); {95827#false} is VALID [2022-04-28 10:17:04,670 INFO L290 TraceCheckUtils]: 38: Hoare triple {95827#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {95827#false} is VALID [2022-04-28 10:17:04,670 INFO L290 TraceCheckUtils]: 37: Hoare triple {95827#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {95827#false} is VALID [2022-04-28 10:17:04,670 INFO L290 TraceCheckUtils]: 36: Hoare triple {95827#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {95827#false} is VALID [2022-04-28 10:17:04,670 INFO L290 TraceCheckUtils]: 35: Hoare triple {95827#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {95827#false} is VALID [2022-04-28 10:17:04,670 INFO L290 TraceCheckUtils]: 34: Hoare triple {95827#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {95827#false} is VALID [2022-04-28 10:17:04,670 INFO L290 TraceCheckUtils]: 33: Hoare triple {95827#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {95827#false} is VALID [2022-04-28 10:17:04,670 INFO L290 TraceCheckUtils]: 32: Hoare triple {95827#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {95827#false} is VALID [2022-04-28 10:17:04,670 INFO L290 TraceCheckUtils]: 31: Hoare triple {95827#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {95827#false} is VALID [2022-04-28 10:17:04,670 INFO L290 TraceCheckUtils]: 30: Hoare triple {95827#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {95827#false} is VALID [2022-04-28 10:17:04,670 INFO L290 TraceCheckUtils]: 29: Hoare triple {95827#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {95827#false} is VALID [2022-04-28 10:17:04,670 INFO L290 TraceCheckUtils]: 28: Hoare triple {95827#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {95827#false} is VALID [2022-04-28 10:17:04,670 INFO L290 TraceCheckUtils]: 27: Hoare triple {95827#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {95827#false} is VALID [2022-04-28 10:17:04,670 INFO L290 TraceCheckUtils]: 26: Hoare triple {95827#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {95827#false} is VALID [2022-04-28 10:17:04,671 INFO L290 TraceCheckUtils]: 25: Hoare triple {96038#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {95827#false} is VALID [2022-04-28 10:17:04,671 INFO L290 TraceCheckUtils]: 24: Hoare triple {96042#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {96038#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 10:17:04,672 INFO L290 TraceCheckUtils]: 23: Hoare triple {96046#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {96042#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 10:17:04,673 INFO L290 TraceCheckUtils]: 22: Hoare triple {96050#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {96046#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-28 10:17:04,673 INFO L290 TraceCheckUtils]: 21: Hoare triple {96054#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {96050#(< 0 (mod (+ main_~z~0 4294967293) 4294967296))} is VALID [2022-04-28 10:17:04,674 INFO L290 TraceCheckUtils]: 20: Hoare triple {96058#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} ~z~0 := ~y~0; {96054#(< 0 (mod (+ 4294967292 main_~z~0) 4294967296))} is VALID [2022-04-28 10:17:04,674 INFO L290 TraceCheckUtils]: 19: Hoare triple {96058#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !(~x~0 % 4294967296 > 0); {96058#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-28 10:17:04,675 INFO L290 TraceCheckUtils]: 18: Hoare triple {96065#(< 0 (mod (+ main_~y~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; {96058#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-28 10:17:04,675 INFO L290 TraceCheckUtils]: 17: Hoare triple {96069#(< 0 (mod (+ main_~y~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; {96065#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 10:17:04,676 INFO L290 TraceCheckUtils]: 16: Hoare triple {96073#(< 0 (mod (+ main_~y~0 4294967295) 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; {96069#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 10:17:04,677 INFO L290 TraceCheckUtils]: 15: Hoare triple {96077#(< 0 (mod main_~y~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; {96073#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 10:17:04,677 INFO L290 TraceCheckUtils]: 14: Hoare triple {96081#(< 0 (mod (+ main_~y~0 1) 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; {96077#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 10:17:04,678 INFO L290 TraceCheckUtils]: 13: Hoare triple {96085#(< 0 (mod (+ main_~y~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; {96081#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-28 10:17:04,679 INFO L290 TraceCheckUtils]: 12: Hoare triple {96089#(< 0 (mod (+ main_~y~0 3) 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; {96085#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-28 10:17:04,679 INFO L290 TraceCheckUtils]: 11: Hoare triple {96093#(< 0 (mod (+ main_~y~0 4) 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; {96089#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-28 10:17:04,680 INFO L290 TraceCheckUtils]: 10: Hoare triple {96097#(< 0 (mod (+ 5 main_~y~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; {96093#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-28 10:17:04,680 INFO L290 TraceCheckUtils]: 9: Hoare triple {96101#(< 0 (mod (+ main_~y~0 6) 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; {96097#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-28 10:17:04,681 INFO L290 TraceCheckUtils]: 8: Hoare triple {96105#(< 0 (mod (+ 7 main_~y~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; {96101#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-28 10:17:04,682 INFO L290 TraceCheckUtils]: 7: Hoare triple {96109#(< 0 (mod (+ main_~y~0 8) 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; {96105#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-28 10:17:04,682 INFO L290 TraceCheckUtils]: 6: Hoare triple {96113#(< 0 (mod (+ main_~y~0 9) 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; {96109#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-28 10:17:04,683 INFO L290 TraceCheckUtils]: 5: Hoare triple {95826#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {96113#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-28 10:17:04,683 INFO L272 TraceCheckUtils]: 4: Hoare triple {95826#true} call #t~ret11 := main(); {95826#true} is VALID [2022-04-28 10:17:04,683 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {95826#true} {95826#true} #61#return; {95826#true} is VALID [2022-04-28 10:17:04,683 INFO L290 TraceCheckUtils]: 2: Hoare triple {95826#true} assume true; {95826#true} is VALID [2022-04-28 10:17:04,683 INFO L290 TraceCheckUtils]: 1: Hoare triple {95826#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(10, 2);call #Ultimate.allocInit(12, 3); {95826#true} is VALID [2022-04-28 10:17:04,683 INFO L272 TraceCheckUtils]: 0: Hoare triple {95826#true} call ULTIMATE.init(); {95826#true} is VALID [2022-04-28 10:17:04,683 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 0 proven. 101 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-04-28 10:17:04,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1896780917] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:17:04,683 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 10:17:04,683 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 21] total 42 [2022-04-28 10:17:04,683 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:17:04,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1497501058] [2022-04-28 10:17:04,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1497501058] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:17:04,683 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:17:04,683 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-28 10:17:04,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089861190] [2022-04-28 10:17:04,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:17:04,684 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 states have internal predecessors, (28), 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 44 [2022-04-28 10:17:04,684 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:17:04,684 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 states have internal predecessors, (28), 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-28 10:17:04,703 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:17:04,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-28 10:17:04,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:17:04,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-28 10:17:04,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=307, Invalid=1415, Unknown=0, NotChecked=0, Total=1722 [2022-04-28 10:17:04,704 INFO L87 Difference]: Start difference. First operand 150 states and 190 transitions. Second operand has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 states have internal predecessors, (28), 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)