/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/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/loops-crafted-1/in-de41.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 03:35:45,585 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 03:35:45,615 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 03:35:45,642 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 03:35:45,642 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 03:35:45,643 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 03:35:45,646 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 03:35:45,649 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 03:35:45,650 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 03:35:45,654 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 03:35:45,654 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 03:35:45,655 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 03:35:45,655 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 03:35:45,657 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 03:35:45,658 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 03:35:45,660 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 03:35:45,660 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 03:35:45,661 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 03:35:45,662 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 03:35:45,666 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 03:35:45,667 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 03:35:45,668 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 03:35:45,669 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 03:35:45,669 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 03:35:45,670 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 03:35:45,675 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 03:35:45,675 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 03:35:45,676 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 03:35:45,676 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 03:35:45,677 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 03:35:45,677 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 03:35:45,677 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 03:35:45,679 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 03:35:45,679 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 03:35:45,679 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 03:35:45,680 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 03:35:45,680 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 03:35:45,680 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 03:35:45,680 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 03:35:45,680 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 03:35:45,681 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 03:35:45,682 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 03:35:45,683 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-28 03:35:45,693 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 03:35:45,694 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 03:35:45,694 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 03:35:45,695 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 03:35:45,695 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 03:35:45,695 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 03:35:45,695 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 03:35:45,695 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 03:35:45,695 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 03:35:45,696 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 03:35:45,696 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 03:35:45,696 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 03:35:45,696 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 03:35:45,696 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 03:35:45,696 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 03:35:45,696 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 03:35:45,696 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 03:35:45,696 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 03:35:45,696 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 03:35:45,697 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 03:35:45,697 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 03:35:45,697 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 03:35:45,697 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 03:35:45,697 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 03:35:45,697 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 03:35:45,697 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 03:35:45,893 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 03:35:45,913 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 03:35:45,915 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 03:35:45,916 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 03:35:45,916 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 03:35:45,917 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/in-de41.c [2022-04-28 03:35:45,959 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/12230acb8/ce169966de354255be200c7ad3bed1bb/FLAG355e94f7d [2022-04-28 03:35:46,250 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 03:35:46,250 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/in-de41.c [2022-04-28 03:35:46,256 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/12230acb8/ce169966de354255be200c7ad3bed1bb/FLAG355e94f7d [2022-04-28 03:35:46,683 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/12230acb8/ce169966de354255be200c7ad3bed1bb [2022-04-28 03:35:46,685 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 03:35:46,687 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 03:35:46,689 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 03:35:46,689 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 03:35:46,692 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 03:35:46,693 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 03:35:46" (1/1) ... [2022-04-28 03:35:46,693 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f3463b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:35:46, skipping insertion in model container [2022-04-28 03:35:46,694 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 03:35:46" (1/1) ... [2022-04-28 03:35:46,698 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 03:35:46,707 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 03:35:46,836 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-de41.c[368,381] [2022-04-28 03:35:46,854 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 03:35:46,859 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 03:35:46,867 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-de41.c[368,381] [2022-04-28 03:35:46,871 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 03:35:46,882 INFO L208 MainTranslator]: Completed translation [2022-04-28 03:35:46,882 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:35:46 WrapperNode [2022-04-28 03:35:46,882 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 03:35:46,883 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 03:35:46,883 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 03:35:46,883 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 03:35:46,890 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:35:46" (1/1) ... [2022-04-28 03:35:46,890 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:35:46" (1/1) ... [2022-04-28 03:35:46,894 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:35:46" (1/1) ... [2022-04-28 03:35:46,894 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:35:46" (1/1) ... [2022-04-28 03:35:46,898 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:35:46" (1/1) ... [2022-04-28 03:35:46,901 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:35:46" (1/1) ... [2022-04-28 03:35:46,901 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:35:46" (1/1) ... [2022-04-28 03:35:46,902 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 03:35:46,903 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 03:35:46,903 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 03:35:46,903 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 03:35:46,907 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:35:46" (1/1) ... [2022-04-28 03:35:46,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 03:35:46,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:35:46,933 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 03:35:46,934 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 03:35:46,970 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 03:35:46,970 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 03:35:46,970 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 03:35:46,970 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 03:35:46,971 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 03:35:46,971 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 03:35:46,971 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 03:35:46,971 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 03:35:46,971 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 03:35:46,972 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-28 03:35:46,972 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 03:35:46,972 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 03:35:46,973 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 03:35:46,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 03:35:46,973 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 03:35:46,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 03:35:46,974 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 03:35:46,974 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 03:35:47,022 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 03:35:47,023 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 03:35:47,195 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 03:35:47,199 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 03:35:47,199 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-04-28 03:35:47,201 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 03:35:47 BoogieIcfgContainer [2022-04-28 03:35:47,201 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 03:35:47,204 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 03:35:47,204 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 03:35:47,207 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 03:35:47,207 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 03:35:46" (1/3) ... [2022-04-28 03:35:47,208 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59c9d98a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 03:35:47, skipping insertion in model container [2022-04-28 03:35:47,208 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:35:46" (2/3) ... [2022-04-28 03:35:47,208 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59c9d98a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 03:35:47, skipping insertion in model container [2022-04-28 03:35:47,208 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 03:35:47" (3/3) ... [2022-04-28 03:35:47,209 INFO L111 eAbstractionObserver]: Analyzing ICFG in-de41.c [2022-04-28 03:35:47,218 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 03:35:47,218 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 03:35:47,259 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 03:35:47,266 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@288cefd9, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6859ee88 [2022-04-28 03:35:47,266 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 03:35:47,272 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 16 states have internal predecessors, (25), 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 03:35:47,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-28 03:35:47,276 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:35:47,277 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:35:47,277 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:35:47,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:35:47,281 INFO L85 PathProgramCache]: Analyzing trace with hash 2066875484, now seen corresponding path program 1 times [2022-04-28 03:35:47,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:35:47,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [770693307] [2022-04-28 03:35:47,296 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:35:47,296 INFO L85 PathProgramCache]: Analyzing trace with hash 2066875484, now seen corresponding path program 2 times [2022-04-28 03:35:47,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:35:47,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902093436] [2022-04-28 03:35:47,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:35:47,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:35:47,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:35:47,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:35:47,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:35:47,477 INFO L290 TraceCheckUtils]: 0: Hoare triple {31#(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); {26#true} is VALID [2022-04-28 03:35:47,478 INFO L290 TraceCheckUtils]: 1: Hoare triple {26#true} assume true; {26#true} is VALID [2022-04-28 03:35:47,478 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26#true} {26#true} #72#return; {26#true} is VALID [2022-04-28 03:35:47,480 INFO L272 TraceCheckUtils]: 0: Hoare triple {26#true} call ULTIMATE.init(); {31#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:35:47,481 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#(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); {26#true} is VALID [2022-04-28 03:35:47,481 INFO L290 TraceCheckUtils]: 2: Hoare triple {26#true} assume true; {26#true} is VALID [2022-04-28 03:35:47,481 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26#true} {26#true} #72#return; {26#true} is VALID [2022-04-28 03:35:47,481 INFO L272 TraceCheckUtils]: 4: Hoare triple {26#true} call #t~ret13 := main(); {26#true} is VALID [2022-04-28 03:35:47,482 INFO L290 TraceCheckUtils]: 5: Hoare triple {26#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {26#true} is VALID [2022-04-28 03:35:47,482 INFO L290 TraceCheckUtils]: 6: Hoare triple {26#true} assume !(~x~0 % 4294967296 > 0); {26#true} is VALID [2022-04-28 03:35:47,482 INFO L290 TraceCheckUtils]: 7: Hoare triple {26#true} ~z~0 := ~y~0; {26#true} is VALID [2022-04-28 03:35:47,482 INFO L290 TraceCheckUtils]: 8: Hoare triple {26#true} assume !(~z~0 % 4294967296 > 0); {26#true} is VALID [2022-04-28 03:35:47,483 INFO L290 TraceCheckUtils]: 9: Hoare triple {26#true} assume !(~y~0 % 4294967296 > 0); {26#true} is VALID [2022-04-28 03:35:47,483 INFO L290 TraceCheckUtils]: 10: Hoare triple {26#true} assume !true; {27#false} is VALID [2022-04-28 03:35:47,484 INFO L272 TraceCheckUtils]: 11: Hoare triple {27#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {27#false} is VALID [2022-04-28 03:35:47,484 INFO L290 TraceCheckUtils]: 12: Hoare triple {27#false} ~cond := #in~cond; {27#false} is VALID [2022-04-28 03:35:47,484 INFO L290 TraceCheckUtils]: 13: Hoare triple {27#false} assume 0 == ~cond; {27#false} is VALID [2022-04-28 03:35:47,484 INFO L290 TraceCheckUtils]: 14: Hoare triple {27#false} assume !false; {27#false} is VALID [2022-04-28 03:35:47,484 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 03:35:47,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:35:47,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902093436] [2022-04-28 03:35:47,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902093436] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:35:47,486 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:35:47,486 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 03:35:47,489 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:35:47,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [770693307] [2022-04-28 03:35:47,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [770693307] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:35:47,490 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:35:47,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 03:35:47,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856538715] [2022-04-28 03:35:47,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:35:47,494 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 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 03:35:47,495 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:35:47,498 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 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 03:35:47,521 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 03:35:47,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 03:35:47,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:35:47,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 03:35:47,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 03:35:47,540 INFO L87 Difference]: Start difference. First operand has 23 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 16 states have internal predecessors, (25), 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 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 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 03:35:47,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:35:47,623 INFO L93 Difference]: Finished difference Result 39 states and 54 transitions. [2022-04-28 03:35:47,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 03:35:47,623 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 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 03:35:47,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:35:47,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 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 03:35:47,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2022-04-28 03:35:47,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 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 03:35:47,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2022-04-28 03:35:47,639 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 54 transitions. [2022-04-28 03:35:47,715 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 03:35:47,721 INFO L225 Difference]: With dead ends: 39 [2022-04-28 03:35:47,721 INFO L226 Difference]: Without dead ends: 16 [2022-04-28 03:35:47,723 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 03:35:47,728 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 17 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 03:35:47,729 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 28 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 03:35:47,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-04-28 03:35:47,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-04-28 03:35:47,753 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:35:47,753 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:35:47,754 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:35:47,754 INFO L87 Difference]: Start difference. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:35:47,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:35:47,758 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2022-04-28 03:35:47,758 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2022-04-28 03:35:47,758 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:35:47,759 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:35:47,759 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 3 states have call successors, (3), 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 03:35:47,760 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 3 states have call successors, (3), 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 03:35:47,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:35:47,762 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2022-04-28 03:35:47,762 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2022-04-28 03:35:47,763 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:35:47,763 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:35:47,763 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:35:47,763 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:35:47,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:35:47,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2022-04-28 03:35:47,766 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 19 transitions. Word has length 15 [2022-04-28 03:35:47,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:35:47,767 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 19 transitions. [2022-04-28 03:35:47,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 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 03:35:47,769 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 19 transitions. [2022-04-28 03:35:47,798 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 03:35:47,798 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2022-04-28 03:35:47,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-28 03:35:47,798 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:35:47,799 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:35:47,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 03:35:47,799 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:35:47,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:35:47,799 INFO L85 PathProgramCache]: Analyzing trace with hash 2063181400, now seen corresponding path program 1 times [2022-04-28 03:35:47,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:35:47,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2050837441] [2022-04-28 03:35:47,800 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:35:47,800 INFO L85 PathProgramCache]: Analyzing trace with hash 2063181400, now seen corresponding path program 2 times [2022-04-28 03:35:47,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:35:47,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236711641] [2022-04-28 03:35:47,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:35:47,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:35:47,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:35:48,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:35:48,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:35:48,150 INFO L290 TraceCheckUtils]: 0: Hoare triple {186#(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); {176#true} is VALID [2022-04-28 03:35:48,151 INFO L290 TraceCheckUtils]: 1: Hoare triple {176#true} assume true; {176#true} is VALID [2022-04-28 03:35:48,151 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {176#true} {176#true} #72#return; {176#true} is VALID [2022-04-28 03:35:48,152 INFO L272 TraceCheckUtils]: 0: Hoare triple {176#true} call ULTIMATE.init(); {186#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:35:48,155 INFO L290 TraceCheckUtils]: 1: Hoare triple {186#(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); {176#true} is VALID [2022-04-28 03:35:48,156 INFO L290 TraceCheckUtils]: 2: Hoare triple {176#true} assume true; {176#true} is VALID [2022-04-28 03:35:48,156 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {176#true} {176#true} #72#return; {176#true} is VALID [2022-04-28 03:35:48,156 INFO L272 TraceCheckUtils]: 4: Hoare triple {176#true} call #t~ret13 := main(); {176#true} is VALID [2022-04-28 03:35:48,158 INFO L290 TraceCheckUtils]: 5: Hoare triple {176#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {181#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-28 03:35:48,159 INFO L290 TraceCheckUtils]: 6: Hoare triple {181#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} assume !(~x~0 % 4294967296 > 0); {182#(and (= main_~n~0 main_~x~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} is VALID [2022-04-28 03:35:48,160 INFO L290 TraceCheckUtils]: 7: Hoare triple {182#(and (= main_~n~0 main_~x~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} ~z~0 := ~y~0; {182#(and (= main_~n~0 main_~x~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} is VALID [2022-04-28 03:35:48,161 INFO L290 TraceCheckUtils]: 8: Hoare triple {182#(and (= main_~n~0 main_~x~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} assume !(~z~0 % 4294967296 > 0); {182#(and (= main_~n~0 main_~x~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} is VALID [2022-04-28 03:35:48,161 INFO L290 TraceCheckUtils]: 9: Hoare triple {182#(and (= main_~n~0 main_~x~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} assume !(~y~0 % 4294967296 > 0); {182#(and (= main_~n~0 main_~x~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} is VALID [2022-04-28 03:35:48,162 INFO L290 TraceCheckUtils]: 10: Hoare triple {182#(and (= main_~n~0 main_~x~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} assume !(~x~0 % 4294967296 > 0); {183#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (= main_~y~0 0))} is VALID [2022-04-28 03:35:48,163 INFO L272 TraceCheckUtils]: 11: Hoare triple {183#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (= main_~y~0 0))} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {184#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:35:48,163 INFO L290 TraceCheckUtils]: 12: Hoare triple {184#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {185#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:35:48,164 INFO L290 TraceCheckUtils]: 13: Hoare triple {185#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {177#false} is VALID [2022-04-28 03:35:48,164 INFO L290 TraceCheckUtils]: 14: Hoare triple {177#false} assume !false; {177#false} is VALID [2022-04-28 03:35:48,164 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 03:35:48,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:35:48,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236711641] [2022-04-28 03:35:48,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236711641] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:35:48,165 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:35:48,165 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 03:35:48,165 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:35:48,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2050837441] [2022-04-28 03:35:48,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2050837441] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:35:48,166 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:35:48,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 03:35:48,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758676542] [2022-04-28 03:35:48,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:35:48,168 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 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 03:35:48,168 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:35:48,168 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 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 03:35:48,181 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 03:35:48,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 03:35:48,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:35:48,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 03:35:48,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-04-28 03:35:48,183 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. Second operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 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 03:35:48,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:35:48,457 INFO L93 Difference]: Finished difference Result 35 states and 46 transitions. [2022-04-28 03:35:48,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 03:35:48,458 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 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 03:35:48,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:35:48,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 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 03:35:48,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 46 transitions. [2022-04-28 03:35:48,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 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 03:35:48,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 46 transitions. [2022-04-28 03:35:48,461 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 46 transitions. [2022-04-28 03:35:48,500 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 03:35:48,501 INFO L225 Difference]: With dead ends: 35 [2022-04-28 03:35:48,501 INFO L226 Difference]: Without dead ends: 22 [2022-04-28 03:35:48,502 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-04-28 03:35:48,503 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 36 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:35:48,503 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 38 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 03:35:48,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-28 03:35:48,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-04-28 03:35:48,513 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:35:48,513 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 22 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:35:48,514 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 22 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:35:48,514 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 22 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:35:48,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:35:48,515 INFO L93 Difference]: Finished difference Result 22 states and 27 transitions. [2022-04-28 03:35:48,515 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2022-04-28 03:35:48,515 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:35:48,515 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:35:48,516 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 22 states. [2022-04-28 03:35:48,516 INFO L87 Difference]: Start difference. First operand has 22 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 22 states. [2022-04-28 03:35:48,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:35:48,517 INFO L93 Difference]: Finished difference Result 22 states and 27 transitions. [2022-04-28 03:35:48,517 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2022-04-28 03:35:48,517 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:35:48,517 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:35:48,517 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:35:48,517 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:35:48,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:35:48,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2022-04-28 03:35:48,518 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 27 transitions. Word has length 15 [2022-04-28 03:35:48,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:35:48,518 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 27 transitions. [2022-04-28 03:35:48,519 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 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 03:35:48,519 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 27 transitions. [2022-04-28 03:35:48,543 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 03:35:48,543 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2022-04-28 03:35:48,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-28 03:35:48,544 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:35:48,544 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:35:48,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 03:35:48,544 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:35:48,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:35:48,545 INFO L85 PathProgramCache]: Analyzing trace with hash 570818913, now seen corresponding path program 1 times [2022-04-28 03:35:48,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:35:48,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1523486446] [2022-04-28 03:35:48,877 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:35:48,879 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:35:48,886 INFO L85 PathProgramCache]: Analyzing trace with hash 1649432706, now seen corresponding path program 1 times [2022-04-28 03:35:48,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:35:48,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142111523] [2022-04-28 03:35:48,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:35:48,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:35:48,898 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_1.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:35:48,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:35:48,931 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_1.1))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:35:49,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:35:49,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:35:49,182 INFO L290 TraceCheckUtils]: 0: Hoare triple {368#(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); {357#true} is VALID [2022-04-28 03:35:49,183 INFO L290 TraceCheckUtils]: 1: Hoare triple {357#true} assume true; {357#true} is VALID [2022-04-28 03:35:49,183 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {357#true} {357#true} #72#return; {357#true} is VALID [2022-04-28 03:35:49,184 INFO L272 TraceCheckUtils]: 0: Hoare triple {357#true} call ULTIMATE.init(); {368#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:35:49,185 INFO L290 TraceCheckUtils]: 1: Hoare triple {368#(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); {357#true} is VALID [2022-04-28 03:35:49,185 INFO L290 TraceCheckUtils]: 2: Hoare triple {357#true} assume true; {357#true} is VALID [2022-04-28 03:35:49,185 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {357#true} {357#true} #72#return; {357#true} is VALID [2022-04-28 03:35:49,185 INFO L272 TraceCheckUtils]: 4: Hoare triple {357#true} call #t~ret13 := main(); {357#true} is VALID [2022-04-28 03:35:49,185 INFO L290 TraceCheckUtils]: 5: Hoare triple {357#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {362#(and (= main_~n~0 main_~x~0) (= main_~y~0 0))} is VALID [2022-04-28 03:35:49,203 INFO L290 TraceCheckUtils]: 6: Hoare triple {362#(and (= main_~n~0 main_~x~0) (= main_~y~0 0))} [76] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_11 v_main_~x~0_10)) (.cse1 (= |v_main_#t~post6_4| |v_main_#t~post6_3|)) (.cse4 (mod v_main_~x~0_11 4294967296)) (.cse2 (= |v_main_#t~post5_4| |v_main_#t~post5_3|)) (.cse3 (= v_main_~y~0_13 v_main_~y~0_12))) (or (and .cse0 .cse1 .cse2 .cse3) (and (forall ((v_it_1 Int)) (or (< 0 (mod (+ v_main_~x~0_11 (* v_it_1 4294967295)) 4294967296)) (not (<= 1 v_it_1)) (not (<= (+ v_main_~x~0_10 v_it_1 1) v_main_~x~0_11)))) (< 0 .cse4) (= v_main_~y~0_12 (+ v_main_~x~0_11 v_main_~y~0_13 (* (- 1) v_main_~x~0_10))) (< v_main_~x~0_10 v_main_~x~0_11)) (and .cse0 .cse1 (<= .cse4 0) .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_13, main_#t~post5=|v_main_#t~post5_4|, main_~x~0=v_main_~x~0_11, main_#t~post6=|v_main_#t~post6_4|} OutVars{main_~y~0=v_main_~y~0_12, main_#t~post5=|v_main_#t~post5_3|, main_~x~0=v_main_~x~0_10, main_#t~post6=|v_main_#t~post6_3|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {363#(or (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (= main_~y~0 0)) (<= (+ (* (div main_~y~0 4294967296) 4294967296) (* 4294967296 (div main_~x~0 4294967296)) 1) (+ main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:35:49,204 INFO L290 TraceCheckUtils]: 7: Hoare triple {363#(or (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (= main_~y~0 0)) (<= (+ (* (div main_~y~0 4294967296) 4294967296) (* 4294967296 (div main_~x~0 4294967296)) 1) (+ main_~y~0 main_~x~0)))} [75] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {364#(or (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (= main_~y~0 0)) (<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0))} is VALID [2022-04-28 03:35:49,205 INFO L290 TraceCheckUtils]: 8: Hoare triple {364#(or (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (= main_~y~0 0)) (<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0))} ~z~0 := ~y~0; {364#(or (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (= main_~y~0 0)) (<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0))} is VALID [2022-04-28 03:35:49,206 INFO L290 TraceCheckUtils]: 9: Hoare triple {364#(or (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (= main_~y~0 0)) (<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0))} assume !(~z~0 % 4294967296 > 0); {364#(or (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (= main_~y~0 0)) (<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0))} is VALID [2022-04-28 03:35:49,207 INFO L290 TraceCheckUtils]: 10: Hoare triple {364#(or (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (= main_~y~0 0)) (<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0))} assume !(~y~0 % 4294967296 > 0); {365#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (= main_~y~0 0))} is VALID [2022-04-28 03:35:49,210 INFO L290 TraceCheckUtils]: 11: Hoare triple {365#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (= main_~y~0 0))} assume !(~x~0 % 4294967296 > 0); {365#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (= main_~y~0 0))} is VALID [2022-04-28 03:35:49,211 INFO L272 TraceCheckUtils]: 12: Hoare triple {365#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (= main_~y~0 0))} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {366#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:35:49,211 INFO L290 TraceCheckUtils]: 13: Hoare triple {366#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {367#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:35:49,212 INFO L290 TraceCheckUtils]: 14: Hoare triple {367#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {358#false} is VALID [2022-04-28 03:35:49,212 INFO L290 TraceCheckUtils]: 15: Hoare triple {358#false} assume !false; {358#false} is VALID [2022-04-28 03:35:49,212 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 03:35:49,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:35:49,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142111523] [2022-04-28 03:35:49,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142111523] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:35:49,212 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:35:49,213 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 03:35:49,517 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:35:49,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1523486446] [2022-04-28 03:35:49,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1523486446] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:35:49,518 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:35:49,518 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 03:35:49,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450087007] [2022-04-28 03:35:49,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:35:49,518 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 7 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 03:35:49,519 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:35:49,519 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 7 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 03:35:49,560 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 03:35:49,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 03:35:49,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:35:49,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 03:35:49,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-04-28 03:35:49,562 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. Second operand has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 7 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 03:35:49,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:35:49,850 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2022-04-28 03:35:49,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 03:35:49,850 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 7 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 03:35:49,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:35:49,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 7 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 03:35:49,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 35 transitions. [2022-04-28 03:35:49,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 7 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 03:35:49,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 35 transitions. [2022-04-28 03:35:49,852 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 35 transitions. [2022-04-28 03:35:50,076 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 03:35:50,077 INFO L225 Difference]: With dead ends: 31 [2022-04-28 03:35:50,077 INFO L226 Difference]: Without dead ends: 26 [2022-04-28 03:35:50,077 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2022-04-28 03:35:50,078 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 17 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 26 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:35:50,078 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 46 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 69 Invalid, 0 Unknown, 26 Unchecked, 0.1s Time] [2022-04-28 03:35:50,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-28 03:35:50,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 23. [2022-04-28 03:35:50,098 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:35:50,098 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 23 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 18 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:35:50,099 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 23 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 18 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:35:50,099 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 23 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 18 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:35:50,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:35:50,100 INFO L93 Difference]: Finished difference Result 26 states and 33 transitions. [2022-04-28 03:35:50,100 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2022-04-28 03:35:50,100 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:35:50,100 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:35:50,100 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 18 states have internal predecessors, (25), 3 states have call successors, (3), 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 26 states. [2022-04-28 03:35:50,101 INFO L87 Difference]: Start difference. First operand has 23 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 18 states have internal predecessors, (25), 3 states have call successors, (3), 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 26 states. [2022-04-28 03:35:50,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:35:50,101 INFO L93 Difference]: Finished difference Result 26 states and 33 transitions. [2022-04-28 03:35:50,102 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2022-04-28 03:35:50,102 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:35:50,102 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:35:50,102 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:35:50,102 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:35:50,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 18 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:35:50,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2022-04-28 03:35:50,103 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 29 transitions. Word has length 16 [2022-04-28 03:35:50,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:35:50,103 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 29 transitions. [2022-04-28 03:35:50,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 7 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 03:35:50,103 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 29 transitions. [2022-04-28 03:35:50,233 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 03:35:50,233 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2022-04-28 03:35:50,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 03:35:50,234 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:35:50,234 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 03:35:50,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-28 03:35:50,234 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:35:50,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:35:50,234 INFO L85 PathProgramCache]: Analyzing trace with hash -417354376, now seen corresponding path program 1 times [2022-04-28 03:35:50,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:35:50,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2091387996] [2022-04-28 03:35:50,446 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:35:50,447 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:35:50,450 INFO L85 PathProgramCache]: Analyzing trace with hash 2129640343, now seen corresponding path program 1 times [2022-04-28 03:35:50,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:35:50,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441410141] [2022-04-28 03:35:50,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:35:50,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:35:50,460 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_2.0))) (+ main_~z~0_7 .cse0 (* (- 4294967296) (div (+ main_~z~0_7 .cse0) 4294967296)))) 0)) [2022-04-28 03:35:50,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:35:50,489 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_2.1))) (+ main_~z~0_7 .cse0 (* (- 4294967296) (div (+ main_~z~0_7 .cse0) 4294967296)))) 0)) [2022-04-28 03:35:50,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:35:50,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:35:50,608 INFO L290 TraceCheckUtils]: 0: Hoare triple {553#(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); {543#true} is VALID [2022-04-28 03:35:50,608 INFO L290 TraceCheckUtils]: 1: Hoare triple {543#true} assume true; {543#true} is VALID [2022-04-28 03:35:50,608 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {543#true} {543#true} #72#return; {543#true} is VALID [2022-04-28 03:35:50,609 INFO L272 TraceCheckUtils]: 0: Hoare triple {543#true} call ULTIMATE.init(); {553#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:35:50,609 INFO L290 TraceCheckUtils]: 1: Hoare triple {553#(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); {543#true} is VALID [2022-04-28 03:35:50,609 INFO L290 TraceCheckUtils]: 2: Hoare triple {543#true} assume true; {543#true} is VALID [2022-04-28 03:35:50,609 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {543#true} {543#true} #72#return; {543#true} is VALID [2022-04-28 03:35:50,609 INFO L272 TraceCheckUtils]: 4: Hoare triple {543#true} call #t~ret13 := main(); {543#true} is VALID [2022-04-28 03:35:50,611 INFO L290 TraceCheckUtils]: 5: Hoare triple {543#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {548#(and (= main_~n~0 main_~x~0) (= main_~y~0 0))} is VALID [2022-04-28 03:35:50,611 INFO L290 TraceCheckUtils]: 6: Hoare triple {548#(and (= main_~n~0 main_~x~0) (= main_~y~0 0))} assume !(~x~0 % 4294967296 > 0); {549#(and (= main_~n~0 main_~x~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} is VALID [2022-04-28 03:35:50,612 INFO L290 TraceCheckUtils]: 7: Hoare triple {549#(and (= main_~n~0 main_~x~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} ~z~0 := ~y~0; {550#(and (= main_~z~0 0) (= main_~n~0 main_~x~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 03:35:50,613 INFO L290 TraceCheckUtils]: 8: Hoare triple {550#(and (= main_~z~0 0) (= main_~n~0 main_~x~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))))} [78] L23-2-->L29-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_18 v_main_~x~0_17)) (.cse1 (= |v_main_#t~post7_4| |v_main_#t~post7_3|)) (.cse2 (= |v_main_#t~post8_4| |v_main_#t~post8_3|)) (.cse3 (= v_main_~z~0_9 v_main_~z~0_8)) (.cse4 (mod v_main_~z~0_9 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3) (and (<= .cse4 0) .cse0 .cse1 .cse2 .cse3) (and (< v_main_~z~0_8 v_main_~z~0_9) (forall ((v_it_2 Int)) (or (not (<= 1 v_it_2)) (< 0 (mod (+ v_main_~z~0_9 (* v_it_2 4294967295)) 4294967296)) (not (<= (+ v_main_~z~0_8 v_it_2 1) v_main_~z~0_9)))) (= v_main_~x~0_17 (+ v_main_~x~0_18 v_main_~z~0_9 (* (- 1) v_main_~z~0_8))) (< 0 .cse4)))) InVars {main_~x~0=v_main_~x~0_18, main_#t~post8=|v_main_#t~post8_4|, main_~z~0=v_main_~z~0_9, main_#t~post7=|v_main_#t~post7_4|} OutVars{main_~x~0=v_main_~x~0_17, main_#t~post8=|v_main_#t~post8_3|, main_~z~0=v_main_~z~0_8, main_#t~post7=|v_main_#t~post7_3|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {551#(and (= main_~z~0 0) (<= (+ main_~z~0 main_~x~0) (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 03:35:50,613 INFO L290 TraceCheckUtils]: 9: Hoare triple {551#(and (= main_~z~0 0) (<= (+ main_~z~0 main_~x~0) (* 4294967296 (div main_~x~0 4294967296))))} [77] L29-1_primed-->L29-1: Formula: (not (< 0 (mod v_main_~z~0_5 4294967296))) InVars {main_~z~0=v_main_~z~0_5} OutVars{main_~z~0=v_main_~z~0_5} AuxVars[] AssignedVars[] {552#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:35:50,614 INFO L290 TraceCheckUtils]: 10: Hoare triple {552#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {552#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:35:50,614 INFO L290 TraceCheckUtils]: 11: Hoare triple {552#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {544#false} is VALID [2022-04-28 03:35:50,614 INFO L290 TraceCheckUtils]: 12: Hoare triple {544#false} assume !(~x~0 % 4294967296 > 0); {544#false} is VALID [2022-04-28 03:35:50,615 INFO L272 TraceCheckUtils]: 13: Hoare triple {544#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {544#false} is VALID [2022-04-28 03:35:50,615 INFO L290 TraceCheckUtils]: 14: Hoare triple {544#false} ~cond := #in~cond; {544#false} is VALID [2022-04-28 03:35:50,615 INFO L290 TraceCheckUtils]: 15: Hoare triple {544#false} assume 0 == ~cond; {544#false} is VALID [2022-04-28 03:35:50,615 INFO L290 TraceCheckUtils]: 16: Hoare triple {544#false} assume !false; {544#false} is VALID [2022-04-28 03:35:50,615 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:35:50,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:35:50,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441410141] [2022-04-28 03:35:50,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441410141] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:35:50,615 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:35:50,616 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 03:35:50,670 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:35:50,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2091387996] [2022-04-28 03:35:50,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2091387996] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:35:50,670 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:35:50,671 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 03:35:50,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532318938] [2022-04-28 03:35:50,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:35:50,671 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 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 03:35:50,671 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:35:50,671 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 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 03:35:50,689 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 03:35:50,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 03:35:50,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:35:50,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 03:35:50,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-04-28 03:35:50,690 INFO L87 Difference]: Start difference. First operand 23 states and 29 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 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 03:35:50,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:35:50,873 INFO L93 Difference]: Finished difference Result 35 states and 45 transitions. [2022-04-28 03:35:50,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 03:35:50,875 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 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 03:35:50,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:35:50,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 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 03:35:50,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 38 transitions. [2022-04-28 03:35:50,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 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 03:35:50,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 38 transitions. [2022-04-28 03:35:50,878 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 38 transitions. [2022-04-28 03:35:50,909 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 03:35:50,911 INFO L225 Difference]: With dead ends: 35 [2022-04-28 03:35:50,911 INFO L226 Difference]: Without dead ends: 23 [2022-04-28 03:35:50,911 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2022-04-28 03:35:50,912 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 27 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 03:35:50,912 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 26 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 03:35:50,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-28 03:35:50,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-04-28 03:35:50,944 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:35:50,944 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 18 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:35:50,944 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 18 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:35:50,945 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 18 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:35:50,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:35:50,946 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2022-04-28 03:35:50,946 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2022-04-28 03:35:50,946 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:35:50,946 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:35:50,946 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 18 states have internal predecessors, (25), 3 states have call successors, (3), 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 03:35:50,947 INFO L87 Difference]: Start difference. First operand has 23 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 18 states have internal predecessors, (25), 3 states have call successors, (3), 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 03:35:50,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:35:50,947 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2022-04-28 03:35:50,947 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2022-04-28 03:35:50,948 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:35:50,948 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:35:50,948 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:35:50,948 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:35:50,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 18 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:35:50,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2022-04-28 03:35:50,949 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 29 transitions. Word has length 17 [2022-04-28 03:35:50,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:35:50,949 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 29 transitions. [2022-04-28 03:35:50,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 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 03:35:50,949 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 29 transitions. [2022-04-28 03:35:51,367 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 03:35:51,367 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2022-04-28 03:35:51,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 03:35:51,368 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:35:51,368 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 03:35:51,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-28 03:35:51,368 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:35:51,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:35:51,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1952840614, now seen corresponding path program 1 times [2022-04-28 03:35:51,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:35:51,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [321210701] [2022-04-28 03:35:51,563 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:35:51,564 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:35:51,567 INFO L85 PathProgramCache]: Analyzing trace with hash 1646204965, now seen corresponding path program 1 times [2022-04-28 03:35:51,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:35:51,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436931839] [2022-04-28 03:35:51,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:35:51,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:35:51,578 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:35:51,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:35:51,586 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.1))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:35:51,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:35:51,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:35:51,641 INFO L290 TraceCheckUtils]: 0: Hoare triple {733#(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); {726#true} is VALID [2022-04-28 03:35:51,641 INFO L290 TraceCheckUtils]: 1: Hoare triple {726#true} assume true; {726#true} is VALID [2022-04-28 03:35:51,641 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {726#true} {726#true} #72#return; {726#true} is VALID [2022-04-28 03:35:51,642 INFO L272 TraceCheckUtils]: 0: Hoare triple {726#true} call ULTIMATE.init(); {733#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:35:51,642 INFO L290 TraceCheckUtils]: 1: Hoare triple {733#(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); {726#true} is VALID [2022-04-28 03:35:51,642 INFO L290 TraceCheckUtils]: 2: Hoare triple {726#true} assume true; {726#true} is VALID [2022-04-28 03:35:51,642 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {726#true} {726#true} #72#return; {726#true} is VALID [2022-04-28 03:35:51,642 INFO L272 TraceCheckUtils]: 4: Hoare triple {726#true} call #t~ret13 := main(); {726#true} is VALID [2022-04-28 03:35:51,642 INFO L290 TraceCheckUtils]: 5: Hoare triple {726#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {726#true} is VALID [2022-04-28 03:35:51,643 INFO L290 TraceCheckUtils]: 6: Hoare triple {726#true} [80] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_21 v_main_~y~0_20)) (.cse1 (= v_main_~x~0_26 v_main_~x~0_25)) (.cse2 (= |v_main_#t~post6_9| |v_main_#t~post6_8|)) (.cse3 (= |v_main_#t~post5_9| |v_main_#t~post5_8|)) (.cse4 (mod v_main_~x~0_26 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3) (and (forall ((v_it_3 Int)) (or (< 0 (mod (+ v_main_~x~0_26 (* v_it_3 4294967295)) 4294967296)) (not (<= 1 v_it_3)) (not (<= (+ v_main_~x~0_25 v_it_3 1) v_main_~x~0_26)))) (< 0 .cse4) (< v_main_~x~0_25 v_main_~x~0_26) (= (+ v_main_~x~0_26 v_main_~y~0_21 (* (- 1) v_main_~x~0_25)) v_main_~y~0_20)) (and .cse0 .cse1 .cse2 .cse3 (<= .cse4 0)))) InVars {main_~y~0=v_main_~y~0_21, main_#t~post5=|v_main_#t~post5_9|, main_~x~0=v_main_~x~0_26, main_#t~post6=|v_main_#t~post6_9|} OutVars{main_~y~0=v_main_~y~0_20, main_#t~post5=|v_main_#t~post5_8|, main_~x~0=v_main_~x~0_25, main_#t~post6=|v_main_#t~post6_8|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {726#true} is VALID [2022-04-28 03:35:51,643 INFO L290 TraceCheckUtils]: 7: Hoare triple {726#true} [79] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {726#true} is VALID [2022-04-28 03:35:51,643 INFO L290 TraceCheckUtils]: 8: Hoare triple {726#true} ~z~0 := ~y~0; {731#(= (+ main_~z~0 (* (- 1) main_~y~0)) 0)} is VALID [2022-04-28 03:35:51,644 INFO L290 TraceCheckUtils]: 9: Hoare triple {731#(= (+ main_~z~0 (* (- 1) main_~y~0)) 0)} assume !(~z~0 % 4294967296 > 0); {732#(and (= main_~z~0 main_~y~0) (<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-28 03:35:51,644 INFO L290 TraceCheckUtils]: 10: Hoare triple {732#(and (= main_~z~0 main_~y~0) (<= main_~z~0 (* (div 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; {727#false} is VALID [2022-04-28 03:35:51,644 INFO L290 TraceCheckUtils]: 11: Hoare triple {727#false} assume !(~y~0 % 4294967296 > 0); {727#false} is VALID [2022-04-28 03:35:51,645 INFO L290 TraceCheckUtils]: 12: Hoare triple {727#false} assume !(~x~0 % 4294967296 > 0); {727#false} is VALID [2022-04-28 03:35:51,645 INFO L272 TraceCheckUtils]: 13: Hoare triple {727#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {727#false} is VALID [2022-04-28 03:35:51,645 INFO L290 TraceCheckUtils]: 14: Hoare triple {727#false} ~cond := #in~cond; {727#false} is VALID [2022-04-28 03:35:51,645 INFO L290 TraceCheckUtils]: 15: Hoare triple {727#false} assume 0 == ~cond; {727#false} is VALID [2022-04-28 03:35:51,645 INFO L290 TraceCheckUtils]: 16: Hoare triple {727#false} assume !false; {727#false} is VALID [2022-04-28 03:35:51,645 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:35:51,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:35:51,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436931839] [2022-04-28 03:35:51,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436931839] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:35:51,645 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:35:51,646 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 03:35:51,667 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:35:51,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [321210701] [2022-04-28 03:35:51,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [321210701] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:35:51,667 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:35:51,667 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 03:35:51,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220059420] [2022-04-28 03:35:51,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:35:51,668 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 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 03:35:51,668 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:35:51,668 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:35:51,678 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 03:35:51,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 03:35:51,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:35:51,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 03:35:51,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-28 03:35:51,679 INFO L87 Difference]: Start difference. First operand 23 states and 29 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:35:51,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:35:51,829 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2022-04-28 03:35:51,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 03:35:51,829 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 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 03:35:51,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:35:51,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:35:51,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 32 transitions. [2022-04-28 03:35:51,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:35:51,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 32 transitions. [2022-04-28 03:35:51,831 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 32 transitions. [2022-04-28 03:35:51,855 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 03:35:51,855 INFO L225 Difference]: With dead ends: 29 [2022-04-28 03:35:51,855 INFO L226 Difference]: Without dead ends: 21 [2022-04-28 03:35:51,856 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-04-28 03:35:51,856 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 20 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 03:35:51,857 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 32 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 03:35:51,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-04-28 03:35:51,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2022-04-28 03:35:51,879 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:35:51,879 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 20 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:35:51,879 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 20 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:35:51,879 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 20 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:35:51,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:35:51,880 INFO L93 Difference]: Finished difference Result 21 states and 26 transitions. [2022-04-28 03:35:51,880 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 26 transitions. [2022-04-28 03:35:51,880 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:35:51,880 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:35:51,881 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 3 states have call successors, (3), 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 21 states. [2022-04-28 03:35:51,881 INFO L87 Difference]: Start difference. First operand has 20 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 3 states have call successors, (3), 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 21 states. [2022-04-28 03:35:51,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:35:51,881 INFO L93 Difference]: Finished difference Result 21 states and 26 transitions. [2022-04-28 03:35:51,881 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 26 transitions. [2022-04-28 03:35:51,882 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:35:51,882 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:35:51,882 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:35:51,882 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:35:51,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:35:51,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2022-04-28 03:35:51,882 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 17 [2022-04-28 03:35:51,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:35:51,883 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2022-04-28 03:35:51,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:35:51,883 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 24 transitions. [2022-04-28 03:35:51,980 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 03:35:51,980 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2022-04-28 03:35:51,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-28 03:35:51,981 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:35:51,981 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:35:51,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-28 03:35:51,981 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:35:51,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:35:51,981 INFO L85 PathProgramCache]: Analyzing trace with hash -58627519, now seen corresponding path program 1 times [2022-04-28 03:35:51,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:35:51,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1219518755] [2022-04-28 03:35:52,177 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:35:52,179 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:35:52,181 INFO L85 PathProgramCache]: Analyzing trace with hash -15168030, now seen corresponding path program 1 times [2022-04-28 03:35:52,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:35:52,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726626934] [2022-04-28 03:35:52,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:35:52,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:35:52,188 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.0))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-04-28 03:35:52,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:35:52,200 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.1))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-04-28 03:35:52,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:35:52,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:35:52,308 INFO L290 TraceCheckUtils]: 0: Hoare triple {894#(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); {884#true} is VALID [2022-04-28 03:35:52,308 INFO L290 TraceCheckUtils]: 1: Hoare triple {884#true} assume true; {884#true} is VALID [2022-04-28 03:35:52,308 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {884#true} {884#true} #72#return; {884#true} is VALID [2022-04-28 03:35:52,309 INFO L272 TraceCheckUtils]: 0: Hoare triple {884#true} call ULTIMATE.init(); {894#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:35:52,309 INFO L290 TraceCheckUtils]: 1: Hoare triple {894#(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); {884#true} is VALID [2022-04-28 03:35:52,309 INFO L290 TraceCheckUtils]: 2: Hoare triple {884#true} assume true; {884#true} is VALID [2022-04-28 03:35:52,309 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {884#true} {884#true} #72#return; {884#true} is VALID [2022-04-28 03:35:52,309 INFO L272 TraceCheckUtils]: 4: Hoare triple {884#true} call #t~ret13 := main(); {884#true} is VALID [2022-04-28 03:35:52,311 INFO L290 TraceCheckUtils]: 5: Hoare triple {884#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {889#(= main_~y~0 0)} is VALID [2022-04-28 03:35:52,320 INFO L290 TraceCheckUtils]: 6: Hoare triple {889#(= main_~y~0 0)} [82] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_33 4294967296)) (.cse1 (= |v_main_#t~post6_14| |v_main_#t~post6_13|)) (.cse2 (= v_main_~x~0_33 v_main_~x~0_32)) (.cse3 (= |v_main_#t~post5_14| |v_main_#t~post5_13|)) (.cse4 (= v_main_~y~0_29 v_main_~y~0_28))) (or (and (< v_main_~y~0_29 v_main_~y~0_28) (< 0 .cse0) (forall ((v_it_4 Int)) (or (< 0 (mod (+ (* v_it_4 4294967295) v_main_~x~0_33) 4294967296)) (not (<= 1 v_it_4)) (not (<= (+ v_main_~y~0_29 v_it_4 1) v_main_~y~0_28)))) (= (+ v_main_~x~0_33 v_main_~y~0_29 (* (- 1) v_main_~y~0_28)) v_main_~x~0_32)) (and .cse1 .cse2 .cse3 .cse4) (and (<= .cse0 0) .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_29, main_#t~post5=|v_main_#t~post5_14|, main_~x~0=v_main_~x~0_33, main_#t~post6=|v_main_#t~post6_14|} OutVars{main_~y~0=v_main_~y~0_28, main_#t~post5=|v_main_#t~post5_13|, main_~x~0=v_main_~x~0_32, main_#t~post6=|v_main_#t~post6_13|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {890#(or (and (<= 0 main_~y~0) (<= main_~y~0 0)) (<= (+ (* (div main_~y~0 4294967296) 4294967296) (* 4294967296 (div main_~x~0 4294967296)) 1) (+ main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:35:52,321 INFO L290 TraceCheckUtils]: 7: Hoare triple {890#(or (and (<= 0 main_~y~0) (<= main_~y~0 0)) (<= (+ (* (div main_~y~0 4294967296) 4294967296) (* 4294967296 (div main_~x~0 4294967296)) 1) (+ main_~y~0 main_~x~0)))} [81] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {891#(or (and (<= 0 main_~y~0) (<= main_~y~0 0)) (<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0))} is VALID [2022-04-28 03:35:52,322 INFO L290 TraceCheckUtils]: 8: Hoare triple {891#(or (and (<= 0 main_~y~0) (<= main_~y~0 0)) (<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0))} ~z~0 := ~y~0; {892#(or (and (<= main_~z~0 0) (<= 0 main_~z~0)) (<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0))} is VALID [2022-04-28 03:35:52,323 INFO L290 TraceCheckUtils]: 9: Hoare triple {892#(or (and (<= main_~z~0 0) (<= 0 main_~z~0)) (<= (+ (* (div main_~y~0 4294967296) 4294967296) 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; {893#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-28 03:35:52,323 INFO L290 TraceCheckUtils]: 10: Hoare triple {893#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~z~0 % 4294967296 > 0); {893#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-28 03:35:52,323 INFO L290 TraceCheckUtils]: 11: Hoare triple {893#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {885#false} is VALID [2022-04-28 03:35:52,324 INFO L290 TraceCheckUtils]: 12: Hoare triple {885#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {885#false} is VALID [2022-04-28 03:35:52,324 INFO L290 TraceCheckUtils]: 13: Hoare triple {885#false} assume !(~x~0 % 4294967296 > 0); {885#false} is VALID [2022-04-28 03:35:52,324 INFO L272 TraceCheckUtils]: 14: Hoare triple {885#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {885#false} is VALID [2022-04-28 03:35:52,324 INFO L290 TraceCheckUtils]: 15: Hoare triple {885#false} ~cond := #in~cond; {885#false} is VALID [2022-04-28 03:35:52,324 INFO L290 TraceCheckUtils]: 16: Hoare triple {885#false} assume 0 == ~cond; {885#false} is VALID [2022-04-28 03:35:52,324 INFO L290 TraceCheckUtils]: 17: Hoare triple {885#false} assume !false; {885#false} is VALID [2022-04-28 03:35:52,324 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:35:52,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:35:52,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726626934] [2022-04-28 03:35:52,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726626934] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:35:52,324 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:35:52,324 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 03:35:52,538 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:35:52,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1219518755] [2022-04-28 03:35:52,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1219518755] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:35:52,538 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:35:52,538 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 03:35:52,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374446452] [2022-04-28 03:35:52,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:35:52,538 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 18 [2022-04-28 03:35:52,539 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:35:52,539 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 03:35:53,176 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 03:35:53,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 03:35:53,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:35:53,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 03:35:53,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2022-04-28 03:35:53,177 INFO L87 Difference]: Start difference. First operand 20 states and 24 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 03:35:53,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:35:53,390 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2022-04-28 03:35:53,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 03:35:53,390 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 18 [2022-04-28 03:35:53,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:35:53,390 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 03:35:53,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 29 transitions. [2022-04-28 03:35:53,391 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 03:35:53,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 29 transitions. [2022-04-28 03:35:53,392 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 29 transitions. [2022-04-28 03:35:53,575 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 03:35:53,575 INFO L225 Difference]: With dead ends: 26 [2022-04-28 03:35:53,576 INFO L226 Difference]: Without dead ends: 19 [2022-04-28 03:35:53,576 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2022-04-28 03:35:53,581 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 12 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 19 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 03:35:53,582 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 32 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 22 Invalid, 0 Unknown, 19 Unchecked, 0.0s Time] [2022-04-28 03:35:53,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-28 03:35:53,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-04-28 03:35:53,612 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:35:53,612 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:35:53,613 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:35:53,613 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:35:53,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:35:53,614 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2022-04-28 03:35:53,614 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2022-04-28 03:35:53,614 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:35:53,614 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:35:53,614 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 19 states. [2022-04-28 03:35:53,614 INFO L87 Difference]: Start difference. First operand has 19 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 19 states. [2022-04-28 03:35:53,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:35:53,615 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2022-04-28 03:35:53,615 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2022-04-28 03:35:53,615 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:35:53,615 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:35:53,615 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:35:53,615 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:35:53,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:35:53,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2022-04-28 03:35:53,616 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 18 [2022-04-28 03:35:53,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:35:53,616 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2022-04-28 03:35:53,616 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 03:35:53,617 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 22 transitions. [2022-04-28 03:35:57,704 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 20 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-28 03:35:57,704 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2022-04-28 03:35:57,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-28 03:35:57,705 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:35:57,705 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:35:57,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-28 03:35:57,705 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:35:57,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:35:57,705 INFO L85 PathProgramCache]: Analyzing trace with hash 1344200880, now seen corresponding path program 1 times [2022-04-28 03:35:57,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:35:57,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1915194805] [2022-04-28 03:36:01,529 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:36:01,623 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:36:01,624 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:36:01,626 INFO L85 PathProgramCache]: Analyzing trace with hash -1948076911, now seen corresponding path program 1 times [2022-04-28 03:36:01,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:36:01,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546839056] [2022-04-28 03:36:01,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:36:01,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:36:01,634 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:36:01,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:36:01,645 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.1))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:36:01,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:36:01,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:36:01,690 INFO L290 TraceCheckUtils]: 0: Hoare triple {1040#(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); {1033#true} is VALID [2022-04-28 03:36:01,690 INFO L290 TraceCheckUtils]: 1: Hoare triple {1033#true} assume true; {1033#true} is VALID [2022-04-28 03:36:01,691 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1033#true} {1033#true} #72#return; {1033#true} is VALID [2022-04-28 03:36:01,691 INFO L272 TraceCheckUtils]: 0: Hoare triple {1033#true} call ULTIMATE.init(); {1040#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:36:01,692 INFO L290 TraceCheckUtils]: 1: Hoare triple {1040#(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); {1033#true} is VALID [2022-04-28 03:36:01,693 INFO L290 TraceCheckUtils]: 2: Hoare triple {1033#true} assume true; {1033#true} is VALID [2022-04-28 03:36:01,699 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1033#true} {1033#true} #72#return; {1033#true} is VALID [2022-04-28 03:36:01,699 INFO L272 TraceCheckUtils]: 4: Hoare triple {1033#true} call #t~ret13 := main(); {1033#true} is VALID [2022-04-28 03:36:01,699 INFO L290 TraceCheckUtils]: 5: Hoare triple {1033#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1033#true} is VALID [2022-04-28 03:36:01,700 INFO L290 TraceCheckUtils]: 6: Hoare triple {1033#true} [84] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_40 4294967296)) (.cse1 (= v_main_~y~0_36 v_main_~y~0_35)) (.cse2 (= v_main_~x~0_40 v_main_~x~0_39)) (.cse3 (= |v_main_#t~post6_19| |v_main_#t~post6_18|)) (.cse4 (= |v_main_#t~post5_19| |v_main_#t~post5_18|))) (or (and (< 0 .cse0) (= v_main_~y~0_35 (+ v_main_~x~0_40 v_main_~y~0_36 (* (- 1) v_main_~x~0_39))) (forall ((v_it_5 Int)) (or (< 0 (mod (+ v_main_~x~0_40 (* v_it_5 4294967295)) 4294967296)) (not (<= 1 v_it_5)) (not (<= (+ v_main_~x~0_39 v_it_5 1) v_main_~x~0_40)))) (< v_main_~x~0_39 v_main_~x~0_40)) (and .cse1 .cse2 (<= .cse0 0) .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_36, main_#t~post5=|v_main_#t~post5_19|, main_~x~0=v_main_~x~0_40, main_#t~post6=|v_main_#t~post6_19|} OutVars{main_~y~0=v_main_~y~0_35, main_#t~post5=|v_main_#t~post5_18|, main_~x~0=v_main_~x~0_39, main_#t~post6=|v_main_#t~post6_18|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1033#true} is VALID [2022-04-28 03:36:01,700 INFO L290 TraceCheckUtils]: 7: Hoare triple {1033#true} [83] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {1038#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:36:01,701 INFO L290 TraceCheckUtils]: 8: Hoare triple {1038#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {1038#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:36:01,702 INFO L290 TraceCheckUtils]: 9: Hoare triple {1038#(<= main_~x~0 (* 4294967296 (div main_~x~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; {1039#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-28 03:36:01,702 INFO L290 TraceCheckUtils]: 10: Hoare triple {1039#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {1039#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-28 03:36:01,703 INFO L290 TraceCheckUtils]: 11: Hoare triple {1039#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~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; {1039#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-28 03:36:01,703 INFO L290 TraceCheckUtils]: 12: Hoare triple {1039#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {1039#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-28 03:36:01,703 INFO L290 TraceCheckUtils]: 13: Hoare triple {1039#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {1034#false} is VALID [2022-04-28 03:36:01,704 INFO L272 TraceCheckUtils]: 14: Hoare triple {1034#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1034#false} is VALID [2022-04-28 03:36:01,704 INFO L290 TraceCheckUtils]: 15: Hoare triple {1034#false} ~cond := #in~cond; {1034#false} is VALID [2022-04-28 03:36:01,704 INFO L290 TraceCheckUtils]: 16: Hoare triple {1034#false} assume 0 == ~cond; {1034#false} is VALID [2022-04-28 03:36:01,704 INFO L290 TraceCheckUtils]: 17: Hoare triple {1034#false} assume !false; {1034#false} is VALID [2022-04-28 03:36:01,704 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:36:01,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:36:01,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546839056] [2022-04-28 03:36:01,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546839056] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:36:01,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [173789992] [2022-04-28 03:36:01,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:36:01,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:36:01,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:36:01,708 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 03:36:01,709 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 03:36:01,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:36:01,747 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-28 03:36:01,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:36:01,761 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:36:02,016 INFO L272 TraceCheckUtils]: 0: Hoare triple {1033#true} call ULTIMATE.init(); {1033#true} is VALID [2022-04-28 03:36:02,017 INFO L290 TraceCheckUtils]: 1: Hoare triple {1033#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1033#true} is VALID [2022-04-28 03:36:02,017 INFO L290 TraceCheckUtils]: 2: Hoare triple {1033#true} assume true; {1033#true} is VALID [2022-04-28 03:36:02,017 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1033#true} {1033#true} #72#return; {1033#true} is VALID [2022-04-28 03:36:02,017 INFO L272 TraceCheckUtils]: 4: Hoare triple {1033#true} call #t~ret13 := main(); {1033#true} is VALID [2022-04-28 03:36:02,017 INFO L290 TraceCheckUtils]: 5: Hoare triple {1033#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1033#true} is VALID [2022-04-28 03:36:02,017 INFO L290 TraceCheckUtils]: 6: Hoare triple {1033#true} [84] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_40 4294967296)) (.cse1 (= v_main_~y~0_36 v_main_~y~0_35)) (.cse2 (= v_main_~x~0_40 v_main_~x~0_39)) (.cse3 (= |v_main_#t~post6_19| |v_main_#t~post6_18|)) (.cse4 (= |v_main_#t~post5_19| |v_main_#t~post5_18|))) (or (and (< 0 .cse0) (= v_main_~y~0_35 (+ v_main_~x~0_40 v_main_~y~0_36 (* (- 1) v_main_~x~0_39))) (forall ((v_it_5 Int)) (or (< 0 (mod (+ v_main_~x~0_40 (* v_it_5 4294967295)) 4294967296)) (not (<= 1 v_it_5)) (not (<= (+ v_main_~x~0_39 v_it_5 1) v_main_~x~0_40)))) (< v_main_~x~0_39 v_main_~x~0_40)) (and .cse1 .cse2 (<= .cse0 0) .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_36, main_#t~post5=|v_main_#t~post5_19|, main_~x~0=v_main_~x~0_40, main_#t~post6=|v_main_#t~post6_19|} OutVars{main_~y~0=v_main_~y~0_35, main_#t~post5=|v_main_#t~post5_18|, main_~x~0=v_main_~x~0_39, main_#t~post6=|v_main_#t~post6_18|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1033#true} is VALID [2022-04-28 03:36:02,018 INFO L290 TraceCheckUtils]: 7: Hoare triple {1033#true} [83] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {1038#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:36:02,018 INFO L290 TraceCheckUtils]: 8: Hoare triple {1038#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {1038#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:36:02,019 INFO L290 TraceCheckUtils]: 9: Hoare triple {1038#(<= main_~x~0 (* 4294967296 (div main_~x~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; {1071#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:36:02,019 INFO L290 TraceCheckUtils]: 10: Hoare triple {1071#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !(~z~0 % 4294967296 > 0); {1071#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:36:02,020 INFO L290 TraceCheckUtils]: 11: Hoare triple {1071#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 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; {1071#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:36:02,020 INFO L290 TraceCheckUtils]: 12: Hoare triple {1071#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !(~y~0 % 4294967296 > 0); {1071#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:36:02,021 INFO L290 TraceCheckUtils]: 13: Hoare triple {1071#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !(~x~0 % 4294967296 > 0); {1034#false} is VALID [2022-04-28 03:36:02,021 INFO L272 TraceCheckUtils]: 14: Hoare triple {1034#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1034#false} is VALID [2022-04-28 03:36:02,021 INFO L290 TraceCheckUtils]: 15: Hoare triple {1034#false} ~cond := #in~cond; {1034#false} is VALID [2022-04-28 03:36:02,021 INFO L290 TraceCheckUtils]: 16: Hoare triple {1034#false} assume 0 == ~cond; {1034#false} is VALID [2022-04-28 03:36:02,021 INFO L290 TraceCheckUtils]: 17: Hoare triple {1034#false} assume !false; {1034#false} is VALID [2022-04-28 03:36:02,021 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:36:02,021 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:36:02,256 INFO L290 TraceCheckUtils]: 17: Hoare triple {1034#false} assume !false; {1034#false} is VALID [2022-04-28 03:36:02,256 INFO L290 TraceCheckUtils]: 16: Hoare triple {1034#false} assume 0 == ~cond; {1034#false} is VALID [2022-04-28 03:36:02,257 INFO L290 TraceCheckUtils]: 15: Hoare triple {1034#false} ~cond := #in~cond; {1034#false} is VALID [2022-04-28 03:36:02,257 INFO L272 TraceCheckUtils]: 14: Hoare triple {1034#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1034#false} is VALID [2022-04-28 03:36:02,257 INFO L290 TraceCheckUtils]: 13: Hoare triple {1039#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {1034#false} is VALID [2022-04-28 03:36:02,258 INFO L290 TraceCheckUtils]: 12: Hoare triple {1039#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {1039#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-28 03:36:02,258 INFO L290 TraceCheckUtils]: 11: Hoare triple {1039#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~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; {1039#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-28 03:36:02,259 INFO L290 TraceCheckUtils]: 10: Hoare triple {1039#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {1039#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-28 03:36:02,259 INFO L290 TraceCheckUtils]: 9: Hoare triple {1120#(<= (* (div (+ main_~x~0 1) 4294967296) 4294967296) 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; {1039#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-28 03:36:02,260 INFO L290 TraceCheckUtils]: 8: Hoare triple {1120#(<= (* (div (+ main_~x~0 1) 4294967296) 4294967296) main_~x~0)} ~z~0 := ~y~0; {1120#(<= (* (div (+ main_~x~0 1) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-28 03:36:02,260 INFO L290 TraceCheckUtils]: 7: Hoare triple {1033#true} [83] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {1120#(<= (* (div (+ main_~x~0 1) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-28 03:36:02,261 INFO L290 TraceCheckUtils]: 6: Hoare triple {1033#true} [84] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_40 4294967296)) (.cse1 (= v_main_~y~0_36 v_main_~y~0_35)) (.cse2 (= v_main_~x~0_40 v_main_~x~0_39)) (.cse3 (= |v_main_#t~post6_19| |v_main_#t~post6_18|)) (.cse4 (= |v_main_#t~post5_19| |v_main_#t~post5_18|))) (or (and (< 0 .cse0) (= v_main_~y~0_35 (+ v_main_~x~0_40 v_main_~y~0_36 (* (- 1) v_main_~x~0_39))) (forall ((v_it_5 Int)) (or (< 0 (mod (+ v_main_~x~0_40 (* v_it_5 4294967295)) 4294967296)) (not (<= 1 v_it_5)) (not (<= (+ v_main_~x~0_39 v_it_5 1) v_main_~x~0_40)))) (< v_main_~x~0_39 v_main_~x~0_40)) (and .cse1 .cse2 (<= .cse0 0) .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_36, main_#t~post5=|v_main_#t~post5_19|, main_~x~0=v_main_~x~0_40, main_#t~post6=|v_main_#t~post6_19|} OutVars{main_~y~0=v_main_~y~0_35, main_#t~post5=|v_main_#t~post5_18|, main_~x~0=v_main_~x~0_39, main_#t~post6=|v_main_#t~post6_18|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1033#true} is VALID [2022-04-28 03:36:02,261 INFO L290 TraceCheckUtils]: 5: Hoare triple {1033#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1033#true} is VALID [2022-04-28 03:36:02,261 INFO L272 TraceCheckUtils]: 4: Hoare triple {1033#true} call #t~ret13 := main(); {1033#true} is VALID [2022-04-28 03:36:02,261 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1033#true} {1033#true} #72#return; {1033#true} is VALID [2022-04-28 03:36:02,261 INFO L290 TraceCheckUtils]: 2: Hoare triple {1033#true} assume true; {1033#true} is VALID [2022-04-28 03:36:02,261 INFO L290 TraceCheckUtils]: 1: Hoare triple {1033#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1033#true} is VALID [2022-04-28 03:36:02,261 INFO L272 TraceCheckUtils]: 0: Hoare triple {1033#true} call ULTIMATE.init(); {1033#true} is VALID [2022-04-28 03:36:02,261 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:36:02,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [173789992] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:36:02,261 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:36:02,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 7 [2022-04-28 03:36:02,322 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:36:02,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1915194805] [2022-04-28 03:36:02,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1915194805] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:36:02,322 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:36:02,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 03:36:02,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659064438] [2022-04-28 03:36:02,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:36:02,322 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 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 03:36:02,323 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:36:02,323 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 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 03:36:02,336 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 03:36:02,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 03:36:02,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:36:02,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 03:36:02,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-04-28 03:36:02,337 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 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 03:36:02,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:36:02,547 INFO L93 Difference]: Finished difference Result 33 states and 42 transitions. [2022-04-28 03:36:02,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 03:36:02,547 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 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 03:36:02,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:36:02,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 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 03:36:02,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 39 transitions. [2022-04-28 03:36:02,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 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 03:36:02,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 39 transitions. [2022-04-28 03:36:02,549 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 39 transitions. [2022-04-28 03:36:02,585 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 03:36:02,585 INFO L225 Difference]: With dead ends: 33 [2022-04-28 03:36:02,585 INFO L226 Difference]: Without dead ends: 28 [2022-04-28 03:36:02,586 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 38 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-04-28 03:36:02,586 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 26 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 03:36:02,586 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 27 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 03:36:02,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-28 03:36:02,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 24. [2022-04-28 03:36:02,626 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:36:02,626 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 24 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:36:02,626 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 24 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:36:02,626 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 24 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:36:02,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:36:02,627 INFO L93 Difference]: Finished difference Result 28 states and 36 transitions. [2022-04-28 03:36:02,627 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2022-04-28 03:36:02,627 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:36:02,627 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:36:02,627 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 3 states have call successors, (3), 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 28 states. [2022-04-28 03:36:02,628 INFO L87 Difference]: Start difference. First operand has 24 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 3 states have call successors, (3), 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 28 states. [2022-04-28 03:36:02,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:36:02,628 INFO L93 Difference]: Finished difference Result 28 states and 36 transitions. [2022-04-28 03:36:02,628 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2022-04-28 03:36:02,629 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:36:02,629 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:36:02,629 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:36:02,629 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:36:02,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:36:02,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2022-04-28 03:36:02,630 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 30 transitions. Word has length 18 [2022-04-28 03:36:02,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:36:02,630 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 30 transitions. [2022-04-28 03:36:02,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 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 03:36:02,630 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 30 transitions. [2022-04-28 03:36:04,821 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 29 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 03:36:04,821 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2022-04-28 03:36:04,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-28 03:36:04,822 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:36:04,822 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:36:04,838 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-28 03:36:05,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:36:05,023 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:36:05,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:36:05,023 INFO L85 PathProgramCache]: Analyzing trace with hash -1244950584, now seen corresponding path program 1 times [2022-04-28 03:36:05,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:36:05,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1102360815] [2022-04-28 03:36:09,139 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:36:09,238 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:36:09,240 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:36:09,242 INFO L85 PathProgramCache]: Analyzing trace with hash -554987577, now seen corresponding path program 1 times [2022-04-28 03:36:09,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:36:09,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95400435] [2022-04-28 03:36:09,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:36:09,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:36:09,250 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:36:09,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:36:09,304 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.3))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:36:09,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:36:09,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:36:09,632 INFO L290 TraceCheckUtils]: 0: Hoare triple {1343#(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); {1328#true} is VALID [2022-04-28 03:36:09,632 INFO L290 TraceCheckUtils]: 1: Hoare triple {1328#true} assume true; {1328#true} is VALID [2022-04-28 03:36:09,632 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1328#true} {1328#true} #72#return; {1328#true} is VALID [2022-04-28 03:36:09,636 INFO L272 TraceCheckUtils]: 0: Hoare triple {1328#true} call ULTIMATE.init(); {1343#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:36:09,636 INFO L290 TraceCheckUtils]: 1: Hoare triple {1343#(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); {1328#true} is VALID [2022-04-28 03:36:09,636 INFO L290 TraceCheckUtils]: 2: Hoare triple {1328#true} assume true; {1328#true} is VALID [2022-04-28 03:36:09,636 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1328#true} {1328#true} #72#return; {1328#true} is VALID [2022-04-28 03:36:09,636 INFO L272 TraceCheckUtils]: 4: Hoare triple {1328#true} call #t~ret13 := main(); {1328#true} is VALID [2022-04-28 03:36:09,637 INFO L290 TraceCheckUtils]: 5: Hoare triple {1328#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1333#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-28 03:36:09,639 INFO L290 TraceCheckUtils]: 6: Hoare triple {1333#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} [86] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= |v_main_#t~post5_24| |v_main_#t~post5_23|)) (.cse2 (= v_main_~x~0_49 v_main_~x~0_48)) (.cse3 (= v_main_~y~0_44 v_main_~y~0_43)) (.cse4 (= |v_main_#t~post6_24| |v_main_#t~post6_23|)) (.cse0 (mod v_main_~x~0_49 4294967296))) (or (and (<= .cse0 0) .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4) (and (= (+ v_main_~x~0_49 v_main_~y~0_44 (* (- 1) v_main_~y~0_43)) v_main_~x~0_48) (< v_main_~y~0_44 v_main_~y~0_43) (forall ((v_it_6 Int)) (or (not (<= (+ v_main_~y~0_44 v_it_6 1) v_main_~y~0_43)) (< 0 (mod (+ v_main_~x~0_49 (* v_it_6 4294967295)) 4294967296)) (not (<= 1 v_it_6)))) (< 0 .cse0)))) InVars {main_~y~0=v_main_~y~0_44, main_#t~post5=|v_main_#t~post5_24|, main_~x~0=v_main_~x~0_49, main_#t~post6=|v_main_#t~post6_24|} OutVars{main_~y~0=v_main_~y~0_43, main_#t~post5=|v_main_#t~post5_23|, main_~x~0=v_main_~x~0_48, main_#t~post6=|v_main_#t~post6_23|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1334#(or (and (<= (div main_~n~0 4294967296) (div (+ (- 1) main_~n~0) 4294967296)) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= main_~n~0 (+ main_~y~0 main_~x~0))) (= main_~y~0 0))} is VALID [2022-04-28 03:36:09,639 INFO L290 TraceCheckUtils]: 7: Hoare triple {1334#(or (and (<= (div main_~n~0 4294967296) (div (+ (- 1) main_~n~0) 4294967296)) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= main_~n~0 (+ main_~y~0 main_~x~0))) (= main_~y~0 0))} [85] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {1335#(or (and (<= (div main_~n~0 4294967296) (div (+ (- 1) main_~n~0) 4294967296)) (<= (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))))) (= main_~y~0 0))} is VALID [2022-04-28 03:36:09,640 INFO L290 TraceCheckUtils]: 8: Hoare triple {1335#(or (and (<= (div main_~n~0 4294967296) (div (+ (- 1) main_~n~0) 4294967296)) (<= (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))))) (= main_~y~0 0))} ~z~0 := ~y~0; {1336#(and (or (and (<= (div main_~n~0 4294967296) (div (+ (- 1) main_~n~0) 4294967296)) (<= (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))))) (= main_~y~0 0)) (= (+ main_~y~0 (* (- 1) main_~z~0)) 0))} is VALID [2022-04-28 03:36:09,642 INFO L290 TraceCheckUtils]: 9: Hoare triple {1336#(and (or (and (<= (div main_~n~0 4294967296) (div (+ (- 1) main_~n~0) 4294967296)) (<= (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))))) (= main_~y~0 0)) (= (+ main_~y~0 (* (- 1) main_~z~0)) 0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1337#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~y~0 (* (div (+ main_~n~0 main_~z~0 (* (- 1) main_~y~0)) 4294967296) 4294967296))))} is VALID [2022-04-28 03:36:09,644 INFO L290 TraceCheckUtils]: 10: Hoare triple {1337#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~y~0 (* (div (+ main_~n~0 main_~z~0 (* (- 1) main_~y~0)) 4294967296) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {1338#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0)) (<= (+ (* (div main_~n~0 4294967296) 4294967296) (* (div main_~z~0 4294967296) 4294967296) 1) (+ main_~y~0 (* (div (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296) (* (- 1) main_~y~0)) 4294967296) 4294967296))))} is VALID [2022-04-28 03:36:09,646 INFO L290 TraceCheckUtils]: 11: Hoare triple {1338#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0)) (<= (+ (* (div main_~n~0 4294967296) 4294967296) (* (div main_~z~0 4294967296) 4294967296) 1) (+ main_~y~0 (* (div (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296) (* (- 1) main_~y~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; {1339#(and (<= main_~n~0 (+ (* (div (+ (- 1) main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0 1)) (<= (* (div main_~n~0 4294967296) 4294967296) (+ (* (div (+ (- 1) main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0)))} is VALID [2022-04-28 03:36:09,650 INFO L290 TraceCheckUtils]: 12: Hoare triple {1339#(and (<= main_~n~0 (+ (* (div (+ (- 1) main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0 1)) (<= (* (div main_~n~0 4294967296) 4294967296) (+ (* (div (+ (- 1) main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0)))} assume !(~y~0 % 4294967296 > 0); {1339#(and (<= main_~n~0 (+ (* (div (+ (- 1) main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0 1)) (<= (* (div main_~n~0 4294967296) 4294967296) (+ (* (div (+ (- 1) main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0)))} is VALID [2022-04-28 03:36:09,652 INFO L290 TraceCheckUtils]: 13: Hoare triple {1339#(and (<= main_~n~0 (+ (* (div (+ (- 1) main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0 1)) (<= (* (div main_~n~0 4294967296) 4294967296) (+ (* (div (+ (- 1) main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {1340#(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 03:36:09,652 INFO L290 TraceCheckUtils]: 14: Hoare triple {1340#(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); {1340#(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 03:36:09,653 INFO L272 TraceCheckUtils]: 15: Hoare triple {1340#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1341#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:36:09,654 INFO L290 TraceCheckUtils]: 16: Hoare triple {1341#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {1342#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:36:09,654 INFO L290 TraceCheckUtils]: 17: Hoare triple {1342#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1329#false} is VALID [2022-04-28 03:36:09,654 INFO L290 TraceCheckUtils]: 18: Hoare triple {1329#false} assume !false; {1329#false} is VALID [2022-04-28 03:36:09,654 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 03:36:09,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:36:09,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95400435] [2022-04-28 03:36:09,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95400435] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:36:09,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1053501578] [2022-04-28 03:36:09,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:36:09,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:36:09,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:36:09,660 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 03:36:09,661 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 03:36:09,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:36:09,783 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-28 03:36:09,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:36:09,830 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:36:43,451 INFO L272 TraceCheckUtils]: 0: Hoare triple {1328#true} call ULTIMATE.init(); {1328#true} is VALID [2022-04-28 03:36:43,451 INFO L290 TraceCheckUtils]: 1: Hoare triple {1328#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1328#true} is VALID [2022-04-28 03:36:43,451 INFO L290 TraceCheckUtils]: 2: Hoare triple {1328#true} assume true; {1328#true} is VALID [2022-04-28 03:36:43,451 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1328#true} {1328#true} #72#return; {1328#true} is VALID [2022-04-28 03:36:43,451 INFO L272 TraceCheckUtils]: 4: Hoare triple {1328#true} call #t~ret13 := main(); {1328#true} is VALID [2022-04-28 03:36:43,452 INFO L290 TraceCheckUtils]: 5: Hoare triple {1328#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1333#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-28 03:36:43,466 INFO L290 TraceCheckUtils]: 6: Hoare triple {1333#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} [86] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= |v_main_#t~post5_24| |v_main_#t~post5_23|)) (.cse2 (= v_main_~x~0_49 v_main_~x~0_48)) (.cse3 (= v_main_~y~0_44 v_main_~y~0_43)) (.cse4 (= |v_main_#t~post6_24| |v_main_#t~post6_23|)) (.cse0 (mod v_main_~x~0_49 4294967296))) (or (and (<= .cse0 0) .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4) (and (= (+ v_main_~x~0_49 v_main_~y~0_44 (* (- 1) v_main_~y~0_43)) v_main_~x~0_48) (< v_main_~y~0_44 v_main_~y~0_43) (forall ((v_it_6 Int)) (or (not (<= (+ v_main_~y~0_44 v_it_6 1) v_main_~y~0_43)) (< 0 (mod (+ v_main_~x~0_49 (* v_it_6 4294967295)) 4294967296)) (not (<= 1 v_it_6)))) (< 0 .cse0)))) InVars {main_~y~0=v_main_~y~0_44, main_#t~post5=|v_main_#t~post5_24|, main_~x~0=v_main_~x~0_49, main_#t~post6=|v_main_#t~post6_24|} OutVars{main_~y~0=v_main_~y~0_43, main_#t~post5=|v_main_#t~post5_23|, main_~x~0=v_main_~x~0_48, main_#t~post6=|v_main_#t~post6_23|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1365#(or (and (forall ((v_it_6 Int)) (or (not (<= 1 v_it_6)) (not (<= (+ v_it_6 1) main_~y~0)) (< 0 (mod (+ main_~n~0 (* v_it_6 4294967295)) 4294967296)))) (= main_~x~0 (+ main_~n~0 (* (- 1) main_~y~0))) (< 0 (mod main_~n~0 4294967296)) (< 0 main_~y~0)) (and (= main_~n~0 main_~x~0) (= main_~y~0 0)))} is VALID [2022-04-28 03:36:43,467 INFO L290 TraceCheckUtils]: 7: Hoare triple {1365#(or (and (forall ((v_it_6 Int)) (or (not (<= 1 v_it_6)) (not (<= (+ v_it_6 1) main_~y~0)) (< 0 (mod (+ main_~n~0 (* v_it_6 4294967295)) 4294967296)))) (= main_~x~0 (+ main_~n~0 (* (- 1) main_~y~0))) (< 0 (mod main_~n~0 4294967296)) (< 0 main_~y~0)) (and (= main_~n~0 main_~x~0) (= main_~y~0 0)))} [85] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {1369#(and (or (and (forall ((v_it_6 Int)) (or (not (<= 1 v_it_6)) (not (<= (+ v_it_6 1) main_~y~0)) (< 0 (mod (+ main_~n~0 (* v_it_6 4294967295)) 4294967296)))) (= main_~x~0 (+ main_~n~0 (* (- 1) main_~y~0))) (< 0 (mod main_~n~0 4294967296)) (< 0 main_~y~0)) (and (= main_~n~0 main_~x~0) (= main_~y~0 0))) (not (< 0 (mod main_~x~0 4294967296))))} is VALID [2022-04-28 03:36:43,468 INFO L290 TraceCheckUtils]: 8: Hoare triple {1369#(and (or (and (forall ((v_it_6 Int)) (or (not (<= 1 v_it_6)) (not (<= (+ v_it_6 1) main_~y~0)) (< 0 (mod (+ main_~n~0 (* v_it_6 4294967295)) 4294967296)))) (= main_~x~0 (+ main_~n~0 (* (- 1) main_~y~0))) (< 0 (mod main_~n~0 4294967296)) (< 0 main_~y~0)) (and (= main_~n~0 main_~x~0) (= main_~y~0 0))) (not (< 0 (mod main_~x~0 4294967296))))} ~z~0 := ~y~0; {1373#(and (= main_~z~0 main_~y~0) (or (and (forall ((v_it_6 Int)) (or (not (<= 1 v_it_6)) (not (<= (+ v_it_6 1) main_~y~0)) (< 0 (mod (+ main_~n~0 (* v_it_6 4294967295)) 4294967296)))) (= main_~x~0 (+ main_~n~0 (* (- 1) main_~y~0))) (< 0 (mod main_~n~0 4294967296)) (< 0 main_~y~0)) (and (= main_~n~0 main_~x~0) (= main_~y~0 0))) (not (< 0 (mod main_~x~0 4294967296))))} is VALID [2022-04-28 03:36:43,502 INFO L290 TraceCheckUtils]: 9: Hoare triple {1373#(and (= main_~z~0 main_~y~0) (or (and (forall ((v_it_6 Int)) (or (not (<= 1 v_it_6)) (not (<= (+ v_it_6 1) main_~y~0)) (< 0 (mod (+ main_~n~0 (* v_it_6 4294967295)) 4294967296)))) (= main_~x~0 (+ main_~n~0 (* (- 1) main_~y~0))) (< 0 (mod main_~n~0 4294967296)) (< 0 main_~y~0)) (and (= main_~n~0 main_~x~0) (= main_~y~0 0))) (not (< 0 (mod main_~x~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; {1377#(and (forall ((v_it_6 Int)) (or (not (<= 1 v_it_6)) (not (<= (+ v_it_6 1) main_~y~0)) (< 0 (mod (+ main_~n~0 (* v_it_6 4294967295)) 4294967296)))) (< 0 (mod (+ main_~z~0 1) 4294967296)) (not (< 0 (mod (+ main_~x~0 4294967295) 4294967296))) (= (+ (- 1) main_~x~0) (+ main_~n~0 (* (- 1) main_~y~0))) (< 0 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-28 03:36:43,512 INFO L290 TraceCheckUtils]: 10: Hoare triple {1377#(and (forall ((v_it_6 Int)) (or (not (<= 1 v_it_6)) (not (<= (+ v_it_6 1) main_~y~0)) (< 0 (mod (+ main_~n~0 (* v_it_6 4294967295)) 4294967296)))) (< 0 (mod (+ main_~z~0 1) 4294967296)) (not (< 0 (mod (+ main_~x~0 4294967295) 4294967296))) (= (+ (- 1) main_~x~0) (+ main_~n~0 (* (- 1) main_~y~0))) (< 0 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} assume !(~z~0 % 4294967296 > 0); {1381#(and (forall ((v_it_6 Int)) (or (not (<= 1 v_it_6)) (not (<= (+ v_it_6 1) main_~y~0)) (< 0 (mod (+ main_~n~0 (* v_it_6 4294967295)) 4294967296)))) (<= (mod (+ main_~y~0 4294967295) 4294967296) 0) (<= (mod (+ main_~x~0 4294967295) 4294967296) 0) (< 0 main_~y~0) (= (+ main_~n~0 1) (+ main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:36:43,524 INFO L290 TraceCheckUtils]: 11: Hoare triple {1381#(and (forall ((v_it_6 Int)) (or (not (<= 1 v_it_6)) (not (<= (+ v_it_6 1) main_~y~0)) (< 0 (mod (+ main_~n~0 (* v_it_6 4294967295)) 4294967296)))) (<= (mod (+ main_~y~0 4294967295) 4294967296) 0) (<= (mod (+ main_~x~0 4294967295) 4294967296) 0) (< 0 main_~y~0) (= (+ main_~n~0 1) (+ main_~y~0 main_~x~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; {1385#(and (<= (mod main_~y~0 4294967296) 0) (<= (mod (+ main_~x~0 4294967295) 4294967296) 0) (= (+ main_~y~0 main_~x~0 1) (+ main_~n~0 1)) (< 0 (+ main_~y~0 1)) (forall ((v_it_6 Int)) (or (not (<= v_it_6 main_~y~0)) (not (<= 1 v_it_6)) (< 0 (mod (+ main_~n~0 (* v_it_6 4294967295)) 4294967296)))))} is VALID [2022-04-28 03:36:43,555 INFO L290 TraceCheckUtils]: 12: Hoare triple {1385#(and (<= (mod main_~y~0 4294967296) 0) (<= (mod (+ main_~x~0 4294967295) 4294967296) 0) (= (+ main_~y~0 main_~x~0 1) (+ main_~n~0 1)) (< 0 (+ main_~y~0 1)) (forall ((v_it_6 Int)) (or (not (<= v_it_6 main_~y~0)) (not (<= 1 v_it_6)) (< 0 (mod (+ main_~n~0 (* v_it_6 4294967295)) 4294967296)))))} assume !(~y~0 % 4294967296 > 0); {1385#(and (<= (mod main_~y~0 4294967296) 0) (<= (mod (+ main_~x~0 4294967295) 4294967296) 0) (= (+ main_~y~0 main_~x~0 1) (+ main_~n~0 1)) (< 0 (+ main_~y~0 1)) (forall ((v_it_6 Int)) (or (not (<= v_it_6 main_~y~0)) (not (<= 1 v_it_6)) (< 0 (mod (+ main_~n~0 (* v_it_6 4294967295)) 4294967296)))))} is VALID [2022-04-28 03:36:43,570 INFO L290 TraceCheckUtils]: 13: Hoare triple {1385#(and (<= (mod main_~y~0 4294967296) 0) (<= (mod (+ main_~x~0 4294967295) 4294967296) 0) (= (+ main_~y~0 main_~x~0 1) (+ main_~n~0 1)) (< 0 (+ main_~y~0 1)) (forall ((v_it_6 Int)) (or (not (<= v_it_6 main_~y~0)) (not (<= 1 v_it_6)) (< 0 (mod (+ main_~n~0 (* v_it_6 4294967295)) 4294967296)))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {1392#(and (< main_~x~0 main_~n~0) (<= (mod (+ main_~n~0 4294967295 (* main_~x~0 4294967295)) 4294967296) 0) (<= (mod main_~x~0 4294967296) 0) (forall ((v_it_6 Int)) (or (not (<= (+ v_it_6 main_~x~0 1) main_~n~0)) (not (<= 1 v_it_6)) (< 0 (mod (+ main_~n~0 (* v_it_6 4294967295)) 4294967296)))) (= main_~y~0 (+ main_~n~0 (* (- 1) main_~x~0))))} is VALID [2022-04-28 03:36:43,578 INFO L290 TraceCheckUtils]: 14: Hoare triple {1392#(and (< main_~x~0 main_~n~0) (<= (mod (+ main_~n~0 4294967295 (* main_~x~0 4294967295)) 4294967296) 0) (<= (mod main_~x~0 4294967296) 0) (forall ((v_it_6 Int)) (or (not (<= (+ v_it_6 main_~x~0 1) main_~n~0)) (not (<= 1 v_it_6)) (< 0 (mod (+ main_~n~0 (* v_it_6 4294967295)) 4294967296)))) (= main_~y~0 (+ main_~n~0 (* (- 1) main_~x~0))))} assume !(~x~0 % 4294967296 > 0); {1396#(and (forall ((v_it_6 Int)) (or (not (<= 1 v_it_6)) (not (<= (+ v_it_6 1) main_~y~0)) (< 0 (mod (+ main_~n~0 (* v_it_6 4294967295)) 4294967296)))) (<= (mod (+ main_~n~0 (* main_~y~0 4294967295)) 4294967296) 0) (<= (mod (+ main_~y~0 4294967295) 4294967296) 0) (< 0 main_~y~0))} is VALID [2022-04-28 03:36:43,583 INFO L272 TraceCheckUtils]: 15: Hoare triple {1396#(and (forall ((v_it_6 Int)) (or (not (<= 1 v_it_6)) (not (<= (+ v_it_6 1) main_~y~0)) (< 0 (mod (+ main_~n~0 (* v_it_6 4294967295)) 4294967296)))) (<= (mod (+ main_~n~0 (* main_~y~0 4294967295)) 4294967296) 0) (<= (mod (+ main_~y~0 4294967295) 4294967296) 0) (< 0 main_~y~0))} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1400#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:36:43,583 INFO L290 TraceCheckUtils]: 16: Hoare triple {1400#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1404#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:36:43,583 INFO L290 TraceCheckUtils]: 17: Hoare triple {1404#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1329#false} is VALID [2022-04-28 03:36:43,584 INFO L290 TraceCheckUtils]: 18: Hoare triple {1329#false} assume !false; {1329#false} is VALID [2022-04-28 03:36:43,584 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 03:36:43,584 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:37:07,762 INFO L290 TraceCheckUtils]: 18: Hoare triple {1329#false} assume !false; {1329#false} is VALID [2022-04-28 03:37:07,762 INFO L290 TraceCheckUtils]: 17: Hoare triple {1404#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1329#false} is VALID [2022-04-28 03:37:07,763 INFO L290 TraceCheckUtils]: 16: Hoare triple {1400#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1404#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:37:07,764 INFO L272 TraceCheckUtils]: 15: Hoare triple {1340#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1400#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:37:07,765 INFO L290 TraceCheckUtils]: 14: Hoare triple {1423#(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); {1340#(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 03:37:07,767 INFO L290 TraceCheckUtils]: 13: Hoare triple {1427#(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~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {1423#(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 03:37:07,768 INFO L290 TraceCheckUtils]: 12: Hoare triple {1431#(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)))) (< 0 (mod main_~y~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {1427#(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 03:37:07,770 INFO L290 TraceCheckUtils]: 11: Hoare triple {1435#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (< 0 (mod (+ main_~y~0 4294967295) 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 !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {1431#(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)))) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 03:37:07,771 INFO L290 TraceCheckUtils]: 10: Hoare triple {1439#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (< 0 (mod main_~z~0 4294967296)) (< 0 (mod (+ main_~y~0 4294967295) 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 !(~z~0 % 4294967296 > 0); {1435#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (< 0 (mod (+ main_~y~0 4294967295) 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 03:37:07,774 INFO L290 TraceCheckUtils]: 9: Hoare triple {1443#(or (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (< 0 (mod main_~x~0 4294967296)) (< 0 (mod (+ main_~z~0 4294967295) 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 !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1439#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (< 0 (mod main_~z~0 4294967296)) (< 0 (mod (+ main_~y~0 4294967295) 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 03:37:07,775 INFO L290 TraceCheckUtils]: 8: Hoare triple {1447#(or (< 0 (mod (+ main_~y~0 4294967295) 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))))} ~z~0 := ~y~0; {1443#(or (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (< 0 (mod main_~x~0 4294967296)) (< 0 (mod (+ main_~z~0 4294967295) 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 03:37:07,776 INFO L290 TraceCheckUtils]: 7: Hoare triple {1447#(or (< 0 (mod (+ main_~y~0 4294967295) 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))))} [85] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {1447#(or (< 0 (mod (+ main_~y~0 4294967295) 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 03:37:09,829 WARN L290 TraceCheckUtils]: 6: Hoare triple {1454#(and (forall ((aux_div_aux_mod_v_main_~y~0_53_46_102 Int) (aux_div_v_main_~y~0_53_46 Int) (aux_mod_aux_mod_v_main_~y~0_53_46_102 Int)) (or (< (* aux_div_v_main_~y~0_53_46 4294967296) (+ (* aux_div_aux_mod_v_main_~y~0_53_46_102 4294967296) 4294967295 aux_mod_aux_mod_v_main_~y~0_53_46_102)) (<= (+ aux_mod_aux_mod_v_main_~y~0_53_46_102 (* (div main_~n~0 4294967296) 4294967296)) main_~n~0) (< (+ (* aux_div_aux_mod_v_main_~y~0_53_46_102 4294967296) 4294967295 aux_mod_aux_mod_v_main_~y~0_53_46_102) (* aux_div_v_main_~y~0_53_46 4294967296)) (<= 4294967296 aux_mod_aux_mod_v_main_~y~0_53_46_102) (and (or (not (< main_~y~0 (+ (* aux_div_aux_mod_v_main_~y~0_53_46_102 4294967296) aux_mod_aux_mod_v_main_~y~0_53_46_102))) (forall ((aux_div_v_main_~x~0_58_31 Int)) (or (< (+ (* aux_div_aux_mod_v_main_~y~0_53_46_102 4294967296) (* aux_div_v_main_~x~0_58_31 4294967296) aux_mod_aux_mod_v_main_~y~0_53_46_102) (+ main_~y~0 main_~x~0)) (< (+ main_~y~0 main_~x~0) (+ (* aux_div_aux_mod_v_main_~y~0_53_46_102 4294967296) (* aux_div_v_main_~x~0_58_31 4294967296) aux_mod_aux_mod_v_main_~y~0_53_46_102)))) (not (< 0 (mod main_~x~0 4294967296))) (exists ((v_it_6 Int)) (and (<= 1 v_it_6) (not (< 0 (mod (+ main_~x~0 (* v_it_6 4294967295)) 4294967296))) (<= (+ v_it_6 main_~y~0 1) (+ (* aux_div_aux_mod_v_main_~y~0_53_46_102 4294967296) aux_mod_aux_mod_v_main_~y~0_53_46_102))))) (or (not (= (+ main_~y~0 4294967295) (+ (* aux_div_aux_mod_v_main_~y~0_53_46_102 4294967296) 4294967295 aux_mod_aux_mod_v_main_~y~0_53_46_102))) (< 0 (mod main_~x~0 4294967296)))))) (forall ((aux_div_aux_mod_v_main_~y~0_53_46_102 Int) (aux_div_v_main_~y~0_53_46 Int) (aux_mod_aux_mod_v_main_~y~0_53_46_102 Int)) (or (< (* aux_div_v_main_~y~0_53_46 4294967296) (+ (* aux_div_aux_mod_v_main_~y~0_53_46_102 4294967296) 4294967295 aux_mod_aux_mod_v_main_~y~0_53_46_102)) (< aux_mod_aux_mod_v_main_~y~0_53_46_102 0) (< (+ (* aux_div_aux_mod_v_main_~y~0_53_46_102 4294967296) 4294967295 aux_mod_aux_mod_v_main_~y~0_53_46_102) (* aux_div_v_main_~y~0_53_46 4294967296)) (and (or (not (< main_~y~0 (+ (* aux_div_aux_mod_v_main_~y~0_53_46_102 4294967296) aux_mod_aux_mod_v_main_~y~0_53_46_102))) (forall ((aux_div_v_main_~x~0_58_31 Int)) (or (< (+ (* aux_div_aux_mod_v_main_~y~0_53_46_102 4294967296) (* aux_div_v_main_~x~0_58_31 4294967296) aux_mod_aux_mod_v_main_~y~0_53_46_102) (+ main_~y~0 main_~x~0)) (< (+ main_~y~0 main_~x~0) (+ (* aux_div_aux_mod_v_main_~y~0_53_46_102 4294967296) (* aux_div_v_main_~x~0_58_31 4294967296) aux_mod_aux_mod_v_main_~y~0_53_46_102)))) (not (< 0 (mod main_~x~0 4294967296))) (exists ((v_it_6 Int)) (and (<= 1 v_it_6) (not (< 0 (mod (+ main_~x~0 (* v_it_6 4294967295)) 4294967296))) (<= (+ v_it_6 main_~y~0 1) (+ (* aux_div_aux_mod_v_main_~y~0_53_46_102 4294967296) aux_mod_aux_mod_v_main_~y~0_53_46_102))))) (or (not (= (+ main_~y~0 4294967295) (+ (* aux_div_aux_mod_v_main_~y~0_53_46_102 4294967296) 4294967295 aux_mod_aux_mod_v_main_~y~0_53_46_102))) (< 0 (mod main_~x~0 4294967296)))) (< main_~n~0 (+ aux_mod_aux_mod_v_main_~y~0_53_46_102 (* (div main_~n~0 4294967296) 4294967296) 1)))))} [86] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= |v_main_#t~post5_24| |v_main_#t~post5_23|)) (.cse2 (= v_main_~x~0_49 v_main_~x~0_48)) (.cse3 (= v_main_~y~0_44 v_main_~y~0_43)) (.cse4 (= |v_main_#t~post6_24| |v_main_#t~post6_23|)) (.cse0 (mod v_main_~x~0_49 4294967296))) (or (and (<= .cse0 0) .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4) (and (= (+ v_main_~x~0_49 v_main_~y~0_44 (* (- 1) v_main_~y~0_43)) v_main_~x~0_48) (< v_main_~y~0_44 v_main_~y~0_43) (forall ((v_it_6 Int)) (or (not (<= (+ v_main_~y~0_44 v_it_6 1) v_main_~y~0_43)) (< 0 (mod (+ v_main_~x~0_49 (* v_it_6 4294967295)) 4294967296)) (not (<= 1 v_it_6)))) (< 0 .cse0)))) InVars {main_~y~0=v_main_~y~0_44, main_#t~post5=|v_main_#t~post5_24|, main_~x~0=v_main_~x~0_49, main_#t~post6=|v_main_#t~post6_24|} OutVars{main_~y~0=v_main_~y~0_43, main_#t~post5=|v_main_#t~post5_23|, main_~x~0=v_main_~x~0_48, main_#t~post6=|v_main_#t~post6_23|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1447#(or (< 0 (mod (+ main_~y~0 4294967295) 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 UNKNOWN [2022-04-28 03:37:09,838 INFO L290 TraceCheckUtils]: 5: Hoare triple {1328#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1454#(and (forall ((aux_div_aux_mod_v_main_~y~0_53_46_102 Int) (aux_div_v_main_~y~0_53_46 Int) (aux_mod_aux_mod_v_main_~y~0_53_46_102 Int)) (or (< (* aux_div_v_main_~y~0_53_46 4294967296) (+ (* aux_div_aux_mod_v_main_~y~0_53_46_102 4294967296) 4294967295 aux_mod_aux_mod_v_main_~y~0_53_46_102)) (<= (+ aux_mod_aux_mod_v_main_~y~0_53_46_102 (* (div main_~n~0 4294967296) 4294967296)) main_~n~0) (< (+ (* aux_div_aux_mod_v_main_~y~0_53_46_102 4294967296) 4294967295 aux_mod_aux_mod_v_main_~y~0_53_46_102) (* aux_div_v_main_~y~0_53_46 4294967296)) (<= 4294967296 aux_mod_aux_mod_v_main_~y~0_53_46_102) (and (or (not (< main_~y~0 (+ (* aux_div_aux_mod_v_main_~y~0_53_46_102 4294967296) aux_mod_aux_mod_v_main_~y~0_53_46_102))) (forall ((aux_div_v_main_~x~0_58_31 Int)) (or (< (+ (* aux_div_aux_mod_v_main_~y~0_53_46_102 4294967296) (* aux_div_v_main_~x~0_58_31 4294967296) aux_mod_aux_mod_v_main_~y~0_53_46_102) (+ main_~y~0 main_~x~0)) (< (+ main_~y~0 main_~x~0) (+ (* aux_div_aux_mod_v_main_~y~0_53_46_102 4294967296) (* aux_div_v_main_~x~0_58_31 4294967296) aux_mod_aux_mod_v_main_~y~0_53_46_102)))) (not (< 0 (mod main_~x~0 4294967296))) (exists ((v_it_6 Int)) (and (<= 1 v_it_6) (not (< 0 (mod (+ main_~x~0 (* v_it_6 4294967295)) 4294967296))) (<= (+ v_it_6 main_~y~0 1) (+ (* aux_div_aux_mod_v_main_~y~0_53_46_102 4294967296) aux_mod_aux_mod_v_main_~y~0_53_46_102))))) (or (not (= (+ main_~y~0 4294967295) (+ (* aux_div_aux_mod_v_main_~y~0_53_46_102 4294967296) 4294967295 aux_mod_aux_mod_v_main_~y~0_53_46_102))) (< 0 (mod main_~x~0 4294967296)))))) (forall ((aux_div_aux_mod_v_main_~y~0_53_46_102 Int) (aux_div_v_main_~y~0_53_46 Int) (aux_mod_aux_mod_v_main_~y~0_53_46_102 Int)) (or (< (* aux_div_v_main_~y~0_53_46 4294967296) (+ (* aux_div_aux_mod_v_main_~y~0_53_46_102 4294967296) 4294967295 aux_mod_aux_mod_v_main_~y~0_53_46_102)) (< aux_mod_aux_mod_v_main_~y~0_53_46_102 0) (< (+ (* aux_div_aux_mod_v_main_~y~0_53_46_102 4294967296) 4294967295 aux_mod_aux_mod_v_main_~y~0_53_46_102) (* aux_div_v_main_~y~0_53_46 4294967296)) (and (or (not (< main_~y~0 (+ (* aux_div_aux_mod_v_main_~y~0_53_46_102 4294967296) aux_mod_aux_mod_v_main_~y~0_53_46_102))) (forall ((aux_div_v_main_~x~0_58_31 Int)) (or (< (+ (* aux_div_aux_mod_v_main_~y~0_53_46_102 4294967296) (* aux_div_v_main_~x~0_58_31 4294967296) aux_mod_aux_mod_v_main_~y~0_53_46_102) (+ main_~y~0 main_~x~0)) (< (+ main_~y~0 main_~x~0) (+ (* aux_div_aux_mod_v_main_~y~0_53_46_102 4294967296) (* aux_div_v_main_~x~0_58_31 4294967296) aux_mod_aux_mod_v_main_~y~0_53_46_102)))) (not (< 0 (mod main_~x~0 4294967296))) (exists ((v_it_6 Int)) (and (<= 1 v_it_6) (not (< 0 (mod (+ main_~x~0 (* v_it_6 4294967295)) 4294967296))) (<= (+ v_it_6 main_~y~0 1) (+ (* aux_div_aux_mod_v_main_~y~0_53_46_102 4294967296) aux_mod_aux_mod_v_main_~y~0_53_46_102))))) (or (not (= (+ main_~y~0 4294967295) (+ (* aux_div_aux_mod_v_main_~y~0_53_46_102 4294967296) 4294967295 aux_mod_aux_mod_v_main_~y~0_53_46_102))) (< 0 (mod main_~x~0 4294967296)))) (< main_~n~0 (+ aux_mod_aux_mod_v_main_~y~0_53_46_102 (* (div main_~n~0 4294967296) 4294967296) 1)))))} is VALID [2022-04-28 03:37:09,838 INFO L272 TraceCheckUtils]: 4: Hoare triple {1328#true} call #t~ret13 := main(); {1328#true} is VALID [2022-04-28 03:37:09,838 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1328#true} {1328#true} #72#return; {1328#true} is VALID [2022-04-28 03:37:09,838 INFO L290 TraceCheckUtils]: 2: Hoare triple {1328#true} assume true; {1328#true} is VALID [2022-04-28 03:37:09,838 INFO L290 TraceCheckUtils]: 1: Hoare triple {1328#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1328#true} is VALID [2022-04-28 03:37:09,839 INFO L272 TraceCheckUtils]: 0: Hoare triple {1328#true} call ULTIMATE.init(); {1328#true} is VALID [2022-04-28 03:37:09,839 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 03:37:09,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1053501578] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:37:09,839 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:37:09,839 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 31 [2022-04-28 03:37:10,910 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:37:10,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1102360815] [2022-04-28 03:37:10,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1102360815] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:37:10,911 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:37:10,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 03:37:10,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102480585] [2022-04-28 03:37:10,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:37:10,911 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 11 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 03:37:10,911 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:37:10,911 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 11 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 03:37:10,943 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 03:37:10,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 03:37:10,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:37:10,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 03:37:10,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=771, Unknown=7, NotChecked=0, Total=992 [2022-04-28 03:37:10,944 INFO L87 Difference]: Start difference. First operand 24 states and 30 transitions. Second operand has 13 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 11 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 03:37:16,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:37:16,849 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2022-04-28 03:37:16,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 03:37:16,849 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 11 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 03:37:16,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:37:16,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 11 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 03:37:16,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 33 transitions. [2022-04-28 03:37:16,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 11 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 03:37:16,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 33 transitions. [2022-04-28 03:37:16,852 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 33 transitions. [2022-04-28 03:37:16,907 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 03:37:16,908 INFO L225 Difference]: With dead ends: 35 [2022-04-28 03:37:16,908 INFO L226 Difference]: Without dead ends: 30 [2022-04-28 03:37:16,909 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 19 SyntacticMatches, 5 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 511 ImplicationChecksByTransitivity, 39.4s TimeCoverageRelationStatistics Valid=277, Invalid=1196, Unknown=9, NotChecked=0, Total=1482 [2022-04-28 03:37:16,909 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 18 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 36 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 03:37:16,909 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 54 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 106 Invalid, 0 Unknown, 36 Unchecked, 0.4s Time] [2022-04-28 03:37:16,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-28 03:37:16,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2022-04-28 03:37:16,972 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:37:16,972 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 28 states, 23 states have (on average 1.434782608695652) internal successors, (33), 23 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:37:16,972 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 28 states, 23 states have (on average 1.434782608695652) internal successors, (33), 23 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:37:16,973 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 28 states, 23 states have (on average 1.434782608695652) internal successors, (33), 23 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:37:16,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:37:16,974 INFO L93 Difference]: Finished difference Result 30 states and 39 transitions. [2022-04-28 03:37:16,974 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 39 transitions. [2022-04-28 03:37:16,974 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:37:16,974 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:37:16,974 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 23 states have (on average 1.434782608695652) internal successors, (33), 23 states have internal predecessors, (33), 3 states have call successors, (3), 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 03:37:16,974 INFO L87 Difference]: Start difference. First operand has 28 states, 23 states have (on average 1.434782608695652) internal successors, (33), 23 states have internal predecessors, (33), 3 states have call successors, (3), 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 03:37:16,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:37:16,975 INFO L93 Difference]: Finished difference Result 30 states and 39 transitions. [2022-04-28 03:37:16,975 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 39 transitions. [2022-04-28 03:37:16,975 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:37:16,975 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:37:16,975 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:37:16,975 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:37:16,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.434782608695652) internal successors, (33), 23 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:37:16,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2022-04-28 03:37:16,976 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 37 transitions. Word has length 19 [2022-04-28 03:37:16,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:37:16,976 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 37 transitions. [2022-04-28 03:37:16,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 11 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 03:37:16,976 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 37 transitions. [2022-04-28 03:37:19,369 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 36 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 03:37:19,369 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2022-04-28 03:37:19,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-28 03:37:19,370 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:37:19,370 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:37:19,386 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 03:37:19,570 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,SelfDestructingSolverStorable7 [2022-04-28 03:37:19,570 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:37:19,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:37:19,571 INFO L85 PathProgramCache]: Analyzing trace with hash 95732656, now seen corresponding path program 2 times [2022-04-28 03:37:19,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:37:19,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1145023840] [2022-04-28 03:37:19,891 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:37:19,892 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:37:19,894 INFO L85 PathProgramCache]: Analyzing trace with hash -1588173871, now seen corresponding path program 1 times [2022-04-28 03:37:19,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:37:19,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230967765] [2022-04-28 03:37:19,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:37:19,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:37:19,904 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_7.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:37:19,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:37:19,921 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_7.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:37:20,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:37:20,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:37:20,022 INFO L290 TraceCheckUtils]: 0: Hoare triple {1683#(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); {1676#true} is VALID [2022-04-28 03:37:20,022 INFO L290 TraceCheckUtils]: 1: Hoare triple {1676#true} assume true; {1676#true} is VALID [2022-04-28 03:37:20,022 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1676#true} {1676#true} #72#return; {1676#true} is VALID [2022-04-28 03:37:20,023 INFO L272 TraceCheckUtils]: 0: Hoare triple {1676#true} call ULTIMATE.init(); {1683#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:37:20,023 INFO L290 TraceCheckUtils]: 1: Hoare triple {1683#(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); {1676#true} is VALID [2022-04-28 03:37:20,023 INFO L290 TraceCheckUtils]: 2: Hoare triple {1676#true} assume true; {1676#true} is VALID [2022-04-28 03:37:20,023 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1676#true} {1676#true} #72#return; {1676#true} is VALID [2022-04-28 03:37:20,023 INFO L272 TraceCheckUtils]: 4: Hoare triple {1676#true} call #t~ret13 := main(); {1676#true} is VALID [2022-04-28 03:37:20,023 INFO L290 TraceCheckUtils]: 5: Hoare triple {1676#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1676#true} is VALID [2022-04-28 03:37:20,023 INFO L290 TraceCheckUtils]: 6: Hoare triple {1676#true} [88] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= |v_main_#t~post6_31| |v_main_#t~post6_30|)) (.cse2 (= |v_main_#t~post5_31| |v_main_#t~post5_30|)) (.cse0 (mod v_main_~x~0_63 4294967296)) (.cse3 (= v_main_~x~0_63 v_main_~x~0_62)) (.cse4 (= v_main_~y~0_58 v_main_~y~0_57))) (or (and (< 0 .cse0) (= v_main_~x~0_62 (+ v_main_~x~0_63 v_main_~y~0_58 (* (- 1) v_main_~y~0_57))) (< v_main_~y~0_58 v_main_~y~0_57) (forall ((v_it_7 Int)) (or (< 0 (mod (+ v_main_~x~0_63 (* v_it_7 4294967295)) 4294967296)) (not (<= (+ v_main_~y~0_58 v_it_7 1) v_main_~y~0_57)) (not (<= 1 v_it_7))))) (and .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 (<= .cse0 0) .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_58, main_#t~post5=|v_main_#t~post5_31|, main_~x~0=v_main_~x~0_63, main_#t~post6=|v_main_#t~post6_31|} OutVars{main_~y~0=v_main_~y~0_57, main_#t~post5=|v_main_#t~post5_30|, main_~x~0=v_main_~x~0_62, main_#t~post6=|v_main_#t~post6_30|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1676#true} is VALID [2022-04-28 03:37:20,024 INFO L290 TraceCheckUtils]: 7: Hoare triple {1676#true} [87] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {1681#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:37:20,024 INFO L290 TraceCheckUtils]: 8: Hoare triple {1681#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {1681#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:37:20,025 INFO L290 TraceCheckUtils]: 9: Hoare triple {1681#(<= main_~x~0 (* 4294967296 (div main_~x~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; {1682#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:37:20,026 INFO L290 TraceCheckUtils]: 10: Hoare triple {1682#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !(~z~0 % 4294967296 > 0); {1682#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:37:20,026 INFO L290 TraceCheckUtils]: 11: Hoare triple {1682#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 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; {1682#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:37:20,026 INFO L290 TraceCheckUtils]: 12: Hoare triple {1682#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !(~y~0 % 4294967296 > 0); {1682#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:37:20,028 INFO L290 TraceCheckUtils]: 13: Hoare triple {1682#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {1681#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:37:20,029 INFO L290 TraceCheckUtils]: 14: Hoare triple {1681#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {1677#false} is VALID [2022-04-28 03:37:20,029 INFO L290 TraceCheckUtils]: 15: Hoare triple {1677#false} assume !(~x~0 % 4294967296 > 0); {1677#false} is VALID [2022-04-28 03:37:20,029 INFO L272 TraceCheckUtils]: 16: Hoare triple {1677#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1677#false} is VALID [2022-04-28 03:37:20,029 INFO L290 TraceCheckUtils]: 17: Hoare triple {1677#false} ~cond := #in~cond; {1677#false} is VALID [2022-04-28 03:37:20,029 INFO L290 TraceCheckUtils]: 18: Hoare triple {1677#false} assume 0 == ~cond; {1677#false} is VALID [2022-04-28 03:37:20,029 INFO L290 TraceCheckUtils]: 19: Hoare triple {1677#false} assume !false; {1677#false} is VALID [2022-04-28 03:37:20,030 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 03:37:20,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:37:20,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230967765] [2022-04-28 03:37:20,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230967765] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:37:20,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1110709903] [2022-04-28 03:37:20,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:37:20,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:37:20,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:37:20,035 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 03:37:20,039 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 03:37:20,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:37:20,071 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-28 03:37:20,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:37:20,083 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:37:20,430 INFO L272 TraceCheckUtils]: 0: Hoare triple {1676#true} call ULTIMATE.init(); {1676#true} is VALID [2022-04-28 03:37:20,430 INFO L290 TraceCheckUtils]: 1: Hoare triple {1676#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1676#true} is VALID [2022-04-28 03:37:20,430 INFO L290 TraceCheckUtils]: 2: Hoare triple {1676#true} assume true; {1676#true} is VALID [2022-04-28 03:37:20,430 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1676#true} {1676#true} #72#return; {1676#true} is VALID [2022-04-28 03:37:20,430 INFO L272 TraceCheckUtils]: 4: Hoare triple {1676#true} call #t~ret13 := main(); {1676#true} is VALID [2022-04-28 03:37:20,430 INFO L290 TraceCheckUtils]: 5: Hoare triple {1676#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1676#true} is VALID [2022-04-28 03:37:20,430 INFO L290 TraceCheckUtils]: 6: Hoare triple {1676#true} [88] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= |v_main_#t~post6_31| |v_main_#t~post6_30|)) (.cse2 (= |v_main_#t~post5_31| |v_main_#t~post5_30|)) (.cse0 (mod v_main_~x~0_63 4294967296)) (.cse3 (= v_main_~x~0_63 v_main_~x~0_62)) (.cse4 (= v_main_~y~0_58 v_main_~y~0_57))) (or (and (< 0 .cse0) (= v_main_~x~0_62 (+ v_main_~x~0_63 v_main_~y~0_58 (* (- 1) v_main_~y~0_57))) (< v_main_~y~0_58 v_main_~y~0_57) (forall ((v_it_7 Int)) (or (< 0 (mod (+ v_main_~x~0_63 (* v_it_7 4294967295)) 4294967296)) (not (<= (+ v_main_~y~0_58 v_it_7 1) v_main_~y~0_57)) (not (<= 1 v_it_7))))) (and .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 (<= .cse0 0) .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_58, main_#t~post5=|v_main_#t~post5_31|, main_~x~0=v_main_~x~0_63, main_#t~post6=|v_main_#t~post6_31|} OutVars{main_~y~0=v_main_~y~0_57, main_#t~post5=|v_main_#t~post5_30|, main_~x~0=v_main_~x~0_62, main_#t~post6=|v_main_#t~post6_30|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1676#true} is VALID [2022-04-28 03:37:20,431 INFO L290 TraceCheckUtils]: 7: Hoare triple {1676#true} [87] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {1681#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:37:20,431 INFO L290 TraceCheckUtils]: 8: Hoare triple {1681#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {1681#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:37:20,432 INFO L290 TraceCheckUtils]: 9: Hoare triple {1681#(<= main_~x~0 (* 4294967296 (div main_~x~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; {1682#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:37:20,433 INFO L290 TraceCheckUtils]: 10: Hoare triple {1682#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !(~z~0 % 4294967296 > 0); {1682#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:37:20,433 INFO L290 TraceCheckUtils]: 11: Hoare triple {1682#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 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; {1682#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:37:20,433 INFO L290 TraceCheckUtils]: 12: Hoare triple {1682#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !(~y~0 % 4294967296 > 0); {1682#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:37:20,434 INFO L290 TraceCheckUtils]: 13: Hoare triple {1682#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {1681#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:37:20,435 INFO L290 TraceCheckUtils]: 14: Hoare triple {1681#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {1677#false} is VALID [2022-04-28 03:37:20,435 INFO L290 TraceCheckUtils]: 15: Hoare triple {1677#false} assume !(~x~0 % 4294967296 > 0); {1677#false} is VALID [2022-04-28 03:37:20,435 INFO L272 TraceCheckUtils]: 16: Hoare triple {1677#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1677#false} is VALID [2022-04-28 03:37:20,435 INFO L290 TraceCheckUtils]: 17: Hoare triple {1677#false} ~cond := #in~cond; {1677#false} is VALID [2022-04-28 03:37:20,435 INFO L290 TraceCheckUtils]: 18: Hoare triple {1677#false} assume 0 == ~cond; {1677#false} is VALID [2022-04-28 03:37:20,435 INFO L290 TraceCheckUtils]: 19: Hoare triple {1677#false} assume !false; {1677#false} is VALID [2022-04-28 03:37:20,436 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 03:37:20,436 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:37:20,731 INFO L290 TraceCheckUtils]: 19: Hoare triple {1677#false} assume !false; {1677#false} is VALID [2022-04-28 03:37:20,731 INFO L290 TraceCheckUtils]: 18: Hoare triple {1677#false} assume 0 == ~cond; {1677#false} is VALID [2022-04-28 03:37:20,731 INFO L290 TraceCheckUtils]: 17: Hoare triple {1677#false} ~cond := #in~cond; {1677#false} is VALID [2022-04-28 03:37:20,731 INFO L272 TraceCheckUtils]: 16: Hoare triple {1677#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1677#false} is VALID [2022-04-28 03:37:20,731 INFO L290 TraceCheckUtils]: 15: Hoare triple {1677#false} assume !(~x~0 % 4294967296 > 0); {1677#false} is VALID [2022-04-28 03:37:20,732 INFO L290 TraceCheckUtils]: 14: Hoare triple {1681#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {1677#false} is VALID [2022-04-28 03:37:20,734 INFO L290 TraceCheckUtils]: 13: Hoare triple {1682#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {1681#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:37:20,734 INFO L290 TraceCheckUtils]: 12: Hoare triple {1682#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !(~y~0 % 4294967296 > 0); {1682#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:37:20,734 INFO L290 TraceCheckUtils]: 11: Hoare triple {1682#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 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; {1682#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:37:20,735 INFO L290 TraceCheckUtils]: 10: Hoare triple {1682#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} assume !(~z~0 % 4294967296 > 0); {1682#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:37:20,736 INFO L290 TraceCheckUtils]: 9: Hoare triple {1681#(<= main_~x~0 (* 4294967296 (div main_~x~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; {1682#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:37:20,736 INFO L290 TraceCheckUtils]: 8: Hoare triple {1681#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {1681#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:37:20,736 INFO L290 TraceCheckUtils]: 7: Hoare triple {1676#true} [87] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {1681#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:37:20,737 INFO L290 TraceCheckUtils]: 6: Hoare triple {1676#true} [88] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= |v_main_#t~post6_31| |v_main_#t~post6_30|)) (.cse2 (= |v_main_#t~post5_31| |v_main_#t~post5_30|)) (.cse0 (mod v_main_~x~0_63 4294967296)) (.cse3 (= v_main_~x~0_63 v_main_~x~0_62)) (.cse4 (= v_main_~y~0_58 v_main_~y~0_57))) (or (and (< 0 .cse0) (= v_main_~x~0_62 (+ v_main_~x~0_63 v_main_~y~0_58 (* (- 1) v_main_~y~0_57))) (< v_main_~y~0_58 v_main_~y~0_57) (forall ((v_it_7 Int)) (or (< 0 (mod (+ v_main_~x~0_63 (* v_it_7 4294967295)) 4294967296)) (not (<= (+ v_main_~y~0_58 v_it_7 1) v_main_~y~0_57)) (not (<= 1 v_it_7))))) (and .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 (<= .cse0 0) .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_58, main_#t~post5=|v_main_#t~post5_31|, main_~x~0=v_main_~x~0_63, main_#t~post6=|v_main_#t~post6_31|} OutVars{main_~y~0=v_main_~y~0_57, main_#t~post5=|v_main_#t~post5_30|, main_~x~0=v_main_~x~0_62, main_#t~post6=|v_main_#t~post6_30|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1676#true} is VALID [2022-04-28 03:37:20,737 INFO L290 TraceCheckUtils]: 5: Hoare triple {1676#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1676#true} is VALID [2022-04-28 03:37:20,737 INFO L272 TraceCheckUtils]: 4: Hoare triple {1676#true} call #t~ret13 := main(); {1676#true} is VALID [2022-04-28 03:37:20,737 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1676#true} {1676#true} #72#return; {1676#true} is VALID [2022-04-28 03:37:20,737 INFO L290 TraceCheckUtils]: 2: Hoare triple {1676#true} assume true; {1676#true} is VALID [2022-04-28 03:37:20,737 INFO L290 TraceCheckUtils]: 1: Hoare triple {1676#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1676#true} is VALID [2022-04-28 03:37:20,737 INFO L272 TraceCheckUtils]: 0: Hoare triple {1676#true} call ULTIMATE.init(); {1676#true} is VALID [2022-04-28 03:37:20,737 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 03:37:20,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1110709903] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:37:20,737 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:37:20,738 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 5 [2022-04-28 03:37:20,804 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:37:20,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1145023840] [2022-04-28 03:37:20,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1145023840] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:37:20,804 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:37:20,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 03:37:20,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324977098] [2022-04-28 03:37:20,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:37:20,804 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 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 03:37:20,804 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:37:20,804 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:37:20,825 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 03:37:20,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 03:37:20,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:37:20,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 03:37:20,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 03:37:20,826 INFO L87 Difference]: Start difference. First operand 28 states and 37 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:37:21,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:37:21,323 INFO L93 Difference]: Finished difference Result 42 states and 55 transitions. [2022-04-28 03:37:21,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 03:37:21,324 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 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 03:37:21,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:37:21,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:37:21,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2022-04-28 03:37:21,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:37:21,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2022-04-28 03:37:21,325 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 40 transitions. [2022-04-28 03:37:21,385 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 03:37:21,386 INFO L225 Difference]: With dead ends: 42 [2022-04-28 03:37:21,386 INFO L226 Difference]: Without dead ends: 34 [2022-04-28 03:37:21,387 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 46 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-04-28 03:37:21,387 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 29 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:37:21,387 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 27 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 03:37:21,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-28 03:37:21,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2022-04-28 03:37:21,462 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:37:21,462 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 33 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 28 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 03:37:21,462 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 33 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 28 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 03:37:21,462 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 33 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 28 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 03:37:21,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:37:21,463 INFO L93 Difference]: Finished difference Result 34 states and 45 transitions. [2022-04-28 03:37:21,463 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions. [2022-04-28 03:37:21,464 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:37:21,464 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:37:21,464 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 28 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 34 states. [2022-04-28 03:37:21,464 INFO L87 Difference]: Start difference. First operand has 33 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 28 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 34 states. [2022-04-28 03:37:21,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:37:21,465 INFO L93 Difference]: Finished difference Result 34 states and 45 transitions. [2022-04-28 03:37:21,465 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions. [2022-04-28 03:37:21,465 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:37:21,465 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:37:21,465 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:37:21,465 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:37:21,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 28 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 03:37:21,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 43 transitions. [2022-04-28 03:37:21,466 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 43 transitions. Word has length 20 [2022-04-28 03:37:21,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:37:21,466 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 43 transitions. [2022-04-28 03:37:21,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:37:21,466 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 43 transitions. [2022-04-28 03:37:25,697 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 41 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-28 03:37:25,698 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2022-04-28 03:37:25,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-28 03:37:25,698 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:37:25,698 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:37:25,714 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-04-28 03:37:25,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:37:25,899 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:37:25,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:37:25,899 INFO L85 PathProgramCache]: Analyzing trace with hash 633740065, now seen corresponding path program 3 times [2022-04-28 03:37:25,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:37:25,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [701714866] [2022-04-28 03:37:28,263 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:37:28,266 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:37:28,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1646877570, now seen corresponding path program 1 times [2022-04-28 03:37:28,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:37:28,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057122853] [2022-04-28 03:37:28,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:37:28,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:37:28,275 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_8.0))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-04-28 03:37:28,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:37:28,283 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_8.1))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-04-28 03:37:28,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:37:28,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:37:28,448 INFO L290 TraceCheckUtils]: 0: Hoare triple {2037#(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); {2028#true} is VALID [2022-04-28 03:37:28,448 INFO L290 TraceCheckUtils]: 1: Hoare triple {2028#true} assume true; {2028#true} is VALID [2022-04-28 03:37:28,448 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2028#true} {2028#true} #72#return; {2028#true} is VALID [2022-04-28 03:37:28,449 INFO L272 TraceCheckUtils]: 0: Hoare triple {2028#true} call ULTIMATE.init(); {2037#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:37:28,449 INFO L290 TraceCheckUtils]: 1: Hoare triple {2037#(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); {2028#true} is VALID [2022-04-28 03:37:28,449 INFO L290 TraceCheckUtils]: 2: Hoare triple {2028#true} assume true; {2028#true} is VALID [2022-04-28 03:37:28,449 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2028#true} {2028#true} #72#return; {2028#true} is VALID [2022-04-28 03:37:28,449 INFO L272 TraceCheckUtils]: 4: Hoare triple {2028#true} call #t~ret13 := main(); {2028#true} is VALID [2022-04-28 03:37:28,449 INFO L290 TraceCheckUtils]: 5: Hoare triple {2028#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2028#true} is VALID [2022-04-28 03:37:28,450 INFO L290 TraceCheckUtils]: 6: Hoare triple {2028#true} [90] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_76 v_main_~x~0_75)) (.cse1 (= |v_main_#t~post6_36| |v_main_#t~post6_35|)) (.cse2 (= |v_main_#t~post5_36| |v_main_#t~post5_35|)) (.cse3 (= v_main_~y~0_69 v_main_~y~0_68)) (.cse4 (mod v_main_~x~0_76 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3 (<= .cse4 0)) (and .cse0 .cse1 .cse2 .cse3) (and (< v_main_~y~0_69 v_main_~y~0_68) (forall ((v_it_8 Int)) (or (not (<= (+ v_main_~y~0_69 v_it_8 1) v_main_~y~0_68)) (< 0 (mod (+ (* v_it_8 4294967295) v_main_~x~0_76) 4294967296)) (not (<= 1 v_it_8)))) (< 0 .cse4) (= v_main_~x~0_75 (+ v_main_~x~0_76 v_main_~y~0_69 (* (- 1) v_main_~y~0_68)))))) InVars {main_~y~0=v_main_~y~0_69, main_#t~post5=|v_main_#t~post5_36|, main_~x~0=v_main_~x~0_76, main_#t~post6=|v_main_#t~post6_36|} OutVars{main_~y~0=v_main_~y~0_68, main_#t~post5=|v_main_#t~post5_35|, main_~x~0=v_main_~x~0_75, main_#t~post6=|v_main_#t~post6_35|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2028#true} is VALID [2022-04-28 03:37:28,450 INFO L290 TraceCheckUtils]: 7: Hoare triple {2028#true} [89] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {2028#true} is VALID [2022-04-28 03:37:28,451 INFO L290 TraceCheckUtils]: 8: Hoare triple {2028#true} ~z~0 := ~y~0; {2033#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-28 03:37:28,452 INFO L290 TraceCheckUtils]: 9: Hoare triple {2033#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2034#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-28 03:37:28,452 INFO L290 TraceCheckUtils]: 10: Hoare triple {2034#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} assume !(~z~0 % 4294967296 > 0); {2035#(and (<= main_~y~0 (+ (* (div main_~z~0 4294967296) 4294967296) 1)) (<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~y~0))} is VALID [2022-04-28 03:37:28,454 INFO L290 TraceCheckUtils]: 11: Hoare triple {2035#(and (<= main_~y~0 (+ (* (div main_~z~0 4294967296) 4294967296) 1)) (<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~y~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; {2036#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:37:28,454 INFO L290 TraceCheckUtils]: 12: Hoare triple {2036#(<= main_~y~0 (* (div main_~y~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; {2029#false} is VALID [2022-04-28 03:37:28,454 INFO L290 TraceCheckUtils]: 13: Hoare triple {2029#false} assume !(~y~0 % 4294967296 > 0); {2029#false} is VALID [2022-04-28 03:37:28,454 INFO L290 TraceCheckUtils]: 14: Hoare triple {2029#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {2029#false} is VALID [2022-04-28 03:37:28,454 INFO L290 TraceCheckUtils]: 15: Hoare triple {2029#false} assume !(~x~0 % 4294967296 > 0); {2029#false} is VALID [2022-04-28 03:37:28,454 INFO L272 TraceCheckUtils]: 16: Hoare triple {2029#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2029#false} is VALID [2022-04-28 03:37:28,455 INFO L290 TraceCheckUtils]: 17: Hoare triple {2029#false} ~cond := #in~cond; {2029#false} is VALID [2022-04-28 03:37:28,455 INFO L290 TraceCheckUtils]: 18: Hoare triple {2029#false} assume 0 == ~cond; {2029#false} is VALID [2022-04-28 03:37:28,455 INFO L290 TraceCheckUtils]: 19: Hoare triple {2029#false} assume !false; {2029#false} is VALID [2022-04-28 03:37:28,455 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 03:37:28,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:37:28,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057122853] [2022-04-28 03:37:28,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057122853] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:37:28,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1800744850] [2022-04-28 03:37:28,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:37:28,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:37:28,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:37:28,456 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 03:37:28,457 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 03:37:28,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:37:28,488 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-28 03:37:28,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:37:28,493 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:37:29,144 INFO L272 TraceCheckUtils]: 0: Hoare triple {2028#true} call ULTIMATE.init(); {2028#true} is VALID [2022-04-28 03:37:29,145 INFO L290 TraceCheckUtils]: 1: Hoare triple {2028#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2028#true} is VALID [2022-04-28 03:37:29,145 INFO L290 TraceCheckUtils]: 2: Hoare triple {2028#true} assume true; {2028#true} is VALID [2022-04-28 03:37:29,145 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2028#true} {2028#true} #72#return; {2028#true} is VALID [2022-04-28 03:37:29,145 INFO L272 TraceCheckUtils]: 4: Hoare triple {2028#true} call #t~ret13 := main(); {2028#true} is VALID [2022-04-28 03:37:29,145 INFO L290 TraceCheckUtils]: 5: Hoare triple {2028#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2028#true} is VALID [2022-04-28 03:37:29,145 INFO L290 TraceCheckUtils]: 6: Hoare triple {2028#true} [90] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_76 v_main_~x~0_75)) (.cse1 (= |v_main_#t~post6_36| |v_main_#t~post6_35|)) (.cse2 (= |v_main_#t~post5_36| |v_main_#t~post5_35|)) (.cse3 (= v_main_~y~0_69 v_main_~y~0_68)) (.cse4 (mod v_main_~x~0_76 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3 (<= .cse4 0)) (and .cse0 .cse1 .cse2 .cse3) (and (< v_main_~y~0_69 v_main_~y~0_68) (forall ((v_it_8 Int)) (or (not (<= (+ v_main_~y~0_69 v_it_8 1) v_main_~y~0_68)) (< 0 (mod (+ (* v_it_8 4294967295) v_main_~x~0_76) 4294967296)) (not (<= 1 v_it_8)))) (< 0 .cse4) (= v_main_~x~0_75 (+ v_main_~x~0_76 v_main_~y~0_69 (* (- 1) v_main_~y~0_68)))))) InVars {main_~y~0=v_main_~y~0_69, main_#t~post5=|v_main_#t~post5_36|, main_~x~0=v_main_~x~0_76, main_#t~post6=|v_main_#t~post6_36|} OutVars{main_~y~0=v_main_~y~0_68, main_#t~post5=|v_main_#t~post5_35|, main_~x~0=v_main_~x~0_75, main_#t~post6=|v_main_#t~post6_35|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2028#true} is VALID [2022-04-28 03:37:29,145 INFO L290 TraceCheckUtils]: 7: Hoare triple {2028#true} [89] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {2028#true} is VALID [2022-04-28 03:37:29,146 INFO L290 TraceCheckUtils]: 8: Hoare triple {2028#true} ~z~0 := ~y~0; {2033#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-28 03:37:29,146 INFO L290 TraceCheckUtils]: 9: Hoare triple {2033#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2034#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-28 03:37:29,148 INFO L290 TraceCheckUtils]: 10: Hoare triple {2034#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} assume !(~z~0 % 4294967296 > 0); {2071#(<= (div (+ (* (- 1) main_~y~0) 1) (- 4294967296)) (div (+ (- 1) main_~y~0) 4294967296))} is VALID [2022-04-28 03:37:29,149 INFO L290 TraceCheckUtils]: 11: Hoare triple {2071#(<= (div (+ (* (- 1) main_~y~0) 1) (- 4294967296)) (div (+ (- 1) 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; {2036#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:37:29,149 INFO L290 TraceCheckUtils]: 12: Hoare triple {2036#(<= main_~y~0 (* (div main_~y~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; {2029#false} is VALID [2022-04-28 03:37:29,149 INFO L290 TraceCheckUtils]: 13: Hoare triple {2029#false} assume !(~y~0 % 4294967296 > 0); {2029#false} is VALID [2022-04-28 03:37:29,150 INFO L290 TraceCheckUtils]: 14: Hoare triple {2029#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {2029#false} is VALID [2022-04-28 03:37:29,150 INFO L290 TraceCheckUtils]: 15: Hoare triple {2029#false} assume !(~x~0 % 4294967296 > 0); {2029#false} is VALID [2022-04-28 03:37:29,150 INFO L272 TraceCheckUtils]: 16: Hoare triple {2029#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2029#false} is VALID [2022-04-28 03:37:29,150 INFO L290 TraceCheckUtils]: 17: Hoare triple {2029#false} ~cond := #in~cond; {2029#false} is VALID [2022-04-28 03:37:29,150 INFO L290 TraceCheckUtils]: 18: Hoare triple {2029#false} assume 0 == ~cond; {2029#false} is VALID [2022-04-28 03:37:29,150 INFO L290 TraceCheckUtils]: 19: Hoare triple {2029#false} assume !false; {2029#false} is VALID [2022-04-28 03:37:29,150 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 03:37:29,150 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:37:30,019 INFO L290 TraceCheckUtils]: 19: Hoare triple {2029#false} assume !false; {2029#false} is VALID [2022-04-28 03:37:30,019 INFO L290 TraceCheckUtils]: 18: Hoare triple {2029#false} assume 0 == ~cond; {2029#false} is VALID [2022-04-28 03:37:30,019 INFO L290 TraceCheckUtils]: 17: Hoare triple {2029#false} ~cond := #in~cond; {2029#false} is VALID [2022-04-28 03:37:30,019 INFO L272 TraceCheckUtils]: 16: Hoare triple {2029#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2029#false} is VALID [2022-04-28 03:37:30,019 INFO L290 TraceCheckUtils]: 15: Hoare triple {2029#false} assume !(~x~0 % 4294967296 > 0); {2029#false} is VALID [2022-04-28 03:37:30,019 INFO L290 TraceCheckUtils]: 14: Hoare triple {2029#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {2029#false} is VALID [2022-04-28 03:37:30,019 INFO L290 TraceCheckUtils]: 13: Hoare triple {2029#false} assume !(~y~0 % 4294967296 > 0); {2029#false} is VALID [2022-04-28 03:37:30,020 INFO L290 TraceCheckUtils]: 12: Hoare triple {2036#(<= main_~y~0 (* (div main_~y~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; {2029#false} is VALID [2022-04-28 03:37:30,021 INFO L290 TraceCheckUtils]: 11: Hoare triple {2071#(<= (div (+ (* (- 1) main_~y~0) 1) (- 4294967296)) (div (+ (- 1) 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; {2036#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:37:30,022 INFO L290 TraceCheckUtils]: 10: Hoare triple {2126#(or (< 0 (mod main_~z~0 4294967296)) (<= (div (+ (* (- 1) main_~y~0) 1) (- 4294967296)) (div (+ (- 1) main_~y~0) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {2071#(<= (div (+ (* (- 1) main_~y~0) 1) (- 4294967296)) (div (+ (- 1) main_~y~0) 4294967296))} is VALID [2022-04-28 03:37:30,024 INFO L290 TraceCheckUtils]: 9: Hoare triple {2130#(or (<= (div (+ (* (- 1) main_~y~0) 1) (- 4294967296)) (div (+ (- 1) 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; {2126#(or (< 0 (mod main_~z~0 4294967296)) (<= (div (+ (* (- 1) main_~y~0) 1) (- 4294967296)) (div (+ (- 1) main_~y~0) 4294967296)))} is VALID [2022-04-28 03:37:30,025 INFO L290 TraceCheckUtils]: 8: Hoare triple {2028#true} ~z~0 := ~y~0; {2130#(or (<= (div (+ (* (- 1) main_~y~0) 1) (- 4294967296)) (div (+ (- 1) main_~y~0) 4294967296)) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-28 03:37:30,025 INFO L290 TraceCheckUtils]: 7: Hoare triple {2028#true} [89] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {2028#true} is VALID [2022-04-28 03:37:30,025 INFO L290 TraceCheckUtils]: 6: Hoare triple {2028#true} [90] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_76 v_main_~x~0_75)) (.cse1 (= |v_main_#t~post6_36| |v_main_#t~post6_35|)) (.cse2 (= |v_main_#t~post5_36| |v_main_#t~post5_35|)) (.cse3 (= v_main_~y~0_69 v_main_~y~0_68)) (.cse4 (mod v_main_~x~0_76 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3 (<= .cse4 0)) (and .cse0 .cse1 .cse2 .cse3) (and (< v_main_~y~0_69 v_main_~y~0_68) (forall ((v_it_8 Int)) (or (not (<= (+ v_main_~y~0_69 v_it_8 1) v_main_~y~0_68)) (< 0 (mod (+ (* v_it_8 4294967295) v_main_~x~0_76) 4294967296)) (not (<= 1 v_it_8)))) (< 0 .cse4) (= v_main_~x~0_75 (+ v_main_~x~0_76 v_main_~y~0_69 (* (- 1) v_main_~y~0_68)))))) InVars {main_~y~0=v_main_~y~0_69, main_#t~post5=|v_main_#t~post5_36|, main_~x~0=v_main_~x~0_76, main_#t~post6=|v_main_#t~post6_36|} OutVars{main_~y~0=v_main_~y~0_68, main_#t~post5=|v_main_#t~post5_35|, main_~x~0=v_main_~x~0_75, main_#t~post6=|v_main_#t~post6_35|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2028#true} is VALID [2022-04-28 03:37:30,025 INFO L290 TraceCheckUtils]: 5: Hoare triple {2028#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2028#true} is VALID [2022-04-28 03:37:30,025 INFO L272 TraceCheckUtils]: 4: Hoare triple {2028#true} call #t~ret13 := main(); {2028#true} is VALID [2022-04-28 03:37:30,025 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2028#true} {2028#true} #72#return; {2028#true} is VALID [2022-04-28 03:37:30,025 INFO L290 TraceCheckUtils]: 2: Hoare triple {2028#true} assume true; {2028#true} is VALID [2022-04-28 03:37:30,025 INFO L290 TraceCheckUtils]: 1: Hoare triple {2028#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2028#true} is VALID [2022-04-28 03:37:30,025 INFO L272 TraceCheckUtils]: 0: Hoare triple {2028#true} call ULTIMATE.init(); {2028#true} is VALID [2022-04-28 03:37:30,026 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 03:37:30,026 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1800744850] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:37:30,026 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:37:30,026 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 10 [2022-04-28 03:37:30,084 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:37:30,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [701714866] [2022-04-28 03:37:30,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [701714866] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:37:30,084 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:37:30,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 03:37:30,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455047325] [2022-04-28 03:37:30,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:37:30,085 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 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 03:37:30,085 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:37:30,085 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 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 03:37:30,101 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 03:37:30,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 03:37:30,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:37:30,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 03:37:30,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-04-28 03:37:30,101 INFO L87 Difference]: Start difference. First operand 33 states and 43 transitions. Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 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 03:37:31,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:37:31,003 INFO L93 Difference]: Finished difference Result 41 states and 51 transitions. [2022-04-28 03:37:31,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 03:37:31,003 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 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 03:37:31,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:37:31,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 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 03:37:31,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 36 transitions. [2022-04-28 03:37:31,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 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 03:37:31,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 36 transitions. [2022-04-28 03:37:31,005 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 36 transitions. [2022-04-28 03:37:31,037 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 03:37:31,037 INFO L225 Difference]: With dead ends: 41 [2022-04-28 03:37:31,037 INFO L226 Difference]: Without dead ends: 31 [2022-04-28 03:37:31,037 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 43 SyntacticMatches, 6 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2022-04-28 03:37:31,038 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 18 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 03:37:31,038 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 40 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 03:37:31,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-28 03:37:31,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2022-04-28 03:37:31,109 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:37:31,109 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 28 states, 23 states have (on average 1.391304347826087) internal successors, (32), 23 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:37:31,109 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 28 states, 23 states have (on average 1.391304347826087) internal successors, (32), 23 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:37:31,109 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 28 states, 23 states have (on average 1.391304347826087) internal successors, (32), 23 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:37:31,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:37:31,110 INFO L93 Difference]: Finished difference Result 31 states and 40 transitions. [2022-04-28 03:37:31,110 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 40 transitions. [2022-04-28 03:37:31,110 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:37:31,110 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:37:31,110 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 23 states have (on average 1.391304347826087) internal successors, (32), 23 states have internal predecessors, (32), 3 states have call successors, (3), 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 31 states. [2022-04-28 03:37:31,110 INFO L87 Difference]: Start difference. First operand has 28 states, 23 states have (on average 1.391304347826087) internal successors, (32), 23 states have internal predecessors, (32), 3 states have call successors, (3), 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 31 states. [2022-04-28 03:37:31,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:37:31,112 INFO L93 Difference]: Finished difference Result 31 states and 40 transitions. [2022-04-28 03:37:31,112 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 40 transitions. [2022-04-28 03:37:31,112 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:37:31,112 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:37:31,113 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:37:31,113 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:37:31,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.391304347826087) internal successors, (32), 23 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:37:31,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2022-04-28 03:37:31,113 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 36 transitions. Word has length 20 [2022-04-28 03:37:31,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:37:31,113 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 36 transitions. [2022-04-28 03:37:31,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 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 03:37:31,114 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 36 transitions. [2022-04-28 03:37:33,828 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 35 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 03:37:33,828 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2022-04-28 03:37:33,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-28 03:37:33,828 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:37:33,828 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:37:33,844 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 03:37:34,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:37:34,031 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:37:34,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:37:34,032 INFO L85 PathProgramCache]: Analyzing trace with hash -1130993808, now seen corresponding path program 2 times [2022-04-28 03:37:34,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:37:34,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1537267818] [2022-04-28 03:37:36,773 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:37:36,774 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:37:36,777 INFO L85 PathProgramCache]: Analyzing trace with hash -1715779567, now seen corresponding path program 1 times [2022-04-28 03:37:36,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:37:36,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621560844] [2022-04-28 03:37:36,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:37:36,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:37:36,783 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_9.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:37:36,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:37:36,791 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_9.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:37:36,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:37:36,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:37:36,937 INFO L290 TraceCheckUtils]: 0: Hoare triple {2384#(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); {2375#true} is VALID [2022-04-28 03:37:36,937 INFO L290 TraceCheckUtils]: 1: Hoare triple {2375#true} assume true; {2375#true} is VALID [2022-04-28 03:37:36,937 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2375#true} {2375#true} #72#return; {2375#true} is VALID [2022-04-28 03:37:36,938 INFO L272 TraceCheckUtils]: 0: Hoare triple {2375#true} call ULTIMATE.init(); {2384#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:37:36,938 INFO L290 TraceCheckUtils]: 1: Hoare triple {2384#(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); {2375#true} is VALID [2022-04-28 03:37:36,938 INFO L290 TraceCheckUtils]: 2: Hoare triple {2375#true} assume true; {2375#true} is VALID [2022-04-28 03:37:36,938 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2375#true} {2375#true} #72#return; {2375#true} is VALID [2022-04-28 03:37:36,938 INFO L272 TraceCheckUtils]: 4: Hoare triple {2375#true} call #t~ret13 := main(); {2375#true} is VALID [2022-04-28 03:37:36,938 INFO L290 TraceCheckUtils]: 5: Hoare triple {2375#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2375#true} is VALID [2022-04-28 03:37:36,938 INFO L290 TraceCheckUtils]: 6: Hoare triple {2375#true} [92] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_41| |v_main_#t~post5_40|)) (.cse1 (= v_main_~x~0_85 v_main_~x~0_84)) (.cse2 (= v_main_~y~0_81 v_main_~y~0_80)) (.cse3 (= |v_main_#t~post6_41| |v_main_#t~post6_40|)) (.cse4 (mod v_main_~x~0_85 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 (<= .cse4 0) .cse1 .cse2 .cse3) (and (forall ((v_it_9 Int)) (or (not (<= 1 v_it_9)) (not (<= (+ v_main_~y~0_81 v_it_9 1) v_main_~y~0_80)) (< 0 (mod (+ v_main_~x~0_85 (* v_it_9 4294967295)) 4294967296)))) (< v_main_~y~0_81 v_main_~y~0_80) (< 0 .cse4) (= (+ v_main_~x~0_85 v_main_~y~0_81 (* (- 1) v_main_~y~0_80)) v_main_~x~0_84)))) InVars {main_~y~0=v_main_~y~0_81, main_#t~post5=|v_main_#t~post5_41|, main_~x~0=v_main_~x~0_85, main_#t~post6=|v_main_#t~post6_41|} OutVars{main_~y~0=v_main_~y~0_80, main_#t~post5=|v_main_#t~post5_40|, main_~x~0=v_main_~x~0_84, main_#t~post6=|v_main_#t~post6_40|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2375#true} is VALID [2022-04-28 03:37:36,939 INFO L290 TraceCheckUtils]: 7: Hoare triple {2375#true} [91] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {2380#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:37:36,939 INFO L290 TraceCheckUtils]: 8: Hoare triple {2380#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {2380#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:37:36,940 INFO L290 TraceCheckUtils]: 9: Hoare triple {2380#(<= main_~x~0 (* 4294967296 (div main_~x~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; {2381#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:37:36,941 INFO L290 TraceCheckUtils]: 10: Hoare triple {2381#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 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; {2382#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:37:36,942 INFO L290 TraceCheckUtils]: 11: Hoare triple {2382#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~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; {2383#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 03:37:36,943 INFO L290 TraceCheckUtils]: 12: Hoare triple {2383#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {2383#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 03:37:36,943 INFO L290 TraceCheckUtils]: 13: Hoare triple {2383#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~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; {2383#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 03:37:36,944 INFO L290 TraceCheckUtils]: 14: Hoare triple {2383#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {2383#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 03:37:36,948 INFO L290 TraceCheckUtils]: 15: Hoare triple {2383#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {2376#false} is VALID [2022-04-28 03:37:36,948 INFO L272 TraceCheckUtils]: 16: Hoare triple {2376#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2376#false} is VALID [2022-04-28 03:37:36,948 INFO L290 TraceCheckUtils]: 17: Hoare triple {2376#false} ~cond := #in~cond; {2376#false} is VALID [2022-04-28 03:37:36,948 INFO L290 TraceCheckUtils]: 18: Hoare triple {2376#false} assume 0 == ~cond; {2376#false} is VALID [2022-04-28 03:37:36,949 INFO L290 TraceCheckUtils]: 19: Hoare triple {2376#false} assume !false; {2376#false} is VALID [2022-04-28 03:37:36,949 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:37:36,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:37:36,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621560844] [2022-04-28 03:37:36,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621560844] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:37:36,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1978477071] [2022-04-28 03:37:36,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:37:36,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:37:36,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:37:36,950 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 03:37:36,951 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 03:37:36,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:37:36,978 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-28 03:37:36,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:37:36,984 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:37:37,196 INFO L272 TraceCheckUtils]: 0: Hoare triple {2375#true} call ULTIMATE.init(); {2375#true} is VALID [2022-04-28 03:37:37,197 INFO L290 TraceCheckUtils]: 1: Hoare triple {2375#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2375#true} is VALID [2022-04-28 03:37:37,197 INFO L290 TraceCheckUtils]: 2: Hoare triple {2375#true} assume true; {2375#true} is VALID [2022-04-28 03:37:37,197 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2375#true} {2375#true} #72#return; {2375#true} is VALID [2022-04-28 03:37:37,197 INFO L272 TraceCheckUtils]: 4: Hoare triple {2375#true} call #t~ret13 := main(); {2375#true} is VALID [2022-04-28 03:37:37,197 INFO L290 TraceCheckUtils]: 5: Hoare triple {2375#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2375#true} is VALID [2022-04-28 03:37:37,197 INFO L290 TraceCheckUtils]: 6: Hoare triple {2375#true} [92] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_41| |v_main_#t~post5_40|)) (.cse1 (= v_main_~x~0_85 v_main_~x~0_84)) (.cse2 (= v_main_~y~0_81 v_main_~y~0_80)) (.cse3 (= |v_main_#t~post6_41| |v_main_#t~post6_40|)) (.cse4 (mod v_main_~x~0_85 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 (<= .cse4 0) .cse1 .cse2 .cse3) (and (forall ((v_it_9 Int)) (or (not (<= 1 v_it_9)) (not (<= (+ v_main_~y~0_81 v_it_9 1) v_main_~y~0_80)) (< 0 (mod (+ v_main_~x~0_85 (* v_it_9 4294967295)) 4294967296)))) (< v_main_~y~0_81 v_main_~y~0_80) (< 0 .cse4) (= (+ v_main_~x~0_85 v_main_~y~0_81 (* (- 1) v_main_~y~0_80)) v_main_~x~0_84)))) InVars {main_~y~0=v_main_~y~0_81, main_#t~post5=|v_main_#t~post5_41|, main_~x~0=v_main_~x~0_85, main_#t~post6=|v_main_#t~post6_41|} OutVars{main_~y~0=v_main_~y~0_80, main_#t~post5=|v_main_#t~post5_40|, main_~x~0=v_main_~x~0_84, main_#t~post6=|v_main_#t~post6_40|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2375#true} is VALID [2022-04-28 03:37:37,197 INFO L290 TraceCheckUtils]: 7: Hoare triple {2375#true} [91] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {2375#true} is VALID [2022-04-28 03:37:37,199 INFO L290 TraceCheckUtils]: 8: Hoare triple {2375#true} ~z~0 := ~y~0; {2412#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 03:37:37,200 INFO L290 TraceCheckUtils]: 9: Hoare triple {2412#(= 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; {2416#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-28 03:37:37,201 INFO L290 TraceCheckUtils]: 10: Hoare triple {2416#(= 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; {2420#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 03:37:37,201 INFO L290 TraceCheckUtils]: 11: Hoare triple {2420#(< 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; {2420#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 03:37:37,202 INFO L290 TraceCheckUtils]: 12: Hoare triple {2420#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~z~0 % 4294967296 > 0); {2420#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 03:37:37,203 INFO L290 TraceCheckUtils]: 13: Hoare triple {2420#(< 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; {2430#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:37:37,203 INFO L290 TraceCheckUtils]: 14: Hoare triple {2430#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {2376#false} is VALID [2022-04-28 03:37:37,203 INFO L290 TraceCheckUtils]: 15: Hoare triple {2376#false} assume !(~x~0 % 4294967296 > 0); {2376#false} is VALID [2022-04-28 03:37:37,203 INFO L272 TraceCheckUtils]: 16: Hoare triple {2376#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2376#false} is VALID [2022-04-28 03:37:37,203 INFO L290 TraceCheckUtils]: 17: Hoare triple {2376#false} ~cond := #in~cond; {2376#false} is VALID [2022-04-28 03:37:37,203 INFO L290 TraceCheckUtils]: 18: Hoare triple {2376#false} assume 0 == ~cond; {2376#false} is VALID [2022-04-28 03:37:37,203 INFO L290 TraceCheckUtils]: 19: Hoare triple {2376#false} assume !false; {2376#false} is VALID [2022-04-28 03:37:37,203 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:37:37,203 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:37:37,416 INFO L290 TraceCheckUtils]: 19: Hoare triple {2376#false} assume !false; {2376#false} is VALID [2022-04-28 03:37:37,416 INFO L290 TraceCheckUtils]: 18: Hoare triple {2376#false} assume 0 == ~cond; {2376#false} is VALID [2022-04-28 03:37:37,416 INFO L290 TraceCheckUtils]: 17: Hoare triple {2376#false} ~cond := #in~cond; {2376#false} is VALID [2022-04-28 03:37:37,416 INFO L272 TraceCheckUtils]: 16: Hoare triple {2376#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2376#false} is VALID [2022-04-28 03:37:37,416 INFO L290 TraceCheckUtils]: 15: Hoare triple {2376#false} assume !(~x~0 % 4294967296 > 0); {2376#false} is VALID [2022-04-28 03:37:37,416 INFO L290 TraceCheckUtils]: 14: Hoare triple {2430#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {2376#false} is VALID [2022-04-28 03:37:37,418 INFO L290 TraceCheckUtils]: 13: Hoare triple {2420#(< 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; {2430#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:37:37,418 INFO L290 TraceCheckUtils]: 12: Hoare triple {2420#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~z~0 % 4294967296 > 0); {2420#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 03:37:37,419 INFO L290 TraceCheckUtils]: 11: Hoare triple {2420#(< 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; {2420#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 03:37:37,419 INFO L290 TraceCheckUtils]: 10: Hoare triple {2476#(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; {2420#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 03:37:37,420 INFO L290 TraceCheckUtils]: 9: Hoare triple {2480#(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; {2476#(or (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (not (< 0 (mod main_~z~0 4294967296))))} is VALID [2022-04-28 03:37:37,421 INFO L290 TraceCheckUtils]: 8: Hoare triple {2375#true} ~z~0 := ~y~0; {2480#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 03:37:37,421 INFO L290 TraceCheckUtils]: 7: Hoare triple {2375#true} [91] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {2375#true} is VALID [2022-04-28 03:37:37,421 INFO L290 TraceCheckUtils]: 6: Hoare triple {2375#true} [92] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_41| |v_main_#t~post5_40|)) (.cse1 (= v_main_~x~0_85 v_main_~x~0_84)) (.cse2 (= v_main_~y~0_81 v_main_~y~0_80)) (.cse3 (= |v_main_#t~post6_41| |v_main_#t~post6_40|)) (.cse4 (mod v_main_~x~0_85 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 (<= .cse4 0) .cse1 .cse2 .cse3) (and (forall ((v_it_9 Int)) (or (not (<= 1 v_it_9)) (not (<= (+ v_main_~y~0_81 v_it_9 1) v_main_~y~0_80)) (< 0 (mod (+ v_main_~x~0_85 (* v_it_9 4294967295)) 4294967296)))) (< v_main_~y~0_81 v_main_~y~0_80) (< 0 .cse4) (= (+ v_main_~x~0_85 v_main_~y~0_81 (* (- 1) v_main_~y~0_80)) v_main_~x~0_84)))) InVars {main_~y~0=v_main_~y~0_81, main_#t~post5=|v_main_#t~post5_41|, main_~x~0=v_main_~x~0_85, main_#t~post6=|v_main_#t~post6_41|} OutVars{main_~y~0=v_main_~y~0_80, main_#t~post5=|v_main_#t~post5_40|, main_~x~0=v_main_~x~0_84, main_#t~post6=|v_main_#t~post6_40|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2375#true} is VALID [2022-04-28 03:37:37,421 INFO L290 TraceCheckUtils]: 5: Hoare triple {2375#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2375#true} is VALID [2022-04-28 03:37:37,421 INFO L272 TraceCheckUtils]: 4: Hoare triple {2375#true} call #t~ret13 := main(); {2375#true} is VALID [2022-04-28 03:37:37,421 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2375#true} {2375#true} #72#return; {2375#true} is VALID [2022-04-28 03:37:37,421 INFO L290 TraceCheckUtils]: 2: Hoare triple {2375#true} assume true; {2375#true} is VALID [2022-04-28 03:37:37,421 INFO L290 TraceCheckUtils]: 1: Hoare triple {2375#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2375#true} is VALID [2022-04-28 03:37:37,421 INFO L272 TraceCheckUtils]: 0: Hoare triple {2375#true} call ULTIMATE.init(); {2375#true} is VALID [2022-04-28 03:37:37,422 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:37:37,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1978477071] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:37:37,422 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:37:37,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 13 [2022-04-28 03:37:37,486 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:37:37,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1537267818] [2022-04-28 03:37:37,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1537267818] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:37:37,486 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:37:37,486 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 03:37:37,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226161703] [2022-04-28 03:37:37,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:37:37,487 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 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 03:37:37,487 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:37:37,487 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 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 03:37:37,503 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 03:37:37,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 03:37:37,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:37:37,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 03:37:37,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2022-04-28 03:37:37,504 INFO L87 Difference]: Start difference. First operand 28 states and 36 transitions. Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 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 03:37:38,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:37:38,587 INFO L93 Difference]: Finished difference Result 51 states and 72 transitions. [2022-04-28 03:37:38,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 03:37:38,587 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 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 03:37:38,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:37:38,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 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 03:37:38,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 51 transitions. [2022-04-28 03:37:38,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 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 03:37:38,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 51 transitions. [2022-04-28 03:37:38,589 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 51 transitions. [2022-04-28 03:37:38,641 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 03:37:38,642 INFO L225 Difference]: With dead ends: 51 [2022-04-28 03:37:38,642 INFO L226 Difference]: Without dead ends: 45 [2022-04-28 03:37:38,642 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2022-04-28 03:37:38,643 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 36 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 03:37:38,643 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 40 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 03:37:38,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-28 03:37:38,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 35. [2022-04-28 03:37:38,739 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:37:38,739 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 35 states, 30 states have (on average 1.4) internal successors, (42), 30 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:37:38,739 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 35 states, 30 states have (on average 1.4) internal successors, (42), 30 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:37:38,740 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 35 states, 30 states have (on average 1.4) internal successors, (42), 30 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:37:38,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:37:38,741 INFO L93 Difference]: Finished difference Result 45 states and 60 transitions. [2022-04-28 03:37:38,741 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 60 transitions. [2022-04-28 03:37:38,741 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:37:38,741 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:37:38,741 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 30 states have (on average 1.4) internal successors, (42), 30 states have internal predecessors, (42), 3 states have call successors, (3), 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 45 states. [2022-04-28 03:37:38,742 INFO L87 Difference]: Start difference. First operand has 35 states, 30 states have (on average 1.4) internal successors, (42), 30 states have internal predecessors, (42), 3 states have call successors, (3), 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 45 states. [2022-04-28 03:37:38,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:37:38,742 INFO L93 Difference]: Finished difference Result 45 states and 60 transitions. [2022-04-28 03:37:38,742 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 60 transitions. [2022-04-28 03:37:38,742 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:37:38,742 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:37:38,742 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:37:38,743 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:37:38,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.4) internal successors, (42), 30 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:37:38,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 46 transitions. [2022-04-28 03:37:38,743 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 46 transitions. Word has length 20 [2022-04-28 03:37:38,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:37:38,743 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 46 transitions. [2022-04-28 03:37:38,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 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 03:37:38,743 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 46 transitions. [2022-04-28 03:37:42,983 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 44 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-28 03:37:42,984 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 46 transitions. [2022-04-28 03:37:42,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-28 03:37:42,984 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:37:42,984 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:37:43,001 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 03:37:43,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-04-28 03:37:43,201 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:37:43,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:37:43,202 INFO L85 PathProgramCache]: Analyzing trace with hash 1461340774, now seen corresponding path program 4 times [2022-04-28 03:37:43,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:37:43,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [835562035] [2022-04-28 03:37:43,462 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:37:43,463 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:37:43,466 INFO L85 PathProgramCache]: Analyzing trace with hash -1778129499, now seen corresponding path program 1 times [2022-04-28 03:37:43,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:37:43,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434264547] [2022-04-28 03:37:43,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:37:43,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:37:43,475 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_10.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:37:43,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:37:43,485 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_10.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:37:43,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:37:43,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:37:43,645 INFO L290 TraceCheckUtils]: 0: Hoare triple {2794#(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); {2785#true} is VALID [2022-04-28 03:37:43,645 INFO L290 TraceCheckUtils]: 1: Hoare triple {2785#true} assume true; {2785#true} is VALID [2022-04-28 03:37:43,645 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2785#true} {2785#true} #72#return; {2785#true} is VALID [2022-04-28 03:37:43,646 INFO L272 TraceCheckUtils]: 0: Hoare triple {2785#true} call ULTIMATE.init(); {2794#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:37:43,646 INFO L290 TraceCheckUtils]: 1: Hoare triple {2794#(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); {2785#true} is VALID [2022-04-28 03:37:43,646 INFO L290 TraceCheckUtils]: 2: Hoare triple {2785#true} assume true; {2785#true} is VALID [2022-04-28 03:37:43,646 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2785#true} {2785#true} #72#return; {2785#true} is VALID [2022-04-28 03:37:43,646 INFO L272 TraceCheckUtils]: 4: Hoare triple {2785#true} call #t~ret13 := main(); {2785#true} is VALID [2022-04-28 03:37:43,646 INFO L290 TraceCheckUtils]: 5: Hoare triple {2785#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2785#true} is VALID [2022-04-28 03:37:43,646 INFO L290 TraceCheckUtils]: 6: Hoare triple {2785#true} [94] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_95 4294967296)) (.cse1 (= v_main_~x~0_95 v_main_~x~0_94)) (.cse2 (= |v_main_#t~post5_46| |v_main_#t~post5_45|)) (.cse3 (= v_main_~y~0_90 v_main_~y~0_89)) (.cse4 (= |v_main_#t~post6_46| |v_main_#t~post6_45|))) (or (and (<= .cse0 0) .cse1 .cse2 .cse3 .cse4) (and (forall ((v_it_10 Int)) (or (not (<= (+ v_main_~x~0_94 v_it_10 1) v_main_~x~0_95)) (not (<= 1 v_it_10)) (< 0 (mod (+ v_main_~x~0_95 (* 4294967295 v_it_10)) 4294967296)))) (= v_main_~y~0_89 (+ v_main_~x~0_95 v_main_~y~0_90 (* (- 1) v_main_~x~0_94))) (< 0 .cse0) (< v_main_~x~0_94 v_main_~x~0_95)) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_90, main_#t~post5=|v_main_#t~post5_46|, main_~x~0=v_main_~x~0_95, main_#t~post6=|v_main_#t~post6_46|} OutVars{main_~y~0=v_main_~y~0_89, main_#t~post5=|v_main_#t~post5_45|, main_~x~0=v_main_~x~0_94, main_#t~post6=|v_main_#t~post6_45|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2785#true} is VALID [2022-04-28 03:37:43,646 INFO L290 TraceCheckUtils]: 7: Hoare triple {2785#true} [93] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {2785#true} is VALID [2022-04-28 03:37:43,647 INFO L290 TraceCheckUtils]: 8: Hoare triple {2785#true} ~z~0 := ~y~0; {2790#(= (+ main_~z~0 (* (- 1) main_~y~0)) 0)} is VALID [2022-04-28 03:37:43,648 INFO L290 TraceCheckUtils]: 9: Hoare triple {2790#(= (+ main_~z~0 (* (- 1) main_~y~0)) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2791#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-28 03:37:43,649 INFO L290 TraceCheckUtils]: 10: Hoare triple {2791#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 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; {2792#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-28 03:37:43,649 INFO L290 TraceCheckUtils]: 11: Hoare triple {2792#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !(~z~0 % 4294967296 > 0); {2792#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-28 03:37:43,650 INFO L290 TraceCheckUtils]: 12: Hoare triple {2792#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 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; {2793#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-28 03:37:43,651 INFO L290 TraceCheckUtils]: 13: Hoare triple {2793#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {2786#false} is VALID [2022-04-28 03:37:43,651 INFO L290 TraceCheckUtils]: 14: Hoare triple {2786#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {2786#false} is VALID [2022-04-28 03:37:43,651 INFO L290 TraceCheckUtils]: 15: Hoare triple {2786#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {2786#false} is VALID [2022-04-28 03:37:43,651 INFO L290 TraceCheckUtils]: 16: Hoare triple {2786#false} assume !(~x~0 % 4294967296 > 0); {2786#false} is VALID [2022-04-28 03:37:43,651 INFO L272 TraceCheckUtils]: 17: Hoare triple {2786#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2786#false} is VALID [2022-04-28 03:37:43,651 INFO L290 TraceCheckUtils]: 18: Hoare triple {2786#false} ~cond := #in~cond; {2786#false} is VALID [2022-04-28 03:37:43,651 INFO L290 TraceCheckUtils]: 19: Hoare triple {2786#false} assume 0 == ~cond; {2786#false} is VALID [2022-04-28 03:37:43,651 INFO L290 TraceCheckUtils]: 20: Hoare triple {2786#false} assume !false; {2786#false} is VALID [2022-04-28 03:37:43,651 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 03:37:43,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:37:43,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434264547] [2022-04-28 03:37:43,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434264547] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:37:43,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1631978498] [2022-04-28 03:37:43,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:37:43,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:37:43,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:37:43,653 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 03:37:43,653 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 03:37:43,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:37:43,697 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-28 03:37:43,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:37:43,705 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:37:44,240 INFO L272 TraceCheckUtils]: 0: Hoare triple {2785#true} call ULTIMATE.init(); {2785#true} is VALID [2022-04-28 03:37:44,240 INFO L290 TraceCheckUtils]: 1: Hoare triple {2785#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2785#true} is VALID [2022-04-28 03:37:44,240 INFO L290 TraceCheckUtils]: 2: Hoare triple {2785#true} assume true; {2785#true} is VALID [2022-04-28 03:37:44,240 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2785#true} {2785#true} #72#return; {2785#true} is VALID [2022-04-28 03:37:44,240 INFO L272 TraceCheckUtils]: 4: Hoare triple {2785#true} call #t~ret13 := main(); {2785#true} is VALID [2022-04-28 03:37:44,240 INFO L290 TraceCheckUtils]: 5: Hoare triple {2785#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2785#true} is VALID [2022-04-28 03:37:44,241 INFO L290 TraceCheckUtils]: 6: Hoare triple {2785#true} [94] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_95 4294967296)) (.cse1 (= v_main_~x~0_95 v_main_~x~0_94)) (.cse2 (= |v_main_#t~post5_46| |v_main_#t~post5_45|)) (.cse3 (= v_main_~y~0_90 v_main_~y~0_89)) (.cse4 (= |v_main_#t~post6_46| |v_main_#t~post6_45|))) (or (and (<= .cse0 0) .cse1 .cse2 .cse3 .cse4) (and (forall ((v_it_10 Int)) (or (not (<= (+ v_main_~x~0_94 v_it_10 1) v_main_~x~0_95)) (not (<= 1 v_it_10)) (< 0 (mod (+ v_main_~x~0_95 (* 4294967295 v_it_10)) 4294967296)))) (= v_main_~y~0_89 (+ v_main_~x~0_95 v_main_~y~0_90 (* (- 1) v_main_~x~0_94))) (< 0 .cse0) (< v_main_~x~0_94 v_main_~x~0_95)) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_90, main_#t~post5=|v_main_#t~post5_46|, main_~x~0=v_main_~x~0_95, main_#t~post6=|v_main_#t~post6_46|} OutVars{main_~y~0=v_main_~y~0_89, main_#t~post5=|v_main_#t~post5_45|, main_~x~0=v_main_~x~0_94, main_#t~post6=|v_main_#t~post6_45|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2785#true} is VALID [2022-04-28 03:37:44,241 INFO L290 TraceCheckUtils]: 7: Hoare triple {2785#true} [93] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {2785#true} is VALID [2022-04-28 03:37:44,241 INFO L290 TraceCheckUtils]: 8: Hoare triple {2785#true} ~z~0 := ~y~0; {2790#(= (+ main_~z~0 (* (- 1) main_~y~0)) 0)} is VALID [2022-04-28 03:37:44,242 INFO L290 TraceCheckUtils]: 9: Hoare triple {2790#(= (+ main_~z~0 (* (- 1) main_~y~0)) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2791#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-28 03:37:44,243 INFO L290 TraceCheckUtils]: 10: Hoare triple {2791#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 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; {2792#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-28 03:37:44,243 INFO L290 TraceCheckUtils]: 11: Hoare triple {2792#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !(~z~0 % 4294967296 > 0); {2792#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-28 03:37:44,245 INFO L290 TraceCheckUtils]: 12: Hoare triple {2792#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 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; {2793#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-28 03:37:44,245 INFO L290 TraceCheckUtils]: 13: Hoare triple {2793#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {2786#false} is VALID [2022-04-28 03:37:44,245 INFO L290 TraceCheckUtils]: 14: Hoare triple {2786#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {2786#false} is VALID [2022-04-28 03:37:44,245 INFO L290 TraceCheckUtils]: 15: Hoare triple {2786#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {2786#false} is VALID [2022-04-28 03:37:44,246 INFO L290 TraceCheckUtils]: 16: Hoare triple {2786#false} assume !(~x~0 % 4294967296 > 0); {2786#false} is VALID [2022-04-28 03:37:44,246 INFO L272 TraceCheckUtils]: 17: Hoare triple {2786#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2786#false} is VALID [2022-04-28 03:37:44,246 INFO L290 TraceCheckUtils]: 18: Hoare triple {2786#false} ~cond := #in~cond; {2786#false} is VALID [2022-04-28 03:37:44,246 INFO L290 TraceCheckUtils]: 19: Hoare triple {2786#false} assume 0 == ~cond; {2786#false} is VALID [2022-04-28 03:37:44,246 INFO L290 TraceCheckUtils]: 20: Hoare triple {2786#false} assume !false; {2786#false} is VALID [2022-04-28 03:37:44,246 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 03:37:44,246 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:37:44,734 INFO L290 TraceCheckUtils]: 20: Hoare triple {2786#false} assume !false; {2786#false} is VALID [2022-04-28 03:37:44,734 INFO L290 TraceCheckUtils]: 19: Hoare triple {2786#false} assume 0 == ~cond; {2786#false} is VALID [2022-04-28 03:37:44,734 INFO L290 TraceCheckUtils]: 18: Hoare triple {2786#false} ~cond := #in~cond; {2786#false} is VALID [2022-04-28 03:37:44,734 INFO L272 TraceCheckUtils]: 17: Hoare triple {2786#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2786#false} is VALID [2022-04-28 03:37:44,734 INFO L290 TraceCheckUtils]: 16: Hoare triple {2786#false} assume !(~x~0 % 4294967296 > 0); {2786#false} is VALID [2022-04-28 03:37:44,734 INFO L290 TraceCheckUtils]: 15: Hoare triple {2786#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {2786#false} is VALID [2022-04-28 03:37:44,734 INFO L290 TraceCheckUtils]: 14: Hoare triple {2786#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {2786#false} is VALID [2022-04-28 03:37:44,735 INFO L290 TraceCheckUtils]: 13: Hoare triple {2793#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {2786#false} is VALID [2022-04-28 03:37:44,736 INFO L290 TraceCheckUtils]: 12: Hoare triple {2792#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 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; {2793#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-28 03:37:44,736 INFO L290 TraceCheckUtils]: 11: Hoare triple {2792#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !(~z~0 % 4294967296 > 0); {2792#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-28 03:37:44,737 INFO L290 TraceCheckUtils]: 10: Hoare triple {2888#(or (<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 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; {2792#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-28 03:37:44,738 INFO L290 TraceCheckUtils]: 9: Hoare triple {2892#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 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; {2888#(or (<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296)) (not (< 0 (mod main_~z~0 4294967296))))} is VALID [2022-04-28 03:37:44,739 INFO L290 TraceCheckUtils]: 8: Hoare triple {2785#true} ~z~0 := ~y~0; {2892#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296)))} is VALID [2022-04-28 03:37:44,739 INFO L290 TraceCheckUtils]: 7: Hoare triple {2785#true} [93] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {2785#true} is VALID [2022-04-28 03:37:44,740 INFO L290 TraceCheckUtils]: 6: Hoare triple {2785#true} [94] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_95 4294967296)) (.cse1 (= v_main_~x~0_95 v_main_~x~0_94)) (.cse2 (= |v_main_#t~post5_46| |v_main_#t~post5_45|)) (.cse3 (= v_main_~y~0_90 v_main_~y~0_89)) (.cse4 (= |v_main_#t~post6_46| |v_main_#t~post6_45|))) (or (and (<= .cse0 0) .cse1 .cse2 .cse3 .cse4) (and (forall ((v_it_10 Int)) (or (not (<= (+ v_main_~x~0_94 v_it_10 1) v_main_~x~0_95)) (not (<= 1 v_it_10)) (< 0 (mod (+ v_main_~x~0_95 (* 4294967295 v_it_10)) 4294967296)))) (= v_main_~y~0_89 (+ v_main_~x~0_95 v_main_~y~0_90 (* (- 1) v_main_~x~0_94))) (< 0 .cse0) (< v_main_~x~0_94 v_main_~x~0_95)) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_90, main_#t~post5=|v_main_#t~post5_46|, main_~x~0=v_main_~x~0_95, main_#t~post6=|v_main_#t~post6_46|} OutVars{main_~y~0=v_main_~y~0_89, main_#t~post5=|v_main_#t~post5_45|, main_~x~0=v_main_~x~0_94, main_#t~post6=|v_main_#t~post6_45|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2785#true} is VALID [2022-04-28 03:37:44,740 INFO L290 TraceCheckUtils]: 5: Hoare triple {2785#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2785#true} is VALID [2022-04-28 03:37:44,740 INFO L272 TraceCheckUtils]: 4: Hoare triple {2785#true} call #t~ret13 := main(); {2785#true} is VALID [2022-04-28 03:37:44,740 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2785#true} {2785#true} #72#return; {2785#true} is VALID [2022-04-28 03:37:44,740 INFO L290 TraceCheckUtils]: 2: Hoare triple {2785#true} assume true; {2785#true} is VALID [2022-04-28 03:37:44,740 INFO L290 TraceCheckUtils]: 1: Hoare triple {2785#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2785#true} is VALID [2022-04-28 03:37:44,740 INFO L272 TraceCheckUtils]: 0: Hoare triple {2785#true} call ULTIMATE.init(); {2785#true} is VALID [2022-04-28 03:37:44,740 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 03:37:44,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1631978498] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:37:44,740 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:37:44,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 9 [2022-04-28 03:37:44,800 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:37:44,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [835562035] [2022-04-28 03:37:44,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [835562035] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:37:44,800 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:37:44,800 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 03:37:44,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664127238] [2022-04-28 03:37:44,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:37:44,800 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 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 21 [2022-04-28 03:37:44,801 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:37:44,801 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 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 03:37:44,817 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 03:37:44,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 03:37:44,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:37:44,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 03:37:44,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-04-28 03:37:44,817 INFO L87 Difference]: Start difference. First operand 35 states and 46 transitions. Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 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 03:37:45,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:37:45,804 INFO L93 Difference]: Finished difference Result 48 states and 61 transitions. [2022-04-28 03:37:45,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 03:37:45,804 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 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 21 [2022-04-28 03:37:45,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:37:45,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 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 03:37:45,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 34 transitions. [2022-04-28 03:37:45,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 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 03:37:45,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 34 transitions. [2022-04-28 03:37:45,806 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 34 transitions. [2022-04-28 03:37:45,840 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 03:37:45,841 INFO L225 Difference]: With dead ends: 48 [2022-04-28 03:37:45,841 INFO L226 Difference]: Without dead ends: 36 [2022-04-28 03:37:45,841 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 45 SyntacticMatches, 7 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2022-04-28 03:37:45,842 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 19 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 03:37:45,842 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 43 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 03:37:45,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-28 03:37:45,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2022-04-28 03:37:45,931 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:37:45,931 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 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 03:37:45,931 INFO L74 IsIncluded]: Start isIncluded. First operand 36 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 03:37:45,932 INFO L87 Difference]: Start difference. First operand 36 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 03:37:45,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:37:45,932 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2022-04-28 03:37:45,932 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 45 transitions. [2022-04-28 03:37:45,932 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:37:45,933 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:37:45,933 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 36 states. [2022-04-28 03:37:45,933 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 36 states. [2022-04-28 03:37:45,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:37:45,933 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2022-04-28 03:37:45,933 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 45 transitions. [2022-04-28 03:37:45,933 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:37:45,933 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:37:45,934 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:37:45,934 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:37:45,934 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 03:37:45,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2022-04-28 03:37:45,934 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 42 transitions. Word has length 21 [2022-04-28 03:37:45,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:37:45,934 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 42 transitions. [2022-04-28 03:37:45,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 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 03:37:45,934 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 42 transitions. [2022-04-28 03:37:48,255 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 41 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 03:37:48,255 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2022-04-28 03:37:48,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 03:37:48,255 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:37:48,255 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:37:48,273 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 03:37:48,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:37:48,460 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:37:48,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:37:48,461 INFO L85 PathProgramCache]: Analyzing trace with hash 1884746625, now seen corresponding path program 5 times [2022-04-28 03:37:48,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:37:48,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1132952725] [2022-04-28 03:37:48,742 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:37:48,743 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:37:48,745 INFO L85 PathProgramCache]: Analyzing trace with hash -2055516062, now seen corresponding path program 1 times [2022-04-28 03:37:48,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:37:48,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110992445] [2022-04-28 03:37:48,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:37:48,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:37:48,752 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_11.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:37:48,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:37:48,777 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_11.6))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:37:49,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:37:49,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:37:49,896 INFO L290 TraceCheckUtils]: 0: Hoare triple {3193#(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); {3175#true} is VALID [2022-04-28 03:37:49,896 INFO L290 TraceCheckUtils]: 1: Hoare triple {3175#true} assume true; {3175#true} is VALID [2022-04-28 03:37:49,896 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3175#true} {3175#true} #72#return; {3175#true} is VALID [2022-04-28 03:37:49,897 INFO L272 TraceCheckUtils]: 0: Hoare triple {3175#true} call ULTIMATE.init(); {3193#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:37:49,897 INFO L290 TraceCheckUtils]: 1: Hoare triple {3193#(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); {3175#true} is VALID [2022-04-28 03:37:49,897 INFO L290 TraceCheckUtils]: 2: Hoare triple {3175#true} assume true; {3175#true} is VALID [2022-04-28 03:37:49,897 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3175#true} {3175#true} #72#return; {3175#true} is VALID [2022-04-28 03:37:49,897 INFO L272 TraceCheckUtils]: 4: Hoare triple {3175#true} call #t~ret13 := main(); {3175#true} is VALID [2022-04-28 03:37:49,897 INFO L290 TraceCheckUtils]: 5: Hoare triple {3175#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3180#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-28 03:37:49,938 INFO L290 TraceCheckUtils]: 6: Hoare triple {3180#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} [96] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_106 v_main_~x~0_105)) (.cse1 (= |v_main_#t~post5_51| |v_main_#t~post5_50|)) (.cse2 (= |v_main_#t~post6_51| |v_main_#t~post6_50|)) (.cse4 (= v_main_~y~0_101 v_main_~y~0_100)) (.cse3 (mod v_main_~x~0_106 4294967296))) (or (and .cse0 .cse1 .cse2 (<= .cse3 0) .cse4) (and .cse0 .cse1 .cse2 .cse4) (and (= v_main_~y~0_100 (+ v_main_~x~0_106 (* v_main_~x~0_105 (- 1)) v_main_~y~0_101)) (forall ((v_it_11 Int)) (or (not (<= 1 v_it_11)) (not (<= (+ v_main_~x~0_105 v_it_11 1) v_main_~x~0_106)) (< 0 (mod (+ v_main_~x~0_106 (* 4294967295 v_it_11)) 4294967296)))) (< v_main_~x~0_105 v_main_~x~0_106) (< 0 .cse3)))) InVars {main_~y~0=v_main_~y~0_101, main_#t~post5=|v_main_#t~post5_51|, main_~x~0=v_main_~x~0_106, main_#t~post6=|v_main_#t~post6_51|} OutVars{main_~y~0=v_main_~y~0_100, main_#t~post5=|v_main_#t~post5_50|, main_~x~0=v_main_~x~0_105, main_#t~post6=|v_main_#t~post6_50|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {3181#(or (and (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= (+ main_~y~0 main_~x~0) (+ (* 4294967296 (div (+ (* 4294967296 (div (+ (- 1) main_~y~0 main_~x~0) 4294967296)) main_~y~0 main_~x~0 (* (- 1) main_~n~0)) 4294967296)) 4294967295))) (= main_~y~0 0))} is VALID [2022-04-28 03:37:49,942 INFO L290 TraceCheckUtils]: 7: Hoare triple {3181#(or (and (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= (+ main_~y~0 main_~x~0) (+ (* 4294967296 (div (+ (* 4294967296 (div (+ (- 1) main_~y~0 main_~x~0) 4294967296)) main_~y~0 main_~x~0 (* (- 1) main_~n~0)) 4294967296)) 4294967295))) (= main_~y~0 0))} [95] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {3182#(or (= main_~y~0 0) (and (<= (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0) (<= (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) (+ 4294967295 (* (div (+ main_~y~0 (* (div (+ (- 1) main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296) (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296)))))} is VALID [2022-04-28 03:37:49,943 INFO L290 TraceCheckUtils]: 8: Hoare triple {3182#(or (= main_~y~0 0) (and (<= (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0) (<= (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) (+ 4294967295 (* (div (+ main_~y~0 (* (div (+ (- 1) main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296) (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296)))))} ~z~0 := ~y~0; {3183#(and (or (= main_~y~0 0) (and (<= (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0) (<= (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) (+ 4294967295 (* (div (+ main_~y~0 (* (div (+ (- 1) main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296) (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))))) (= (+ main_~z~0 (* (- 1) main_~y~0)) 0))} is VALID [2022-04-28 03:37:49,964 INFO L290 TraceCheckUtils]: 9: Hoare triple {3183#(and (or (= main_~y~0 0) (and (<= (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0) (<= (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) (+ 4294967295 (* (div (+ main_~y~0 (* (div (+ (- 1) main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296) (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))))) (= (+ main_~z~0 (* (- 1) main_~y~0)) 0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3184#(and (<= main_~z~0 (+ (* (div (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 1) 4294967296) 4294967296) 4294967294)) (<= (div main_~n~0 4294967296) (+ (div main_~z~0 4294967296) (div (+ (- 1) main_~n~0 (* (- 1) main_~z~0)) 4294967296))))} is VALID [2022-04-28 03:37:49,969 INFO L290 TraceCheckUtils]: 10: Hoare triple {3184#(and (<= main_~z~0 (+ (* (div (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 1) 4294967296) 4294967296) 4294967294)) (<= (div main_~n~0 4294967296) (+ (div main_~z~0 4294967296) (div (+ (- 1) main_~n~0 (* (- 1) 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; {3185#(and (or (<= (+ main_~n~0 4294967294 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (* (div main_~n~0 4294967296) 4294967296) (+ main_~z~0 (* (div (+ (- 2) main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)))) (<= (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-28 03:37:49,970 INFO L290 TraceCheckUtils]: 11: Hoare triple {3185#(and (or (<= (+ main_~n~0 4294967294 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296))) (<= (* (div main_~n~0 4294967296) 4294967296) (+ main_~z~0 (* (div (+ (- 2) main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)))) (<= (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {3186#(and (<= (div main_~n~0 4294967296) (+ (div main_~z~0 4294967296) (div (+ (- 2) main_~n~0 (* (div main_~z~0 4294967296) (- 4294967296))) 4294967296))) (<= main_~n~0 (+ 2 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-28 03:37:49,972 INFO L290 TraceCheckUtils]: 12: Hoare triple {3186#(and (<= (div main_~n~0 4294967296) (+ (div main_~z~0 4294967296) (div (+ (- 2) main_~n~0 (* (div main_~z~0 4294967296) (- 4294967296))) 4294967296))) (<= main_~n~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; {3186#(and (<= (div main_~n~0 4294967296) (+ (div main_~z~0 4294967296) (div (+ (- 2) main_~n~0 (* (div main_~z~0 4294967296) (- 4294967296))) 4294967296))) (<= main_~n~0 (+ 2 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-28 03:37:49,973 INFO L290 TraceCheckUtils]: 13: Hoare triple {3186#(and (<= (div main_~n~0 4294967296) (+ (div main_~z~0 4294967296) (div (+ (- 2) main_~n~0 (* (div main_~z~0 4294967296) (- 4294967296))) 4294967296))) (<= main_~n~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; {3187#(and (<= (div main_~n~0 4294967296) (div (+ (- 2) main_~n~0) 4294967296)) (<= main_~n~0 (+ main_~y~0 2 (* (div (+ 4294967294 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~y~0)) 4294967296) 4294967296))))} is VALID [2022-04-28 03:37:49,976 INFO L290 TraceCheckUtils]: 14: Hoare triple {3187#(and (<= (div main_~n~0 4294967296) (div (+ (- 2) main_~n~0) 4294967296)) (<= main_~n~0 (+ main_~y~0 2 (* (div (+ 4294967294 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~y~0)) 4294967296) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {3188#(and (<= (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296)) (<= (+ (* (div main_~y~0 4294967296) 4294967296) (* (div main_~n~0 4294967296) 4294967296)) (+ (* 4294967296 (div (+ (- 2) (* (div main_~y~0 4294967296) 4294967296) main_~n~0 (* (- 1) main_~y~0)) 4294967296)) main_~y~0)))} is VALID [2022-04-28 03:37:49,982 INFO L290 TraceCheckUtils]: 15: Hoare triple {3188#(and (<= (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296)) (<= (+ (* (div main_~y~0 4294967296) 4294967296) (* (div main_~n~0 4294967296) 4294967296)) (+ (* 4294967296 (div (+ (- 2) (* (div main_~y~0 4294967296) 4294967296) main_~n~0 (* (- 1) main_~y~0)) 4294967296)) main_~y~0)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {3189#(and (<= (+ (* (div main_~n~0 4294967296) 4294967296) 1) (+ (* (div (+ (- 1) main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0)) (<= main_~n~0 (+ main_~y~0 (* (div (+ (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~y~0) 1) 4294967296) 4294967296) 1)))} is VALID [2022-04-28 03:37:49,985 INFO L290 TraceCheckUtils]: 16: Hoare triple {3189#(and (<= (+ (* (div main_~n~0 4294967296) 4294967296) 1) (+ (* (div (+ (- 1) main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0)) (<= main_~n~0 (+ main_~y~0 (* (div (+ (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~y~0) 1) 4294967296) 4294967296) 1)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {3190#(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 03:37:49,990 INFO L290 TraceCheckUtils]: 17: Hoare triple {3190#(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); {3190#(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 03:37:49,991 INFO L272 TraceCheckUtils]: 18: Hoare triple {3190#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {3191#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:37:49,991 INFO L290 TraceCheckUtils]: 19: Hoare triple {3191#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {3192#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:37:49,992 INFO L290 TraceCheckUtils]: 20: Hoare triple {3192#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {3176#false} is VALID [2022-04-28 03:37:49,992 INFO L290 TraceCheckUtils]: 21: Hoare triple {3176#false} assume !false; {3176#false} is VALID [2022-04-28 03:37:49,992 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:37:49,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:37:49,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110992445] [2022-04-28 03:37:49,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110992445] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:37:49,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [984013728] [2022-04-28 03:37:49,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:37:49,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:37:49,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:37:49,993 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 03:37:49,994 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 03:37:50,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:37:50,329 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-28 03:37:50,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:37:50,788 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:39:00,073 INFO L272 TraceCheckUtils]: 0: Hoare triple {3175#true} call ULTIMATE.init(); {3175#true} is VALID [2022-04-28 03:39:00,073 INFO L290 TraceCheckUtils]: 1: Hoare triple {3175#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3175#true} is VALID [2022-04-28 03:39:00,074 INFO L290 TraceCheckUtils]: 2: Hoare triple {3175#true} assume true; {3175#true} is VALID [2022-04-28 03:39:00,074 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3175#true} {3175#true} #72#return; {3175#true} is VALID [2022-04-28 03:39:00,074 INFO L272 TraceCheckUtils]: 4: Hoare triple {3175#true} call #t~ret13 := main(); {3175#true} is VALID [2022-04-28 03:39:00,074 INFO L290 TraceCheckUtils]: 5: Hoare triple {3175#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3180#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-28 03:39:00,081 INFO L290 TraceCheckUtils]: 6: Hoare triple {3180#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} [96] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_106 v_main_~x~0_105)) (.cse1 (= |v_main_#t~post5_51| |v_main_#t~post5_50|)) (.cse2 (= |v_main_#t~post6_51| |v_main_#t~post6_50|)) (.cse4 (= v_main_~y~0_101 v_main_~y~0_100)) (.cse3 (mod v_main_~x~0_106 4294967296))) (or (and .cse0 .cse1 .cse2 (<= .cse3 0) .cse4) (and .cse0 .cse1 .cse2 .cse4) (and (= v_main_~y~0_100 (+ v_main_~x~0_106 (* v_main_~x~0_105 (- 1)) v_main_~y~0_101)) (forall ((v_it_11 Int)) (or (not (<= 1 v_it_11)) (not (<= (+ v_main_~x~0_105 v_it_11 1) v_main_~x~0_106)) (< 0 (mod (+ v_main_~x~0_106 (* 4294967295 v_it_11)) 4294967296)))) (< v_main_~x~0_105 v_main_~x~0_106) (< 0 .cse3)))) InVars {main_~y~0=v_main_~y~0_101, main_#t~post5=|v_main_#t~post5_51|, main_~x~0=v_main_~x~0_106, main_#t~post6=|v_main_#t~post6_51|} OutVars{main_~y~0=v_main_~y~0_100, main_#t~post5=|v_main_#t~post5_50|, main_~x~0=v_main_~x~0_105, main_#t~post6=|v_main_#t~post6_50|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {3215#(or (and (= main_~n~0 main_~x~0) (= main_~y~0 0)) (and (forall ((v_it_11 Int)) (or (not (<= 1 v_it_11)) (not (<= (+ main_~x~0 v_it_11 1) main_~n~0)) (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_11)) 4294967296)))) (< main_~x~0 main_~n~0) (< 0 (mod main_~n~0 4294967296)) (= main_~y~0 (+ main_~n~0 (* (- 1) main_~x~0)))))} is VALID [2022-04-28 03:39:00,083 INFO L290 TraceCheckUtils]: 7: Hoare triple {3215#(or (and (= main_~n~0 main_~x~0) (= main_~y~0 0)) (and (forall ((v_it_11 Int)) (or (not (<= 1 v_it_11)) (not (<= (+ main_~x~0 v_it_11 1) main_~n~0)) (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_11)) 4294967296)))) (< main_~x~0 main_~n~0) (< 0 (mod main_~n~0 4294967296)) (= main_~y~0 (+ main_~n~0 (* (- 1) main_~x~0)))))} [95] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {3219#(and (not (< 0 (mod main_~x~0 4294967296))) (or (and (= main_~n~0 main_~x~0) (= main_~y~0 0)) (and (forall ((v_it_11 Int)) (or (not (<= 1 v_it_11)) (not (<= (+ main_~x~0 v_it_11 1) main_~n~0)) (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_11)) 4294967296)))) (< main_~x~0 main_~n~0) (< 0 (mod main_~n~0 4294967296)) (= main_~y~0 (+ main_~n~0 (* (- 1) main_~x~0))))))} is VALID [2022-04-28 03:39:00,084 INFO L290 TraceCheckUtils]: 8: Hoare triple {3219#(and (not (< 0 (mod main_~x~0 4294967296))) (or (and (= main_~n~0 main_~x~0) (= main_~y~0 0)) (and (forall ((v_it_11 Int)) (or (not (<= 1 v_it_11)) (not (<= (+ main_~x~0 v_it_11 1) main_~n~0)) (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_11)) 4294967296)))) (< main_~x~0 main_~n~0) (< 0 (mod main_~n~0 4294967296)) (= main_~y~0 (+ main_~n~0 (* (- 1) main_~x~0))))))} ~z~0 := ~y~0; {3223#(and (= main_~z~0 main_~y~0) (not (< 0 (mod main_~x~0 4294967296))) (or (and (= main_~n~0 main_~x~0) (= main_~y~0 0)) (and (forall ((v_it_11 Int)) (or (not (<= 1 v_it_11)) (not (<= (+ main_~x~0 v_it_11 1) main_~n~0)) (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_11)) 4294967296)))) (< main_~x~0 main_~n~0) (< 0 (mod main_~n~0 4294967296)) (= main_~y~0 (+ main_~n~0 (* (- 1) main_~x~0))))))} is VALID [2022-04-28 03:39:00,134 INFO L290 TraceCheckUtils]: 9: Hoare triple {3223#(and (= main_~z~0 main_~y~0) (not (< 0 (mod main_~x~0 4294967296))) (or (and (= main_~n~0 main_~x~0) (= main_~y~0 0)) (and (forall ((v_it_11 Int)) (or (not (<= 1 v_it_11)) (not (<= (+ main_~x~0 v_it_11 1) main_~n~0)) (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_11)) 4294967296)))) (< main_~x~0 main_~n~0) (< 0 (mod main_~n~0 4294967296)) (= main_~y~0 (+ main_~n~0 (* (- 1) 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; {3227#(and (forall ((v_it_11 Int)) (or (not (<= 1 v_it_11)) (not (<= (+ main_~x~0 v_it_11) main_~n~0)) (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_11)) 4294967296)))) (< 0 (mod (+ main_~z~0 1) 4294967296)) (< main_~x~0 (+ main_~n~0 1)) (not (< 0 (mod (+ main_~x~0 4294967295) 4294967296))) (= (+ main_~n~0 (* (- 1) main_~x~0) 1) main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-28 03:39:00,138 INFO L290 TraceCheckUtils]: 10: Hoare triple {3227#(and (forall ((v_it_11 Int)) (or (not (<= 1 v_it_11)) (not (<= (+ main_~x~0 v_it_11) main_~n~0)) (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_11)) 4294967296)))) (< 0 (mod (+ main_~z~0 1) 4294967296)) (< main_~x~0 (+ main_~n~0 1)) (not (< 0 (mod (+ main_~x~0 4294967295) 4294967296))) (= (+ main_~n~0 (* (- 1) main_~x~0) 1) 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; {3231#(and (< 0 (mod (+ main_~z~0 2) 4294967296)) (< 0 (mod (+ main_~z~0 1) 4294967296)) (= main_~y~0 (+ main_~z~0 2)) (not (< 0 (mod (+ main_~x~0 4294967294) 4294967296))) (< main_~x~0 (+ main_~n~0 2)) (= main_~y~0 (+ main_~n~0 2 (* (- 1) main_~x~0))) (forall ((v_it_11 Int)) (or (not (<= 1 v_it_11)) (not (<= (+ main_~x~0 v_it_11) (+ main_~n~0 1))) (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_11)) 4294967296)))))} is VALID [2022-04-28 03:39:00,165 INFO L290 TraceCheckUtils]: 11: Hoare triple {3231#(and (< 0 (mod (+ main_~z~0 2) 4294967296)) (< 0 (mod (+ main_~z~0 1) 4294967296)) (= main_~y~0 (+ main_~z~0 2)) (not (< 0 (mod (+ main_~x~0 4294967294) 4294967296))) (< main_~x~0 (+ main_~n~0 2)) (= main_~y~0 (+ main_~n~0 2 (* (- 1) main_~x~0))) (forall ((v_it_11 Int)) (or (not (<= 1 v_it_11)) (not (<= (+ main_~x~0 v_it_11) (+ main_~n~0 1))) (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_11)) 4294967296)))))} assume !(~z~0 % 4294967296 > 0); {3235#(and (<= (mod (+ main_~x~0 4294967294) 4294967296) 0) (<= (mod (+ main_~y~0 4294967294) 4294967296) 0) (< main_~x~0 (+ main_~n~0 2)) (= (+ main_~n~0 2) (+ main_~y~0 main_~x~0)) (forall ((v_it_11 Int)) (or (not (<= 1 v_it_11)) (not (<= (+ main_~x~0 v_it_11) (+ main_~n~0 1))) (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_11)) 4294967296)))))} is VALID [2022-04-28 03:39:00,168 INFO L290 TraceCheckUtils]: 12: Hoare triple {3235#(and (<= (mod (+ main_~x~0 4294967294) 4294967296) 0) (<= (mod (+ main_~y~0 4294967294) 4294967296) 0) (< main_~x~0 (+ main_~n~0 2)) (= (+ main_~n~0 2) (+ main_~y~0 main_~x~0)) (forall ((v_it_11 Int)) (or (not (<= 1 v_it_11)) (not (<= (+ main_~x~0 v_it_11) (+ main_~n~0 1))) (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_11)) 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; {3239#(and (<= (mod (+ main_~y~0 4294967295) 4294967296) 0) (= (+ main_~y~0 main_~x~0 1) (+ main_~n~0 2)) (<= (mod (+ main_~x~0 4294967294) 4294967296) 0) (< main_~x~0 (+ main_~n~0 2)) (forall ((v_it_11 Int)) (or (not (<= 1 v_it_11)) (not (<= (+ main_~x~0 v_it_11) (+ main_~n~0 1))) (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_11)) 4294967296)))))} is VALID [2022-04-28 03:39:00,219 INFO L290 TraceCheckUtils]: 13: Hoare triple {3239#(and (<= (mod (+ main_~y~0 4294967295) 4294967296) 0) (= (+ main_~y~0 main_~x~0 1) (+ main_~n~0 2)) (<= (mod (+ main_~x~0 4294967294) 4294967296) 0) (< main_~x~0 (+ main_~n~0 2)) (forall ((v_it_11 Int)) (or (not (<= 1 v_it_11)) (not (<= (+ main_~x~0 v_it_11) (+ main_~n~0 1))) (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_11)) 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; {3243#(and (<= (mod main_~y~0 4294967296) 0) (<= (mod (+ main_~x~0 4294967294) 4294967296) 0) (= (+ main_~y~0 main_~x~0 2) (+ main_~n~0 2)) (< main_~x~0 (+ main_~n~0 2)) (forall ((v_it_11 Int)) (or (not (<= 1 v_it_11)) (not (<= (+ main_~x~0 v_it_11) (+ main_~n~0 1))) (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_11)) 4294967296)))))} is VALID [2022-04-28 03:39:00,221 INFO L290 TraceCheckUtils]: 14: Hoare triple {3243#(and (<= (mod main_~y~0 4294967296) 0) (<= (mod (+ main_~x~0 4294967294) 4294967296) 0) (= (+ main_~y~0 main_~x~0 2) (+ main_~n~0 2)) (< main_~x~0 (+ main_~n~0 2)) (forall ((v_it_11 Int)) (or (not (<= 1 v_it_11)) (not (<= (+ main_~x~0 v_it_11) (+ main_~n~0 1))) (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_11)) 4294967296)))))} assume !(~y~0 % 4294967296 > 0); {3243#(and (<= (mod main_~y~0 4294967296) 0) (<= (mod (+ main_~x~0 4294967294) 4294967296) 0) (= (+ main_~y~0 main_~x~0 2) (+ main_~n~0 2)) (< main_~x~0 (+ main_~n~0 2)) (forall ((v_it_11 Int)) (or (not (<= 1 v_it_11)) (not (<= (+ main_~x~0 v_it_11) (+ main_~n~0 1))) (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_11)) 4294967296)))))} is VALID [2022-04-28 03:39:00,291 INFO L290 TraceCheckUtils]: 15: Hoare triple {3243#(and (<= (mod main_~y~0 4294967296) 0) (<= (mod (+ main_~x~0 4294967294) 4294967296) 0) (= (+ main_~y~0 main_~x~0 2) (+ main_~n~0 2)) (< main_~x~0 (+ main_~n~0 2)) (forall ((v_it_11 Int)) (or (not (<= 1 v_it_11)) (not (<= (+ main_~x~0 v_it_11) (+ main_~n~0 1))) (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_11)) 4294967296)))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {3250#(and (<= (mod (+ main_~y~0 4294967295) 4294967296) 0) (<= (mod (+ main_~n~0 4294967295 (* main_~y~0 4294967295)) 4294967296) 0) (< 0 (+ main_~y~0 1)) (forall ((v_it_11 Int)) (or (not (<= v_it_11 main_~y~0)) (not (<= 1 v_it_11)) (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_11)) 4294967296)))))} is VALID [2022-04-28 03:39:00,307 INFO L290 TraceCheckUtils]: 16: Hoare triple {3250#(and (<= (mod (+ main_~y~0 4294967295) 4294967296) 0) (<= (mod (+ main_~n~0 4294967295 (* main_~y~0 4294967295)) 4294967296) 0) (< 0 (+ main_~y~0 1)) (forall ((v_it_11 Int)) (or (not (<= v_it_11 main_~y~0)) (not (<= 1 v_it_11)) (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_11)) 4294967296)))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {3254#(and (<= (mod (+ main_~n~0 (* main_~y~0 4294967295)) 4294967296) 0) (<= (mod (+ main_~y~0 4294967294) 4294967296) 0) (< 0 main_~y~0) (forall ((v_it_11 Int)) (or (not (<= 1 v_it_11)) (not (<= (+ v_it_11 1) main_~y~0)) (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_11)) 4294967296)))))} is VALID [2022-04-28 03:39:00,315 INFO L290 TraceCheckUtils]: 17: Hoare triple {3254#(and (<= (mod (+ main_~n~0 (* main_~y~0 4294967295)) 4294967296) 0) (<= (mod (+ main_~y~0 4294967294) 4294967296) 0) (< 0 main_~y~0) (forall ((v_it_11 Int)) (or (not (<= 1 v_it_11)) (not (<= (+ v_it_11 1) main_~y~0)) (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_11)) 4294967296)))))} assume !(~x~0 % 4294967296 > 0); {3254#(and (<= (mod (+ main_~n~0 (* main_~y~0 4294967295)) 4294967296) 0) (<= (mod (+ main_~y~0 4294967294) 4294967296) 0) (< 0 main_~y~0) (forall ((v_it_11 Int)) (or (not (<= 1 v_it_11)) (not (<= (+ v_it_11 1) main_~y~0)) (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_11)) 4294967296)))))} is VALID [2022-04-28 03:39:00,322 INFO L272 TraceCheckUtils]: 18: Hoare triple {3254#(and (<= (mod (+ main_~n~0 (* main_~y~0 4294967295)) 4294967296) 0) (<= (mod (+ main_~y~0 4294967294) 4294967296) 0) (< 0 main_~y~0) (forall ((v_it_11 Int)) (or (not (<= 1 v_it_11)) (not (<= (+ v_it_11 1) main_~y~0)) (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_11)) 4294967296)))))} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {3261#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:39:00,322 INFO L290 TraceCheckUtils]: 19: Hoare triple {3261#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3265#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:39:00,322 INFO L290 TraceCheckUtils]: 20: Hoare triple {3265#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3176#false} is VALID [2022-04-28 03:39:00,323 INFO L290 TraceCheckUtils]: 21: Hoare triple {3176#false} assume !false; {3176#false} is VALID [2022-04-28 03:39:00,323 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 03:39:00,323 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:40:04,042 INFO L290 TraceCheckUtils]: 21: Hoare triple {3176#false} assume !false; {3176#false} is VALID [2022-04-28 03:40:04,042 INFO L290 TraceCheckUtils]: 20: Hoare triple {3265#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3176#false} is VALID [2022-04-28 03:40:04,043 INFO L290 TraceCheckUtils]: 19: Hoare triple {3261#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3265#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:40:04,044 INFO L272 TraceCheckUtils]: 18: Hoare triple {3190#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {3261#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:40:04,044 INFO L290 TraceCheckUtils]: 17: Hoare triple {3190#(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); {3190#(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 03:40:04,046 INFO L290 TraceCheckUtils]: 16: Hoare triple {3287#(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~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {3190#(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 03:40:04,047 INFO L290 TraceCheckUtils]: 15: Hoare triple {3291#(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))) (not (< 0 (mod main_~x~0 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {3287#(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 03:40:04,048 INFO L290 TraceCheckUtils]: 14: Hoare triple {3295#(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))) (not (< 0 (mod main_~x~0 4294967296))) (< 0 (mod main_~y~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {3291#(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))) (not (< 0 (mod main_~x~0 4294967296))))} is VALID [2022-04-28 03:40:04,050 INFO L290 TraceCheckUtils]: 13: Hoare triple {3299#(or (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)))) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (not (< 0 (mod main_~x~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; {3295#(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))) (not (< 0 (mod main_~x~0 4294967296))) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 03:40:04,052 INFO L290 TraceCheckUtils]: 12: Hoare triple {3303#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (not (< 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 !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {3299#(or (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)))) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (not (< 0 (mod main_~x~0 4294967296))))} is VALID [2022-04-28 03:40:04,053 INFO L290 TraceCheckUtils]: 11: Hoare triple {3307#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (< 0 (mod main_~z~0 4294967296)) (not (< 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 !(~z~0 % 4294967296 > 0); {3303#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (not (< 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 03:40:04,056 INFO L290 TraceCheckUtils]: 10: Hoare triple {3311#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (<= (mod (+ main_~x~0 1) 4294967296) 0) (< 0 (mod (+ main_~z~0 4294967295) 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 !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3307#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (< 0 (mod main_~z~0 4294967296)) (not (< 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 03:40:04,058 INFO L290 TraceCheckUtils]: 9: Hoare triple {3315#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (< 0 (mod (+ main_~z~0 4294967294) 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))) (<= (mod (+ main_~x~0 2) 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; {3311#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (<= (mod (+ main_~x~0 1) 4294967296) 0) (< 0 (mod (+ main_~z~0 4294967295) 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 03:40:04,059 INFO L290 TraceCheckUtils]: 8: Hoare triple {3319#(or (< 0 (mod (+ main_~y~0 4294967294) 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))) (<= (mod (+ main_~x~0 2) 4294967296) 0))} ~z~0 := ~y~0; {3315#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (< 0 (mod (+ main_~z~0 4294967294) 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))) (<= (mod (+ main_~x~0 2) 4294967296) 0))} is VALID [2022-04-28 03:40:04,060 INFO L290 TraceCheckUtils]: 7: Hoare triple {3323#(or (< 0 (mod (+ main_~y~0 4294967294) 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))))} [95] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {3319#(or (< 0 (mod (+ main_~y~0 4294967294) 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))) (<= (mod (+ main_~x~0 2) 4294967296) 0))} is VALID [2022-04-28 03:40:06,085 WARN L290 TraceCheckUtils]: 6: Hoare triple {3327#(and (forall ((aux_mod_aux_mod_v_main_~y~0_114_47_104 Int) (aux_div_v_main_~y~0_114_47 Int) (aux_div_aux_mod_v_main_~y~0_114_47_104 Int)) (or (< main_~n~0 (+ aux_mod_aux_mod_v_main_~y~0_114_47_104 (* (div main_~n~0 4294967296) 4294967296) 1)) (< aux_mod_aux_mod_v_main_~y~0_114_47_104 0) (< (+ aux_mod_aux_mod_v_main_~y~0_114_47_104 4294967294 (* 4294967296 aux_div_aux_mod_v_main_~y~0_114_47_104)) (* 4294967296 aux_div_v_main_~y~0_114_47)) (and (or (exists ((v_it_11 Int)) (and (not (< 0 (mod (+ main_~x~0 (* 4294967295 v_it_11)) 4294967296))) (<= 1 v_it_11) (<= (+ main_~y~0 v_it_11 1) (+ aux_mod_aux_mod_v_main_~y~0_114_47_104 (* 4294967296 aux_div_aux_mod_v_main_~y~0_114_47_104))))) (not (< main_~y~0 (+ aux_mod_aux_mod_v_main_~y~0_114_47_104 (* 4294967296 aux_div_aux_mod_v_main_~y~0_114_47_104)))) (not (< 0 (mod main_~x~0 4294967296))) (forall ((aux_div_v_main_~x~0_117_32 Int)) (or (< (+ aux_mod_aux_mod_v_main_~y~0_114_47_104 (* 4294967296 aux_div_v_main_~x~0_117_32) (* 4294967296 aux_div_aux_mod_v_main_~y~0_114_47_104)) (+ main_~y~0 main_~x~0)) (< (+ main_~y~0 main_~x~0) (+ aux_mod_aux_mod_v_main_~y~0_114_47_104 (* 4294967296 aux_div_v_main_~x~0_117_32) (* 4294967296 aux_div_aux_mod_v_main_~y~0_114_47_104)))))) (or (not (= (+ aux_mod_aux_mod_v_main_~y~0_114_47_104 4294967294 (* 4294967296 aux_div_aux_mod_v_main_~y~0_114_47_104)) (+ main_~y~0 4294967294))) (< (div (+ (- 1) (* (- 1) main_~x~0)) (- 4294967296)) (+ 2 (div (+ (- 1) main_~x~0) 4294967296))))) (< (* 4294967296 aux_div_v_main_~y~0_114_47) (+ aux_mod_aux_mod_v_main_~y~0_114_47_104 4294967294 (* 4294967296 aux_div_aux_mod_v_main_~y~0_114_47_104))))) (forall ((aux_mod_aux_mod_v_main_~y~0_114_47_104 Int) (aux_div_v_main_~y~0_114_47 Int) (aux_div_aux_mod_v_main_~y~0_114_47_104 Int)) (or (<= (+ aux_mod_aux_mod_v_main_~y~0_114_47_104 (* (div main_~n~0 4294967296) 4294967296)) main_~n~0) (< (+ aux_mod_aux_mod_v_main_~y~0_114_47_104 4294967294 (* 4294967296 aux_div_aux_mod_v_main_~y~0_114_47_104)) (* 4294967296 aux_div_v_main_~y~0_114_47)) (and (or (exists ((v_it_11 Int)) (and (not (< 0 (mod (+ main_~x~0 (* 4294967295 v_it_11)) 4294967296))) (<= 1 v_it_11) (<= (+ main_~y~0 v_it_11 1) (+ aux_mod_aux_mod_v_main_~y~0_114_47_104 (* 4294967296 aux_div_aux_mod_v_main_~y~0_114_47_104))))) (not (< main_~y~0 (+ aux_mod_aux_mod_v_main_~y~0_114_47_104 (* 4294967296 aux_div_aux_mod_v_main_~y~0_114_47_104)))) (not (< 0 (mod main_~x~0 4294967296))) (forall ((aux_div_v_main_~x~0_117_32 Int)) (or (< (+ aux_mod_aux_mod_v_main_~y~0_114_47_104 (* 4294967296 aux_div_v_main_~x~0_117_32) (* 4294967296 aux_div_aux_mod_v_main_~y~0_114_47_104)) (+ main_~y~0 main_~x~0)) (< (+ main_~y~0 main_~x~0) (+ aux_mod_aux_mod_v_main_~y~0_114_47_104 (* 4294967296 aux_div_v_main_~x~0_117_32) (* 4294967296 aux_div_aux_mod_v_main_~y~0_114_47_104)))))) (or (not (= (+ aux_mod_aux_mod_v_main_~y~0_114_47_104 4294967294 (* 4294967296 aux_div_aux_mod_v_main_~y~0_114_47_104)) (+ main_~y~0 4294967294))) (< (div (+ (- 1) (* (- 1) main_~x~0)) (- 4294967296)) (+ 2 (div (+ (- 1) main_~x~0) 4294967296))))) (< (* 4294967296 aux_div_v_main_~y~0_114_47) (+ aux_mod_aux_mod_v_main_~y~0_114_47_104 4294967294 (* 4294967296 aux_div_aux_mod_v_main_~y~0_114_47_104))) (<= 4294967296 aux_mod_aux_mod_v_main_~y~0_114_47_104))))} [96] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_106 v_main_~x~0_105)) (.cse1 (= |v_main_#t~post5_51| |v_main_#t~post5_50|)) (.cse2 (= |v_main_#t~post6_51| |v_main_#t~post6_50|)) (.cse4 (= v_main_~y~0_101 v_main_~y~0_100)) (.cse3 (mod v_main_~x~0_106 4294967296))) (or (and .cse0 .cse1 .cse2 (<= .cse3 0) .cse4) (and .cse0 .cse1 .cse2 .cse4) (and (= v_main_~y~0_100 (+ v_main_~x~0_106 (* v_main_~x~0_105 (- 1)) v_main_~y~0_101)) (forall ((v_it_11 Int)) (or (not (<= 1 v_it_11)) (not (<= (+ v_main_~x~0_105 v_it_11 1) v_main_~x~0_106)) (< 0 (mod (+ v_main_~x~0_106 (* 4294967295 v_it_11)) 4294967296)))) (< v_main_~x~0_105 v_main_~x~0_106) (< 0 .cse3)))) InVars {main_~y~0=v_main_~y~0_101, main_#t~post5=|v_main_#t~post5_51|, main_~x~0=v_main_~x~0_106, main_#t~post6=|v_main_#t~post6_51|} OutVars{main_~y~0=v_main_~y~0_100, main_#t~post5=|v_main_#t~post5_50|, main_~x~0=v_main_~x~0_105, main_#t~post6=|v_main_#t~post6_50|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {3323#(or (< 0 (mod (+ main_~y~0 4294967294) 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 UNKNOWN [2022-04-28 03:40:06,112 INFO L290 TraceCheckUtils]: 5: Hoare triple {3175#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3327#(and (forall ((aux_mod_aux_mod_v_main_~y~0_114_47_104 Int) (aux_div_v_main_~y~0_114_47 Int) (aux_div_aux_mod_v_main_~y~0_114_47_104 Int)) (or (< main_~n~0 (+ aux_mod_aux_mod_v_main_~y~0_114_47_104 (* (div main_~n~0 4294967296) 4294967296) 1)) (< aux_mod_aux_mod_v_main_~y~0_114_47_104 0) (< (+ aux_mod_aux_mod_v_main_~y~0_114_47_104 4294967294 (* 4294967296 aux_div_aux_mod_v_main_~y~0_114_47_104)) (* 4294967296 aux_div_v_main_~y~0_114_47)) (and (or (exists ((v_it_11 Int)) (and (not (< 0 (mod (+ main_~x~0 (* 4294967295 v_it_11)) 4294967296))) (<= 1 v_it_11) (<= (+ main_~y~0 v_it_11 1) (+ aux_mod_aux_mod_v_main_~y~0_114_47_104 (* 4294967296 aux_div_aux_mod_v_main_~y~0_114_47_104))))) (not (< main_~y~0 (+ aux_mod_aux_mod_v_main_~y~0_114_47_104 (* 4294967296 aux_div_aux_mod_v_main_~y~0_114_47_104)))) (not (< 0 (mod main_~x~0 4294967296))) (forall ((aux_div_v_main_~x~0_117_32 Int)) (or (< (+ aux_mod_aux_mod_v_main_~y~0_114_47_104 (* 4294967296 aux_div_v_main_~x~0_117_32) (* 4294967296 aux_div_aux_mod_v_main_~y~0_114_47_104)) (+ main_~y~0 main_~x~0)) (< (+ main_~y~0 main_~x~0) (+ aux_mod_aux_mod_v_main_~y~0_114_47_104 (* 4294967296 aux_div_v_main_~x~0_117_32) (* 4294967296 aux_div_aux_mod_v_main_~y~0_114_47_104)))))) (or (not (= (+ aux_mod_aux_mod_v_main_~y~0_114_47_104 4294967294 (* 4294967296 aux_div_aux_mod_v_main_~y~0_114_47_104)) (+ main_~y~0 4294967294))) (< (div (+ (- 1) (* (- 1) main_~x~0)) (- 4294967296)) (+ 2 (div (+ (- 1) main_~x~0) 4294967296))))) (< (* 4294967296 aux_div_v_main_~y~0_114_47) (+ aux_mod_aux_mod_v_main_~y~0_114_47_104 4294967294 (* 4294967296 aux_div_aux_mod_v_main_~y~0_114_47_104))))) (forall ((aux_mod_aux_mod_v_main_~y~0_114_47_104 Int) (aux_div_v_main_~y~0_114_47 Int) (aux_div_aux_mod_v_main_~y~0_114_47_104 Int)) (or (<= (+ aux_mod_aux_mod_v_main_~y~0_114_47_104 (* (div main_~n~0 4294967296) 4294967296)) main_~n~0) (< (+ aux_mod_aux_mod_v_main_~y~0_114_47_104 4294967294 (* 4294967296 aux_div_aux_mod_v_main_~y~0_114_47_104)) (* 4294967296 aux_div_v_main_~y~0_114_47)) (and (or (exists ((v_it_11 Int)) (and (not (< 0 (mod (+ main_~x~0 (* 4294967295 v_it_11)) 4294967296))) (<= 1 v_it_11) (<= (+ main_~y~0 v_it_11 1) (+ aux_mod_aux_mod_v_main_~y~0_114_47_104 (* 4294967296 aux_div_aux_mod_v_main_~y~0_114_47_104))))) (not (< main_~y~0 (+ aux_mod_aux_mod_v_main_~y~0_114_47_104 (* 4294967296 aux_div_aux_mod_v_main_~y~0_114_47_104)))) (not (< 0 (mod main_~x~0 4294967296))) (forall ((aux_div_v_main_~x~0_117_32 Int)) (or (< (+ aux_mod_aux_mod_v_main_~y~0_114_47_104 (* 4294967296 aux_div_v_main_~x~0_117_32) (* 4294967296 aux_div_aux_mod_v_main_~y~0_114_47_104)) (+ main_~y~0 main_~x~0)) (< (+ main_~y~0 main_~x~0) (+ aux_mod_aux_mod_v_main_~y~0_114_47_104 (* 4294967296 aux_div_v_main_~x~0_117_32) (* 4294967296 aux_div_aux_mod_v_main_~y~0_114_47_104)))))) (or (not (= (+ aux_mod_aux_mod_v_main_~y~0_114_47_104 4294967294 (* 4294967296 aux_div_aux_mod_v_main_~y~0_114_47_104)) (+ main_~y~0 4294967294))) (< (div (+ (- 1) (* (- 1) main_~x~0)) (- 4294967296)) (+ 2 (div (+ (- 1) main_~x~0) 4294967296))))) (< (* 4294967296 aux_div_v_main_~y~0_114_47) (+ aux_mod_aux_mod_v_main_~y~0_114_47_104 4294967294 (* 4294967296 aux_div_aux_mod_v_main_~y~0_114_47_104))) (<= 4294967296 aux_mod_aux_mod_v_main_~y~0_114_47_104))))} is VALID [2022-04-28 03:40:06,112 INFO L272 TraceCheckUtils]: 4: Hoare triple {3175#true} call #t~ret13 := main(); {3175#true} is VALID [2022-04-28 03:40:06,112 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3175#true} {3175#true} #72#return; {3175#true} is VALID [2022-04-28 03:40:06,112 INFO L290 TraceCheckUtils]: 2: Hoare triple {3175#true} assume true; {3175#true} is VALID [2022-04-28 03:40:06,113 INFO L290 TraceCheckUtils]: 1: Hoare triple {3175#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3175#true} is VALID [2022-04-28 03:40:06,113 INFO L272 TraceCheckUtils]: 0: Hoare triple {3175#true} call ULTIMATE.init(); {3175#true} is VALID [2022-04-28 03:40:06,113 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 03:40:06,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [984013728] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:40:06,113 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:40:06,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 16] total 39 [2022-04-28 03:40:17,024 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:40:17,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1132952725] [2022-04-28 03:40:17,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1132952725] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:40:17,024 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:40:17,025 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-28 03:40:17,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943718850] [2022-04-28 03:40:17,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:40:17,025 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.125) internal successors, (18), 14 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 03:40:17,025 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:40:17,025 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 1.125) internal successors, (18), 14 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 03:40:17,143 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 03:40:17,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-28 03:40:17,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:40:17,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-28 03:40:17,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=277, Invalid=1248, Unknown=35, NotChecked=0, Total=1560 [2022-04-28 03:40:17,144 INFO L87 Difference]: Start difference. First operand 34 states and 42 transitions. Second operand has 16 states, 16 states have (on average 1.125) internal successors, (18), 14 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 03:40:28,540 WARN L232 SmtUtils]: Spent 9.56s on a formula simplification. DAG size of input: 53 DAG size of output: 49 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-28 03:40:36,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:40:36,447 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2022-04-28 03:40:36,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-28 03:40:36,448 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.125) internal successors, (18), 14 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 03:40:36,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:40:36,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.125) internal successors, (18), 14 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 03:40:36,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 43 transitions. [2022-04-28 03:40:36,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.125) internal successors, (18), 14 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 03:40:36,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 43 transitions. [2022-04-28 03:40:36,449 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 43 transitions. [2022-04-28 03:40:36,910 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 03:40:36,911 INFO L225 Difference]: With dead ends: 46 [2022-04-28 03:40:36,911 INFO L226 Difference]: Without dead ends: 28 [2022-04-28 03:40:36,912 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 20 SyntacticMatches, 6 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 807 ImplicationChecksByTransitivity, 133.0s TimeCoverageRelationStatistics Valid=432, Invalid=2183, Unknown=37, NotChecked=0, Total=2652 [2022-04-28 03:40:36,912 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 24 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 44 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-28 03:40:36,912 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 62 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 138 Invalid, 0 Unknown, 44 Unchecked, 0.7s Time] [2022-04-28 03:40:36,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-28 03:40:36,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-04-28 03:40:36,989 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:40:36,989 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 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 03:40:36,989 INFO L74 IsIncluded]: Start isIncluded. First operand 28 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 03:40:36,989 INFO L87 Difference]: Start difference. First operand 28 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 03:40:36,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:40:36,990 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2022-04-28 03:40:36,990 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2022-04-28 03:40:36,990 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:40:36,990 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:40:36,990 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 28 states. [2022-04-28 03:40:36,990 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 28 states. [2022-04-28 03:40:36,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:40:36,990 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2022-04-28 03:40:36,991 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2022-04-28 03:40:36,991 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:40:36,991 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:40:36,991 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:40:36,991 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:40:36,991 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 03:40:36,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2022-04-28 03:40:36,991 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 22 [2022-04-28 03:40:36,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:40:36,991 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2022-04-28 03:40:36,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.125) internal successors, (18), 14 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 03:40:36,992 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 34 transitions. [2022-04-28 03:40:41,522 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 32 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-28 03:40:41,522 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2022-04-28 03:40:41,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 03:40:41,523 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:40:41,523 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:40:41,527 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 03:40:41,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:40:41,727 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:40:41,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:40:41,728 INFO L85 PathProgramCache]: Analyzing trace with hash 1383526881, now seen corresponding path program 6 times [2022-04-28 03:40:41,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:40:41,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [849356174] [2022-04-28 03:40:42,061 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:40:42,063 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:40:42,065 INFO L85 PathProgramCache]: Analyzing trace with hash -562700542, now seen corresponding path program 1 times [2022-04-28 03:40:42,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:40:42,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810092872] [2022-04-28 03:40:42,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:40:42,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:40:42,073 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_12.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:40:42,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:40:42,083 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_12.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:40:42,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:40:42,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:40:42,264 INFO L290 TraceCheckUtils]: 0: Hoare triple {3587#(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); {3577#true} is VALID [2022-04-28 03:40:42,264 INFO L290 TraceCheckUtils]: 1: Hoare triple {3577#true} assume true; {3577#true} is VALID [2022-04-28 03:40:42,264 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3577#true} {3577#true} #72#return; {3577#true} is VALID [2022-04-28 03:40:42,264 INFO L272 TraceCheckUtils]: 0: Hoare triple {3577#true} call ULTIMATE.init(); {3587#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:40:42,264 INFO L290 TraceCheckUtils]: 1: Hoare triple {3587#(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); {3577#true} is VALID [2022-04-28 03:40:42,265 INFO L290 TraceCheckUtils]: 2: Hoare triple {3577#true} assume true; {3577#true} is VALID [2022-04-28 03:40:42,265 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3577#true} {3577#true} #72#return; {3577#true} is VALID [2022-04-28 03:40:42,265 INFO L272 TraceCheckUtils]: 4: Hoare triple {3577#true} call #t~ret13 := main(); {3577#true} is VALID [2022-04-28 03:40:42,265 INFO L290 TraceCheckUtils]: 5: Hoare triple {3577#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3577#true} is VALID [2022-04-28 03:40:42,265 INFO L290 TraceCheckUtils]: 6: Hoare triple {3577#true} [98] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_122 4294967296)) (.cse1 (= v_main_~y~0_119 v_main_~y~0_118)) (.cse2 (= v_main_~x~0_122 v_main_~x~0_121)) (.cse3 (= |v_main_#t~post6_58| |v_main_#t~post6_57|)) (.cse4 (= |v_main_#t~post5_58| |v_main_#t~post5_57|))) (or (and (forall ((v_it_12 Int)) (or (< 0 (mod (+ v_main_~x~0_122 (* 4294967295 v_it_12)) 4294967296)) (not (<= (+ v_main_~y~0_119 v_it_12 1) v_main_~y~0_118)) (not (<= 1 v_it_12)))) (< v_main_~y~0_119 v_main_~y~0_118) (= v_main_~x~0_121 (+ v_main_~x~0_122 v_main_~y~0_119 (* (- 1) v_main_~y~0_118))) (< 0 .cse0)) (and .cse1 .cse2 (<= .cse0 0) .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_119, main_#t~post5=|v_main_#t~post5_58|, main_~x~0=v_main_~x~0_122, main_#t~post6=|v_main_#t~post6_58|} OutVars{main_~y~0=v_main_~y~0_118, main_#t~post5=|v_main_#t~post5_57|, main_~x~0=v_main_~x~0_121, main_#t~post6=|v_main_#t~post6_57|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {3577#true} is VALID [2022-04-28 03:40:42,266 INFO L290 TraceCheckUtils]: 7: Hoare triple {3577#true} [97] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {3582#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:40:42,266 INFO L290 TraceCheckUtils]: 8: Hoare triple {3582#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {3582#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:40:42,267 INFO L290 TraceCheckUtils]: 9: Hoare triple {3582#(<= main_~x~0 (* 4294967296 (div main_~x~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; {3583#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:40:42,268 INFO L290 TraceCheckUtils]: 10: Hoare triple {3583#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 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; {3584#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:40:42,269 INFO L290 TraceCheckUtils]: 11: Hoare triple {3584#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~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; {3585#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:40:42,269 INFO L290 TraceCheckUtils]: 12: Hoare triple {3585#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {3585#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:40:42,270 INFO L290 TraceCheckUtils]: 13: Hoare triple {3585#(<= main_~x~0 (+ 3 (* (div (+ main_~x~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; {3585#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:40:42,270 INFO L290 TraceCheckUtils]: 14: Hoare triple {3585#(<= main_~x~0 (+ 3 (* (div (+ main_~x~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; {3585#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:40:42,270 INFO L290 TraceCheckUtils]: 15: Hoare triple {3585#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {3585#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:40:42,272 INFO L290 TraceCheckUtils]: 16: Hoare triple {3585#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {3586#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 03:40:42,273 INFO L290 TraceCheckUtils]: 17: Hoare triple {3586#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {3578#false} is VALID [2022-04-28 03:40:42,273 INFO L272 TraceCheckUtils]: 18: Hoare triple {3578#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {3578#false} is VALID [2022-04-28 03:40:42,273 INFO L290 TraceCheckUtils]: 19: Hoare triple {3578#false} ~cond := #in~cond; {3578#false} is VALID [2022-04-28 03:40:42,273 INFO L290 TraceCheckUtils]: 20: Hoare triple {3578#false} assume 0 == ~cond; {3578#false} is VALID [2022-04-28 03:40:42,273 INFO L290 TraceCheckUtils]: 21: Hoare triple {3578#false} assume !false; {3578#false} is VALID [2022-04-28 03:40:42,273 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 03:40:42,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:40:42,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810092872] [2022-04-28 03:40:42,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810092872] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:40:42,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [696423014] [2022-04-28 03:40:42,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:40:42,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:40:42,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:40:42,274 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 03:40:42,275 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 03:40:42,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:40:42,306 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-28 03:40:42,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:40:42,312 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:40:42,651 INFO L272 TraceCheckUtils]: 0: Hoare triple {3577#true} call ULTIMATE.init(); {3577#true} is VALID [2022-04-28 03:40:42,651 INFO L290 TraceCheckUtils]: 1: Hoare triple {3577#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3577#true} is VALID [2022-04-28 03:40:42,651 INFO L290 TraceCheckUtils]: 2: Hoare triple {3577#true} assume true; {3577#true} is VALID [2022-04-28 03:40:42,651 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3577#true} {3577#true} #72#return; {3577#true} is VALID [2022-04-28 03:40:42,651 INFO L272 TraceCheckUtils]: 4: Hoare triple {3577#true} call #t~ret13 := main(); {3577#true} is VALID [2022-04-28 03:40:42,652 INFO L290 TraceCheckUtils]: 5: Hoare triple {3577#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3577#true} is VALID [2022-04-28 03:40:42,652 INFO L290 TraceCheckUtils]: 6: Hoare triple {3577#true} [98] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_122 4294967296)) (.cse1 (= v_main_~y~0_119 v_main_~y~0_118)) (.cse2 (= v_main_~x~0_122 v_main_~x~0_121)) (.cse3 (= |v_main_#t~post6_58| |v_main_#t~post6_57|)) (.cse4 (= |v_main_#t~post5_58| |v_main_#t~post5_57|))) (or (and (forall ((v_it_12 Int)) (or (< 0 (mod (+ v_main_~x~0_122 (* 4294967295 v_it_12)) 4294967296)) (not (<= (+ v_main_~y~0_119 v_it_12 1) v_main_~y~0_118)) (not (<= 1 v_it_12)))) (< v_main_~y~0_119 v_main_~y~0_118) (= v_main_~x~0_121 (+ v_main_~x~0_122 v_main_~y~0_119 (* (- 1) v_main_~y~0_118))) (< 0 .cse0)) (and .cse1 .cse2 (<= .cse0 0) .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_119, main_#t~post5=|v_main_#t~post5_58|, main_~x~0=v_main_~x~0_122, main_#t~post6=|v_main_#t~post6_58|} OutVars{main_~y~0=v_main_~y~0_118, main_#t~post5=|v_main_#t~post5_57|, main_~x~0=v_main_~x~0_121, main_#t~post6=|v_main_#t~post6_57|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {3577#true} is VALID [2022-04-28 03:40:42,652 INFO L290 TraceCheckUtils]: 7: Hoare triple {3577#true} [97] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {3577#true} is VALID [2022-04-28 03:40:42,652 INFO L290 TraceCheckUtils]: 8: Hoare triple {3577#true} ~z~0 := ~y~0; {3615#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 03:40:42,653 INFO L290 TraceCheckUtils]: 9: Hoare triple {3615#(= 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; {3619#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-28 03:40:42,653 INFO L290 TraceCheckUtils]: 10: Hoare triple {3619#(= 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; {3623#(= main_~y~0 (+ main_~z~0 2))} is VALID [2022-04-28 03:40:42,654 INFO L290 TraceCheckUtils]: 11: Hoare triple {3623#(= 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; {3627#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 03:40:42,655 INFO L290 TraceCheckUtils]: 12: Hoare triple {3627#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !(~z~0 % 4294967296 > 0); {3627#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 03:40:42,656 INFO L290 TraceCheckUtils]: 13: Hoare triple {3627#(< 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; {3634#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 03:40:42,657 INFO L290 TraceCheckUtils]: 14: Hoare triple {3634#(< 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; {3638#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:40:42,657 INFO L290 TraceCheckUtils]: 15: Hoare triple {3638#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {3578#false} is VALID [2022-04-28 03:40:42,657 INFO L290 TraceCheckUtils]: 16: Hoare triple {3578#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {3578#false} is VALID [2022-04-28 03:40:42,657 INFO L290 TraceCheckUtils]: 17: Hoare triple {3578#false} assume !(~x~0 % 4294967296 > 0); {3578#false} is VALID [2022-04-28 03:40:42,657 INFO L272 TraceCheckUtils]: 18: Hoare triple {3578#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {3578#false} is VALID [2022-04-28 03:40:42,657 INFO L290 TraceCheckUtils]: 19: Hoare triple {3578#false} ~cond := #in~cond; {3578#false} is VALID [2022-04-28 03:40:42,657 INFO L290 TraceCheckUtils]: 20: Hoare triple {3578#false} assume 0 == ~cond; {3578#false} is VALID [2022-04-28 03:40:42,657 INFO L290 TraceCheckUtils]: 21: Hoare triple {3578#false} assume !false; {3578#false} is VALID [2022-04-28 03:40:42,657 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:40:42,657 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:40:42,988 INFO L290 TraceCheckUtils]: 21: Hoare triple {3578#false} assume !false; {3578#false} is VALID [2022-04-28 03:40:42,988 INFO L290 TraceCheckUtils]: 20: Hoare triple {3578#false} assume 0 == ~cond; {3578#false} is VALID [2022-04-28 03:40:42,989 INFO L290 TraceCheckUtils]: 19: Hoare triple {3578#false} ~cond := #in~cond; {3578#false} is VALID [2022-04-28 03:40:42,989 INFO L272 TraceCheckUtils]: 18: Hoare triple {3578#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {3578#false} is VALID [2022-04-28 03:40:42,989 INFO L290 TraceCheckUtils]: 17: Hoare triple {3578#false} assume !(~x~0 % 4294967296 > 0); {3578#false} is VALID [2022-04-28 03:40:42,989 INFO L290 TraceCheckUtils]: 16: Hoare triple {3578#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {3578#false} is VALID [2022-04-28 03:40:42,995 INFO L290 TraceCheckUtils]: 15: Hoare triple {3638#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {3578#false} is VALID [2022-04-28 03:40:42,996 INFO L290 TraceCheckUtils]: 14: Hoare triple {3634#(< 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; {3638#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:40:42,997 INFO L290 TraceCheckUtils]: 13: Hoare triple {3627#(< 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; {3634#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 03:40:42,997 INFO L290 TraceCheckUtils]: 12: Hoare triple {3627#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !(~z~0 % 4294967296 > 0); {3627#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 03:40:42,998 INFO L290 TraceCheckUtils]: 11: Hoare triple {3690#(or (< 0 (mod (+ main_~y~0 4294967294) 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; {3627#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 03:40:43,000 INFO L290 TraceCheckUtils]: 10: Hoare triple {3694#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 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; {3690#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (not (< 0 (mod main_~z~0 4294967296))))} is VALID [2022-04-28 03:40:43,001 INFO L290 TraceCheckUtils]: 9: Hoare triple {3698#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (not (< 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; {3694#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-28 03:40:43,001 INFO L290 TraceCheckUtils]: 8: Hoare triple {3577#true} ~z~0 := ~y~0; {3698#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))))} is VALID [2022-04-28 03:40:43,001 INFO L290 TraceCheckUtils]: 7: Hoare triple {3577#true} [97] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {3577#true} is VALID [2022-04-28 03:40:43,002 INFO L290 TraceCheckUtils]: 6: Hoare triple {3577#true} [98] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_122 4294967296)) (.cse1 (= v_main_~y~0_119 v_main_~y~0_118)) (.cse2 (= v_main_~x~0_122 v_main_~x~0_121)) (.cse3 (= |v_main_#t~post6_58| |v_main_#t~post6_57|)) (.cse4 (= |v_main_#t~post5_58| |v_main_#t~post5_57|))) (or (and (forall ((v_it_12 Int)) (or (< 0 (mod (+ v_main_~x~0_122 (* 4294967295 v_it_12)) 4294967296)) (not (<= (+ v_main_~y~0_119 v_it_12 1) v_main_~y~0_118)) (not (<= 1 v_it_12)))) (< v_main_~y~0_119 v_main_~y~0_118) (= v_main_~x~0_121 (+ v_main_~x~0_122 v_main_~y~0_119 (* (- 1) v_main_~y~0_118))) (< 0 .cse0)) (and .cse1 .cse2 (<= .cse0 0) .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_119, main_#t~post5=|v_main_#t~post5_58|, main_~x~0=v_main_~x~0_122, main_#t~post6=|v_main_#t~post6_58|} OutVars{main_~y~0=v_main_~y~0_118, main_#t~post5=|v_main_#t~post5_57|, main_~x~0=v_main_~x~0_121, main_#t~post6=|v_main_#t~post6_57|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {3577#true} is VALID [2022-04-28 03:40:43,002 INFO L290 TraceCheckUtils]: 5: Hoare triple {3577#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3577#true} is VALID [2022-04-28 03:40:43,002 INFO L272 TraceCheckUtils]: 4: Hoare triple {3577#true} call #t~ret13 := main(); {3577#true} is VALID [2022-04-28 03:40:43,002 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3577#true} {3577#true} #72#return; {3577#true} is VALID [2022-04-28 03:40:43,002 INFO L290 TraceCheckUtils]: 2: Hoare triple {3577#true} assume true; {3577#true} is VALID [2022-04-28 03:40:43,002 INFO L290 TraceCheckUtils]: 1: Hoare triple {3577#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3577#true} is VALID [2022-04-28 03:40:43,002 INFO L272 TraceCheckUtils]: 0: Hoare triple {3577#true} call ULTIMATE.init(); {3577#true} is VALID [2022-04-28 03:40:43,002 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:40:43,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [696423014] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:40:43,002 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:40:43,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2022-04-28 03:40:43,079 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:40:43,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [849356174] [2022-04-28 03:40:43,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [849356174] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:40:43,079 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:40:43,079 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 03:40:43,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363001210] [2022-04-28 03:40:43,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:40:43,079 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 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 22 [2022-04-28 03:40:43,080 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:40:43,080 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 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 03:40:43,097 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 03:40:43,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 03:40:43,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:40:43,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 03:40:43,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2022-04-28 03:40:43,098 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 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 03:40:44,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:40:44,269 INFO L93 Difference]: Finished difference Result 47 states and 61 transitions. [2022-04-28 03:40:44,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 03:40:44,270 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 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 22 [2022-04-28 03:40:44,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:40:44,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 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 03:40:44,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 53 transitions. [2022-04-28 03:40:44,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 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 03:40:44,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 53 transitions. [2022-04-28 03:40:44,271 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 53 transitions. [2022-04-28 03:40:44,324 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 03:40:44,325 INFO L225 Difference]: With dead ends: 47 [2022-04-28 03:40:44,325 INFO L226 Difference]: Without dead ends: 41 [2022-04-28 03:40:44,325 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=90, Invalid=510, Unknown=0, NotChecked=0, Total=600 [2022-04-28 03:40:44,326 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 41 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 03:40:44,326 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 32 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 03:40:44,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-04-28 03:40:44,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 36. [2022-04-28 03:40:44,429 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:40:44,430 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 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 03:40:44,430 INFO L74 IsIncluded]: Start isIncluded. First operand 41 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 03:40:44,430 INFO L87 Difference]: Start difference. First operand 41 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 03:40:44,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:40:44,430 INFO L93 Difference]: Finished difference Result 41 states and 51 transitions. [2022-04-28 03:40:44,430 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 51 transitions. [2022-04-28 03:40:44,431 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:40:44,431 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:40:44,431 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 41 states. [2022-04-28 03:40:44,431 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 41 states. [2022-04-28 03:40:44,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:40:44,431 INFO L93 Difference]: Finished difference Result 41 states and 51 transitions. [2022-04-28 03:40:44,431 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 51 transitions. [2022-04-28 03:40:44,432 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:40:44,432 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:40:44,432 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:40:44,432 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:40:44,432 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 03:40:44,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2022-04-28 03:40:44,432 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 44 transitions. Word has length 22 [2022-04-28 03:40:44,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:40:44,432 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 44 transitions. [2022-04-28 03:40:44,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 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 03:40:44,433 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 44 transitions. [2022-04-28 03:40:48,713 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 42 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-28 03:40:48,714 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions. [2022-04-28 03:40:48,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 03:40:48,714 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:40:48,714 INFO L195 NwaCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:40:48,729 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 03:40:48,914 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,SelfDestructingSolverStorable13 [2022-04-28 03:40:48,915 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:40:48,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:40:48,915 INFO L85 PathProgramCache]: Analyzing trace with hash -527064297, now seen corresponding path program 7 times [2022-04-28 03:40:48,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:40:48,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2138397025] [2022-04-28 03:40:49,204 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:40:49,206 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:40:49,208 INFO L85 PathProgramCache]: Analyzing trace with hash 954978774, now seen corresponding path program 1 times [2022-04-28 03:40:49,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:40:49,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236411422] [2022-04-28 03:40:49,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:40:49,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:40:49,218 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_13.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:40:49,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:40:49,226 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_13.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:40:49,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:40:49,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:40:49,452 INFO L290 TraceCheckUtils]: 0: Hoare triple {4002#(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); {3991#true} is VALID [2022-04-28 03:40:49,452 INFO L290 TraceCheckUtils]: 1: Hoare triple {3991#true} assume true; {3991#true} is VALID [2022-04-28 03:40:49,452 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3991#true} {3991#true} #72#return; {3991#true} is VALID [2022-04-28 03:40:49,453 INFO L272 TraceCheckUtils]: 0: Hoare triple {3991#true} call ULTIMATE.init(); {4002#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:40:49,453 INFO L290 TraceCheckUtils]: 1: Hoare triple {4002#(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); {3991#true} is VALID [2022-04-28 03:40:49,453 INFO L290 TraceCheckUtils]: 2: Hoare triple {3991#true} assume true; {3991#true} is VALID [2022-04-28 03:40:49,453 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3991#true} {3991#true} #72#return; {3991#true} is VALID [2022-04-28 03:40:49,453 INFO L272 TraceCheckUtils]: 4: Hoare triple {3991#true} call #t~ret13 := main(); {3991#true} is VALID [2022-04-28 03:40:49,453 INFO L290 TraceCheckUtils]: 5: Hoare triple {3991#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3991#true} is VALID [2022-04-28 03:40:49,453 INFO L290 TraceCheckUtils]: 6: Hoare triple {3991#true} [100] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post6_63| |v_main_#t~post6_62|)) (.cse1 (= v_main_~x~0_133 v_main_~x~0_132)) (.cse2 (= v_main_~y~0_131 v_main_~y~0_130)) (.cse3 (= |v_main_#t~post5_63| |v_main_#t~post5_62|)) (.cse4 (mod v_main_~x~0_133 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3) (and (<= .cse4 0) .cse0 .cse1 .cse2 .cse3) (and (< 0 .cse4) (forall ((v_it_13 Int)) (or (not (<= 1 v_it_13)) (not (<= (+ v_main_~y~0_131 v_it_13 1) v_main_~y~0_130)) (< 0 (mod (+ v_main_~x~0_133 (* 4294967295 v_it_13)) 4294967296)))) (< v_main_~y~0_131 v_main_~y~0_130) (= v_main_~x~0_132 (+ v_main_~x~0_133 v_main_~y~0_131 (* (- 1) v_main_~y~0_130)))))) InVars {main_~y~0=v_main_~y~0_131, main_#t~post5=|v_main_#t~post5_63|, main_~x~0=v_main_~x~0_133, main_#t~post6=|v_main_#t~post6_63|} OutVars{main_~y~0=v_main_~y~0_130, main_#t~post5=|v_main_#t~post5_62|, main_~x~0=v_main_~x~0_132, main_#t~post6=|v_main_#t~post6_62|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {3991#true} is VALID [2022-04-28 03:40:49,454 INFO L290 TraceCheckUtils]: 7: Hoare triple {3991#true} [99] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {3996#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:40:49,454 INFO L290 TraceCheckUtils]: 8: Hoare triple {3996#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {3996#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:40:49,455 INFO L290 TraceCheckUtils]: 9: Hoare triple {3996#(<= main_~x~0 (* 4294967296 (div main_~x~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; {3997#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:40:49,456 INFO L290 TraceCheckUtils]: 10: Hoare triple {3997#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 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; {3998#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:40:49,457 INFO L290 TraceCheckUtils]: 11: Hoare triple {3998#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~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; {3999#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:40:49,459 INFO L290 TraceCheckUtils]: 12: Hoare triple {3999#(<= main_~x~0 (+ 3 (* (div (+ main_~x~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; {4000#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:40:49,459 INFO L290 TraceCheckUtils]: 13: Hoare triple {4000#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {4000#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:40:49,459 INFO L290 TraceCheckUtils]: 14: Hoare triple {4000#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 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; {4000#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:40:49,460 INFO L290 TraceCheckUtils]: 15: Hoare triple {4000#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 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; {4000#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:40:49,460 INFO L290 TraceCheckUtils]: 16: Hoare triple {4000#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {4000#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:40:49,461 INFO L290 TraceCheckUtils]: 17: Hoare triple {4000#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {4001#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 03:40:49,462 INFO L290 TraceCheckUtils]: 18: Hoare triple {4001#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {3992#false} is VALID [2022-04-28 03:40:49,462 INFO L272 TraceCheckUtils]: 19: Hoare triple {3992#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {3992#false} is VALID [2022-04-28 03:40:49,462 INFO L290 TraceCheckUtils]: 20: Hoare triple {3992#false} ~cond := #in~cond; {3992#false} is VALID [2022-04-28 03:40:49,462 INFO L290 TraceCheckUtils]: 21: Hoare triple {3992#false} assume 0 == ~cond; {3992#false} is VALID [2022-04-28 03:40:49,462 INFO L290 TraceCheckUtils]: 22: Hoare triple {3992#false} assume !false; {3992#false} is VALID [2022-04-28 03:40:49,462 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 03:40:49,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:40:49,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236411422] [2022-04-28 03:40:49,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236411422] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:40:49,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [171369544] [2022-04-28 03:40:49,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:40:49,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:40:49,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:40:49,472 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 03:40:49,473 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 03:40:49,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:40:49,508 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-28 03:40:49,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:40:49,515 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:40:49,864 INFO L272 TraceCheckUtils]: 0: Hoare triple {3991#true} call ULTIMATE.init(); {3991#true} is VALID [2022-04-28 03:40:49,864 INFO L290 TraceCheckUtils]: 1: Hoare triple {3991#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3991#true} is VALID [2022-04-28 03:40:49,864 INFO L290 TraceCheckUtils]: 2: Hoare triple {3991#true} assume true; {3991#true} is VALID [2022-04-28 03:40:49,864 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3991#true} {3991#true} #72#return; {3991#true} is VALID [2022-04-28 03:40:49,864 INFO L272 TraceCheckUtils]: 4: Hoare triple {3991#true} call #t~ret13 := main(); {3991#true} is VALID [2022-04-28 03:40:49,864 INFO L290 TraceCheckUtils]: 5: Hoare triple {3991#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3991#true} is VALID [2022-04-28 03:40:49,864 INFO L290 TraceCheckUtils]: 6: Hoare triple {3991#true} [100] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post6_63| |v_main_#t~post6_62|)) (.cse1 (= v_main_~x~0_133 v_main_~x~0_132)) (.cse2 (= v_main_~y~0_131 v_main_~y~0_130)) (.cse3 (= |v_main_#t~post5_63| |v_main_#t~post5_62|)) (.cse4 (mod v_main_~x~0_133 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3) (and (<= .cse4 0) .cse0 .cse1 .cse2 .cse3) (and (< 0 .cse4) (forall ((v_it_13 Int)) (or (not (<= 1 v_it_13)) (not (<= (+ v_main_~y~0_131 v_it_13 1) v_main_~y~0_130)) (< 0 (mod (+ v_main_~x~0_133 (* 4294967295 v_it_13)) 4294967296)))) (< v_main_~y~0_131 v_main_~y~0_130) (= v_main_~x~0_132 (+ v_main_~x~0_133 v_main_~y~0_131 (* (- 1) v_main_~y~0_130)))))) InVars {main_~y~0=v_main_~y~0_131, main_#t~post5=|v_main_#t~post5_63|, main_~x~0=v_main_~x~0_133, main_#t~post6=|v_main_#t~post6_63|} OutVars{main_~y~0=v_main_~y~0_130, main_#t~post5=|v_main_#t~post5_62|, main_~x~0=v_main_~x~0_132, main_#t~post6=|v_main_#t~post6_62|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {3991#true} is VALID [2022-04-28 03:40:49,864 INFO L290 TraceCheckUtils]: 7: Hoare triple {3991#true} [99] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {3991#true} is VALID [2022-04-28 03:40:49,871 INFO L290 TraceCheckUtils]: 8: Hoare triple {3991#true} ~z~0 := ~y~0; {4030#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 03:40:49,871 INFO L290 TraceCheckUtils]: 9: Hoare triple {4030#(= 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; {4034#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-28 03:40:49,872 INFO L290 TraceCheckUtils]: 10: Hoare triple {4034#(= 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; {4038#(= main_~y~0 (+ main_~z~0 2))} is VALID [2022-04-28 03:40:49,873 INFO L290 TraceCheckUtils]: 11: Hoare triple {4038#(= 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; {4042#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 03:40:49,874 INFO L290 TraceCheckUtils]: 12: Hoare triple {4042#(< 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; {4042#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 03:40:49,874 INFO L290 TraceCheckUtils]: 13: Hoare triple {4042#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !(~z~0 % 4294967296 > 0); {4042#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 03:40:49,875 INFO L290 TraceCheckUtils]: 14: Hoare triple {4042#(< 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; {4052#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 03:40:49,876 INFO L290 TraceCheckUtils]: 15: Hoare triple {4052#(< 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; {4056#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:40:49,876 INFO L290 TraceCheckUtils]: 16: Hoare triple {4056#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {3992#false} is VALID [2022-04-28 03:40:49,876 INFO L290 TraceCheckUtils]: 17: Hoare triple {3992#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {3992#false} is VALID [2022-04-28 03:40:49,876 INFO L290 TraceCheckUtils]: 18: Hoare triple {3992#false} assume !(~x~0 % 4294967296 > 0); {3992#false} is VALID [2022-04-28 03:40:49,876 INFO L272 TraceCheckUtils]: 19: Hoare triple {3992#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {3992#false} is VALID [2022-04-28 03:40:49,877 INFO L290 TraceCheckUtils]: 20: Hoare triple {3992#false} ~cond := #in~cond; {3992#false} is VALID [2022-04-28 03:40:49,877 INFO L290 TraceCheckUtils]: 21: Hoare triple {3992#false} assume 0 == ~cond; {3992#false} is VALID [2022-04-28 03:40:49,877 INFO L290 TraceCheckUtils]: 22: Hoare triple {3992#false} assume !false; {3992#false} is VALID [2022-04-28 03:40:49,877 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:40:49,877 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:40:50,219 INFO L290 TraceCheckUtils]: 22: Hoare triple {3992#false} assume !false; {3992#false} is VALID [2022-04-28 03:40:50,219 INFO L290 TraceCheckUtils]: 21: Hoare triple {3992#false} assume 0 == ~cond; {3992#false} is VALID [2022-04-28 03:40:50,219 INFO L290 TraceCheckUtils]: 20: Hoare triple {3992#false} ~cond := #in~cond; {3992#false} is VALID [2022-04-28 03:40:50,219 INFO L272 TraceCheckUtils]: 19: Hoare triple {3992#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {3992#false} is VALID [2022-04-28 03:40:50,219 INFO L290 TraceCheckUtils]: 18: Hoare triple {3992#false} assume !(~x~0 % 4294967296 > 0); {3992#false} is VALID [2022-04-28 03:40:50,219 INFO L290 TraceCheckUtils]: 17: Hoare triple {3992#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {3992#false} is VALID [2022-04-28 03:40:50,219 INFO L290 TraceCheckUtils]: 16: Hoare triple {4056#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {3992#false} is VALID [2022-04-28 03:40:50,221 INFO L290 TraceCheckUtils]: 15: Hoare triple {4052#(< 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; {4056#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:40:50,223 INFO L290 TraceCheckUtils]: 14: Hoare triple {4042#(< 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; {4052#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 03:40:50,223 INFO L290 TraceCheckUtils]: 13: Hoare triple {4042#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} assume !(~z~0 % 4294967296 > 0); {4042#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 03:40:50,223 INFO L290 TraceCheckUtils]: 12: Hoare triple {4042#(< 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; {4042#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 03:40:50,224 INFO L290 TraceCheckUtils]: 11: Hoare triple {4111#(or (< 0 (mod (+ main_~y~0 4294967294) 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; {4042#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 03:40:50,225 INFO L290 TraceCheckUtils]: 10: Hoare triple {4115#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 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; {4111#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (not (< 0 (mod main_~z~0 4294967296))))} is VALID [2022-04-28 03:40:50,226 INFO L290 TraceCheckUtils]: 9: Hoare triple {4119#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (not (< 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; {4115#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-28 03:40:50,227 INFO L290 TraceCheckUtils]: 8: Hoare triple {3991#true} ~z~0 := ~y~0; {4119#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))))} is VALID [2022-04-28 03:40:50,227 INFO L290 TraceCheckUtils]: 7: Hoare triple {3991#true} [99] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {3991#true} is VALID [2022-04-28 03:40:50,227 INFO L290 TraceCheckUtils]: 6: Hoare triple {3991#true} [100] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post6_63| |v_main_#t~post6_62|)) (.cse1 (= v_main_~x~0_133 v_main_~x~0_132)) (.cse2 (= v_main_~y~0_131 v_main_~y~0_130)) (.cse3 (= |v_main_#t~post5_63| |v_main_#t~post5_62|)) (.cse4 (mod v_main_~x~0_133 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3) (and (<= .cse4 0) .cse0 .cse1 .cse2 .cse3) (and (< 0 .cse4) (forall ((v_it_13 Int)) (or (not (<= 1 v_it_13)) (not (<= (+ v_main_~y~0_131 v_it_13 1) v_main_~y~0_130)) (< 0 (mod (+ v_main_~x~0_133 (* 4294967295 v_it_13)) 4294967296)))) (< v_main_~y~0_131 v_main_~y~0_130) (= v_main_~x~0_132 (+ v_main_~x~0_133 v_main_~y~0_131 (* (- 1) v_main_~y~0_130)))))) InVars {main_~y~0=v_main_~y~0_131, main_#t~post5=|v_main_#t~post5_63|, main_~x~0=v_main_~x~0_133, main_#t~post6=|v_main_#t~post6_63|} OutVars{main_~y~0=v_main_~y~0_130, main_#t~post5=|v_main_#t~post5_62|, main_~x~0=v_main_~x~0_132, main_#t~post6=|v_main_#t~post6_62|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {3991#true} is VALID [2022-04-28 03:40:50,227 INFO L290 TraceCheckUtils]: 5: Hoare triple {3991#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3991#true} is VALID [2022-04-28 03:40:50,227 INFO L272 TraceCheckUtils]: 4: Hoare triple {3991#true} call #t~ret13 := main(); {3991#true} is VALID [2022-04-28 03:40:50,227 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3991#true} {3991#true} #72#return; {3991#true} is VALID [2022-04-28 03:40:50,227 INFO L290 TraceCheckUtils]: 2: Hoare triple {3991#true} assume true; {3991#true} is VALID [2022-04-28 03:40:50,227 INFO L290 TraceCheckUtils]: 1: Hoare triple {3991#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3991#true} is VALID [2022-04-28 03:40:50,227 INFO L272 TraceCheckUtils]: 0: Hoare triple {3991#true} call ULTIMATE.init(); {3991#true} is VALID [2022-04-28 03:40:50,228 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:40:50,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [171369544] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:40:50,228 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:40:50,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2022-04-28 03:40:50,305 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:40:50,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2138397025] [2022-04-28 03:40:50,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2138397025] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:40:50,306 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:40:50,306 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 03:40:50,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655151357] [2022-04-28 03:40:50,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:40:50,306 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.8) internal successors, (18), 9 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 23 [2022-04-28 03:40:50,306 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:40:50,306 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 1.8) internal successors, (18), 9 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 03:40:50,325 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 03:40:50,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 03:40:50,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:40:50,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 03:40:50,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2022-04-28 03:40:50,326 INFO L87 Difference]: Start difference. First operand 36 states and 44 transitions. Second operand has 10 states, 10 states have (on average 1.8) internal successors, (18), 9 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 03:40:51,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:40:51,915 INFO L93 Difference]: Finished difference Result 56 states and 73 transitions. [2022-04-28 03:40:51,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 03:40:51,916 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.8) internal successors, (18), 9 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 23 [2022-04-28 03:40:51,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:40:51,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.8) internal successors, (18), 9 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 03:40:51,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 59 transitions. [2022-04-28 03:40:51,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.8) internal successors, (18), 9 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 03:40:51,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 59 transitions. [2022-04-28 03:40:51,917 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 59 transitions. [2022-04-28 03:40:51,979 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 03:40:51,980 INFO L225 Difference]: With dead ends: 56 [2022-04-28 03:40:51,980 INFO L226 Difference]: Without dead ends: 50 [2022-04-28 03:40:51,980 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=99, Invalid=603, Unknown=0, NotChecked=0, Total=702 [2022-04-28 03:40:51,981 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 53 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 03:40:51,981 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 35 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 03:40:51,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-28 03:40:52,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 41. [2022-04-28 03:40:52,109 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:40:52,109 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 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 03:40:52,109 INFO L74 IsIncluded]: Start isIncluded. First operand 50 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 03:40:52,109 INFO L87 Difference]: Start difference. First operand 50 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 03:40:52,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:40:52,110 INFO L93 Difference]: Finished difference Result 50 states and 62 transitions. [2022-04-28 03:40:52,110 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2022-04-28 03:40:52,110 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:40:52,110 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:40:52,110 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 50 states. [2022-04-28 03:40:52,110 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 50 states. [2022-04-28 03:40:52,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:40:52,111 INFO L93 Difference]: Finished difference Result 50 states and 62 transitions. [2022-04-28 03:40:52,111 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2022-04-28 03:40:52,111 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:40:52,111 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:40:52,111 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:40:52,111 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:40:52,111 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 03:40:52,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 51 transitions. [2022-04-28 03:40:52,112 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 51 transitions. Word has length 23 [2022-04-28 03:40:52,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:40:52,112 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 51 transitions. [2022-04-28 03:40:52,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.8) internal successors, (18), 9 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 03:40:52,112 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 51 transitions. [2022-04-28 03:40:56,765 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 49 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-28 03:40:56,766 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 51 transitions. [2022-04-28 03:40:56,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-28 03:40:56,766 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:40:56,766 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:40:56,784 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 03:40:56,966 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,SelfDestructingSolverStorable14 [2022-04-28 03:40:56,967 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:40:56,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:40:56,967 INFO L85 PathProgramCache]: Analyzing trace with hash -766686047, now seen corresponding path program 8 times [2022-04-28 03:40:56,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:40:56,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [204126624] [2022-04-28 03:40:57,304 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:40:57,306 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:40:57,308 INFO L85 PathProgramCache]: Analyzing trace with hash -1355516414, now seen corresponding path program 1 times [2022-04-28 03:40:57,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:40:57,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225448372] [2022-04-28 03:40:57,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:40:57,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:40:57,315 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_14.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:40:57,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:40:57,337 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_14.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:40:57,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:40:57,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:40:57,582 INFO L290 TraceCheckUtils]: 0: Hoare triple {4471#(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); {4460#true} is VALID [2022-04-28 03:40:57,582 INFO L290 TraceCheckUtils]: 1: Hoare triple {4460#true} assume true; {4460#true} is VALID [2022-04-28 03:40:57,582 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4460#true} {4460#true} #72#return; {4460#true} is VALID [2022-04-28 03:40:57,583 INFO L272 TraceCheckUtils]: 0: Hoare triple {4460#true} call ULTIMATE.init(); {4471#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:40:57,583 INFO L290 TraceCheckUtils]: 1: Hoare triple {4471#(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); {4460#true} is VALID [2022-04-28 03:40:57,583 INFO L290 TraceCheckUtils]: 2: Hoare triple {4460#true} assume true; {4460#true} is VALID [2022-04-28 03:40:57,583 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4460#true} {4460#true} #72#return; {4460#true} is VALID [2022-04-28 03:40:57,583 INFO L272 TraceCheckUtils]: 4: Hoare triple {4460#true} call #t~ret13 := main(); {4460#true} is VALID [2022-04-28 03:40:57,583 INFO L290 TraceCheckUtils]: 5: Hoare triple {4460#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4460#true} is VALID [2022-04-28 03:40:57,583 INFO L290 TraceCheckUtils]: 6: Hoare triple {4460#true} [102] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_68| |v_main_#t~post5_67|)) (.cse1 (= |v_main_#t~post6_68| |v_main_#t~post6_67|)) (.cse2 (= v_main_~y~0_143 v_main_~y~0_142)) (.cse3 (= v_main_~x~0_145 v_main_~x~0_144)) (.cse4 (mod v_main_~x~0_145 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3) (and (forall ((v_it_14 Int)) (or (not (<= 1 v_it_14)) (< 0 (mod (+ v_main_~x~0_145 (* 4294967295 v_it_14)) 4294967296)) (not (<= (+ v_main_~y~0_143 v_it_14 1) v_main_~y~0_142)))) (= v_main_~x~0_144 (+ v_main_~x~0_145 v_main_~y~0_143 (* (- 1) v_main_~y~0_142))) (< v_main_~y~0_143 v_main_~y~0_142) (< 0 .cse4)) (and .cse0 .cse1 .cse2 .cse3 (<= .cse4 0)))) InVars {main_~y~0=v_main_~y~0_143, main_#t~post5=|v_main_#t~post5_68|, main_~x~0=v_main_~x~0_145, main_#t~post6=|v_main_#t~post6_68|} OutVars{main_~y~0=v_main_~y~0_142, main_#t~post5=|v_main_#t~post5_67|, main_~x~0=v_main_~x~0_144, main_#t~post6=|v_main_#t~post6_67|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {4460#true} is VALID [2022-04-28 03:40:57,583 INFO L290 TraceCheckUtils]: 7: Hoare triple {4460#true} [101] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {4460#true} is VALID [2022-04-28 03:40:57,594 INFO L290 TraceCheckUtils]: 8: Hoare triple {4460#true} ~z~0 := ~y~0; {4465#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-28 03:40:57,595 INFO L290 TraceCheckUtils]: 9: Hoare triple {4465#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4466#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-28 03:40:57,595 INFO L290 TraceCheckUtils]: 10: Hoare triple {4466#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 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; {4467#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-28 03:40:57,597 INFO L290 TraceCheckUtils]: 11: Hoare triple {4467#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) 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; {4468#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-28 03:40:57,597 INFO L290 TraceCheckUtils]: 12: Hoare triple {4468#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} assume !(~z~0 % 4294967296 > 0); {4468#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-28 03:40:57,598 INFO L290 TraceCheckUtils]: 13: Hoare triple {4468#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4469#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-28 03:40:57,600 INFO L290 TraceCheckUtils]: 14: Hoare triple {4469#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 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; {4470#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-28 03:40:57,600 INFO L290 TraceCheckUtils]: 15: Hoare triple {4470#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {4461#false} is VALID [2022-04-28 03:40:57,600 INFO L290 TraceCheckUtils]: 16: Hoare triple {4461#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {4461#false} is VALID [2022-04-28 03:40:57,600 INFO L290 TraceCheckUtils]: 17: Hoare triple {4461#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {4461#false} is VALID [2022-04-28 03:40:57,600 INFO L290 TraceCheckUtils]: 18: Hoare triple {4461#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {4461#false} is VALID [2022-04-28 03:40:57,600 INFO L290 TraceCheckUtils]: 19: Hoare triple {4461#false} assume !(~x~0 % 4294967296 > 0); {4461#false} is VALID [2022-04-28 03:40:57,600 INFO L272 TraceCheckUtils]: 20: Hoare triple {4461#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {4461#false} is VALID [2022-04-28 03:40:57,600 INFO L290 TraceCheckUtils]: 21: Hoare triple {4461#false} ~cond := #in~cond; {4461#false} is VALID [2022-04-28 03:40:57,601 INFO L290 TraceCheckUtils]: 22: Hoare triple {4461#false} assume 0 == ~cond; {4461#false} is VALID [2022-04-28 03:40:57,601 INFO L290 TraceCheckUtils]: 23: Hoare triple {4461#false} assume !false; {4461#false} is VALID [2022-04-28 03:40:57,601 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 03:40:57,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:40:57,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225448372] [2022-04-28 03:40:57,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225448372] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:40:57,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [351523771] [2022-04-28 03:40:57,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:40:57,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:40:57,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:40:57,603 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 03:40:57,608 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 03:40:57,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:40:57,638 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-28 03:40:57,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:40:57,650 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:40:58,315 INFO L272 TraceCheckUtils]: 0: Hoare triple {4460#true} call ULTIMATE.init(); {4460#true} is VALID [2022-04-28 03:40:58,315 INFO L290 TraceCheckUtils]: 1: Hoare triple {4460#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4460#true} is VALID [2022-04-28 03:40:58,315 INFO L290 TraceCheckUtils]: 2: Hoare triple {4460#true} assume true; {4460#true} is VALID [2022-04-28 03:40:58,315 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4460#true} {4460#true} #72#return; {4460#true} is VALID [2022-04-28 03:40:58,315 INFO L272 TraceCheckUtils]: 4: Hoare triple {4460#true} call #t~ret13 := main(); {4460#true} is VALID [2022-04-28 03:40:58,315 INFO L290 TraceCheckUtils]: 5: Hoare triple {4460#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4460#true} is VALID [2022-04-28 03:40:58,315 INFO L290 TraceCheckUtils]: 6: Hoare triple {4460#true} [102] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_68| |v_main_#t~post5_67|)) (.cse1 (= |v_main_#t~post6_68| |v_main_#t~post6_67|)) (.cse2 (= v_main_~y~0_143 v_main_~y~0_142)) (.cse3 (= v_main_~x~0_145 v_main_~x~0_144)) (.cse4 (mod v_main_~x~0_145 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3) (and (forall ((v_it_14 Int)) (or (not (<= 1 v_it_14)) (< 0 (mod (+ v_main_~x~0_145 (* 4294967295 v_it_14)) 4294967296)) (not (<= (+ v_main_~y~0_143 v_it_14 1) v_main_~y~0_142)))) (= v_main_~x~0_144 (+ v_main_~x~0_145 v_main_~y~0_143 (* (- 1) v_main_~y~0_142))) (< v_main_~y~0_143 v_main_~y~0_142) (< 0 .cse4)) (and .cse0 .cse1 .cse2 .cse3 (<= .cse4 0)))) InVars {main_~y~0=v_main_~y~0_143, main_#t~post5=|v_main_#t~post5_68|, main_~x~0=v_main_~x~0_145, main_#t~post6=|v_main_#t~post6_68|} OutVars{main_~y~0=v_main_~y~0_142, main_#t~post5=|v_main_#t~post5_67|, main_~x~0=v_main_~x~0_144, main_#t~post6=|v_main_#t~post6_67|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {4460#true} is VALID [2022-04-28 03:40:58,315 INFO L290 TraceCheckUtils]: 7: Hoare triple {4460#true} [101] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {4460#true} is VALID [2022-04-28 03:40:58,316 INFO L290 TraceCheckUtils]: 8: Hoare triple {4460#true} ~z~0 := ~y~0; {4465#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-28 03:40:58,317 INFO L290 TraceCheckUtils]: 9: Hoare triple {4465#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4466#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-28 03:40:58,317 INFO L290 TraceCheckUtils]: 10: Hoare triple {4466#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 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; {4467#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-28 03:40:58,319 INFO L290 TraceCheckUtils]: 11: Hoare triple {4467#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) 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; {4468#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-28 03:40:58,319 INFO L290 TraceCheckUtils]: 12: Hoare triple {4468#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} assume !(~z~0 % 4294967296 > 0); {4468#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-28 03:40:58,320 INFO L290 TraceCheckUtils]: 13: Hoare triple {4468#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4469#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-28 03:40:58,321 INFO L290 TraceCheckUtils]: 14: Hoare triple {4469#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 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; {4470#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-28 03:40:58,322 INFO L290 TraceCheckUtils]: 15: Hoare triple {4470#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {4461#false} is VALID [2022-04-28 03:40:58,322 INFO L290 TraceCheckUtils]: 16: Hoare triple {4461#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {4461#false} is VALID [2022-04-28 03:40:58,322 INFO L290 TraceCheckUtils]: 17: Hoare triple {4461#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {4461#false} is VALID [2022-04-28 03:40:58,322 INFO L290 TraceCheckUtils]: 18: Hoare triple {4461#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {4461#false} is VALID [2022-04-28 03:40:58,322 INFO L290 TraceCheckUtils]: 19: Hoare triple {4461#false} assume !(~x~0 % 4294967296 > 0); {4461#false} is VALID [2022-04-28 03:40:58,322 INFO L272 TraceCheckUtils]: 20: Hoare triple {4461#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {4461#false} is VALID [2022-04-28 03:40:58,322 INFO L290 TraceCheckUtils]: 21: Hoare triple {4461#false} ~cond := #in~cond; {4461#false} is VALID [2022-04-28 03:40:58,322 INFO L290 TraceCheckUtils]: 22: Hoare triple {4461#false} assume 0 == ~cond; {4461#false} is VALID [2022-04-28 03:40:58,322 INFO L290 TraceCheckUtils]: 23: Hoare triple {4461#false} assume !false; {4461#false} is VALID [2022-04-28 03:40:58,322 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 03:40:58,322 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:40:58,945 INFO L290 TraceCheckUtils]: 23: Hoare triple {4461#false} assume !false; {4461#false} is VALID [2022-04-28 03:40:58,945 INFO L290 TraceCheckUtils]: 22: Hoare triple {4461#false} assume 0 == ~cond; {4461#false} is VALID [2022-04-28 03:40:58,945 INFO L290 TraceCheckUtils]: 21: Hoare triple {4461#false} ~cond := #in~cond; {4461#false} is VALID [2022-04-28 03:40:58,946 INFO L272 TraceCheckUtils]: 20: Hoare triple {4461#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {4461#false} is VALID [2022-04-28 03:40:58,946 INFO L290 TraceCheckUtils]: 19: Hoare triple {4461#false} assume !(~x~0 % 4294967296 > 0); {4461#false} is VALID [2022-04-28 03:40:58,946 INFO L290 TraceCheckUtils]: 18: Hoare triple {4461#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {4461#false} is VALID [2022-04-28 03:40:58,946 INFO L290 TraceCheckUtils]: 17: Hoare triple {4461#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {4461#false} is VALID [2022-04-28 03:40:58,946 INFO L290 TraceCheckUtils]: 16: Hoare triple {4461#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {4461#false} is VALID [2022-04-28 03:40:58,946 INFO L290 TraceCheckUtils]: 15: Hoare triple {4470#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {4461#false} is VALID [2022-04-28 03:40:58,947 INFO L290 TraceCheckUtils]: 14: Hoare triple {4469#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 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; {4470#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-28 03:40:58,949 INFO L290 TraceCheckUtils]: 13: Hoare triple {4468#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {4469#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-28 03:40:58,949 INFO L290 TraceCheckUtils]: 12: Hoare triple {4468#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} assume !(~z~0 % 4294967296 > 0); {4468#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-28 03:40:58,949 INFO L290 TraceCheckUtils]: 11: Hoare triple {4580#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297)) (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; {4468#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-28 03:40:58,951 INFO L290 TraceCheckUtils]: 10: Hoare triple {4584#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {4580#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297)) (not (< 0 (mod main_~z~0 4294967296))))} is VALID [2022-04-28 03:40:58,952 INFO L290 TraceCheckUtils]: 9: Hoare triple {4588#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297)) (not (< 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; {4584#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297)))} is VALID [2022-04-28 03:40:58,953 INFO L290 TraceCheckUtils]: 8: Hoare triple {4460#true} ~z~0 := ~y~0; {4588#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297)) (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))))} is VALID [2022-04-28 03:40:58,953 INFO L290 TraceCheckUtils]: 7: Hoare triple {4460#true} [101] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {4460#true} is VALID [2022-04-28 03:40:58,953 INFO L290 TraceCheckUtils]: 6: Hoare triple {4460#true} [102] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_68| |v_main_#t~post5_67|)) (.cse1 (= |v_main_#t~post6_68| |v_main_#t~post6_67|)) (.cse2 (= v_main_~y~0_143 v_main_~y~0_142)) (.cse3 (= v_main_~x~0_145 v_main_~x~0_144)) (.cse4 (mod v_main_~x~0_145 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3) (and (forall ((v_it_14 Int)) (or (not (<= 1 v_it_14)) (< 0 (mod (+ v_main_~x~0_145 (* 4294967295 v_it_14)) 4294967296)) (not (<= (+ v_main_~y~0_143 v_it_14 1) v_main_~y~0_142)))) (= v_main_~x~0_144 (+ v_main_~x~0_145 v_main_~y~0_143 (* (- 1) v_main_~y~0_142))) (< v_main_~y~0_143 v_main_~y~0_142) (< 0 .cse4)) (and .cse0 .cse1 .cse2 .cse3 (<= .cse4 0)))) InVars {main_~y~0=v_main_~y~0_143, main_#t~post5=|v_main_#t~post5_68|, main_~x~0=v_main_~x~0_145, main_#t~post6=|v_main_#t~post6_68|} OutVars{main_~y~0=v_main_~y~0_142, main_#t~post5=|v_main_#t~post5_67|, main_~x~0=v_main_~x~0_144, main_#t~post6=|v_main_#t~post6_67|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {4460#true} is VALID [2022-04-28 03:40:58,953 INFO L290 TraceCheckUtils]: 5: Hoare triple {4460#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4460#true} is VALID [2022-04-28 03:40:58,953 INFO L272 TraceCheckUtils]: 4: Hoare triple {4460#true} call #t~ret13 := main(); {4460#true} is VALID [2022-04-28 03:40:58,954 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4460#true} {4460#true} #72#return; {4460#true} is VALID [2022-04-28 03:40:58,954 INFO L290 TraceCheckUtils]: 2: Hoare triple {4460#true} assume true; {4460#true} is VALID [2022-04-28 03:40:58,954 INFO L290 TraceCheckUtils]: 1: Hoare triple {4460#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4460#true} is VALID [2022-04-28 03:40:58,954 INFO L272 TraceCheckUtils]: 0: Hoare triple {4460#true} call ULTIMATE.init(); {4460#true} is VALID [2022-04-28 03:40:58,954 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 03:40:58,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [351523771] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:40:58,954 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:40:58,954 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 12 [2022-04-28 03:40:59,011 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:40:59,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [204126624] [2022-04-28 03:40:59,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [204126624] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:40:59,011 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:40:59,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 03:40:59,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602909738] [2022-04-28 03:40:59,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:40:59,012 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.8) internal successors, (18), 9 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 24 [2022-04-28 03:40:59,012 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:40:59,012 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 1.8) internal successors, (18), 9 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 03:40:59,029 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 03:40:59,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 03:40:59,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:40:59,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 03:40:59,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2022-04-28 03:40:59,030 INFO L87 Difference]: Start difference. First operand 41 states and 51 transitions. Second operand has 10 states, 10 states have (on average 1.8) internal successors, (18), 9 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 03:41:00,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:00,884 INFO L93 Difference]: Finished difference Result 68 states and 85 transitions. [2022-04-28 03:41:00,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-28 03:41:00,884 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.8) internal successors, (18), 9 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 24 [2022-04-28 03:41:00,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:41:00,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.8) internal successors, (18), 9 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 03:41:00,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 45 transitions. [2022-04-28 03:41:00,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.8) internal successors, (18), 9 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 03:41:00,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 45 transitions. [2022-04-28 03:41:00,886 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 45 transitions. [2022-04-28 03:41:00,948 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 03:41:00,948 INFO L225 Difference]: With dead ends: 68 [2022-04-28 03:41:00,948 INFO L226 Difference]: Without dead ends: 56 [2022-04-28 03:41:00,949 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 52 SyntacticMatches, 7 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=145, Invalid=505, Unknown=0, NotChecked=0, Total=650 [2022-04-28 03:41:00,949 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 29 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 03:41:00,949 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 52 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 03:41:00,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-04-28 03:41:01,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 45. [2022-04-28 03:41:01,096 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:41:01,096 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand has 45 states, 40 states have (on average 1.275) internal successors, (51), 40 states have internal predecessors, (51), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:01,096 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand has 45 states, 40 states have (on average 1.275) internal successors, (51), 40 states have internal predecessors, (51), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:01,096 INFO L87 Difference]: Start difference. First operand 56 states. Second operand has 45 states, 40 states have (on average 1.275) internal successors, (51), 40 states have internal predecessors, (51), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:01,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:01,097 INFO L93 Difference]: Finished difference Result 56 states and 69 transitions. [2022-04-28 03:41:01,097 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 69 transitions. [2022-04-28 03:41:01,097 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:41:01,097 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:41:01,097 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 40 states have (on average 1.275) internal successors, (51), 40 states have internal predecessors, (51), 3 states have call successors, (3), 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 56 states. [2022-04-28 03:41:01,097 INFO L87 Difference]: Start difference. First operand has 45 states, 40 states have (on average 1.275) internal successors, (51), 40 states have internal predecessors, (51), 3 states have call successors, (3), 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 56 states. [2022-04-28 03:41:01,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:01,098 INFO L93 Difference]: Finished difference Result 56 states and 69 transitions. [2022-04-28 03:41:01,098 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 69 transitions. [2022-04-28 03:41:01,098 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:41:01,098 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:41:01,098 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:41:01,098 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:41:01,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 40 states have (on average 1.275) internal successors, (51), 40 states have internal predecessors, (51), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:01,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 55 transitions. [2022-04-28 03:41:01,099 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 55 transitions. Word has length 24 [2022-04-28 03:41:01,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:41:01,099 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 55 transitions. [2022-04-28 03:41:01,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.8) internal successors, (18), 9 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 03:41:01,099 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 45 states and 55 transitions. [2022-04-28 03:41:05,652 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 53 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-28 03:41:05,652 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 55 transitions. [2022-04-28 03:41:05,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-28 03:41:05,653 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:41:05,653 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:41:05,668 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 03:41:05,867 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,SelfDestructingSolverStorable15 [2022-04-28 03:41:05,867 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:41:05,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:41:05,867 INFO L85 PathProgramCache]: Analyzing trace with hash -628891352, now seen corresponding path program 9 times [2022-04-28 03:41:05,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:41:05,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [432274019] [2022-04-28 03:41:06,196 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:41:06,198 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:41:06,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1090884697, now seen corresponding path program 1 times [2022-04-28 03:41:06,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:41:06,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103711679] [2022-04-28 03:41:06,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:41:06,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:41:06,207 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_15.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:41:06,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:06,229 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_15.3))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:41:07,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:41:07,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:07,067 INFO L290 TraceCheckUtils]: 0: Hoare triple {5004#(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); {4986#true} is VALID [2022-04-28 03:41:07,067 INFO L290 TraceCheckUtils]: 1: Hoare triple {4986#true} assume true; {4986#true} is VALID [2022-04-28 03:41:07,068 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4986#true} {4986#true} #72#return; {4986#true} is VALID [2022-04-28 03:41:07,068 INFO L272 TraceCheckUtils]: 0: Hoare triple {4986#true} call ULTIMATE.init(); {5004#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:41:07,068 INFO L290 TraceCheckUtils]: 1: Hoare triple {5004#(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); {4986#true} is VALID [2022-04-28 03:41:07,068 INFO L290 TraceCheckUtils]: 2: Hoare triple {4986#true} assume true; {4986#true} is VALID [2022-04-28 03:41:07,068 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4986#true} {4986#true} #72#return; {4986#true} is VALID [2022-04-28 03:41:07,068 INFO L272 TraceCheckUtils]: 4: Hoare triple {4986#true} call #t~ret13 := main(); {4986#true} is VALID [2022-04-28 03:41:07,069 INFO L290 TraceCheckUtils]: 5: Hoare triple {4986#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4991#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-28 03:41:07,070 INFO L290 TraceCheckUtils]: 6: Hoare triple {4991#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} [104] L16-2-->L16-3_primed: Formula: (let ((.cse2 (mod v_main_~x~0_158 4294967296)) (.cse0 (= |v_main_#t~post6_73| |v_main_#t~post6_72|)) (.cse1 (= |v_main_#t~post5_73| |v_main_#t~post5_72|)) (.cse3 (= v_main_~x~0_158 v_main_~x~0_157)) (.cse4 (= v_main_~y~0_157 v_main_~y~0_156))) (or (and .cse0 .cse1 (<= .cse2 0) .cse3 .cse4) (and (< 0 .cse2) (forall ((v_it_15 Int)) (or (< 0 (mod (+ v_main_~x~0_158 (* 4294967295 v_it_15)) 4294967296)) (not (<= (+ v_main_~y~0_157 v_it_15 1) v_main_~y~0_156)) (not (<= 1 v_it_15)))) (< v_main_~y~0_157 v_main_~y~0_156) (= v_main_~x~0_157 (+ v_main_~x~0_158 v_main_~y~0_157 (* (- 1) v_main_~y~0_156)))) (and .cse0 .cse1 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_157, main_#t~post5=|v_main_#t~post5_73|, main_~x~0=v_main_~x~0_158, main_#t~post6=|v_main_#t~post6_73|} OutVars{main_~y~0=v_main_~y~0_156, main_#t~post5=|v_main_#t~post5_72|, main_~x~0=v_main_~x~0_157, main_#t~post6=|v_main_#t~post6_72|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {4992#(or (and (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= main_~n~0 (+ main_~y~0 main_~x~0))) (= main_~y~0 0))} is VALID [2022-04-28 03:41:07,071 INFO L290 TraceCheckUtils]: 7: Hoare triple {4992#(or (and (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= main_~n~0 (+ main_~y~0 main_~x~0))) (= main_~y~0 0))} [103] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {4993#(or (= main_~y~0 0) (and (<= (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))))))} is VALID [2022-04-28 03:41:07,072 INFO L290 TraceCheckUtils]: 8: Hoare triple {4993#(or (= main_~y~0 0) (and (<= (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))))))} ~z~0 := ~y~0; {4994#(or (and (= (+ main_~y~0 (* (- 1) main_~z~0)) 0) (= main_~y~0 0)) (and (<= (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))))))} is VALID [2022-04-28 03:41:07,073 INFO L290 TraceCheckUtils]: 9: Hoare triple {4994#(or (and (= (+ main_~y~0 (* (- 1) main_~z~0)) 0) (= main_~y~0 0)) (and (<= (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~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; {4995#(or (and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0) (= main_~y~0 0)) (<= main_~n~0 (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0)))} is VALID [2022-04-28 03:41:07,074 INFO L290 TraceCheckUtils]: 10: Hoare triple {4995#(or (and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0) (= main_~y~0 0)) (<= main_~n~0 (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) 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; {4996#(or (and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0) (= main_~y~0 0)) (<= main_~n~0 (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0)))} is VALID [2022-04-28 03:41:07,075 INFO L290 TraceCheckUtils]: 11: Hoare triple {4996#(or (and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0) (= main_~y~0 0)) (<= main_~n~0 (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) 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; {4997#(or (and (<= main_~y~0 (+ main_~z~0 3)) (<= (+ (div main_~z~0 4294967296) 1) 0) (= main_~y~0 0)) (<= main_~n~0 (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0)))} is VALID [2022-04-28 03:41:07,076 INFO L290 TraceCheckUtils]: 12: Hoare triple {4997#(or (and (<= main_~y~0 (+ main_~z~0 3)) (<= (+ (div main_~z~0 4294967296) 1) 0) (= main_~y~0 0)) (<= main_~n~0 (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0)))} assume !(~z~0 % 4294967296 > 0); {4998#(<= main_~n~0 (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0))} is VALID [2022-04-28 03:41:07,077 INFO L290 TraceCheckUtils]: 13: Hoare triple {4998#(<= main_~n~0 (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~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; {4999#(<= main_~n~0 (+ (* (div (+ (- 1) main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0 1))} is VALID [2022-04-28 03:41:07,078 INFO L290 TraceCheckUtils]: 14: Hoare triple {4999#(<= main_~n~0 (+ (* (div (+ (- 1) main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~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; {5000#(<= main_~n~0 (+ (* (div (+ (- 2) main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0 2))} is VALID [2022-04-28 03:41:07,079 INFO L290 TraceCheckUtils]: 15: Hoare triple {5000#(<= main_~n~0 (+ (* (div (+ (- 2) main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~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; {5001#(<= main_~n~0 (+ main_~y~0 3 (* (div (+ main_~n~0 (- 3) (* (- 1) main_~y~0)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:41:07,080 INFO L290 TraceCheckUtils]: 16: Hoare triple {5001#(<= main_~n~0 (+ main_~y~0 3 (* (div (+ main_~n~0 (- 3) (* (- 1) main_~y~0)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {5001#(<= main_~n~0 (+ main_~y~0 3 (* (div (+ main_~n~0 (- 3) (* (- 1) main_~y~0)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:41:07,081 INFO L290 TraceCheckUtils]: 17: Hoare triple {5001#(<= main_~n~0 (+ main_~y~0 3 (* (div (+ main_~n~0 (- 3) (* (- 1) main_~y~0)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {5000#(<= main_~n~0 (+ (* (div (+ (- 2) main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0 2))} is VALID [2022-04-28 03:41:07,082 INFO L290 TraceCheckUtils]: 18: Hoare triple {5000#(<= main_~n~0 (+ (* (div (+ (- 2) main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {4999#(<= main_~n~0 (+ (* (div (+ (- 1) main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0 1))} is VALID [2022-04-28 03:41:07,083 INFO L290 TraceCheckUtils]: 19: Hoare triple {4999#(<= main_~n~0 (+ (* (div (+ (- 1) main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {4998#(<= main_~n~0 (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0))} is VALID [2022-04-28 03:41:07,084 INFO L290 TraceCheckUtils]: 20: Hoare triple {4998#(<= main_~n~0 (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0))} assume !(~x~0 % 4294967296 > 0); {4998#(<= main_~n~0 (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0))} is VALID [2022-04-28 03:41:07,085 INFO L272 TraceCheckUtils]: 21: Hoare triple {4998#(<= main_~n~0 (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0))} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {5002#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:41:07,086 INFO L290 TraceCheckUtils]: 22: Hoare triple {5002#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {5003#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:41:07,086 INFO L290 TraceCheckUtils]: 23: Hoare triple {5003#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {4987#false} is VALID [2022-04-28 03:41:07,086 INFO L290 TraceCheckUtils]: 24: Hoare triple {4987#false} assume !false; {4987#false} is VALID [2022-04-28 03:41:07,086 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 03:41:07,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:41:07,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103711679] [2022-04-28 03:41:07,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103711679] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:41:07,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1092790410] [2022-04-28 03:41:07,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:41:07,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:41:07,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:41:07,087 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 03:41:07,088 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 03:41:07,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:07,286 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-28 03:41:07,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:07,538 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:41:47,031 INFO L272 TraceCheckUtils]: 0: Hoare triple {4986#true} call ULTIMATE.init(); {4986#true} is VALID [2022-04-28 03:41:47,031 INFO L290 TraceCheckUtils]: 1: Hoare triple {4986#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4986#true} is VALID [2022-04-28 03:41:47,031 INFO L290 TraceCheckUtils]: 2: Hoare triple {4986#true} assume true; {4986#true} is VALID [2022-04-28 03:41:47,031 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4986#true} {4986#true} #72#return; {4986#true} is VALID [2022-04-28 03:41:47,031 INFO L272 TraceCheckUtils]: 4: Hoare triple {4986#true} call #t~ret13 := main(); {4986#true} is VALID [2022-04-28 03:41:47,031 INFO L290 TraceCheckUtils]: 5: Hoare triple {4986#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4991#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-28 03:41:47,044 INFO L290 TraceCheckUtils]: 6: Hoare triple {4991#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} [104] L16-2-->L16-3_primed: Formula: (let ((.cse2 (mod v_main_~x~0_158 4294967296)) (.cse0 (= |v_main_#t~post6_73| |v_main_#t~post6_72|)) (.cse1 (= |v_main_#t~post5_73| |v_main_#t~post5_72|)) (.cse3 (= v_main_~x~0_158 v_main_~x~0_157)) (.cse4 (= v_main_~y~0_157 v_main_~y~0_156))) (or (and .cse0 .cse1 (<= .cse2 0) .cse3 .cse4) (and (< 0 .cse2) (forall ((v_it_15 Int)) (or (< 0 (mod (+ v_main_~x~0_158 (* 4294967295 v_it_15)) 4294967296)) (not (<= (+ v_main_~y~0_157 v_it_15 1) v_main_~y~0_156)) (not (<= 1 v_it_15)))) (< v_main_~y~0_157 v_main_~y~0_156) (= v_main_~x~0_157 (+ v_main_~x~0_158 v_main_~y~0_157 (* (- 1) v_main_~y~0_156)))) (and .cse0 .cse1 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_157, main_#t~post5=|v_main_#t~post5_73|, main_~x~0=v_main_~x~0_158, main_#t~post6=|v_main_#t~post6_73|} OutVars{main_~y~0=v_main_~y~0_156, main_#t~post5=|v_main_#t~post5_72|, main_~x~0=v_main_~x~0_157, main_#t~post6=|v_main_#t~post6_72|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {5026#(or (and (= main_~x~0 (+ main_~n~0 (* (- 1) main_~y~0))) (< 0 (mod main_~n~0 4294967296)) (< 0 main_~y~0) (forall ((v_it_15 Int)) (or (not (<= (+ v_it_15 1) main_~y~0)) (< 0 (mod (+ (* 4294967295 v_it_15) main_~n~0) 4294967296)) (not (<= 1 v_it_15))))) (and (= main_~n~0 main_~x~0) (= main_~y~0 0)))} is VALID [2022-04-28 03:41:47,047 INFO L290 TraceCheckUtils]: 7: Hoare triple {5026#(or (and (= main_~x~0 (+ main_~n~0 (* (- 1) main_~y~0))) (< 0 (mod main_~n~0 4294967296)) (< 0 main_~y~0) (forall ((v_it_15 Int)) (or (not (<= (+ v_it_15 1) main_~y~0)) (< 0 (mod (+ (* 4294967295 v_it_15) main_~n~0) 4294967296)) (not (<= 1 v_it_15))))) (and (= main_~n~0 main_~x~0) (= main_~y~0 0)))} [103] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {5030#(or (and (<= (div (+ main_~y~0 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296)) (< 0 (mod main_~n~0 4294967296)) (< 0 main_~y~0) (forall ((v_it_15 Int)) (or (not (<= (+ v_it_15 1) main_~y~0)) (< 0 (mod (+ (* 4294967295 v_it_15) main_~n~0) 4294967296)) (not (<= 1 v_it_15))))) (and (<= (div (- main_~n~0) (- 4294967296)) (div main_~n~0 4294967296)) (= main_~y~0 0)))} is VALID [2022-04-28 03:41:47,049 INFO L290 TraceCheckUtils]: 8: Hoare triple {5030#(or (and (<= (div (+ main_~y~0 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296)) (< 0 (mod main_~n~0 4294967296)) (< 0 main_~y~0) (forall ((v_it_15 Int)) (or (not (<= (+ v_it_15 1) main_~y~0)) (< 0 (mod (+ (* 4294967295 v_it_15) main_~n~0) 4294967296)) (not (<= 1 v_it_15))))) (and (<= (div (- main_~n~0) (- 4294967296)) (div main_~n~0 4294967296)) (= main_~y~0 0)))} ~z~0 := ~y~0; {5034#(and (= main_~z~0 main_~y~0) (or (and (<= (div (+ main_~y~0 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296)) (< 0 (mod main_~n~0 4294967296)) (< 0 main_~y~0) (forall ((v_it_15 Int)) (or (not (<= (+ v_it_15 1) main_~y~0)) (< 0 (mod (+ (* 4294967295 v_it_15) main_~n~0) 4294967296)) (not (<= 1 v_it_15))))) (and (<= (div (- main_~n~0) (- 4294967296)) (div main_~n~0 4294967296)) (= main_~y~0 0))))} is VALID [2022-04-28 03:41:47,053 INFO L290 TraceCheckUtils]: 9: Hoare triple {5034#(and (= main_~z~0 main_~y~0) (or (and (<= (div (+ main_~y~0 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296)) (< 0 (mod main_~n~0 4294967296)) (< 0 main_~y~0) (forall ((v_it_15 Int)) (or (not (<= (+ v_it_15 1) main_~y~0)) (< 0 (mod (+ (* 4294967295 v_it_15) main_~n~0) 4294967296)) (not (<= 1 v_it_15))))) (and (<= (div (- main_~n~0) (- 4294967296)) (div main_~n~0 4294967296)) (= main_~y~0 0))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5038#(and (< 0 (mod (+ main_~z~0 1) 4294967296)) (<= (div (+ main_~y~0 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296)) (< 0 main_~y~0) (= main_~y~0 (+ main_~z~0 1)) (forall ((v_it_15 Int)) (or (not (<= (+ v_it_15 1) main_~y~0)) (< 0 (mod (+ (* 4294967295 v_it_15) main_~n~0) 4294967296)) (not (<= 1 v_it_15)))))} is VALID [2022-04-28 03:41:47,055 INFO L290 TraceCheckUtils]: 10: Hoare triple {5038#(and (< 0 (mod (+ main_~z~0 1) 4294967296)) (<= (div (+ main_~y~0 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296)) (< 0 main_~y~0) (= main_~y~0 (+ main_~z~0 1)) (forall ((v_it_15 Int)) (or (not (<= (+ v_it_15 1) main_~y~0)) (< 0 (mod (+ (* 4294967295 v_it_15) main_~n~0) 4294967296)) (not (<= 1 v_it_15)))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5042#(and (< 0 (mod (+ main_~z~0 2) 4294967296)) (= main_~y~0 (+ main_~z~0 2)) (<= (div (+ main_~y~0 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296)) (< 0 main_~y~0) (forall ((v_it_15 Int)) (or (not (<= (+ v_it_15 1) main_~y~0)) (< 0 (mod (+ (* 4294967295 v_it_15) main_~n~0) 4294967296)) (not (<= 1 v_it_15)))))} is VALID [2022-04-28 03:41:47,057 INFO L290 TraceCheckUtils]: 11: Hoare triple {5042#(and (< 0 (mod (+ main_~z~0 2) 4294967296)) (= main_~y~0 (+ main_~z~0 2)) (<= (div (+ main_~y~0 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296)) (< 0 main_~y~0) (forall ((v_it_15 Int)) (or (not (<= (+ v_it_15 1) main_~y~0)) (< 0 (mod (+ (* 4294967295 v_it_15) main_~n~0) 4294967296)) (not (<= 1 v_it_15)))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5046#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= (div (+ main_~y~0 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296)) (< 0 main_~y~0) (forall ((v_it_15 Int)) (or (not (<= (+ v_it_15 1) main_~y~0)) (< 0 (mod (+ (* 4294967295 v_it_15) main_~n~0) 4294967296)) (not (<= 1 v_it_15)))) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 03:41:47,098 INFO L290 TraceCheckUtils]: 12: Hoare triple {5046#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= (div (+ main_~y~0 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296)) (< 0 main_~y~0) (forall ((v_it_15 Int)) (or (not (<= (+ v_it_15 1) main_~y~0)) (< 0 (mod (+ (* 4294967295 v_it_15) main_~n~0) 4294967296)) (not (<= 1 v_it_15)))) (< 0 (mod main_~y~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {5050#(and (<= (mod (+ main_~y~0 4294967293) 4294967296) 0) (<= (div (+ main_~y~0 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296)) (< 0 main_~y~0) (forall ((v_it_15 Int)) (or (not (<= (+ v_it_15 1) main_~y~0)) (< 0 (mod (+ (* 4294967295 v_it_15) main_~n~0) 4294967296)) (not (<= 1 v_it_15)))))} is VALID [2022-04-28 03:41:47,107 INFO L290 TraceCheckUtils]: 13: Hoare triple {5050#(and (<= (mod (+ main_~y~0 4294967293) 4294967296) 0) (<= (div (+ main_~y~0 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296)) (< 0 main_~y~0) (forall ((v_it_15 Int)) (or (not (<= (+ v_it_15 1) main_~y~0)) (< 0 (mod (+ (* 4294967295 v_it_15) main_~n~0) 4294967296)) (not (<= 1 v_it_15)))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5054#(and (forall ((v_it_15 Int)) (or (not (<= v_it_15 main_~y~0)) (< 0 (mod (+ (* 4294967295 v_it_15) main_~n~0) 4294967296)) (not (<= 1 v_it_15)))) (<= (div (+ main_~y~0 (* (- 1) main_~n~0) 1) (- 4294967296)) (div (+ (- 1) main_~n~0 (* (- 1) main_~y~0)) 4294967296)) (<= (mod (+ main_~y~0 4294967294) 4294967296) 0) (< 0 (+ main_~y~0 1)))} is VALID [2022-04-28 03:41:47,127 INFO L290 TraceCheckUtils]: 14: Hoare triple {5054#(and (forall ((v_it_15 Int)) (or (not (<= v_it_15 main_~y~0)) (< 0 (mod (+ (* 4294967295 v_it_15) main_~n~0) 4294967296)) (not (<= 1 v_it_15)))) (<= (div (+ main_~y~0 (* (- 1) main_~n~0) 1) (- 4294967296)) (div (+ (- 1) main_~n~0 (* (- 1) main_~y~0)) 4294967296)) (<= (mod (+ main_~y~0 4294967294) 4294967296) 0) (< 0 (+ main_~y~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; {5058#(and (< 0 (+ main_~y~0 2)) (forall ((v_it_15 Int)) (or (not (<= v_it_15 (+ main_~y~0 1))) (< 0 (mod (+ (* 4294967295 v_it_15) main_~n~0) 4294967296)) (not (<= 1 v_it_15)))) (<= (mod (+ main_~y~0 4294967295) 4294967296) 0) (<= (div (+ main_~y~0 2 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ (- 2) main_~n~0 (* (- 1) main_~y~0)) 4294967296)))} is VALID [2022-04-28 03:41:47,483 INFO L290 TraceCheckUtils]: 15: Hoare triple {5058#(and (< 0 (+ main_~y~0 2)) (forall ((v_it_15 Int)) (or (not (<= v_it_15 (+ main_~y~0 1))) (< 0 (mod (+ (* 4294967295 v_it_15) main_~n~0) 4294967296)) (not (<= 1 v_it_15)))) (<= (mod (+ main_~y~0 4294967295) 4294967296) 0) (<= (div (+ main_~y~0 2 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ (- 2) main_~n~0 (* (- 1) 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; {5062#(and (<= (mod main_~y~0 4294967296) 0) (< 0 (+ main_~y~0 3)) (forall ((v_it_15 Int)) (or (not (<= v_it_15 (+ main_~y~0 2))) (< 0 (mod (+ (* 4294967295 v_it_15) main_~n~0) 4294967296)) (not (<= 1 v_it_15)))) (<= (div (+ main_~y~0 3 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (- 3) (* (- 1) main_~y~0)) 4294967296)))} is VALID [2022-04-28 03:41:47,484 INFO L290 TraceCheckUtils]: 16: Hoare triple {5062#(and (<= (mod main_~y~0 4294967296) 0) (< 0 (+ main_~y~0 3)) (forall ((v_it_15 Int)) (or (not (<= v_it_15 (+ main_~y~0 2))) (< 0 (mod (+ (* 4294967295 v_it_15) main_~n~0) 4294967296)) (not (<= 1 v_it_15)))) (<= (div (+ main_~y~0 3 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (- 3) (* (- 1) main_~y~0)) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {5062#(and (<= (mod main_~y~0 4294967296) 0) (< 0 (+ main_~y~0 3)) (forall ((v_it_15 Int)) (or (not (<= v_it_15 (+ main_~y~0 2))) (< 0 (mod (+ (* 4294967295 v_it_15) main_~n~0) 4294967296)) (not (<= 1 v_it_15)))) (<= (div (+ main_~y~0 3 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (- 3) (* (- 1) main_~y~0)) 4294967296)))} is VALID [2022-04-28 03:41:47,511 INFO L290 TraceCheckUtils]: 17: Hoare triple {5062#(and (<= (mod main_~y~0 4294967296) 0) (< 0 (+ main_~y~0 3)) (forall ((v_it_15 Int)) (or (not (<= v_it_15 (+ main_~y~0 2))) (< 0 (mod (+ (* 4294967295 v_it_15) main_~n~0) 4294967296)) (not (<= 1 v_it_15)))) (<= (div (+ main_~y~0 3 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (- 3) (* (- 1) main_~y~0)) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {5058#(and (< 0 (+ main_~y~0 2)) (forall ((v_it_15 Int)) (or (not (<= v_it_15 (+ main_~y~0 1))) (< 0 (mod (+ (* 4294967295 v_it_15) main_~n~0) 4294967296)) (not (<= 1 v_it_15)))) (<= (mod (+ main_~y~0 4294967295) 4294967296) 0) (<= (div (+ main_~y~0 2 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ (- 2) main_~n~0 (* (- 1) main_~y~0)) 4294967296)))} is VALID [2022-04-28 03:41:47,516 INFO L290 TraceCheckUtils]: 18: Hoare triple {5058#(and (< 0 (+ main_~y~0 2)) (forall ((v_it_15 Int)) (or (not (<= v_it_15 (+ main_~y~0 1))) (< 0 (mod (+ (* 4294967295 v_it_15) main_~n~0) 4294967296)) (not (<= 1 v_it_15)))) (<= (mod (+ main_~y~0 4294967295) 4294967296) 0) (<= (div (+ main_~y~0 2 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ (- 2) main_~n~0 (* (- 1) main_~y~0)) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {5054#(and (forall ((v_it_15 Int)) (or (not (<= v_it_15 main_~y~0)) (< 0 (mod (+ (* 4294967295 v_it_15) main_~n~0) 4294967296)) (not (<= 1 v_it_15)))) (<= (div (+ main_~y~0 (* (- 1) main_~n~0) 1) (- 4294967296)) (div (+ (- 1) main_~n~0 (* (- 1) main_~y~0)) 4294967296)) (<= (mod (+ main_~y~0 4294967294) 4294967296) 0) (< 0 (+ main_~y~0 1)))} is VALID [2022-04-28 03:41:47,550 INFO L290 TraceCheckUtils]: 19: Hoare triple {5054#(and (forall ((v_it_15 Int)) (or (not (<= v_it_15 main_~y~0)) (< 0 (mod (+ (* 4294967295 v_it_15) main_~n~0) 4294967296)) (not (<= 1 v_it_15)))) (<= (div (+ main_~y~0 (* (- 1) main_~n~0) 1) (- 4294967296)) (div (+ (- 1) main_~n~0 (* (- 1) main_~y~0)) 4294967296)) (<= (mod (+ main_~y~0 4294967294) 4294967296) 0) (< 0 (+ main_~y~0 1)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {5050#(and (<= (mod (+ main_~y~0 4294967293) 4294967296) 0) (<= (div (+ main_~y~0 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296)) (< 0 main_~y~0) (forall ((v_it_15 Int)) (or (not (<= (+ v_it_15 1) main_~y~0)) (< 0 (mod (+ (* 4294967295 v_it_15) main_~n~0) 4294967296)) (not (<= 1 v_it_15)))))} is VALID [2022-04-28 03:41:47,551 INFO L290 TraceCheckUtils]: 20: Hoare triple {5050#(and (<= (mod (+ main_~y~0 4294967293) 4294967296) 0) (<= (div (+ main_~y~0 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296)) (< 0 main_~y~0) (forall ((v_it_15 Int)) (or (not (<= (+ v_it_15 1) main_~y~0)) (< 0 (mod (+ (* 4294967295 v_it_15) main_~n~0) 4294967296)) (not (<= 1 v_it_15)))))} assume !(~x~0 % 4294967296 > 0); {5050#(and (<= (mod (+ main_~y~0 4294967293) 4294967296) 0) (<= (div (+ main_~y~0 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296)) (< 0 main_~y~0) (forall ((v_it_15 Int)) (or (not (<= (+ v_it_15 1) main_~y~0)) (< 0 (mod (+ (* 4294967295 v_it_15) main_~n~0) 4294967296)) (not (<= 1 v_it_15)))))} is VALID [2022-04-28 03:41:47,620 INFO L272 TraceCheckUtils]: 21: Hoare triple {5050#(and (<= (mod (+ main_~y~0 4294967293) 4294967296) 0) (<= (div (+ main_~y~0 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296)) (< 0 main_~y~0) (forall ((v_it_15 Int)) (or (not (<= (+ v_it_15 1) main_~y~0)) (< 0 (mod (+ (* 4294967295 v_it_15) main_~n~0) 4294967296)) (not (<= 1 v_it_15)))))} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {5081#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:41:47,621 INFO L290 TraceCheckUtils]: 22: Hoare triple {5081#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5085#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:41:47,621 INFO L290 TraceCheckUtils]: 23: Hoare triple {5085#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4987#false} is VALID [2022-04-28 03:41:47,621 INFO L290 TraceCheckUtils]: 24: Hoare triple {4987#false} assume !false; {4987#false} is VALID [2022-04-28 03:41:47,621 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 17 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:41:47,621 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:42:37,936 INFO L290 TraceCheckUtils]: 24: Hoare triple {4987#false} assume !false; {4987#false} is VALID [2022-04-28 03:42:37,937 INFO L290 TraceCheckUtils]: 23: Hoare triple {5085#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4987#false} is VALID [2022-04-28 03:42:37,937 INFO L290 TraceCheckUtils]: 22: Hoare triple {5081#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5085#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:42:37,939 INFO L272 TraceCheckUtils]: 21: Hoare triple {4998#(<= main_~n~0 (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0))} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {5081#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:42:37,940 INFO L290 TraceCheckUtils]: 20: Hoare triple {4998#(<= main_~n~0 (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0))} assume !(~x~0 % 4294967296 > 0); {4998#(<= main_~n~0 (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0))} is VALID [2022-04-28 03:42:37,941 INFO L290 TraceCheckUtils]: 19: Hoare triple {4999#(<= main_~n~0 (+ (* (div (+ (- 1) main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {4998#(<= main_~n~0 (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0))} is VALID [2022-04-28 03:42:37,942 INFO L290 TraceCheckUtils]: 18: Hoare triple {5000#(<= main_~n~0 (+ (* (div (+ (- 2) main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0 2))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {4999#(<= main_~n~0 (+ (* (div (+ (- 1) main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0 1))} is VALID [2022-04-28 03:42:37,943 INFO L290 TraceCheckUtils]: 17: Hoare triple {5001#(<= main_~n~0 (+ main_~y~0 3 (* (div (+ main_~n~0 (- 3) (* (- 1) main_~y~0)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {5000#(<= main_~n~0 (+ (* (div (+ (- 2) main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0 2))} is VALID [2022-04-28 03:42:37,944 INFO L290 TraceCheckUtils]: 16: Hoare triple {5116#(or (<= main_~n~0 (+ main_~y~0 3 (* (div (+ main_~n~0 (- 3) (* (- 1) main_~y~0)) 4294967296) 4294967296))) (< 0 (mod main_~y~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {5001#(<= main_~n~0 (+ main_~y~0 3 (* (div (+ main_~n~0 (- 3) (* (- 1) main_~y~0)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:42:37,945 INFO L290 TraceCheckUtils]: 15: Hoare triple {5120#(or (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (<= main_~n~0 (+ (* (div (+ (- 2) main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~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; {5116#(or (<= main_~n~0 (+ main_~y~0 3 (* (div (+ main_~n~0 (- 3) (* (- 1) main_~y~0)) 4294967296) 4294967296))) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 03:42:37,947 INFO L290 TraceCheckUtils]: 14: Hoare triple {5124#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (<= main_~n~0 (+ (* (div (+ (- 1) main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~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; {5120#(or (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (<= main_~n~0 (+ (* (div (+ (- 2) main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0 2)))} is VALID [2022-04-28 03:42:37,949 INFO L290 TraceCheckUtils]: 13: Hoare triple {5128#(or (<= main_~n~0 (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0)) (< 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; {5124#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (<= main_~n~0 (+ (* (div (+ (- 1) main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0 1)))} is VALID [2022-04-28 03:42:37,949 INFO L290 TraceCheckUtils]: 12: Hoare triple {5132#(or (< 0 (mod main_~z~0 4294967296)) (<= main_~n~0 (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0)) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {5128#(or (<= main_~n~0 (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0)) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-28 03:42:37,951 INFO L290 TraceCheckUtils]: 11: Hoare triple {5136#(or (<= main_~n~0 (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0)) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (< 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; {5132#(or (< 0 (mod main_~z~0 4294967296)) (<= main_~n~0 (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0)) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-28 03:42:37,952 INFO L290 TraceCheckUtils]: 10: Hoare triple {5140#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (<= main_~n~0 (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0)) (< 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; {5136#(or (<= main_~n~0 (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0)) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-28 03:42:37,954 INFO L290 TraceCheckUtils]: 9: Hoare triple {5144#(or (<= main_~n~0 (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0)) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)) (< 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; {5140#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (<= main_~n~0 (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0)) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-28 03:42:37,954 INFO L290 TraceCheckUtils]: 8: Hoare triple {5128#(or (<= main_~n~0 (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0)) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} ~z~0 := ~y~0; {5144#(or (<= main_~n~0 (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0)) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-28 03:42:37,955 INFO L290 TraceCheckUtils]: 7: Hoare triple {5151#(or (<= main_~n~0 (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0)) (< 0 (mod main_~x~0 4294967296)) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} [103] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {5128#(or (<= main_~n~0 (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0)) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-28 03:42:38,277 INFO L290 TraceCheckUtils]: 6: Hoare triple {5155#(forall ((aux_div_v_main_~y~0_174_47 Int) (aux_div_aux_mod_v_main_~y~0_174_47_124 Int) (aux_mod_aux_mod_v_main_~y~0_174_47_124 Int)) (or (< (+ main_~n~0 4294967293) (+ (* 4294967296 aux_div_v_main_~y~0_174_47) (* aux_div_aux_mod_v_main_~y~0_174_47_124 4294967296) aux_mod_aux_mod_v_main_~y~0_174_47_124)) (<= aux_mod_aux_mod_v_main_~y~0_174_47_124 0) (<= 4294967296 aux_mod_aux_mod_v_main_~y~0_174_47_124) (and (or (< (div (+ (- 1) (* (- 1) main_~x~0)) (- 4294967296)) (+ 2 (div (+ (- 1) main_~x~0) 4294967296))) (not (= (+ main_~y~0 (* aux_div_aux_mod_v_main_~y~0_174_47_124 4294967296) aux_mod_aux_mod_v_main_~y~0_174_47_124) main_~n~0))) (or (forall ((aux_div_v_main_~x~0_169_32 Int)) (or (< (+ main_~y~0 main_~x~0 (* aux_div_aux_mod_v_main_~y~0_174_47_124 4294967296) aux_mod_aux_mod_v_main_~y~0_174_47_124) (+ main_~n~0 (* 4294967296 aux_div_v_main_~x~0_169_32))) (< (+ main_~n~0 (* 4294967296 aux_div_v_main_~x~0_169_32)) (+ main_~y~0 main_~x~0 (* aux_div_aux_mod_v_main_~y~0_174_47_124 4294967296) aux_mod_aux_mod_v_main_~y~0_174_47_124)))) (not (< (+ main_~y~0 (* aux_div_aux_mod_v_main_~y~0_174_47_124 4294967296) aux_mod_aux_mod_v_main_~y~0_174_47_124) main_~n~0)) (exists ((v_it_15 Int)) (and (<= 1 v_it_15) (not (< 0 (mod (+ (* 4294967295 v_it_15) main_~x~0) 4294967296))) (<= (+ main_~y~0 v_it_15 (* aux_div_aux_mod_v_main_~y~0_174_47_124 4294967296) aux_mod_aux_mod_v_main_~y~0_174_47_124 1) main_~n~0))) (not (< 0 (mod main_~x~0 4294967296))))) (< (+ (* 4294967296 aux_div_v_main_~y~0_174_47) (* aux_div_aux_mod_v_main_~y~0_174_47_124 4294967296) aux_mod_aux_mod_v_main_~y~0_174_47_124) (+ main_~n~0 4294967293))))} [104] L16-2-->L16-3_primed: Formula: (let ((.cse2 (mod v_main_~x~0_158 4294967296)) (.cse0 (= |v_main_#t~post6_73| |v_main_#t~post6_72|)) (.cse1 (= |v_main_#t~post5_73| |v_main_#t~post5_72|)) (.cse3 (= v_main_~x~0_158 v_main_~x~0_157)) (.cse4 (= v_main_~y~0_157 v_main_~y~0_156))) (or (and .cse0 .cse1 (<= .cse2 0) .cse3 .cse4) (and (< 0 .cse2) (forall ((v_it_15 Int)) (or (< 0 (mod (+ v_main_~x~0_158 (* 4294967295 v_it_15)) 4294967296)) (not (<= (+ v_main_~y~0_157 v_it_15 1) v_main_~y~0_156)) (not (<= 1 v_it_15)))) (< v_main_~y~0_157 v_main_~y~0_156) (= v_main_~x~0_157 (+ v_main_~x~0_158 v_main_~y~0_157 (* (- 1) v_main_~y~0_156)))) (and .cse0 .cse1 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_157, main_#t~post5=|v_main_#t~post5_73|, main_~x~0=v_main_~x~0_158, main_#t~post6=|v_main_#t~post6_73|} OutVars{main_~y~0=v_main_~y~0_156, main_#t~post5=|v_main_#t~post5_72|, main_~x~0=v_main_~x~0_157, main_#t~post6=|v_main_#t~post6_72|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {5151#(or (<= main_~n~0 (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0)) (< 0 (mod main_~x~0 4294967296)) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-28 03:42:38,284 INFO L290 TraceCheckUtils]: 5: Hoare triple {4986#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5155#(forall ((aux_div_v_main_~y~0_174_47 Int) (aux_div_aux_mod_v_main_~y~0_174_47_124 Int) (aux_mod_aux_mod_v_main_~y~0_174_47_124 Int)) (or (< (+ main_~n~0 4294967293) (+ (* 4294967296 aux_div_v_main_~y~0_174_47) (* aux_div_aux_mod_v_main_~y~0_174_47_124 4294967296) aux_mod_aux_mod_v_main_~y~0_174_47_124)) (<= aux_mod_aux_mod_v_main_~y~0_174_47_124 0) (<= 4294967296 aux_mod_aux_mod_v_main_~y~0_174_47_124) (and (or (< (div (+ (- 1) (* (- 1) main_~x~0)) (- 4294967296)) (+ 2 (div (+ (- 1) main_~x~0) 4294967296))) (not (= (+ main_~y~0 (* aux_div_aux_mod_v_main_~y~0_174_47_124 4294967296) aux_mod_aux_mod_v_main_~y~0_174_47_124) main_~n~0))) (or (forall ((aux_div_v_main_~x~0_169_32 Int)) (or (< (+ main_~y~0 main_~x~0 (* aux_div_aux_mod_v_main_~y~0_174_47_124 4294967296) aux_mod_aux_mod_v_main_~y~0_174_47_124) (+ main_~n~0 (* 4294967296 aux_div_v_main_~x~0_169_32))) (< (+ main_~n~0 (* 4294967296 aux_div_v_main_~x~0_169_32)) (+ main_~y~0 main_~x~0 (* aux_div_aux_mod_v_main_~y~0_174_47_124 4294967296) aux_mod_aux_mod_v_main_~y~0_174_47_124)))) (not (< (+ main_~y~0 (* aux_div_aux_mod_v_main_~y~0_174_47_124 4294967296) aux_mod_aux_mod_v_main_~y~0_174_47_124) main_~n~0)) (exists ((v_it_15 Int)) (and (<= 1 v_it_15) (not (< 0 (mod (+ (* 4294967295 v_it_15) main_~x~0) 4294967296))) (<= (+ main_~y~0 v_it_15 (* aux_div_aux_mod_v_main_~y~0_174_47_124 4294967296) aux_mod_aux_mod_v_main_~y~0_174_47_124 1) main_~n~0))) (not (< 0 (mod main_~x~0 4294967296))))) (< (+ (* 4294967296 aux_div_v_main_~y~0_174_47) (* aux_div_aux_mod_v_main_~y~0_174_47_124 4294967296) aux_mod_aux_mod_v_main_~y~0_174_47_124) (+ main_~n~0 4294967293))))} is VALID [2022-04-28 03:42:38,285 INFO L272 TraceCheckUtils]: 4: Hoare triple {4986#true} call #t~ret13 := main(); {4986#true} is VALID [2022-04-28 03:42:38,285 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4986#true} {4986#true} #72#return; {4986#true} is VALID [2022-04-28 03:42:38,285 INFO L290 TraceCheckUtils]: 2: Hoare triple {4986#true} assume true; {4986#true} is VALID [2022-04-28 03:42:38,285 INFO L290 TraceCheckUtils]: 1: Hoare triple {4986#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4986#true} is VALID [2022-04-28 03:42:38,285 INFO L272 TraceCheckUtils]: 0: Hoare triple {4986#true} call ULTIMATE.init(); {4986#true} is VALID [2022-04-28 03:42:38,285 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 03:42:38,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1092790410] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:42:38,286 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:42:38,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 18] total 38 [2022-04-28 03:42:42,390 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:42:42,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [432274019] [2022-04-28 03:42:42,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [432274019] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:42:42,390 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:42:42,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-28 03:42:42,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492364412] [2022-04-28 03:42:42,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:42:42,391 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.3125) 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 25 [2022-04-28 03:42:42,391 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:42:42,391 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), 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 03:42:42,424 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 03:42:42,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-28 03:42:42,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:42:42,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-28 03:42:42,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=252, Invalid=1207, Unknown=23, NotChecked=0, Total=1482 [2022-04-28 03:42:42,425 INFO L87 Difference]: Start difference. First operand 45 states and 55 transitions. Second operand has 16 states, 16 states have (on average 1.3125) 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 03:42:44,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:42:44,854 INFO L93 Difference]: Finished difference Result 70 states and 87 transitions. [2022-04-28 03:42:44,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 03:42:44,855 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.3125) 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 25 [2022-04-28 03:42:44,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:42:44,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.3125) 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 03:42:44,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 41 transitions. [2022-04-28 03:42:44,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.3125) 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 03:42:44,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 41 transitions. [2022-04-28 03:42:44,856 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 41 transitions. [2022-04-28 03:42:44,939 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 03:42:44,940 INFO L225 Difference]: With dead ends: 70 [2022-04-28 03:42:44,940 INFO L226 Difference]: Without dead ends: 61 [2022-04-28 03:42:44,941 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 30 SyntacticMatches, 5 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 631 ImplicationChecksByTransitivity, 84.8s TimeCoverageRelationStatistics Valid=314, Invalid=1825, Unknown=23, NotChecked=0, Total=2162 [2022-04-28 03:42:44,941 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 26 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 64 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 03:42:44,941 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 65 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 173 Invalid, 0 Unknown, 64 Unchecked, 0.5s Time] [2022-04-28 03:42:44,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-04-28 03:42:45,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 52. [2022-04-28 03:42:45,123 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:42:45,123 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand has 52 states, 47 states have (on average 1.3404255319148937) internal successors, (63), 47 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 03:42:45,123 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand has 52 states, 47 states have (on average 1.3404255319148937) internal successors, (63), 47 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 03:42:45,123 INFO L87 Difference]: Start difference. First operand 61 states. Second operand has 52 states, 47 states have (on average 1.3404255319148937) internal successors, (63), 47 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 03:42:45,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:42:45,124 INFO L93 Difference]: Finished difference Result 61 states and 77 transitions. [2022-04-28 03:42:45,124 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 77 transitions. [2022-04-28 03:42:45,124 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:42:45,124 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:42:45,124 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 47 states have (on average 1.3404255319148937) internal successors, (63), 47 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 61 states. [2022-04-28 03:42:45,124 INFO L87 Difference]: Start difference. First operand has 52 states, 47 states have (on average 1.3404255319148937) internal successors, (63), 47 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 61 states. [2022-04-28 03:42:45,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:42:45,125 INFO L93 Difference]: Finished difference Result 61 states and 77 transitions. [2022-04-28 03:42:45,125 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 77 transitions. [2022-04-28 03:42:45,125 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:42:45,125 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:42:45,126 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:42:45,126 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:42:45,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 47 states have (on average 1.3404255319148937) internal successors, (63), 47 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 03:42:45,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 67 transitions. [2022-04-28 03:42:45,126 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 67 transitions. Word has length 25 [2022-04-28 03:42:45,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:42:45,127 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 67 transitions. [2022-04-28 03:42:45,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.3125) 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 03:42:45,127 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 67 transitions. [2022-04-28 03:42:49,741 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 65 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-28 03:42:49,741 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 67 transitions. [2022-04-28 03:42:49,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-28 03:42:49,742 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:42:49,742 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:42:49,758 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 03:42:49,942 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,SelfDestructingSolverStorable16 [2022-04-28 03:42:49,942 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:42:49,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:42:49,943 INFO L85 PathProgramCache]: Analyzing trace with hash -713708184, now seen corresponding path program 10 times [2022-04-28 03:42:49,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:42:49,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1391109589] [2022-04-28 03:42:54,072 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:42:54,195 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:42:54,198 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:42:54,200 INFO L85 PathProgramCache]: Analyzing trace with hash -563822681, now seen corresponding path program 1 times [2022-04-28 03:42:54,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:42:54,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137667951] [2022-04-28 03:42:54,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:42:54,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:42:54,208 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_16.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:42:54,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:42:54,225 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_16.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:42:54,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:42:54,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:42:54,504 INFO L290 TraceCheckUtils]: 0: Hoare triple {5571#(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); {5559#true} is VALID [2022-04-28 03:42:54,504 INFO L290 TraceCheckUtils]: 1: Hoare triple {5559#true} assume true; {5559#true} is VALID [2022-04-28 03:42:54,504 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5559#true} {5559#true} #72#return; {5559#true} is VALID [2022-04-28 03:42:54,504 INFO L272 TraceCheckUtils]: 0: Hoare triple {5559#true} call ULTIMATE.init(); {5571#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:42:54,504 INFO L290 TraceCheckUtils]: 1: Hoare triple {5571#(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); {5559#true} is VALID [2022-04-28 03:42:54,505 INFO L290 TraceCheckUtils]: 2: Hoare triple {5559#true} assume true; {5559#true} is VALID [2022-04-28 03:42:54,505 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5559#true} {5559#true} #72#return; {5559#true} is VALID [2022-04-28 03:42:54,505 INFO L272 TraceCheckUtils]: 4: Hoare triple {5559#true} call #t~ret13 := main(); {5559#true} is VALID [2022-04-28 03:42:54,505 INFO L290 TraceCheckUtils]: 5: Hoare triple {5559#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5559#true} is VALID [2022-04-28 03:42:54,505 INFO L290 TraceCheckUtils]: 6: Hoare triple {5559#true} [106] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_174 4294967296)) (.cse1 (= v_main_~x~0_174 v_main_~x~0_173)) (.cse2 (= v_main_~y~0_179 v_main_~y~0_178)) (.cse3 (= |v_main_#t~post6_80| |v_main_#t~post6_79|))) (or (and (<= .cse0 0) .cse1 .cse2 (= |v_main_#t~post5_79| |v_main_#t~post5_80|) .cse3) (and (forall ((v_it_16 Int)) (or (not (<= (+ v_main_~x~0_173 v_it_16 1) v_main_~x~0_174)) (< 0 (mod (+ v_main_~x~0_174 (* 4294967295 v_it_16)) 4294967296)) (not (<= 1 v_it_16)))) (< 0 .cse0) (= v_main_~y~0_178 (+ v_main_~x~0_174 v_main_~y~0_179 (* v_main_~x~0_173 (- 1)))) (< v_main_~x~0_173 v_main_~x~0_174)) (and .cse1 .cse2 (= |v_main_#t~post5_80| |v_main_#t~post5_79|) .cse3))) InVars {main_~y~0=v_main_~y~0_179, main_#t~post5=|v_main_#t~post5_80|, main_~x~0=v_main_~x~0_174, main_#t~post6=|v_main_#t~post6_80|} OutVars{main_~y~0=v_main_~y~0_178, main_#t~post5=|v_main_#t~post5_79|, main_~x~0=v_main_~x~0_173, main_#t~post6=|v_main_#t~post6_79|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {5559#true} is VALID [2022-04-28 03:42:54,505 INFO L290 TraceCheckUtils]: 7: Hoare triple {5559#true} [105] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {5564#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:42:54,506 INFO L290 TraceCheckUtils]: 8: Hoare triple {5564#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {5564#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:42:54,507 INFO L290 TraceCheckUtils]: 9: Hoare triple {5564#(<= main_~x~0 (* 4294967296 (div main_~x~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; {5565#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:42:54,508 INFO L290 TraceCheckUtils]: 10: Hoare triple {5565#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 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; {5566#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:42:54,509 INFO L290 TraceCheckUtils]: 11: Hoare triple {5566#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~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; {5567#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:42:54,510 INFO L290 TraceCheckUtils]: 12: Hoare triple {5567#(<= main_~x~0 (+ 3 (* (div (+ main_~x~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; {5568#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:42:54,511 INFO L290 TraceCheckUtils]: 13: Hoare triple {5568#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 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; {5569#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 03:42:54,512 INFO L290 TraceCheckUtils]: 14: Hoare triple {5569#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !(~z~0 % 4294967296 > 0); {5569#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 03:42:54,512 INFO L290 TraceCheckUtils]: 15: Hoare triple {5569#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5569#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 03:42:54,512 INFO L290 TraceCheckUtils]: 16: Hoare triple {5569#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5569#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 03:42:54,513 INFO L290 TraceCheckUtils]: 17: Hoare triple {5569#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {5569#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 03:42:54,513 INFO L290 TraceCheckUtils]: 18: Hoare triple {5569#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !(~y~0 % 4294967296 > 0); {5569#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 03:42:54,514 INFO L290 TraceCheckUtils]: 19: Hoare triple {5569#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {5570#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 03:42:54,515 INFO L290 TraceCheckUtils]: 20: Hoare triple {5570#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {5560#false} is VALID [2022-04-28 03:42:54,515 INFO L272 TraceCheckUtils]: 21: Hoare triple {5560#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {5560#false} is VALID [2022-04-28 03:42:54,515 INFO L290 TraceCheckUtils]: 22: Hoare triple {5560#false} ~cond := #in~cond; {5560#false} is VALID [2022-04-28 03:42:54,515 INFO L290 TraceCheckUtils]: 23: Hoare triple {5560#false} assume 0 == ~cond; {5560#false} is VALID [2022-04-28 03:42:54,515 INFO L290 TraceCheckUtils]: 24: Hoare triple {5560#false} assume !false; {5560#false} is VALID [2022-04-28 03:42:54,515 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-28 03:42:54,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:42:54,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137667951] [2022-04-28 03:42:54,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137667951] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:42:54,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1608436100] [2022-04-28 03:42:54,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:42:54,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:42:54,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:42:54,517 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 03:42:54,518 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 03:42:54,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:42:54,552 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-28 03:42:54,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:42:54,559 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:42:55,088 INFO L272 TraceCheckUtils]: 0: Hoare triple {5559#true} call ULTIMATE.init(); {5559#true} is VALID [2022-04-28 03:42:55,088 INFO L290 TraceCheckUtils]: 1: Hoare triple {5559#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5559#true} is VALID [2022-04-28 03:42:55,088 INFO L290 TraceCheckUtils]: 2: Hoare triple {5559#true} assume true; {5559#true} is VALID [2022-04-28 03:42:55,088 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5559#true} {5559#true} #72#return; {5559#true} is VALID [2022-04-28 03:42:55,088 INFO L272 TraceCheckUtils]: 4: Hoare triple {5559#true} call #t~ret13 := main(); {5559#true} is VALID [2022-04-28 03:42:55,088 INFO L290 TraceCheckUtils]: 5: Hoare triple {5559#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5559#true} is VALID [2022-04-28 03:42:55,088 INFO L290 TraceCheckUtils]: 6: Hoare triple {5559#true} [106] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_174 4294967296)) (.cse1 (= v_main_~x~0_174 v_main_~x~0_173)) (.cse2 (= v_main_~y~0_179 v_main_~y~0_178)) (.cse3 (= |v_main_#t~post6_80| |v_main_#t~post6_79|))) (or (and (<= .cse0 0) .cse1 .cse2 (= |v_main_#t~post5_79| |v_main_#t~post5_80|) .cse3) (and (forall ((v_it_16 Int)) (or (not (<= (+ v_main_~x~0_173 v_it_16 1) v_main_~x~0_174)) (< 0 (mod (+ v_main_~x~0_174 (* 4294967295 v_it_16)) 4294967296)) (not (<= 1 v_it_16)))) (< 0 .cse0) (= v_main_~y~0_178 (+ v_main_~x~0_174 v_main_~y~0_179 (* v_main_~x~0_173 (- 1)))) (< v_main_~x~0_173 v_main_~x~0_174)) (and .cse1 .cse2 (= |v_main_#t~post5_80| |v_main_#t~post5_79|) .cse3))) InVars {main_~y~0=v_main_~y~0_179, main_#t~post5=|v_main_#t~post5_80|, main_~x~0=v_main_~x~0_174, main_#t~post6=|v_main_#t~post6_80|} OutVars{main_~y~0=v_main_~y~0_178, main_#t~post5=|v_main_#t~post5_79|, main_~x~0=v_main_~x~0_173, main_#t~post6=|v_main_#t~post6_79|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {5559#true} is VALID [2022-04-28 03:42:55,088 INFO L290 TraceCheckUtils]: 7: Hoare triple {5559#true} [105] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {5559#true} is VALID [2022-04-28 03:42:55,089 INFO L290 TraceCheckUtils]: 8: Hoare triple {5559#true} ~z~0 := ~y~0; {5599#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 03:42:55,089 INFO L290 TraceCheckUtils]: 9: Hoare triple {5599#(= 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; {5603#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-28 03:42:55,090 INFO L290 TraceCheckUtils]: 10: Hoare triple {5603#(= 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; {5607#(= (+ main_~z~0 1) (+ (- 1) main_~y~0))} is VALID [2022-04-28 03:42:55,091 INFO L290 TraceCheckUtils]: 11: Hoare triple {5607#(= (+ 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; {5611#(= (+ (- 2) main_~y~0) (+ main_~z~0 1))} is VALID [2022-04-28 03:42:55,092 INFO L290 TraceCheckUtils]: 12: Hoare triple {5611#(= (+ (- 2) 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; {5615#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 03:42:55,092 INFO L290 TraceCheckUtils]: 13: Hoare triple {5615#(< 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; {5615#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 03:42:55,093 INFO L290 TraceCheckUtils]: 14: Hoare triple {5615#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !(~z~0 % 4294967296 > 0); {5615#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 03:42:55,094 INFO L290 TraceCheckUtils]: 15: Hoare triple {5615#(< 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; {5625#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 03:42:55,095 INFO L290 TraceCheckUtils]: 16: Hoare triple {5625#(< 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; {5629#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 03:42:55,096 INFO L290 TraceCheckUtils]: 17: Hoare triple {5629#(< 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; {5633#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:42:55,096 INFO L290 TraceCheckUtils]: 18: Hoare triple {5633#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {5560#false} is VALID [2022-04-28 03:42:55,096 INFO L290 TraceCheckUtils]: 19: Hoare triple {5560#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {5560#false} is VALID [2022-04-28 03:42:55,096 INFO L290 TraceCheckUtils]: 20: Hoare triple {5560#false} assume !(~x~0 % 4294967296 > 0); {5560#false} is VALID [2022-04-28 03:42:55,096 INFO L272 TraceCheckUtils]: 21: Hoare triple {5560#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {5560#false} is VALID [2022-04-28 03:42:55,096 INFO L290 TraceCheckUtils]: 22: Hoare triple {5560#false} ~cond := #in~cond; {5560#false} is VALID [2022-04-28 03:42:55,096 INFO L290 TraceCheckUtils]: 23: Hoare triple {5560#false} assume 0 == ~cond; {5560#false} is VALID [2022-04-28 03:42:55,096 INFO L290 TraceCheckUtils]: 24: Hoare triple {5560#false} assume !false; {5560#false} is VALID [2022-04-28 03:42:55,096 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:42:55,096 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:42:55,609 INFO L290 TraceCheckUtils]: 24: Hoare triple {5560#false} assume !false; {5560#false} is VALID [2022-04-28 03:42:55,610 INFO L290 TraceCheckUtils]: 23: Hoare triple {5560#false} assume 0 == ~cond; {5560#false} is VALID [2022-04-28 03:42:55,610 INFO L290 TraceCheckUtils]: 22: Hoare triple {5560#false} ~cond := #in~cond; {5560#false} is VALID [2022-04-28 03:42:55,610 INFO L272 TraceCheckUtils]: 21: Hoare triple {5560#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {5560#false} is VALID [2022-04-28 03:42:55,610 INFO L290 TraceCheckUtils]: 20: Hoare triple {5560#false} assume !(~x~0 % 4294967296 > 0); {5560#false} is VALID [2022-04-28 03:42:55,610 INFO L290 TraceCheckUtils]: 19: Hoare triple {5560#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {5560#false} is VALID [2022-04-28 03:42:55,610 INFO L290 TraceCheckUtils]: 18: Hoare triple {5633#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {5560#false} is VALID [2022-04-28 03:42:55,612 INFO L290 TraceCheckUtils]: 17: Hoare triple {5629#(< 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; {5633#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:42:55,613 INFO L290 TraceCheckUtils]: 16: Hoare triple {5625#(< 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; {5629#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 03:42:55,614 INFO L290 TraceCheckUtils]: 15: Hoare triple {5615#(< 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; {5625#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 03:42:55,614 INFO L290 TraceCheckUtils]: 14: Hoare triple {5615#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !(~z~0 % 4294967296 > 0); {5615#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 03:42:55,615 INFO L290 TraceCheckUtils]: 13: Hoare triple {5615#(< 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; {5615#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 03:42:55,615 INFO L290 TraceCheckUtils]: 12: Hoare triple {5691#(or (not (< 0 (mod main_~z~0 4294967296))) (< 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; {5615#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 03:42:55,617 INFO L290 TraceCheckUtils]: 11: Hoare triple {5695#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 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; {5691#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-28 03:42:55,619 INFO L290 TraceCheckUtils]: 10: Hoare triple {5699#(or (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))) (< 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; {5695#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-28 03:42:55,620 INFO L290 TraceCheckUtils]: 9: Hoare triple {5703#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 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; {5699#(or (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-28 03:42:55,621 INFO L290 TraceCheckUtils]: 8: Hoare triple {5559#true} ~z~0 := ~y~0; {5703#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-28 03:42:55,621 INFO L290 TraceCheckUtils]: 7: Hoare triple {5559#true} [105] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {5559#true} is VALID [2022-04-28 03:42:55,621 INFO L290 TraceCheckUtils]: 6: Hoare triple {5559#true} [106] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_174 4294967296)) (.cse1 (= v_main_~x~0_174 v_main_~x~0_173)) (.cse2 (= v_main_~y~0_179 v_main_~y~0_178)) (.cse3 (= |v_main_#t~post6_80| |v_main_#t~post6_79|))) (or (and (<= .cse0 0) .cse1 .cse2 (= |v_main_#t~post5_79| |v_main_#t~post5_80|) .cse3) (and (forall ((v_it_16 Int)) (or (not (<= (+ v_main_~x~0_173 v_it_16 1) v_main_~x~0_174)) (< 0 (mod (+ v_main_~x~0_174 (* 4294967295 v_it_16)) 4294967296)) (not (<= 1 v_it_16)))) (< 0 .cse0) (= v_main_~y~0_178 (+ v_main_~x~0_174 v_main_~y~0_179 (* v_main_~x~0_173 (- 1)))) (< v_main_~x~0_173 v_main_~x~0_174)) (and .cse1 .cse2 (= |v_main_#t~post5_80| |v_main_#t~post5_79|) .cse3))) InVars {main_~y~0=v_main_~y~0_179, main_#t~post5=|v_main_#t~post5_80|, main_~x~0=v_main_~x~0_174, main_#t~post6=|v_main_#t~post6_80|} OutVars{main_~y~0=v_main_~y~0_178, main_#t~post5=|v_main_#t~post5_79|, main_~x~0=v_main_~x~0_173, main_#t~post6=|v_main_#t~post6_79|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {5559#true} is VALID [2022-04-28 03:42:55,621 INFO L290 TraceCheckUtils]: 5: Hoare triple {5559#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5559#true} is VALID [2022-04-28 03:42:55,621 INFO L272 TraceCheckUtils]: 4: Hoare triple {5559#true} call #t~ret13 := main(); {5559#true} is VALID [2022-04-28 03:42:55,621 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5559#true} {5559#true} #72#return; {5559#true} is VALID [2022-04-28 03:42:55,621 INFO L290 TraceCheckUtils]: 2: Hoare triple {5559#true} assume true; {5559#true} is VALID [2022-04-28 03:42:55,621 INFO L290 TraceCheckUtils]: 1: Hoare triple {5559#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5559#true} is VALID [2022-04-28 03:42:55,621 INFO L272 TraceCheckUtils]: 0: Hoare triple {5559#true} call ULTIMATE.init(); {5559#true} is VALID [2022-04-28 03:42:55,621 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:42:55,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1608436100] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:42:55,622 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:42:55,622 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 22 [2022-04-28 03:42:55,712 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:42:55,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1391109589] [2022-04-28 03:42:55,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1391109589] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:42:55,713 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:42:55,713 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 03:42:55,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721065715] [2022-04-28 03:42:55,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:42:55,713 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 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 25 [2022-04-28 03:42:55,713 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:42:55,713 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 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 03:42:55,734 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 03:42:55,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 03:42:55,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:42:55,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 03:42:55,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=447, Unknown=0, NotChecked=0, Total=506 [2022-04-28 03:42:55,735 INFO L87 Difference]: Start difference. First operand 52 states and 67 transitions. Second operand has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 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 03:42:57,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:42:57,844 INFO L93 Difference]: Finished difference Result 83 states and 113 transitions. [2022-04-28 03:42:57,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 03:42:57,844 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 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 25 [2022-04-28 03:42:57,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:42:57,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 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 03:42:57,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 65 transitions. [2022-04-28 03:42:57,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 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 03:42:57,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 65 transitions. [2022-04-28 03:42:57,846 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 65 transitions. [2022-04-28 03:42:57,927 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 03:42:57,928 INFO L225 Difference]: With dead ends: 83 [2022-04-28 03:42:57,928 INFO L226 Difference]: Without dead ends: 77 [2022-04-28 03:42:57,928 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=116, Invalid=876, Unknown=0, NotChecked=0, Total=992 [2022-04-28 03:42:57,928 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 56 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 03:42:57,929 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 53 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 03:42:57,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-04-28 03:42:58,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 58. [2022-04-28 03:42:58,138 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:42:58,138 INFO L82 GeneralOperation]: Start isEquivalent. First operand 77 states. Second operand has 58 states, 53 states have (on average 1.3396226415094339) internal successors, (71), 53 states have internal predecessors, (71), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:58,138 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand has 58 states, 53 states have (on average 1.3396226415094339) internal successors, (71), 53 states have internal predecessors, (71), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:58,139 INFO L87 Difference]: Start difference. First operand 77 states. Second operand has 58 states, 53 states have (on average 1.3396226415094339) internal successors, (71), 53 states have internal predecessors, (71), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:58,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:42:58,140 INFO L93 Difference]: Finished difference Result 77 states and 98 transitions. [2022-04-28 03:42:58,140 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 98 transitions. [2022-04-28 03:42:58,140 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:42:58,140 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:42:58,140 INFO L74 IsIncluded]: Start isIncluded. First operand has 58 states, 53 states have (on average 1.3396226415094339) internal successors, (71), 53 states have internal predecessors, (71), 3 states have call successors, (3), 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 03:42:58,140 INFO L87 Difference]: Start difference. First operand has 58 states, 53 states have (on average 1.3396226415094339) internal successors, (71), 53 states have internal predecessors, (71), 3 states have call successors, (3), 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 03:42:58,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:42:58,141 INFO L93 Difference]: Finished difference Result 77 states and 98 transitions. [2022-04-28 03:42:58,141 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 98 transitions. [2022-04-28 03:42:58,141 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:42:58,141 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:42:58,141 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:42:58,141 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:42:58,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 53 states have (on average 1.3396226415094339) internal successors, (71), 53 states have internal predecessors, (71), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:42:58,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 75 transitions. [2022-04-28 03:42:58,142 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 75 transitions. Word has length 25 [2022-04-28 03:42:58,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:42:58,142 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 75 transitions. [2022-04-28 03:42:58,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 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 03:42:58,142 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 58 states and 75 transitions. [2022-04-28 03:43:02,792 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 73 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-28 03:43:02,793 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 75 transitions. [2022-04-28 03:43:02,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-28 03:43:02,793 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:43:02,793 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:43:02,809 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-04-28 03:43:03,007 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,SelfDestructingSolverStorable17 [2022-04-28 03:43:03,008 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:43:03,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:43:03,008 INFO L85 PathProgramCache]: Analyzing trace with hash -652223103, now seen corresponding path program 11 times [2022-04-28 03:43:03,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:43:03,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1429338662] [2022-04-28 03:43:03,273 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:43:03,274 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:43:03,276 INFO L85 PathProgramCache]: Analyzing trace with hash 1487635298, now seen corresponding path program 1 times [2022-04-28 03:43:03,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:43:03,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260308509] [2022-04-28 03:43:03,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:43:03,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:43:03,284 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_17.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:43:03,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:43:03,296 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_17.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:43:03,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:43:03,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:43:03,649 INFO L290 TraceCheckUtils]: 0: Hoare triple {6201#(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); {6188#true} is VALID [2022-04-28 03:43:03,649 INFO L290 TraceCheckUtils]: 1: Hoare triple {6188#true} assume true; {6188#true} is VALID [2022-04-28 03:43:03,649 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6188#true} {6188#true} #72#return; {6188#true} is VALID [2022-04-28 03:43:03,650 INFO L272 TraceCheckUtils]: 0: Hoare triple {6188#true} call ULTIMATE.init(); {6201#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:43:03,650 INFO L290 TraceCheckUtils]: 1: Hoare triple {6201#(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); {6188#true} is VALID [2022-04-28 03:43:03,650 INFO L290 TraceCheckUtils]: 2: Hoare triple {6188#true} assume true; {6188#true} is VALID [2022-04-28 03:43:03,650 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6188#true} {6188#true} #72#return; {6188#true} is VALID [2022-04-28 03:43:03,650 INFO L272 TraceCheckUtils]: 4: Hoare triple {6188#true} call #t~ret13 := main(); {6188#true} is VALID [2022-04-28 03:43:03,650 INFO L290 TraceCheckUtils]: 5: Hoare triple {6188#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {6188#true} is VALID [2022-04-28 03:43:03,650 INFO L290 TraceCheckUtils]: 6: Hoare triple {6188#true} [108] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_193 v_main_~y~0_192)) (.cse1 (= |v_main_#t~post5_85| |v_main_#t~post5_84|)) (.cse2 (= |v_main_#t~post6_85| |v_main_#t~post6_84|)) (.cse3 (= v_main_~x~0_187 v_main_~x~0_186)) (.cse4 (mod v_main_~x~0_187 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 (<= .cse4 0) .cse1 .cse2 .cse3) (and (< v_main_~x~0_186 v_main_~x~0_187) (< 0 .cse4) (forall ((v_it_17 Int)) (or (< 0 (mod (+ v_main_~x~0_187 (* 4294967295 v_it_17)) 4294967296)) (not (<= (+ v_main_~x~0_186 v_it_17 1) v_main_~x~0_187)) (not (<= 1 v_it_17)))) (= (+ v_main_~x~0_187 v_main_~y~0_193 (* v_main_~x~0_186 (- 1))) v_main_~y~0_192)))) InVars {main_~y~0=v_main_~y~0_193, main_#t~post5=|v_main_#t~post5_85|, main_~x~0=v_main_~x~0_187, main_#t~post6=|v_main_#t~post6_85|} OutVars{main_~y~0=v_main_~y~0_192, main_#t~post5=|v_main_#t~post5_84|, main_~x~0=v_main_~x~0_186, main_#t~post6=|v_main_#t~post6_84|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {6188#true} is VALID [2022-04-28 03:43:03,650 INFO L290 TraceCheckUtils]: 7: Hoare triple {6188#true} [107] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {6188#true} is VALID [2022-04-28 03:43:03,651 INFO L290 TraceCheckUtils]: 8: Hoare triple {6188#true} ~z~0 := ~y~0; {6193#(= (+ main_~z~0 (* (- 1) main_~y~0)) 0)} is VALID [2022-04-28 03:43:03,652 INFO L290 TraceCheckUtils]: 9: Hoare triple {6193#(= (+ main_~z~0 (* (- 1) main_~y~0)) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6194#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-28 03:43:03,652 INFO L290 TraceCheckUtils]: 10: Hoare triple {6194#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 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; {6195#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-28 03:43:03,653 INFO L290 TraceCheckUtils]: 11: Hoare triple {6195#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) 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; {6196#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-28 03:43:03,654 INFO L290 TraceCheckUtils]: 12: Hoare triple {6196#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} assume !(~z~0 % 4294967296 > 0); {6197#(and (<= (+ 3 (* (div main_~z~0 4294967296) 4294967296)) main_~y~0) (<= main_~y~0 (+ 3 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-28 03:43:03,656 INFO L290 TraceCheckUtils]: 13: Hoare triple {6197#(and (<= (+ 3 (* (div main_~z~0 4294967296) 4294967296)) main_~y~0) (<= main_~y~0 (+ 3 (* (div 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; {6198#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:43:03,658 INFO L290 TraceCheckUtils]: 14: Hoare triple {6198#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~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; {6199#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-28 03:43:03,659 INFO L290 TraceCheckUtils]: 15: Hoare triple {6199#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 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; {6200#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:43:03,660 INFO L290 TraceCheckUtils]: 16: Hoare triple {6200#(<= main_~y~0 (* (div main_~y~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; {6189#false} is VALID [2022-04-28 03:43:03,660 INFO L290 TraceCheckUtils]: 17: Hoare triple {6189#false} assume !(~y~0 % 4294967296 > 0); {6189#false} is VALID [2022-04-28 03:43:03,660 INFO L290 TraceCheckUtils]: 18: Hoare triple {6189#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {6189#false} is VALID [2022-04-28 03:43:03,660 INFO L290 TraceCheckUtils]: 19: Hoare triple {6189#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {6189#false} is VALID [2022-04-28 03:43:03,660 INFO L290 TraceCheckUtils]: 20: Hoare triple {6189#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {6189#false} is VALID [2022-04-28 03:43:03,660 INFO L290 TraceCheckUtils]: 21: Hoare triple {6189#false} assume !(~x~0 % 4294967296 > 0); {6189#false} is VALID [2022-04-28 03:43:03,660 INFO L272 TraceCheckUtils]: 22: Hoare triple {6189#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {6189#false} is VALID [2022-04-28 03:43:03,660 INFO L290 TraceCheckUtils]: 23: Hoare triple {6189#false} ~cond := #in~cond; {6189#false} is VALID [2022-04-28 03:43:03,660 INFO L290 TraceCheckUtils]: 24: Hoare triple {6189#false} assume 0 == ~cond; {6189#false} is VALID [2022-04-28 03:43:03,660 INFO L290 TraceCheckUtils]: 25: Hoare triple {6189#false} assume !false; {6189#false} is VALID [2022-04-28 03:43:03,660 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-28 03:43:03,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:43:03,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260308509] [2022-04-28 03:43:03,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260308509] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:43:03,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [240983824] [2022-04-28 03:43:03,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:43:03,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:43:03,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:43:03,662 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 03:43:03,662 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 03:43:03,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:43:03,699 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-28 03:43:03,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:43:03,706 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:43:04,063 INFO L272 TraceCheckUtils]: 0: Hoare triple {6188#true} call ULTIMATE.init(); {6188#true} is VALID [2022-04-28 03:43:04,063 INFO L290 TraceCheckUtils]: 1: Hoare triple {6188#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {6188#true} is VALID [2022-04-28 03:43:04,063 INFO L290 TraceCheckUtils]: 2: Hoare triple {6188#true} assume true; {6188#true} is VALID [2022-04-28 03:43:04,063 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6188#true} {6188#true} #72#return; {6188#true} is VALID [2022-04-28 03:43:04,063 INFO L272 TraceCheckUtils]: 4: Hoare triple {6188#true} call #t~ret13 := main(); {6188#true} is VALID [2022-04-28 03:43:04,063 INFO L290 TraceCheckUtils]: 5: Hoare triple {6188#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {6188#true} is VALID [2022-04-28 03:43:04,063 INFO L290 TraceCheckUtils]: 6: Hoare triple {6188#true} [108] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_193 v_main_~y~0_192)) (.cse1 (= |v_main_#t~post5_85| |v_main_#t~post5_84|)) (.cse2 (= |v_main_#t~post6_85| |v_main_#t~post6_84|)) (.cse3 (= v_main_~x~0_187 v_main_~x~0_186)) (.cse4 (mod v_main_~x~0_187 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 (<= .cse4 0) .cse1 .cse2 .cse3) (and (< v_main_~x~0_186 v_main_~x~0_187) (< 0 .cse4) (forall ((v_it_17 Int)) (or (< 0 (mod (+ v_main_~x~0_187 (* 4294967295 v_it_17)) 4294967296)) (not (<= (+ v_main_~x~0_186 v_it_17 1) v_main_~x~0_187)) (not (<= 1 v_it_17)))) (= (+ v_main_~x~0_187 v_main_~y~0_193 (* v_main_~x~0_186 (- 1))) v_main_~y~0_192)))) InVars {main_~y~0=v_main_~y~0_193, main_#t~post5=|v_main_#t~post5_85|, main_~x~0=v_main_~x~0_187, main_#t~post6=|v_main_#t~post6_85|} OutVars{main_~y~0=v_main_~y~0_192, main_#t~post5=|v_main_#t~post5_84|, main_~x~0=v_main_~x~0_186, main_#t~post6=|v_main_#t~post6_84|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {6188#true} is VALID [2022-04-28 03:43:04,064 INFO L290 TraceCheckUtils]: 7: Hoare triple {6188#true} [107] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {6188#true} is VALID [2022-04-28 03:43:04,064 INFO L290 TraceCheckUtils]: 8: Hoare triple {6188#true} ~z~0 := ~y~0; {6193#(= (+ main_~z~0 (* (- 1) main_~y~0)) 0)} is VALID [2022-04-28 03:43:04,065 INFO L290 TraceCheckUtils]: 9: Hoare triple {6193#(= (+ main_~z~0 (* (- 1) main_~y~0)) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6194#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-28 03:43:04,065 INFO L290 TraceCheckUtils]: 10: Hoare triple {6194#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 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; {6195#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-28 03:43:04,066 INFO L290 TraceCheckUtils]: 11: Hoare triple {6195#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) 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; {6196#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-28 03:43:04,067 INFO L290 TraceCheckUtils]: 12: Hoare triple {6196#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} assume !(~z~0 % 4294967296 > 0); {6241#(<= (div (+ 3 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ main_~y~0 (- 3)) 4294967296))} is VALID [2022-04-28 03:43:04,069 INFO L290 TraceCheckUtils]: 13: Hoare triple {6241#(<= (div (+ 3 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ main_~y~0 (- 3)) 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; {6198#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:43:04,070 INFO L290 TraceCheckUtils]: 14: Hoare triple {6198#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~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; {6199#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-28 03:43:04,071 INFO L290 TraceCheckUtils]: 15: Hoare triple {6199#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 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; {6200#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:43:04,071 INFO L290 TraceCheckUtils]: 16: Hoare triple {6200#(<= main_~y~0 (* (div main_~y~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; {6189#false} is VALID [2022-04-28 03:43:04,071 INFO L290 TraceCheckUtils]: 17: Hoare triple {6189#false} assume !(~y~0 % 4294967296 > 0); {6189#false} is VALID [2022-04-28 03:43:04,071 INFO L290 TraceCheckUtils]: 18: Hoare triple {6189#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {6189#false} is VALID [2022-04-28 03:43:04,071 INFO L290 TraceCheckUtils]: 19: Hoare triple {6189#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {6189#false} is VALID [2022-04-28 03:43:04,072 INFO L290 TraceCheckUtils]: 20: Hoare triple {6189#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {6189#false} is VALID [2022-04-28 03:43:04,072 INFO L290 TraceCheckUtils]: 21: Hoare triple {6189#false} assume !(~x~0 % 4294967296 > 0); {6189#false} is VALID [2022-04-28 03:43:04,072 INFO L272 TraceCheckUtils]: 22: Hoare triple {6189#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {6189#false} is VALID [2022-04-28 03:43:04,072 INFO L290 TraceCheckUtils]: 23: Hoare triple {6189#false} ~cond := #in~cond; {6189#false} is VALID [2022-04-28 03:43:04,072 INFO L290 TraceCheckUtils]: 24: Hoare triple {6189#false} assume 0 == ~cond; {6189#false} is VALID [2022-04-28 03:43:04,072 INFO L290 TraceCheckUtils]: 25: Hoare triple {6189#false} assume !false; {6189#false} is VALID [2022-04-28 03:43:04,072 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-28 03:43:04,072 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:43:05,277 INFO L290 TraceCheckUtils]: 25: Hoare triple {6189#false} assume !false; {6189#false} is VALID [2022-04-28 03:43:05,277 INFO L290 TraceCheckUtils]: 24: Hoare triple {6189#false} assume 0 == ~cond; {6189#false} is VALID [2022-04-28 03:43:05,277 INFO L290 TraceCheckUtils]: 23: Hoare triple {6189#false} ~cond := #in~cond; {6189#false} is VALID [2022-04-28 03:43:05,277 INFO L272 TraceCheckUtils]: 22: Hoare triple {6189#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {6189#false} is VALID [2022-04-28 03:43:05,277 INFO L290 TraceCheckUtils]: 21: Hoare triple {6189#false} assume !(~x~0 % 4294967296 > 0); {6189#false} is VALID [2022-04-28 03:43:05,277 INFO L290 TraceCheckUtils]: 20: Hoare triple {6189#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {6189#false} is VALID [2022-04-28 03:43:05,277 INFO L290 TraceCheckUtils]: 19: Hoare triple {6189#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {6189#false} is VALID [2022-04-28 03:43:05,277 INFO L290 TraceCheckUtils]: 18: Hoare triple {6189#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {6189#false} is VALID [2022-04-28 03:43:05,277 INFO L290 TraceCheckUtils]: 17: Hoare triple {6189#false} assume !(~y~0 % 4294967296 > 0); {6189#false} is VALID [2022-04-28 03:43:05,279 INFO L290 TraceCheckUtils]: 16: Hoare triple {6200#(<= main_~y~0 (* (div main_~y~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; {6189#false} is VALID [2022-04-28 03:43:05,280 INFO L290 TraceCheckUtils]: 15: Hoare triple {6199#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 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; {6200#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:43:05,281 INFO L290 TraceCheckUtils]: 14: Hoare triple {6198#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~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; {6199#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-28 03:43:05,283 INFO L290 TraceCheckUtils]: 13: Hoare triple {6241#(<= (div (+ 3 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ main_~y~0 (- 3)) 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; {6198#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:43:05,284 INFO L290 TraceCheckUtils]: 12: Hoare triple {6320#(or (< 0 (mod main_~z~0 4294967296)) (<= (div (+ 3 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ main_~y~0 (- 3)) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {6241#(<= (div (+ 3 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ main_~y~0 (- 3)) 4294967296))} is VALID [2022-04-28 03:43:05,286 INFO L290 TraceCheckUtils]: 11: Hoare triple {6324#(or (<= (div (+ 3 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ main_~y~0 (- 3)) 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; {6320#(or (< 0 (mod main_~z~0 4294967296)) (<= (div (+ 3 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ main_~y~0 (- 3)) 4294967296)))} is VALID [2022-04-28 03:43:05,287 INFO L290 TraceCheckUtils]: 10: Hoare triple {6328#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (<= (div (+ 3 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ main_~y~0 (- 3)) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6324#(or (<= (div (+ 3 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ main_~y~0 (- 3)) 4294967296)) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-28 03:43:05,289 INFO L290 TraceCheckUtils]: 9: Hoare triple {6332#(or (<= (div (+ 3 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ main_~y~0 (- 3)) 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; {6328#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (<= (div (+ 3 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ main_~y~0 (- 3)) 4294967296)))} is VALID [2022-04-28 03:43:05,290 INFO L290 TraceCheckUtils]: 8: Hoare triple {6188#true} ~z~0 := ~y~0; {6332#(or (<= (div (+ 3 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ main_~y~0 (- 3)) 4294967296)) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} is VALID [2022-04-28 03:43:05,290 INFO L290 TraceCheckUtils]: 7: Hoare triple {6188#true} [107] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {6188#true} is VALID [2022-04-28 03:43:05,291 INFO L290 TraceCheckUtils]: 6: Hoare triple {6188#true} [108] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_193 v_main_~y~0_192)) (.cse1 (= |v_main_#t~post5_85| |v_main_#t~post5_84|)) (.cse2 (= |v_main_#t~post6_85| |v_main_#t~post6_84|)) (.cse3 (= v_main_~x~0_187 v_main_~x~0_186)) (.cse4 (mod v_main_~x~0_187 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 (<= .cse4 0) .cse1 .cse2 .cse3) (and (< v_main_~x~0_186 v_main_~x~0_187) (< 0 .cse4) (forall ((v_it_17 Int)) (or (< 0 (mod (+ v_main_~x~0_187 (* 4294967295 v_it_17)) 4294967296)) (not (<= (+ v_main_~x~0_186 v_it_17 1) v_main_~x~0_187)) (not (<= 1 v_it_17)))) (= (+ v_main_~x~0_187 v_main_~y~0_193 (* v_main_~x~0_186 (- 1))) v_main_~y~0_192)))) InVars {main_~y~0=v_main_~y~0_193, main_#t~post5=|v_main_#t~post5_85|, main_~x~0=v_main_~x~0_187, main_#t~post6=|v_main_#t~post6_85|} OutVars{main_~y~0=v_main_~y~0_192, main_#t~post5=|v_main_#t~post5_84|, main_~x~0=v_main_~x~0_186, main_#t~post6=|v_main_#t~post6_84|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {6188#true} is VALID [2022-04-28 03:43:05,291 INFO L290 TraceCheckUtils]: 5: Hoare triple {6188#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {6188#true} is VALID [2022-04-28 03:43:05,291 INFO L272 TraceCheckUtils]: 4: Hoare triple {6188#true} call #t~ret13 := main(); {6188#true} is VALID [2022-04-28 03:43:05,291 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6188#true} {6188#true} #72#return; {6188#true} is VALID [2022-04-28 03:43:05,291 INFO L290 TraceCheckUtils]: 2: Hoare triple {6188#true} assume true; {6188#true} is VALID [2022-04-28 03:43:05,291 INFO L290 TraceCheckUtils]: 1: Hoare triple {6188#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {6188#true} is VALID [2022-04-28 03:43:05,291 INFO L272 TraceCheckUtils]: 0: Hoare triple {6188#true} call ULTIMATE.init(); {6188#true} is VALID [2022-04-28 03:43:05,291 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-28 03:43:05,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [240983824] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:43:05,291 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:43:05,291 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 16 [2022-04-28 03:43:05,369 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:43:05,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1429338662] [2022-04-28 03:43:05,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1429338662] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:43:05,369 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:43:05,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 03:43:05,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102953094] [2022-04-28 03:43:05,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:43:05,370 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 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 26 [2022-04-28 03:43:05,370 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:43:05,370 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 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 03:43:05,390 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 03:43:05,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 03:43:05,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:43:05,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 03:43:05,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2022-04-28 03:43:05,391 INFO L87 Difference]: Start difference. First operand 58 states and 75 transitions. Second operand has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 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 03:43:08,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:43:08,533 INFO L93 Difference]: Finished difference Result 123 states and 160 transitions. [2022-04-28 03:43:08,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-28 03:43:08,533 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 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 26 [2022-04-28 03:43:08,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:43:08,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 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 03:43:08,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 59 transitions. [2022-04-28 03:43:08,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 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 03:43:08,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 59 transitions. [2022-04-28 03:43:08,535 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 59 transitions. [2022-04-28 03:43:08,601 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 03:43:08,601 INFO L225 Difference]: With dead ends: 123 [2022-04-28 03:43:08,602 INFO L226 Difference]: Without dead ends: 65 [2022-04-28 03:43:08,602 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 57 SyntacticMatches, 6 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=162, Invalid=894, Unknown=0, NotChecked=0, Total=1056 [2022-04-28 03:43:08,602 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 34 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-28 03:43:08,603 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 61 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-28 03:43:08,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-04-28 03:43:08,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 55. [2022-04-28 03:43:08,827 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:43:08,827 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand has 55 states, 50 states have (on average 1.32) internal successors, (66), 50 states have internal predecessors, (66), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:08,827 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand has 55 states, 50 states have (on average 1.32) internal successors, (66), 50 states have internal predecessors, (66), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:08,827 INFO L87 Difference]: Start difference. First operand 65 states. Second operand has 55 states, 50 states have (on average 1.32) internal successors, (66), 50 states have internal predecessors, (66), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:08,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:43:08,828 INFO L93 Difference]: Finished difference Result 65 states and 83 transitions. [2022-04-28 03:43:08,828 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 83 transitions. [2022-04-28 03:43:08,828 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:43:08,828 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:43:08,828 INFO L74 IsIncluded]: Start isIncluded. First operand has 55 states, 50 states have (on average 1.32) internal successors, (66), 50 states have internal predecessors, (66), 3 states have call successors, (3), 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 65 states. [2022-04-28 03:43:08,828 INFO L87 Difference]: Start difference. First operand has 55 states, 50 states have (on average 1.32) internal successors, (66), 50 states have internal predecessors, (66), 3 states have call successors, (3), 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 65 states. [2022-04-28 03:43:08,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:43:08,829 INFO L93 Difference]: Finished difference Result 65 states and 83 transitions. [2022-04-28 03:43:08,829 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 83 transitions. [2022-04-28 03:43:08,829 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:43:08,829 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:43:08,829 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:43:08,829 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:43:08,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 50 states have (on average 1.32) internal successors, (66), 50 states have internal predecessors, (66), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:08,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 70 transitions. [2022-04-28 03:43:08,830 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 70 transitions. Word has length 26 [2022-04-28 03:43:08,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:43:08,830 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 70 transitions. [2022-04-28 03:43:08,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 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 03:43:08,831 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 55 states and 70 transitions. [2022-04-28 03:43:17,831 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 66 inductive. 0 not inductive. 4 times theorem prover too weak to decide inductivity. [2022-04-28 03:43:17,831 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 70 transitions. [2022-04-28 03:43:17,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-28 03:43:17,832 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:43:17,832 INFO L195 NwaCegarLoop]: trace histogram [6, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:43:17,848 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 03:43:18,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:43:18,035 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:43:18,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:43:18,036 INFO L85 PathProgramCache]: Analyzing trace with hash 177771346, now seen corresponding path program 12 times [2022-04-28 03:43:18,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:43:18,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1465361961] [2022-04-28 03:43:18,350 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:43:18,351 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:43:18,353 INFO L85 PathProgramCache]: Analyzing trace with hash 1699348115, now seen corresponding path program 1 times [2022-04-28 03:43:18,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:43:18,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744176910] [2022-04-28 03:43:18,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:43:18,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:43:18,362 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_18.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:43:18,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:43:18,372 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_18.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:43:18,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:43:18,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:43:18,747 INFO L290 TraceCheckUtils]: 0: Hoare triple {6898#(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); {6885#true} is VALID [2022-04-28 03:43:18,747 INFO L290 TraceCheckUtils]: 1: Hoare triple {6885#true} assume true; {6885#true} is VALID [2022-04-28 03:43:18,747 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6885#true} {6885#true} #72#return; {6885#true} is VALID [2022-04-28 03:43:18,747 INFO L272 TraceCheckUtils]: 0: Hoare triple {6885#true} call ULTIMATE.init(); {6898#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:43:18,747 INFO L290 TraceCheckUtils]: 1: Hoare triple {6898#(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); {6885#true} is VALID [2022-04-28 03:43:18,748 INFO L290 TraceCheckUtils]: 2: Hoare triple {6885#true} assume true; {6885#true} is VALID [2022-04-28 03:43:18,748 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6885#true} {6885#true} #72#return; {6885#true} is VALID [2022-04-28 03:43:18,748 INFO L272 TraceCheckUtils]: 4: Hoare triple {6885#true} call #t~ret13 := main(); {6885#true} is VALID [2022-04-28 03:43:18,748 INFO L290 TraceCheckUtils]: 5: Hoare triple {6885#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {6885#true} is VALID [2022-04-28 03:43:18,748 INFO L290 TraceCheckUtils]: 6: Hoare triple {6885#true} [110] L16-2-->L16-3_primed: Formula: (let ((.cse3 (mod v_main_~x~0_200 4294967296)) (.cse0 (= |v_main_#t~post5_90| |v_main_#t~post5_89|)) (.cse1 (= v_main_~y~0_212 v_main_~y~0_211)) (.cse2 (= v_main_~x~0_200 v_main_~x~0_199))) (or (and .cse0 (= |v_main_#t~post6_90| |v_main_#t~post6_89|) .cse1 .cse2) (and (< 0 .cse3) (forall ((v_it_18 Int)) (or (< 0 (mod (+ v_main_~x~0_200 (* 4294967295 v_it_18)) 4294967296)) (not (<= 1 v_it_18)) (not (<= (+ v_main_~x~0_199 v_it_18 1) v_main_~x~0_200)))) (< v_main_~x~0_199 v_main_~x~0_200) (= (+ v_main_~x~0_200 v_main_~y~0_212 (* v_main_~x~0_199 (- 1))) v_main_~y~0_211)) (and (<= .cse3 0) .cse0 (= |v_main_#t~post6_89| |v_main_#t~post6_90|) .cse1 .cse2))) InVars {main_~y~0=v_main_~y~0_212, main_#t~post5=|v_main_#t~post5_90|, main_~x~0=v_main_~x~0_200, main_#t~post6=|v_main_#t~post6_90|} OutVars{main_~y~0=v_main_~y~0_211, main_#t~post5=|v_main_#t~post5_89|, main_~x~0=v_main_~x~0_199, main_#t~post6=|v_main_#t~post6_89|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {6885#true} is VALID [2022-04-28 03:43:18,750 INFO L290 TraceCheckUtils]: 7: Hoare triple {6885#true} [109] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {6890#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:43:18,750 INFO L290 TraceCheckUtils]: 8: Hoare triple {6890#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {6890#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:43:18,751 INFO L290 TraceCheckUtils]: 9: Hoare triple {6890#(<= main_~x~0 (* 4294967296 (div main_~x~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; {6891#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:43:18,752 INFO L290 TraceCheckUtils]: 10: Hoare triple {6891#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 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; {6892#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:43:18,753 INFO L290 TraceCheckUtils]: 11: Hoare triple {6892#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~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; {6893#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:43:18,754 INFO L290 TraceCheckUtils]: 12: Hoare triple {6893#(<= main_~x~0 (+ 3 (* (div (+ main_~x~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; {6894#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:43:18,755 INFO L290 TraceCheckUtils]: 13: Hoare triple {6894#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 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; {6895#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 03:43:18,756 INFO L290 TraceCheckUtils]: 14: Hoare triple {6895#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 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; {6896#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:43:18,757 INFO L290 TraceCheckUtils]: 15: Hoare triple {6896#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {6896#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:43:18,757 INFO L290 TraceCheckUtils]: 16: Hoare triple {6896#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 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; {6896#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:43:18,757 INFO L290 TraceCheckUtils]: 17: Hoare triple {6896#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 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; {6896#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:43:18,758 INFO L290 TraceCheckUtils]: 18: Hoare triple {6896#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 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; {6896#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:43:18,758 INFO L290 TraceCheckUtils]: 19: Hoare triple {6896#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {6896#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:43:18,760 INFO L290 TraceCheckUtils]: 20: Hoare triple {6896#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {6897#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 03:43:18,760 INFO L290 TraceCheckUtils]: 21: Hoare triple {6897#(<= (+ 5 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {6886#false} is VALID [2022-04-28 03:43:18,760 INFO L272 TraceCheckUtils]: 22: Hoare triple {6886#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {6886#false} is VALID [2022-04-28 03:43:18,760 INFO L290 TraceCheckUtils]: 23: Hoare triple {6886#false} ~cond := #in~cond; {6886#false} is VALID [2022-04-28 03:43:18,760 INFO L290 TraceCheckUtils]: 24: Hoare triple {6886#false} assume 0 == ~cond; {6886#false} is VALID [2022-04-28 03:43:18,760 INFO L290 TraceCheckUtils]: 25: Hoare triple {6886#false} assume !false; {6886#false} is VALID [2022-04-28 03:43:18,760 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-28 03:43:18,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:43:18,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744176910] [2022-04-28 03:43:18,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744176910] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:43:18,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1607272087] [2022-04-28 03:43:18,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:43:18,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:43:18,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:43:18,762 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 03:43:18,762 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 03:43:18,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:43:18,799 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-28 03:43:18,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:43:18,807 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:43:19,413 INFO L272 TraceCheckUtils]: 0: Hoare triple {6885#true} call ULTIMATE.init(); {6885#true} is VALID [2022-04-28 03:43:19,413 INFO L290 TraceCheckUtils]: 1: Hoare triple {6885#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {6885#true} is VALID [2022-04-28 03:43:19,413 INFO L290 TraceCheckUtils]: 2: Hoare triple {6885#true} assume true; {6885#true} is VALID [2022-04-28 03:43:19,413 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6885#true} {6885#true} #72#return; {6885#true} is VALID [2022-04-28 03:43:19,413 INFO L272 TraceCheckUtils]: 4: Hoare triple {6885#true} call #t~ret13 := main(); {6885#true} is VALID [2022-04-28 03:43:19,413 INFO L290 TraceCheckUtils]: 5: Hoare triple {6885#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {6885#true} is VALID [2022-04-28 03:43:19,414 INFO L290 TraceCheckUtils]: 6: Hoare triple {6885#true} [110] L16-2-->L16-3_primed: Formula: (let ((.cse3 (mod v_main_~x~0_200 4294967296)) (.cse0 (= |v_main_#t~post5_90| |v_main_#t~post5_89|)) (.cse1 (= v_main_~y~0_212 v_main_~y~0_211)) (.cse2 (= v_main_~x~0_200 v_main_~x~0_199))) (or (and .cse0 (= |v_main_#t~post6_90| |v_main_#t~post6_89|) .cse1 .cse2) (and (< 0 .cse3) (forall ((v_it_18 Int)) (or (< 0 (mod (+ v_main_~x~0_200 (* 4294967295 v_it_18)) 4294967296)) (not (<= 1 v_it_18)) (not (<= (+ v_main_~x~0_199 v_it_18 1) v_main_~x~0_200)))) (< v_main_~x~0_199 v_main_~x~0_200) (= (+ v_main_~x~0_200 v_main_~y~0_212 (* v_main_~x~0_199 (- 1))) v_main_~y~0_211)) (and (<= .cse3 0) .cse0 (= |v_main_#t~post6_89| |v_main_#t~post6_90|) .cse1 .cse2))) InVars {main_~y~0=v_main_~y~0_212, main_#t~post5=|v_main_#t~post5_90|, main_~x~0=v_main_~x~0_200, main_#t~post6=|v_main_#t~post6_90|} OutVars{main_~y~0=v_main_~y~0_211, main_#t~post5=|v_main_#t~post5_89|, main_~x~0=v_main_~x~0_199, main_#t~post6=|v_main_#t~post6_89|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {6885#true} is VALID [2022-04-28 03:43:19,414 INFO L290 TraceCheckUtils]: 7: Hoare triple {6885#true} [109] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {6885#true} is VALID [2022-04-28 03:43:19,414 INFO L290 TraceCheckUtils]: 8: Hoare triple {6885#true} ~z~0 := ~y~0; {6926#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 03:43:19,414 INFO L290 TraceCheckUtils]: 9: Hoare triple {6926#(= 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; {6930#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-28 03:43:19,415 INFO L290 TraceCheckUtils]: 10: Hoare triple {6930#(= 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; {6934#(= (+ main_~z~0 1) (+ (- 1) main_~y~0))} is VALID [2022-04-28 03:43:19,416 INFO L290 TraceCheckUtils]: 11: Hoare triple {6934#(= (+ 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; {6938#(= (+ (- 2) main_~y~0) (+ main_~z~0 1))} is VALID [2022-04-28 03:43:19,417 INFO L290 TraceCheckUtils]: 12: Hoare triple {6938#(= (+ (- 2) 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; {6942#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 03:43:19,418 INFO L290 TraceCheckUtils]: 13: Hoare triple {6942#(< 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; {6942#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 03:43:19,418 INFO L290 TraceCheckUtils]: 14: Hoare triple {6942#(< 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; {6942#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 03:43:19,418 INFO L290 TraceCheckUtils]: 15: Hoare triple {6942#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !(~z~0 % 4294967296 > 0); {6942#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 03:43:19,419 INFO L290 TraceCheckUtils]: 16: Hoare triple {6942#(< 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; {6955#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 03:43:19,421 INFO L290 TraceCheckUtils]: 17: Hoare triple {6955#(< 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; {6959#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 03:43:19,422 INFO L290 TraceCheckUtils]: 18: Hoare triple {6959#(< 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; {6963#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:43:19,422 INFO L290 TraceCheckUtils]: 19: Hoare triple {6963#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {6886#false} is VALID [2022-04-28 03:43:19,422 INFO L290 TraceCheckUtils]: 20: Hoare triple {6886#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {6886#false} is VALID [2022-04-28 03:43:19,422 INFO L290 TraceCheckUtils]: 21: Hoare triple {6886#false} assume !(~x~0 % 4294967296 > 0); {6886#false} is VALID [2022-04-28 03:43:19,422 INFO L272 TraceCheckUtils]: 22: Hoare triple {6886#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {6886#false} is VALID [2022-04-28 03:43:19,422 INFO L290 TraceCheckUtils]: 23: Hoare triple {6886#false} ~cond := #in~cond; {6886#false} is VALID [2022-04-28 03:43:19,422 INFO L290 TraceCheckUtils]: 24: Hoare triple {6886#false} assume 0 == ~cond; {6886#false} is VALID [2022-04-28 03:43:19,423 INFO L290 TraceCheckUtils]: 25: Hoare triple {6886#false} assume !false; {6886#false} is VALID [2022-04-28 03:43:19,423 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 03:43:19,423 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:43:19,955 INFO L290 TraceCheckUtils]: 25: Hoare triple {6886#false} assume !false; {6886#false} is VALID [2022-04-28 03:43:19,955 INFO L290 TraceCheckUtils]: 24: Hoare triple {6886#false} assume 0 == ~cond; {6886#false} is VALID [2022-04-28 03:43:19,955 INFO L290 TraceCheckUtils]: 23: Hoare triple {6886#false} ~cond := #in~cond; {6886#false} is VALID [2022-04-28 03:43:19,956 INFO L272 TraceCheckUtils]: 22: Hoare triple {6886#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {6886#false} is VALID [2022-04-28 03:43:19,956 INFO L290 TraceCheckUtils]: 21: Hoare triple {6886#false} assume !(~x~0 % 4294967296 > 0); {6886#false} is VALID [2022-04-28 03:43:19,956 INFO L290 TraceCheckUtils]: 20: Hoare triple {6886#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {6886#false} is VALID [2022-04-28 03:43:19,956 INFO L290 TraceCheckUtils]: 19: Hoare triple {6963#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {6886#false} is VALID [2022-04-28 03:43:19,957 INFO L290 TraceCheckUtils]: 18: Hoare triple {6959#(< 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; {6963#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:43:19,958 INFO L290 TraceCheckUtils]: 17: Hoare triple {6955#(< 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; {6959#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 03:43:19,959 INFO L290 TraceCheckUtils]: 16: Hoare triple {6942#(< 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; {6955#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 03:43:19,960 INFO L290 TraceCheckUtils]: 15: Hoare triple {6942#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} assume !(~z~0 % 4294967296 > 0); {6942#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 03:43:19,960 INFO L290 TraceCheckUtils]: 14: Hoare triple {6942#(< 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; {6942#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 03:43:19,960 INFO L290 TraceCheckUtils]: 13: Hoare triple {6942#(< 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; {6942#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 03:43:19,961 INFO L290 TraceCheckUtils]: 12: Hoare triple {7024#(or (not (< 0 (mod main_~z~0 4294967296))) (< 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; {6942#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 03:43:19,962 INFO L290 TraceCheckUtils]: 11: Hoare triple {7028#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 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; {7024#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-28 03:43:19,963 INFO L290 TraceCheckUtils]: 10: Hoare triple {7032#(or (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))) (< 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; {7028#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-28 03:43:19,965 INFO L290 TraceCheckUtils]: 9: Hoare triple {7036#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 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; {7032#(or (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-28 03:43:19,965 INFO L290 TraceCheckUtils]: 8: Hoare triple {6885#true} ~z~0 := ~y~0; {7036#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-28 03:43:19,965 INFO L290 TraceCheckUtils]: 7: Hoare triple {6885#true} [109] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {6885#true} is VALID [2022-04-28 03:43:19,965 INFO L290 TraceCheckUtils]: 6: Hoare triple {6885#true} [110] L16-2-->L16-3_primed: Formula: (let ((.cse3 (mod v_main_~x~0_200 4294967296)) (.cse0 (= |v_main_#t~post5_90| |v_main_#t~post5_89|)) (.cse1 (= v_main_~y~0_212 v_main_~y~0_211)) (.cse2 (= v_main_~x~0_200 v_main_~x~0_199))) (or (and .cse0 (= |v_main_#t~post6_90| |v_main_#t~post6_89|) .cse1 .cse2) (and (< 0 .cse3) (forall ((v_it_18 Int)) (or (< 0 (mod (+ v_main_~x~0_200 (* 4294967295 v_it_18)) 4294967296)) (not (<= 1 v_it_18)) (not (<= (+ v_main_~x~0_199 v_it_18 1) v_main_~x~0_200)))) (< v_main_~x~0_199 v_main_~x~0_200) (= (+ v_main_~x~0_200 v_main_~y~0_212 (* v_main_~x~0_199 (- 1))) v_main_~y~0_211)) (and (<= .cse3 0) .cse0 (= |v_main_#t~post6_89| |v_main_#t~post6_90|) .cse1 .cse2))) InVars {main_~y~0=v_main_~y~0_212, main_#t~post5=|v_main_#t~post5_90|, main_~x~0=v_main_~x~0_200, main_#t~post6=|v_main_#t~post6_90|} OutVars{main_~y~0=v_main_~y~0_211, main_#t~post5=|v_main_#t~post5_89|, main_~x~0=v_main_~x~0_199, main_#t~post6=|v_main_#t~post6_89|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {6885#true} is VALID [2022-04-28 03:43:19,965 INFO L290 TraceCheckUtils]: 5: Hoare triple {6885#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {6885#true} is VALID [2022-04-28 03:43:19,965 INFO L272 TraceCheckUtils]: 4: Hoare triple {6885#true} call #t~ret13 := main(); {6885#true} is VALID [2022-04-28 03:43:19,965 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6885#true} {6885#true} #72#return; {6885#true} is VALID [2022-04-28 03:43:19,965 INFO L290 TraceCheckUtils]: 2: Hoare triple {6885#true} assume true; {6885#true} is VALID [2022-04-28 03:43:19,965 INFO L290 TraceCheckUtils]: 1: Hoare triple {6885#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {6885#true} is VALID [2022-04-28 03:43:19,966 INFO L272 TraceCheckUtils]: 0: Hoare triple {6885#true} call ULTIMATE.init(); {6885#true} is VALID [2022-04-28 03:43:19,966 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 03:43:19,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1607272087] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:43:19,966 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:43:19,966 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 23 [2022-04-28 03:43:20,324 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:43:20,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1465361961] [2022-04-28 03:43:20,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1465361961] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:43:20,324 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:43:20,324 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 03:43:20,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749143483] [2022-04-28 03:43:20,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:43:20,325 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 13 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 28 [2022-04-28 03:43:20,325 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:43:20,325 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 13 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 03:43:20,354 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 03:43:20,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 03:43:20,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:43:20,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 03:43:20,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=567, Unknown=0, NotChecked=0, Total=650 [2022-04-28 03:43:20,355 INFO L87 Difference]: Start difference. First operand 55 states and 70 transitions. Second operand has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 13 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 03:43:24,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:43:24,004 INFO L93 Difference]: Finished difference Result 108 states and 154 transitions. [2022-04-28 03:43:24,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-28 03:43:24,005 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 13 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 28 [2022-04-28 03:43:24,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:43:24,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 13 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 03:43:24,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 86 transitions. [2022-04-28 03:43:24,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 13 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 03:43:24,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 86 transitions. [2022-04-28 03:43:24,006 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 86 transitions. [2022-04-28 03:43:24,137 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 03:43:24,138 INFO L225 Difference]: With dead ends: 108 [2022-04-28 03:43:24,138 INFO L226 Difference]: Without dead ends: 102 [2022-04-28 03:43:24,138 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=215, Invalid=1345, Unknown=0, NotChecked=0, Total=1560 [2022-04-28 03:43:24,139 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 82 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-28 03:43:24,139 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 53 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-28 03:43:24,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-04-28 03:43:24,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 63. [2022-04-28 03:43:24,415 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:43:24,415 INFO L82 GeneralOperation]: Start isEquivalent. First operand 102 states. Second operand has 63 states, 58 states have (on average 1.3448275862068966) internal successors, (78), 58 states have internal predecessors, (78), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:24,415 INFO L74 IsIncluded]: Start isIncluded. First operand 102 states. Second operand has 63 states, 58 states have (on average 1.3448275862068966) internal successors, (78), 58 states have internal predecessors, (78), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:24,415 INFO L87 Difference]: Start difference. First operand 102 states. Second operand has 63 states, 58 states have (on average 1.3448275862068966) internal successors, (78), 58 states have internal predecessors, (78), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:24,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:43:24,417 INFO L93 Difference]: Finished difference Result 102 states and 134 transitions. [2022-04-28 03:43:24,417 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 134 transitions. [2022-04-28 03:43:24,417 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:43:24,417 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:43:24,417 INFO L74 IsIncluded]: Start isIncluded. First operand has 63 states, 58 states have (on average 1.3448275862068966) internal successors, (78), 58 states have internal predecessors, (78), 3 states have call successors, (3), 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 03:43:24,417 INFO L87 Difference]: Start difference. First operand has 63 states, 58 states have (on average 1.3448275862068966) internal successors, (78), 58 states have internal predecessors, (78), 3 states have call successors, (3), 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 03:43:24,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:43:24,418 INFO L93 Difference]: Finished difference Result 102 states and 134 transitions. [2022-04-28 03:43:24,418 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 134 transitions. [2022-04-28 03:43:24,418 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:43:24,419 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:43:24,419 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:43:24,419 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:43:24,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 58 states have (on average 1.3448275862068966) internal successors, (78), 58 states have internal predecessors, (78), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:24,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 82 transitions. [2022-04-28 03:43:24,419 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 82 transitions. Word has length 28 [2022-04-28 03:43:24,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:43:24,420 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 82 transitions. [2022-04-28 03:43:24,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 13 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 03:43:24,420 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 63 states and 82 transitions. [2022-04-28 03:43:33,594 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 78 inductive. 0 not inductive. 4 times theorem prover too weak to decide inductivity. [2022-04-28 03:43:33,595 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 82 transitions. [2022-04-28 03:43:33,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-28 03:43:33,595 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:43:33,595 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:43:33,612 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 03:43:33,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:43:33,798 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:43:33,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:43:33,798 INFO L85 PathProgramCache]: Analyzing trace with hash -415205978, now seen corresponding path program 13 times [2022-04-28 03:43:33,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:43:33,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [287021082] [2022-04-28 03:43:34,203 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:43:34,204 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:43:34,207 INFO L85 PathProgramCache]: Analyzing trace with hash -885913019, now seen corresponding path program 1 times [2022-04-28 03:43:34,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:43:34,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175314170] [2022-04-28 03:43:34,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:43:34,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:43:34,214 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_19.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:43:34,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:43:34,235 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_19.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:43:34,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:43:34,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:43:34,585 INFO L290 TraceCheckUtils]: 0: Hoare triple {7656#(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); {7643#true} is VALID [2022-04-28 03:43:34,585 INFO L290 TraceCheckUtils]: 1: Hoare triple {7643#true} assume true; {7643#true} is VALID [2022-04-28 03:43:34,585 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7643#true} {7643#true} #72#return; {7643#true} is VALID [2022-04-28 03:43:34,586 INFO L272 TraceCheckUtils]: 0: Hoare triple {7643#true} call ULTIMATE.init(); {7656#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:43:34,586 INFO L290 TraceCheckUtils]: 1: Hoare triple {7656#(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); {7643#true} is VALID [2022-04-28 03:43:34,586 INFO L290 TraceCheckUtils]: 2: Hoare triple {7643#true} assume true; {7643#true} is VALID [2022-04-28 03:43:34,586 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7643#true} {7643#true} #72#return; {7643#true} is VALID [2022-04-28 03:43:34,586 INFO L272 TraceCheckUtils]: 4: Hoare triple {7643#true} call #t~ret13 := main(); {7643#true} is VALID [2022-04-28 03:43:34,586 INFO L290 TraceCheckUtils]: 5: Hoare triple {7643#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {7643#true} is VALID [2022-04-28 03:43:34,586 INFO L290 TraceCheckUtils]: 6: Hoare triple {7643#true} [112] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_95| |v_main_#t~post5_94|)) (.cse1 (= v_main_~y~0_228 v_main_~y~0_227)) (.cse2 (= v_main_~x~0_216 v_main_~x~0_215)) (.cse4 (= |v_main_#t~post6_95| |v_main_#t~post6_94|)) (.cse3 (mod v_main_~x~0_216 4294967296))) (or (and .cse0 .cse1 .cse2 (<= .cse3 0) .cse4) (and .cse0 .cse1 .cse2 .cse4) (and (forall ((v_it_19 Int)) (or (< 0 (mod (+ v_main_~x~0_216 (* 4294967295 v_it_19)) 4294967296)) (not (<= 1 v_it_19)) (not (<= (+ v_main_~x~0_215 v_it_19 1) v_main_~x~0_216)))) (< v_main_~x~0_215 v_main_~x~0_216) (= (+ v_main_~x~0_216 (* v_main_~x~0_215 (- 1)) v_main_~y~0_228) v_main_~y~0_227) (< 0 .cse3)))) InVars {main_~y~0=v_main_~y~0_228, main_#t~post5=|v_main_#t~post5_95|, main_~x~0=v_main_~x~0_216, main_#t~post6=|v_main_#t~post6_95|} OutVars{main_~y~0=v_main_~y~0_227, main_#t~post5=|v_main_#t~post5_94|, main_~x~0=v_main_~x~0_215, main_#t~post6=|v_main_#t~post6_94|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {7643#true} is VALID [2022-04-28 03:43:34,586 INFO L290 TraceCheckUtils]: 7: Hoare triple {7643#true} [111] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {7643#true} is VALID [2022-04-28 03:43:34,587 INFO L290 TraceCheckUtils]: 8: Hoare triple {7643#true} ~z~0 := ~y~0; {7648#(= (+ main_~z~0 (* (- 1) main_~y~0)) 0)} is VALID [2022-04-28 03:43:34,588 INFO L290 TraceCheckUtils]: 9: Hoare triple {7648#(= (+ main_~z~0 (* (- 1) main_~y~0)) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7649#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-28 03:43:34,588 INFO L290 TraceCheckUtils]: 10: Hoare triple {7649#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 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; {7650#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-28 03:43:34,589 INFO L290 TraceCheckUtils]: 11: Hoare triple {7650#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) 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; {7651#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-28 03:43:34,590 INFO L290 TraceCheckUtils]: 12: Hoare triple {7651#(and (<= (+ main_~z~0 3) 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; {7652#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-28 03:43:34,590 INFO L290 TraceCheckUtils]: 13: Hoare triple {7652#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} assume !(~z~0 % 4294967296 > 0); {7652#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-28 03:43:34,592 INFO L290 TraceCheckUtils]: 14: Hoare triple {7652#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {7653#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-28 03:43:34,593 INFO L290 TraceCheckUtils]: 15: Hoare triple {7653#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {7654#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-28 03:43:34,594 INFO L290 TraceCheckUtils]: 16: Hoare triple {7654#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 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; {7655#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-28 03:43:34,595 INFO L290 TraceCheckUtils]: 17: Hoare triple {7655#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {7644#false} is VALID [2022-04-28 03:43:34,595 INFO L290 TraceCheckUtils]: 18: Hoare triple {7644#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {7644#false} is VALID [2022-04-28 03:43:34,595 INFO L290 TraceCheckUtils]: 19: Hoare triple {7644#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {7644#false} is VALID [2022-04-28 03:43:34,595 INFO L290 TraceCheckUtils]: 20: Hoare triple {7644#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {7644#false} is VALID [2022-04-28 03:43:34,595 INFO L290 TraceCheckUtils]: 21: Hoare triple {7644#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {7644#false} is VALID [2022-04-28 03:43:34,595 INFO L290 TraceCheckUtils]: 22: Hoare triple {7644#false} assume !(~x~0 % 4294967296 > 0); {7644#false} is VALID [2022-04-28 03:43:34,595 INFO L272 TraceCheckUtils]: 23: Hoare triple {7644#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {7644#false} is VALID [2022-04-28 03:43:34,595 INFO L290 TraceCheckUtils]: 24: Hoare triple {7644#false} ~cond := #in~cond; {7644#false} is VALID [2022-04-28 03:43:34,595 INFO L290 TraceCheckUtils]: 25: Hoare triple {7644#false} assume 0 == ~cond; {7644#false} is VALID [2022-04-28 03:43:34,595 INFO L290 TraceCheckUtils]: 26: Hoare triple {7644#false} assume !false; {7644#false} is VALID [2022-04-28 03:43:34,595 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 03:43:34,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:43:34,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175314170] [2022-04-28 03:43:34,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175314170] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:43:34,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [978389172] [2022-04-28 03:43:34,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:43:34,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:43:34,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:43:34,597 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 03:43:34,597 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 03:43:34,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:43:34,633 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-28 03:43:34,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:43:34,652 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:43:35,040 INFO L272 TraceCheckUtils]: 0: Hoare triple {7643#true} call ULTIMATE.init(); {7643#true} is VALID [2022-04-28 03:43:35,040 INFO L290 TraceCheckUtils]: 1: Hoare triple {7643#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {7643#true} is VALID [2022-04-28 03:43:35,040 INFO L290 TraceCheckUtils]: 2: Hoare triple {7643#true} assume true; {7643#true} is VALID [2022-04-28 03:43:35,040 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7643#true} {7643#true} #72#return; {7643#true} is VALID [2022-04-28 03:43:35,040 INFO L272 TraceCheckUtils]: 4: Hoare triple {7643#true} call #t~ret13 := main(); {7643#true} is VALID [2022-04-28 03:43:35,040 INFO L290 TraceCheckUtils]: 5: Hoare triple {7643#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {7643#true} is VALID [2022-04-28 03:43:35,041 INFO L290 TraceCheckUtils]: 6: Hoare triple {7643#true} [112] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_95| |v_main_#t~post5_94|)) (.cse1 (= v_main_~y~0_228 v_main_~y~0_227)) (.cse2 (= v_main_~x~0_216 v_main_~x~0_215)) (.cse4 (= |v_main_#t~post6_95| |v_main_#t~post6_94|)) (.cse3 (mod v_main_~x~0_216 4294967296))) (or (and .cse0 .cse1 .cse2 (<= .cse3 0) .cse4) (and .cse0 .cse1 .cse2 .cse4) (and (forall ((v_it_19 Int)) (or (< 0 (mod (+ v_main_~x~0_216 (* 4294967295 v_it_19)) 4294967296)) (not (<= 1 v_it_19)) (not (<= (+ v_main_~x~0_215 v_it_19 1) v_main_~x~0_216)))) (< v_main_~x~0_215 v_main_~x~0_216) (= (+ v_main_~x~0_216 (* v_main_~x~0_215 (- 1)) v_main_~y~0_228) v_main_~y~0_227) (< 0 .cse3)))) InVars {main_~y~0=v_main_~y~0_228, main_#t~post5=|v_main_#t~post5_95|, main_~x~0=v_main_~x~0_216, main_#t~post6=|v_main_#t~post6_95|} OutVars{main_~y~0=v_main_~y~0_227, main_#t~post5=|v_main_#t~post5_94|, main_~x~0=v_main_~x~0_215, main_#t~post6=|v_main_#t~post6_94|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {7643#true} is VALID [2022-04-28 03:43:35,041 INFO L290 TraceCheckUtils]: 7: Hoare triple {7643#true} [111] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {7643#true} is VALID [2022-04-28 03:43:35,041 INFO L290 TraceCheckUtils]: 8: Hoare triple {7643#true} ~z~0 := ~y~0; {7648#(= (+ main_~z~0 (* (- 1) main_~y~0)) 0)} is VALID [2022-04-28 03:43:35,042 INFO L290 TraceCheckUtils]: 9: Hoare triple {7648#(= (+ main_~z~0 (* (- 1) main_~y~0)) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7649#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-28 03:43:35,043 INFO L290 TraceCheckUtils]: 10: Hoare triple {7649#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 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; {7650#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-28 03:43:35,043 INFO L290 TraceCheckUtils]: 11: Hoare triple {7650#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) 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; {7651#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-28 03:43:35,044 INFO L290 TraceCheckUtils]: 12: Hoare triple {7651#(and (<= (+ main_~z~0 3) 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; {7652#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-28 03:43:35,045 INFO L290 TraceCheckUtils]: 13: Hoare triple {7652#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} assume !(~z~0 % 4294967296 > 0); {7652#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-28 03:43:35,046 INFO L290 TraceCheckUtils]: 14: Hoare triple {7652#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {7653#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-28 03:43:35,047 INFO L290 TraceCheckUtils]: 15: Hoare triple {7653#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {7654#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-28 03:43:35,049 INFO L290 TraceCheckUtils]: 16: Hoare triple {7654#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 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; {7655#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-28 03:43:35,049 INFO L290 TraceCheckUtils]: 17: Hoare triple {7655#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {7644#false} is VALID [2022-04-28 03:43:35,049 INFO L290 TraceCheckUtils]: 18: Hoare triple {7644#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {7644#false} is VALID [2022-04-28 03:43:35,049 INFO L290 TraceCheckUtils]: 19: Hoare triple {7644#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {7644#false} is VALID [2022-04-28 03:43:35,049 INFO L290 TraceCheckUtils]: 20: Hoare triple {7644#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {7644#false} is VALID [2022-04-28 03:43:35,049 INFO L290 TraceCheckUtils]: 21: Hoare triple {7644#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {7644#false} is VALID [2022-04-28 03:43:35,049 INFO L290 TraceCheckUtils]: 22: Hoare triple {7644#false} assume !(~x~0 % 4294967296 > 0); {7644#false} is VALID [2022-04-28 03:43:35,049 INFO L272 TraceCheckUtils]: 23: Hoare triple {7644#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {7644#false} is VALID [2022-04-28 03:43:35,050 INFO L290 TraceCheckUtils]: 24: Hoare triple {7644#false} ~cond := #in~cond; {7644#false} is VALID [2022-04-28 03:43:35,050 INFO L290 TraceCheckUtils]: 25: Hoare triple {7644#false} assume 0 == ~cond; {7644#false} is VALID [2022-04-28 03:43:35,050 INFO L290 TraceCheckUtils]: 26: Hoare triple {7644#false} assume !false; {7644#false} is VALID [2022-04-28 03:43:35,050 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 03:43:35,050 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:43:35,844 INFO L290 TraceCheckUtils]: 26: Hoare triple {7644#false} assume !false; {7644#false} is VALID [2022-04-28 03:43:35,844 INFO L290 TraceCheckUtils]: 25: Hoare triple {7644#false} assume 0 == ~cond; {7644#false} is VALID [2022-04-28 03:43:35,844 INFO L290 TraceCheckUtils]: 24: Hoare triple {7644#false} ~cond := #in~cond; {7644#false} is VALID [2022-04-28 03:43:35,844 INFO L272 TraceCheckUtils]: 23: Hoare triple {7644#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {7644#false} is VALID [2022-04-28 03:43:35,844 INFO L290 TraceCheckUtils]: 22: Hoare triple {7644#false} assume !(~x~0 % 4294967296 > 0); {7644#false} is VALID [2022-04-28 03:43:35,844 INFO L290 TraceCheckUtils]: 21: Hoare triple {7644#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {7644#false} is VALID [2022-04-28 03:43:35,844 INFO L290 TraceCheckUtils]: 20: Hoare triple {7644#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {7644#false} is VALID [2022-04-28 03:43:35,844 INFO L290 TraceCheckUtils]: 19: Hoare triple {7644#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {7644#false} is VALID [2022-04-28 03:43:35,844 INFO L290 TraceCheckUtils]: 18: Hoare triple {7644#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {7644#false} is VALID [2022-04-28 03:43:35,847 INFO L290 TraceCheckUtils]: 17: Hoare triple {7655#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {7644#false} is VALID [2022-04-28 03:43:35,849 INFO L290 TraceCheckUtils]: 16: Hoare triple {7654#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 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; {7655#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-28 03:43:35,850 INFO L290 TraceCheckUtils]: 15: Hoare triple {7653#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {7654#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-28 03:43:35,852 INFO L290 TraceCheckUtils]: 14: Hoare triple {7652#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {7653#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-28 03:43:35,852 INFO L290 TraceCheckUtils]: 13: Hoare triple {7652#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} assume !(~z~0 % 4294967296 > 0); {7652#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-28 03:43:35,852 INFO L290 TraceCheckUtils]: 12: Hoare triple {7780#(or (not (< 0 (mod main_~z~0 4294967296))) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7652#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-28 03:43:35,854 INFO L290 TraceCheckUtils]: 11: Hoare triple {7784#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7780#(or (not (< 0 (mod main_~z~0 4294967296))) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298)))} is VALID [2022-04-28 03:43:35,855 INFO L290 TraceCheckUtils]: 10: Hoare triple {7788#(or (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7784#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298)))} is VALID [2022-04-28 03:43:35,864 INFO L290 TraceCheckUtils]: 9: Hoare triple {7792#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7788#(or (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298)))} is VALID [2022-04-28 03:43:35,865 INFO L290 TraceCheckUtils]: 8: Hoare triple {7643#true} ~z~0 := ~y~0; {7792#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298)))} is VALID [2022-04-28 03:43:35,865 INFO L290 TraceCheckUtils]: 7: Hoare triple {7643#true} [111] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {7643#true} is VALID [2022-04-28 03:43:35,865 INFO L290 TraceCheckUtils]: 6: Hoare triple {7643#true} [112] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_95| |v_main_#t~post5_94|)) (.cse1 (= v_main_~y~0_228 v_main_~y~0_227)) (.cse2 (= v_main_~x~0_216 v_main_~x~0_215)) (.cse4 (= |v_main_#t~post6_95| |v_main_#t~post6_94|)) (.cse3 (mod v_main_~x~0_216 4294967296))) (or (and .cse0 .cse1 .cse2 (<= .cse3 0) .cse4) (and .cse0 .cse1 .cse2 .cse4) (and (forall ((v_it_19 Int)) (or (< 0 (mod (+ v_main_~x~0_216 (* 4294967295 v_it_19)) 4294967296)) (not (<= 1 v_it_19)) (not (<= (+ v_main_~x~0_215 v_it_19 1) v_main_~x~0_216)))) (< v_main_~x~0_215 v_main_~x~0_216) (= (+ v_main_~x~0_216 (* v_main_~x~0_215 (- 1)) v_main_~y~0_228) v_main_~y~0_227) (< 0 .cse3)))) InVars {main_~y~0=v_main_~y~0_228, main_#t~post5=|v_main_#t~post5_95|, main_~x~0=v_main_~x~0_216, main_#t~post6=|v_main_#t~post6_95|} OutVars{main_~y~0=v_main_~y~0_227, main_#t~post5=|v_main_#t~post5_94|, main_~x~0=v_main_~x~0_215, main_#t~post6=|v_main_#t~post6_94|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {7643#true} is VALID [2022-04-28 03:43:35,865 INFO L290 TraceCheckUtils]: 5: Hoare triple {7643#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {7643#true} is VALID [2022-04-28 03:43:35,865 INFO L272 TraceCheckUtils]: 4: Hoare triple {7643#true} call #t~ret13 := main(); {7643#true} is VALID [2022-04-28 03:43:35,865 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7643#true} {7643#true} #72#return; {7643#true} is VALID [2022-04-28 03:43:35,865 INFO L290 TraceCheckUtils]: 2: Hoare triple {7643#true} assume true; {7643#true} is VALID [2022-04-28 03:43:35,865 INFO L290 TraceCheckUtils]: 1: Hoare triple {7643#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {7643#true} is VALID [2022-04-28 03:43:35,866 INFO L272 TraceCheckUtils]: 0: Hoare triple {7643#true} call ULTIMATE.init(); {7643#true} is VALID [2022-04-28 03:43:35,866 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 03:43:35,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [978389172] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:43:35,866 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:43:35,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 15 [2022-04-28 03:43:36,167 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:43:36,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [287021082] [2022-04-28 03:43:36,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [287021082] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:43:36,168 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:43:36,168 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 03:43:36,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407199740] [2022-04-28 03:43:36,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:43:36,168 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 13 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 29 [2022-04-28 03:43:36,169 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:43:36,169 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 13 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 03:43:36,198 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 03:43:36,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 03:43:36,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:43:36,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 03:43:36,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2022-04-28 03:43:36,198 INFO L87 Difference]: Start difference. First operand 63 states and 82 transitions. Second operand has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 13 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 03:43:40,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:43:40,044 INFO L93 Difference]: Finished difference Result 92 states and 117 transitions. [2022-04-28 03:43:40,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-28 03:43:40,044 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 13 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 29 [2022-04-28 03:43:40,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:43:40,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 13 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 03:43:40,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 46 transitions. [2022-04-28 03:43:40,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 13 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 03:43:40,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 46 transitions. [2022-04-28 03:43:40,046 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 46 transitions. [2022-04-28 03:43:40,193 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 03:43:40,194 INFO L225 Difference]: With dead ends: 92 [2022-04-28 03:43:40,194 INFO L226 Difference]: Without dead ends: 74 [2022-04-28 03:43:40,195 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 57 SyntacticMatches, 7 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=200, Invalid=856, Unknown=0, NotChecked=0, Total=1056 [2022-04-28 03:43:40,195 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 34 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:43:40,195 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 69 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-28 03:43:40,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-04-28 03:43:40,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 62. [2022-04-28 03:43:40,506 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:43:40,506 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand has 62 states, 57 states have (on average 1.263157894736842) internal successors, (72), 57 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 03:43:40,506 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand has 62 states, 57 states have (on average 1.263157894736842) internal successors, (72), 57 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 03:43:40,507 INFO L87 Difference]: Start difference. First operand 74 states. Second operand has 62 states, 57 states have (on average 1.263157894736842) internal successors, (72), 57 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 03:43:40,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:43:40,507 INFO L93 Difference]: Finished difference Result 74 states and 91 transitions. [2022-04-28 03:43:40,508 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 91 transitions. [2022-04-28 03:43:40,508 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:43:40,508 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:43:40,508 INFO L74 IsIncluded]: Start isIncluded. First operand has 62 states, 57 states have (on average 1.263157894736842) internal successors, (72), 57 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 74 states. [2022-04-28 03:43:40,508 INFO L87 Difference]: Start difference. First operand has 62 states, 57 states have (on average 1.263157894736842) internal successors, (72), 57 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 74 states. [2022-04-28 03:43:40,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:43:40,509 INFO L93 Difference]: Finished difference Result 74 states and 91 transitions. [2022-04-28 03:43:40,509 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 91 transitions. [2022-04-28 03:43:40,509 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:43:40,509 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:43:40,509 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:43:40,509 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:43:40,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 57 states have (on average 1.263157894736842) internal successors, (72), 57 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 03:43:40,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 76 transitions. [2022-04-28 03:43:40,510 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 76 transitions. Word has length 29 [2022-04-28 03:43:40,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:43:40,510 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 76 transitions. [2022-04-28 03:43:40,510 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 13 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 03:43:40,510 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 62 states and 76 transitions. [2022-04-28 03:43:50,000 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 72 inductive. 0 not inductive. 4 times theorem prover too weak to decide inductivity. [2022-04-28 03:43:50,001 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 76 transitions. [2022-04-28 03:43:50,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-28 03:43:50,001 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:43:50,001 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:43:50,017 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 03:43:50,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:43:50,202 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:43:50,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:43:50,202 INFO L85 PathProgramCache]: Analyzing trace with hash -991215487, now seen corresponding path program 14 times [2022-04-28 03:43:50,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:43:50,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [505468886] [2022-04-28 03:43:50,494 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:43:50,496 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:43:50,498 INFO L85 PathProgramCache]: Analyzing trace with hash -2056675326, now seen corresponding path program 1 times [2022-04-28 03:43:50,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:43:50,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615924887] [2022-04-28 03:43:50,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:43:50,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:43:50,506 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_20.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:43:50,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:43:50,532 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_20.4))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:43:51,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:43:51,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:43:51,684 INFO L290 TraceCheckUtils]: 0: Hoare triple {8334#(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); {8313#true} is VALID [2022-04-28 03:43:51,684 INFO L290 TraceCheckUtils]: 1: Hoare triple {8313#true} assume true; {8313#true} is VALID [2022-04-28 03:43:51,684 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8313#true} {8313#true} #72#return; {8313#true} is VALID [2022-04-28 03:43:51,684 INFO L272 TraceCheckUtils]: 0: Hoare triple {8313#true} call ULTIMATE.init(); {8334#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:43:51,684 INFO L290 TraceCheckUtils]: 1: Hoare triple {8334#(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); {8313#true} is VALID [2022-04-28 03:43:51,685 INFO L290 TraceCheckUtils]: 2: Hoare triple {8313#true} assume true; {8313#true} is VALID [2022-04-28 03:43:51,685 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8313#true} {8313#true} #72#return; {8313#true} is VALID [2022-04-28 03:43:51,685 INFO L272 TraceCheckUtils]: 4: Hoare triple {8313#true} call #t~ret13 := main(); {8313#true} is VALID [2022-04-28 03:43:51,685 INFO L290 TraceCheckUtils]: 5: Hoare triple {8313#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {8318#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-28 03:43:51,687 INFO L290 TraceCheckUtils]: 6: Hoare triple {8318#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} [114] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_233 v_main_~x~0_232)) (.cse1 (mod v_main_~x~0_233 4294967296))) (or (and .cse0 (= |v_main_#t~post6_100| |v_main_#t~post6_99|) (= v_main_~y~0_247 v_main_~y~0_246) (= |v_main_#t~post5_100| |v_main_#t~post5_99|)) (and .cse0 (<= .cse1 0) (= |v_main_#t~post6_99| |v_main_#t~post6_100|) (= v_main_~y~0_246 v_main_~y~0_247) (= |v_main_#t~post5_99| |v_main_#t~post5_100|)) (and (= v_main_~y~0_246 (+ v_main_~x~0_233 v_main_~y~0_247 (* v_main_~x~0_232 (- 1)))) (forall ((v_it_20 Int)) (or (< 0 (mod (+ v_main_~x~0_233 (* 4294967295 v_it_20)) 4294967296)) (not (<= (+ v_main_~x~0_232 v_it_20 1) v_main_~x~0_233)) (not (<= 1 v_it_20)))) (< 0 .cse1) (< v_main_~x~0_232 v_main_~x~0_233)))) InVars {main_~y~0=v_main_~y~0_247, main_#t~post5=|v_main_#t~post5_100|, main_~x~0=v_main_~x~0_233, main_#t~post6=|v_main_#t~post6_100|} OutVars{main_~y~0=v_main_~y~0_246, main_#t~post5=|v_main_#t~post5_99|, main_~x~0=v_main_~x~0_232, main_#t~post6=|v_main_#t~post6_99|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {8319#(or (and (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= main_~n~0 (+ main_~y~0 main_~x~0))) (= main_~y~0 0))} is VALID [2022-04-28 03:43:51,687 INFO L290 TraceCheckUtils]: 7: Hoare triple {8319#(or (and (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= main_~n~0 (+ main_~y~0 main_~x~0))) (= main_~y~0 0))} [113] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {8320#(or (= main_~y~0 0) (and (<= (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))))))} is VALID [2022-04-28 03:43:51,688 INFO L290 TraceCheckUtils]: 8: Hoare triple {8320#(or (= main_~y~0 0) (and (<= (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))))))} ~z~0 := ~y~0; {8321#(and (= (+ main_~z~0 (* (- 1) main_~y~0)) 0) (or (= main_~y~0 0) (and (<= (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296)))))))} is VALID [2022-04-28 03:43:51,690 INFO L290 TraceCheckUtils]: 9: Hoare triple {8321#(and (= (+ main_~z~0 (* (- 1) main_~y~0)) 0) (or (= main_~y~0 0) (and (<= (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~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; {8322#(<= main_~n~0 (+ main_~z~0 (* (div (+ (- 1) main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:43:51,691 INFO L290 TraceCheckUtils]: 10: Hoare triple {8322#(<= main_~n~0 (+ main_~z~0 (* (div (+ (- 1) main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 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; {8323#(<= main_~n~0 (+ main_~z~0 2 (* (div (+ (- 2) main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:43:51,693 INFO L290 TraceCheckUtils]: 11: Hoare triple {8323#(<= main_~n~0 (+ main_~z~0 2 (* (div (+ (- 2) 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; {8324#(<= main_~n~0 (+ main_~z~0 3 (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) (- 3)) 4294967296))))} is VALID [2022-04-28 03:43:51,694 INFO L290 TraceCheckUtils]: 12: Hoare triple {8324#(<= main_~n~0 (+ main_~z~0 3 (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) (- 3)) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8325#(<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (* (- 1) main_~z~0) (- 4)) 4294967296) 4294967296) 4))} is VALID [2022-04-28 03:43:51,696 INFO L290 TraceCheckUtils]: 13: Hoare triple {8325#(<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (* (- 1) main_~z~0) (- 4)) 4294967296) 4294967296) 4))} assume !(~z~0 % 4294967296 > 0); {8326#(<= (+ (* 4294967296 (div (+ 4294967291 main_~n~0 (* (div main_~z~0 4294967296) (- 4294967296))) 4294967296)) (* (div main_~z~0 4294967296) 4294967296) 4) main_~n~0)} is VALID [2022-04-28 03:43:51,698 INFO L290 TraceCheckUtils]: 14: Hoare triple {8326#(<= (+ (* 4294967296 (div (+ 4294967291 main_~n~0 (* (div main_~z~0 4294967296) (- 4294967296))) 4294967296)) (* (div 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; {8326#(<= (+ (* 4294967296 (div (+ 4294967291 main_~n~0 (* (div main_~z~0 4294967296) (- 4294967296))) 4294967296)) (* (div main_~z~0 4294967296) 4294967296) 4) main_~n~0)} is VALID [2022-04-28 03:43:51,705 INFO L290 TraceCheckUtils]: 15: Hoare triple {8326#(<= (+ (* 4294967296 (div (+ 4294967291 main_~n~0 (* (div main_~z~0 4294967296) (- 4294967296))) 4294967296)) (* (div 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; {8326#(<= (+ (* 4294967296 (div (+ 4294967291 main_~n~0 (* (div main_~z~0 4294967296) (- 4294967296))) 4294967296)) (* (div main_~z~0 4294967296) 4294967296) 4) main_~n~0)} is VALID [2022-04-28 03:43:51,707 INFO L290 TraceCheckUtils]: 16: Hoare triple {8326#(<= (+ (* 4294967296 (div (+ 4294967291 main_~n~0 (* (div main_~z~0 4294967296) (- 4294967296))) 4294967296)) (* (div 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; {8326#(<= (+ (* 4294967296 (div (+ 4294967291 main_~n~0 (* (div main_~z~0 4294967296) (- 4294967296))) 4294967296)) (* (div main_~z~0 4294967296) 4294967296) 4) main_~n~0)} is VALID [2022-04-28 03:43:51,709 INFO L290 TraceCheckUtils]: 17: Hoare triple {8326#(<= (+ (* 4294967296 (div (+ 4294967291 main_~n~0 (* (div main_~z~0 4294967296) (- 4294967296))) 4294967296)) (* (div 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; {8326#(<= (+ (* 4294967296 (div (+ 4294967291 main_~n~0 (* (div main_~z~0 4294967296) (- 4294967296))) 4294967296)) (* (div main_~z~0 4294967296) 4294967296) 4) main_~n~0)} is VALID [2022-04-28 03:43:51,712 INFO L290 TraceCheckUtils]: 18: Hoare triple {8326#(<= (+ (* 4294967296 (div (+ 4294967291 main_~n~0 (* (div main_~z~0 4294967296) (- 4294967296))) 4294967296)) (* (div main_~z~0 4294967296) 4294967296) 4) main_~n~0)} assume !(~y~0 % 4294967296 > 0); {8327#(<= (+ main_~y~0 (* (div (+ 4294967291 main_~n~0) 4294967296) 4294967296) 4) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))} is VALID [2022-04-28 03:43:51,714 INFO L290 TraceCheckUtils]: 19: Hoare triple {8327#(<= (+ main_~y~0 (* (div (+ 4294967291 main_~n~0) 4294967296) 4294967296) 4) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {8328#(<= (+ (* (div (+ 4294967291 main_~n~0 (* (- 4294967296) (div (+ (- 1) main_~y~0) 4294967296))) 4294967296) 4294967296) main_~y~0 3) main_~n~0)} is VALID [2022-04-28 03:43:51,718 INFO L290 TraceCheckUtils]: 20: Hoare triple {8328#(<= (+ (* (div (+ 4294967291 main_~n~0 (* (- 4294967296) (div (+ (- 1) main_~y~0) 4294967296))) 4294967296) 4294967296) main_~y~0 3) main_~n~0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {8329#(<= (+ main_~y~0 2 (* (div (+ (* (div (+ (- 2) main_~y~0) 4294967296) (- 4294967296)) 4294967291 main_~n~0) 4294967296) 4294967296)) main_~n~0)} is VALID [2022-04-28 03:43:51,721 INFO L290 TraceCheckUtils]: 21: Hoare triple {8329#(<= (+ main_~y~0 2 (* (div (+ (* (div (+ (- 2) main_~y~0) 4294967296) (- 4294967296)) 4294967291 main_~n~0) 4294967296) 4294967296)) main_~n~0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {8330#(<= (+ (* 4294967296 (div (+ 4294967291 main_~n~0 (* (div (+ main_~y~0 (- 3)) 4294967296) (- 4294967296))) 4294967296)) main_~y~0 1) main_~n~0)} is VALID [2022-04-28 03:43:51,724 INFO L290 TraceCheckUtils]: 22: Hoare triple {8330#(<= (+ (* 4294967296 (div (+ 4294967291 main_~n~0 (* (div (+ main_~y~0 (- 3)) 4294967296) (- 4294967296))) 4294967296)) main_~y~0 1) main_~n~0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {8331#(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 03:43:51,725 INFO L290 TraceCheckUtils]: 23: Hoare triple {8331#(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); {8331#(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 03:43:51,726 INFO L272 TraceCheckUtils]: 24: Hoare triple {8331#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {8332#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:43:51,726 INFO L290 TraceCheckUtils]: 25: Hoare triple {8332#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {8333#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:43:51,727 INFO L290 TraceCheckUtils]: 26: Hoare triple {8333#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {8314#false} is VALID [2022-04-28 03:43:51,727 INFO L290 TraceCheckUtils]: 27: Hoare triple {8314#false} assume !false; {8314#false} is VALID [2022-04-28 03:43:51,727 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 03:43:51,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:43:51,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615924887] [2022-04-28 03:43:51,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615924887] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:43:51,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1042835046] [2022-04-28 03:43:51,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:43:51,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:43:51,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:43:51,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 03:43:51,734 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 03:43:52,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:43:52,594 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 38 conjunts are in the unsatisfiable core [2022-04-28 03:43:52,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:43:52,706 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:44:16,625 WARN L833 $PredicateComparison]: unable to prove that (and (< 0 (mod c_main_~y~0 4294967296)) (= (+ c_main_~z~0 1) (+ (- 3) c_main_~y~0)) (< 0 c_main_~y~0) (<= (div (+ (* (- 1) c_main_~n~0) c_main_~y~0) (- 4294967296)) (div (+ (* (- 1) c_main_~y~0) c_main_~n~0) 4294967296)) (forall ((v_it_20 Int)) (or (not (<= 1 v_it_20)) (not (<= (+ v_it_20 1) c_main_~y~0)) (< 0 (mod (+ (* 4294967295 v_it_20) c_main_~n~0) 4294967296))))) is different from false [2022-04-28 03:45:21,006 INFO L272 TraceCheckUtils]: 0: Hoare triple {8313#true} call ULTIMATE.init(); {8313#true} is VALID [2022-04-28 03:45:21,007 INFO L290 TraceCheckUtils]: 1: Hoare triple {8313#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {8313#true} is VALID [2022-04-28 03:45:21,007 INFO L290 TraceCheckUtils]: 2: Hoare triple {8313#true} assume true; {8313#true} is VALID [2022-04-28 03:45:21,007 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8313#true} {8313#true} #72#return; {8313#true} is VALID [2022-04-28 03:45:21,007 INFO L272 TraceCheckUtils]: 4: Hoare triple {8313#true} call #t~ret13 := main(); {8313#true} is VALID [2022-04-28 03:45:21,007 INFO L290 TraceCheckUtils]: 5: Hoare triple {8313#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {8318#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-28 03:45:21,017 INFO L290 TraceCheckUtils]: 6: Hoare triple {8318#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} [114] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_233 v_main_~x~0_232)) (.cse1 (mod v_main_~x~0_233 4294967296))) (or (and .cse0 (= |v_main_#t~post6_100| |v_main_#t~post6_99|) (= v_main_~y~0_247 v_main_~y~0_246) (= |v_main_#t~post5_100| |v_main_#t~post5_99|)) (and .cse0 (<= .cse1 0) (= |v_main_#t~post6_99| |v_main_#t~post6_100|) (= v_main_~y~0_246 v_main_~y~0_247) (= |v_main_#t~post5_99| |v_main_#t~post5_100|)) (and (= v_main_~y~0_246 (+ v_main_~x~0_233 v_main_~y~0_247 (* v_main_~x~0_232 (- 1)))) (forall ((v_it_20 Int)) (or (< 0 (mod (+ v_main_~x~0_233 (* 4294967295 v_it_20)) 4294967296)) (not (<= (+ v_main_~x~0_232 v_it_20 1) v_main_~x~0_233)) (not (<= 1 v_it_20)))) (< 0 .cse1) (< v_main_~x~0_232 v_main_~x~0_233)))) InVars {main_~y~0=v_main_~y~0_247, main_#t~post5=|v_main_#t~post5_100|, main_~x~0=v_main_~x~0_233, main_#t~post6=|v_main_#t~post6_100|} OutVars{main_~y~0=v_main_~y~0_246, main_#t~post5=|v_main_#t~post5_99|, main_~x~0=v_main_~x~0_232, main_#t~post6=|v_main_#t~post6_99|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {8356#(or (and (< main_~x~0 main_~n~0) (< 0 (mod main_~n~0 4294967296)) (= main_~y~0 (+ main_~n~0 (* (- 1) main_~x~0))) (forall ((v_it_20 Int)) (or (< 0 (mod (+ (* 4294967295 v_it_20) main_~n~0) 4294967296)) (not (<= 1 v_it_20)) (not (<= (+ main_~x~0 v_it_20 1) main_~n~0))))) (and (= main_~n~0 main_~x~0) (= main_~y~0 0)))} is VALID [2022-04-28 03:45:21,024 INFO L290 TraceCheckUtils]: 7: Hoare triple {8356#(or (and (< main_~x~0 main_~n~0) (< 0 (mod main_~n~0 4294967296)) (= main_~y~0 (+ main_~n~0 (* (- 1) main_~x~0))) (forall ((v_it_20 Int)) (or (< 0 (mod (+ (* 4294967295 v_it_20) main_~n~0) 4294967296)) (not (<= 1 v_it_20)) (not (<= (+ main_~x~0 v_it_20 1) main_~n~0))))) (and (= main_~n~0 main_~x~0) (= main_~y~0 0)))} [113] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {8360#(or (and (<= (div (+ main_~y~0 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296)) (< 0 (mod main_~n~0 4294967296)) (< 0 main_~y~0) (forall ((v_it_20 Int)) (or (< 0 (mod (+ (* 4294967295 v_it_20) main_~n~0) 4294967296)) (not (<= (+ v_it_20 1) main_~y~0)) (not (<= 1 v_it_20))))) (and (<= (div (- main_~n~0) (- 4294967296)) (div main_~n~0 4294967296)) (= main_~y~0 0)))} is VALID [2022-04-28 03:45:21,028 INFO L290 TraceCheckUtils]: 8: Hoare triple {8360#(or (and (<= (div (+ main_~y~0 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296)) (< 0 (mod main_~n~0 4294967296)) (< 0 main_~y~0) (forall ((v_it_20 Int)) (or (< 0 (mod (+ (* 4294967295 v_it_20) main_~n~0) 4294967296)) (not (<= (+ v_it_20 1) main_~y~0)) (not (<= 1 v_it_20))))) (and (<= (div (- main_~n~0) (- 4294967296)) (div main_~n~0 4294967296)) (= main_~y~0 0)))} ~z~0 := ~y~0; {8364#(and (= main_~z~0 main_~y~0) (or (and (<= (div (+ main_~y~0 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296)) (< 0 (mod main_~n~0 4294967296)) (< 0 main_~y~0) (forall ((v_it_20 Int)) (or (< 0 (mod (+ (* 4294967295 v_it_20) main_~n~0) 4294967296)) (not (<= (+ v_it_20 1) main_~y~0)) (not (<= 1 v_it_20))))) (and (<= (div (- main_~n~0) (- 4294967296)) (div main_~n~0 4294967296)) (= main_~y~0 0))))} is VALID [2022-04-28 03:45:21,032 INFO L290 TraceCheckUtils]: 9: Hoare triple {8364#(and (= main_~z~0 main_~y~0) (or (and (<= (div (+ main_~y~0 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296)) (< 0 (mod main_~n~0 4294967296)) (< 0 main_~y~0) (forall ((v_it_20 Int)) (or (< 0 (mod (+ (* 4294967295 v_it_20) main_~n~0) 4294967296)) (not (<= (+ v_it_20 1) main_~y~0)) (not (<= 1 v_it_20))))) (and (<= (div (- main_~n~0) (- 4294967296)) (div main_~n~0 4294967296)) (= main_~y~0 0))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8368#(and (<= (div (+ main_~y~0 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296)) (< 0 main_~y~0) (forall ((v_it_20 Int)) (or (< 0 (mod (+ (* 4294967295 v_it_20) main_~n~0) 4294967296)) (not (<= (+ v_it_20 1) main_~y~0)) (not (<= 1 v_it_20)))) (= main_~y~0 (+ main_~z~0 1)) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 03:45:21,034 INFO L290 TraceCheckUtils]: 10: Hoare triple {8368#(and (<= (div (+ main_~y~0 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296)) (< 0 main_~y~0) (forall ((v_it_20 Int)) (or (< 0 (mod (+ (* 4294967295 v_it_20) main_~n~0) 4294967296)) (not (<= (+ v_it_20 1) main_~y~0)) (not (<= 1 v_it_20)))) (= 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; {8372#(and (= main_~y~0 (+ main_~z~0 2)) (<= (div (+ main_~y~0 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296)) (< 0 main_~y~0) (forall ((v_it_20 Int)) (or (< 0 (mod (+ (* 4294967295 v_it_20) main_~n~0) 4294967296)) (not (<= (+ v_it_20 1) main_~y~0)) (not (<= 1 v_it_20)))) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 03:45:21,036 INFO L290 TraceCheckUtils]: 11: Hoare triple {8372#(and (= main_~y~0 (+ main_~z~0 2)) (<= (div (+ main_~y~0 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296)) (< 0 main_~y~0) (forall ((v_it_20 Int)) (or (< 0 (mod (+ (* 4294967295 v_it_20) main_~n~0) 4294967296)) (not (<= (+ v_it_20 1) main_~y~0)) (not (<= 1 v_it_20)))) (< 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; {8376#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= (div (+ main_~y~0 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296)) (< 0 main_~y~0) (forall ((v_it_20 Int)) (or (< 0 (mod (+ (* 4294967295 v_it_20) main_~n~0) 4294967296)) (not (<= (+ v_it_20 1) main_~y~0)) (not (<= 1 v_it_20)))) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 03:45:21,038 INFO L290 TraceCheckUtils]: 12: Hoare triple {8376#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= (div (+ main_~y~0 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296)) (< 0 main_~y~0) (forall ((v_it_20 Int)) (or (< 0 (mod (+ (* 4294967295 v_it_20) main_~n~0) 4294967296)) (not (<= (+ v_it_20 1) main_~y~0)) (not (<= 1 v_it_20)))) (< 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; {8380#(and (= (+ main_~y~0 (- 3)) (+ main_~z~0 1)) (<= (div (+ main_~y~0 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296)) (< 0 main_~y~0) (forall ((v_it_20 Int)) (or (< 0 (mod (+ (* 4294967295 v_it_20) main_~n~0) 4294967296)) (not (<= (+ v_it_20 1) main_~y~0)) (not (<= 1 v_it_20)))) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 03:45:21,048 INFO L290 TraceCheckUtils]: 13: Hoare triple {8380#(and (= (+ main_~y~0 (- 3)) (+ main_~z~0 1)) (<= (div (+ main_~y~0 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296)) (< 0 main_~y~0) (forall ((v_it_20 Int)) (or (< 0 (mod (+ (* 4294967295 v_it_20) main_~n~0) 4294967296)) (not (<= (+ v_it_20 1) main_~y~0)) (not (<= 1 v_it_20)))) (< 0 (mod main_~y~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {8384#(and (<= (div (+ main_~y~0 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296)) (<= (mod (+ 4294967292 main_~y~0) 4294967296) 0) (< 0 main_~y~0) (forall ((v_it_20 Int)) (or (< 0 (mod (+ (* 4294967295 v_it_20) main_~n~0) 4294967296)) (not (<= (+ v_it_20 1) main_~y~0)) (not (<= 1 v_it_20)))))} is VALID [2022-04-28 03:45:21,075 INFO L290 TraceCheckUtils]: 14: Hoare triple {8384#(and (<= (div (+ main_~y~0 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296)) (<= (mod (+ 4294967292 main_~y~0) 4294967296) 0) (< 0 main_~y~0) (forall ((v_it_20 Int)) (or (< 0 (mod (+ (* 4294967295 v_it_20) main_~n~0) 4294967296)) (not (<= (+ v_it_20 1) main_~y~0)) (not (<= 1 v_it_20)))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {8388#(and (forall ((v_it_20 Int)) (or (< 0 (mod (+ (* 4294967295 v_it_20) main_~n~0) 4294967296)) (not (<= 1 v_it_20)) (not (<= v_it_20 main_~y~0)))) (<= (mod (+ main_~y~0 4294967293) 4294967296) 0) (<= (div (+ main_~y~0 (* (- 1) main_~n~0) 1) (- 4294967296)) (div (+ (- 1) main_~n~0 (* (- 1) main_~y~0)) 4294967296)) (< 0 (+ main_~y~0 1)))} is VALID [2022-04-28 03:45:21,110 INFO L290 TraceCheckUtils]: 15: Hoare triple {8388#(and (forall ((v_it_20 Int)) (or (< 0 (mod (+ (* 4294967295 v_it_20) main_~n~0) 4294967296)) (not (<= 1 v_it_20)) (not (<= v_it_20 main_~y~0)))) (<= (mod (+ main_~y~0 4294967293) 4294967296) 0) (<= (div (+ main_~y~0 (* (- 1) main_~n~0) 1) (- 4294967296)) (div (+ (- 1) main_~n~0 (* (- 1) main_~y~0)) 4294967296)) (< 0 (+ main_~y~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; {8392#(and (< 0 (+ main_~y~0 2)) (forall ((v_it_20 Int)) (or (< 0 (mod (+ (* 4294967295 v_it_20) main_~n~0) 4294967296)) (not (<= 1 v_it_20)) (not (<= v_it_20 (+ main_~y~0 1))))) (<= (mod (+ main_~y~0 4294967294) 4294967296) 0) (<= (div (+ main_~y~0 2 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ (- 2) main_~n~0 (* (- 1) main_~y~0)) 4294967296)))} is VALID [2022-04-28 03:45:21,122 INFO L290 TraceCheckUtils]: 16: Hoare triple {8392#(and (< 0 (+ main_~y~0 2)) (forall ((v_it_20 Int)) (or (< 0 (mod (+ (* 4294967295 v_it_20) main_~n~0) 4294967296)) (not (<= 1 v_it_20)) (not (<= v_it_20 (+ main_~y~0 1))))) (<= (mod (+ main_~y~0 4294967294) 4294967296) 0) (<= (div (+ main_~y~0 2 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ (- 2) main_~n~0 (* (- 1) 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; {8396#(and (<= (mod (+ main_~y~0 4294967295) 4294967296) 0) (< 0 (+ main_~y~0 3)) (forall ((v_it_20 Int)) (or (< 0 (mod (+ (* 4294967295 v_it_20) main_~n~0) 4294967296)) (not (<= v_it_20 (+ main_~y~0 2))) (not (<= 1 v_it_20)))) (<= (div (+ main_~y~0 3 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (- 3) (* (- 1) main_~y~0)) 4294967296)))} is VALID [2022-04-28 03:45:21,336 INFO L290 TraceCheckUtils]: 17: Hoare triple {8396#(and (<= (mod (+ main_~y~0 4294967295) 4294967296) 0) (< 0 (+ main_~y~0 3)) (forall ((v_it_20 Int)) (or (< 0 (mod (+ (* 4294967295 v_it_20) main_~n~0) 4294967296)) (not (<= v_it_20 (+ main_~y~0 2))) (not (<= 1 v_it_20)))) (<= (div (+ main_~y~0 3 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (- 3) (* (- 1) 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; {8400#(and (<= (div (+ main_~y~0 4 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (- 4) (* (- 1) main_~y~0)) 4294967296)) (<= (mod main_~y~0 4294967296) 0) (< 0 (+ main_~y~0 4)) (forall ((v_it_20 Int)) (or (not (<= v_it_20 (+ main_~y~0 3))) (< 0 (mod (+ (* 4294967295 v_it_20) main_~n~0) 4294967296)) (not (<= 1 v_it_20)))))} is VALID [2022-04-28 03:45:21,337 INFO L290 TraceCheckUtils]: 18: Hoare triple {8400#(and (<= (div (+ main_~y~0 4 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (- 4) (* (- 1) main_~y~0)) 4294967296)) (<= (mod main_~y~0 4294967296) 0) (< 0 (+ main_~y~0 4)) (forall ((v_it_20 Int)) (or (not (<= v_it_20 (+ main_~y~0 3))) (< 0 (mod (+ (* 4294967295 v_it_20) main_~n~0) 4294967296)) (not (<= 1 v_it_20)))))} assume !(~y~0 % 4294967296 > 0); {8400#(and (<= (div (+ main_~y~0 4 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (- 4) (* (- 1) main_~y~0)) 4294967296)) (<= (mod main_~y~0 4294967296) 0) (< 0 (+ main_~y~0 4)) (forall ((v_it_20 Int)) (or (not (<= v_it_20 (+ main_~y~0 3))) (< 0 (mod (+ (* 4294967295 v_it_20) main_~n~0) 4294967296)) (not (<= 1 v_it_20)))))} is VALID [2022-04-28 03:45:21,363 INFO L290 TraceCheckUtils]: 19: Hoare triple {8400#(and (<= (div (+ main_~y~0 4 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (- 4) (* (- 1) main_~y~0)) 4294967296)) (<= (mod main_~y~0 4294967296) 0) (< 0 (+ main_~y~0 4)) (forall ((v_it_20 Int)) (or (not (<= v_it_20 (+ main_~y~0 3))) (< 0 (mod (+ (* 4294967295 v_it_20) main_~n~0) 4294967296)) (not (<= 1 v_it_20)))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {8396#(and (<= (mod (+ main_~y~0 4294967295) 4294967296) 0) (< 0 (+ main_~y~0 3)) (forall ((v_it_20 Int)) (or (< 0 (mod (+ (* 4294967295 v_it_20) main_~n~0) 4294967296)) (not (<= v_it_20 (+ main_~y~0 2))) (not (<= 1 v_it_20)))) (<= (div (+ main_~y~0 3 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (- 3) (* (- 1) main_~y~0)) 4294967296)))} is VALID [2022-04-28 03:45:21,387 INFO L290 TraceCheckUtils]: 20: Hoare triple {8396#(and (<= (mod (+ main_~y~0 4294967295) 4294967296) 0) (< 0 (+ main_~y~0 3)) (forall ((v_it_20 Int)) (or (< 0 (mod (+ (* 4294967295 v_it_20) main_~n~0) 4294967296)) (not (<= v_it_20 (+ main_~y~0 2))) (not (<= 1 v_it_20)))) (<= (div (+ main_~y~0 3 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (- 3) (* (- 1) main_~y~0)) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {8392#(and (< 0 (+ main_~y~0 2)) (forall ((v_it_20 Int)) (or (< 0 (mod (+ (* 4294967295 v_it_20) main_~n~0) 4294967296)) (not (<= 1 v_it_20)) (not (<= v_it_20 (+ main_~y~0 1))))) (<= (mod (+ main_~y~0 4294967294) 4294967296) 0) (<= (div (+ main_~y~0 2 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ (- 2) main_~n~0 (* (- 1) main_~y~0)) 4294967296)))} is VALID [2022-04-28 03:45:21,400 INFO L290 TraceCheckUtils]: 21: Hoare triple {8392#(and (< 0 (+ main_~y~0 2)) (forall ((v_it_20 Int)) (or (< 0 (mod (+ (* 4294967295 v_it_20) main_~n~0) 4294967296)) (not (<= 1 v_it_20)) (not (<= v_it_20 (+ main_~y~0 1))))) (<= (mod (+ main_~y~0 4294967294) 4294967296) 0) (<= (div (+ main_~y~0 2 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ (- 2) main_~n~0 (* (- 1) main_~y~0)) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {8388#(and (forall ((v_it_20 Int)) (or (< 0 (mod (+ (* 4294967295 v_it_20) main_~n~0) 4294967296)) (not (<= 1 v_it_20)) (not (<= v_it_20 main_~y~0)))) (<= (mod (+ main_~y~0 4294967293) 4294967296) 0) (<= (div (+ main_~y~0 (* (- 1) main_~n~0) 1) (- 4294967296)) (div (+ (- 1) main_~n~0 (* (- 1) main_~y~0)) 4294967296)) (< 0 (+ main_~y~0 1)))} is VALID [2022-04-28 03:45:21,409 INFO L290 TraceCheckUtils]: 22: Hoare triple {8388#(and (forall ((v_it_20 Int)) (or (< 0 (mod (+ (* 4294967295 v_it_20) main_~n~0) 4294967296)) (not (<= 1 v_it_20)) (not (<= v_it_20 main_~y~0)))) (<= (mod (+ main_~y~0 4294967293) 4294967296) 0) (<= (div (+ main_~y~0 (* (- 1) main_~n~0) 1) (- 4294967296)) (div (+ (- 1) main_~n~0 (* (- 1) main_~y~0)) 4294967296)) (< 0 (+ main_~y~0 1)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {8384#(and (<= (div (+ main_~y~0 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296)) (<= (mod (+ 4294967292 main_~y~0) 4294967296) 0) (< 0 main_~y~0) (forall ((v_it_20 Int)) (or (< 0 (mod (+ (* 4294967295 v_it_20) main_~n~0) 4294967296)) (not (<= (+ v_it_20 1) main_~y~0)) (not (<= 1 v_it_20)))))} is VALID [2022-04-28 03:45:21,409 INFO L290 TraceCheckUtils]: 23: Hoare triple {8384#(and (<= (div (+ main_~y~0 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296)) (<= (mod (+ 4294967292 main_~y~0) 4294967296) 0) (< 0 main_~y~0) (forall ((v_it_20 Int)) (or (< 0 (mod (+ (* 4294967295 v_it_20) main_~n~0) 4294967296)) (not (<= (+ v_it_20 1) main_~y~0)) (not (<= 1 v_it_20)))))} assume !(~x~0 % 4294967296 > 0); {8384#(and (<= (div (+ main_~y~0 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296)) (<= (mod (+ 4294967292 main_~y~0) 4294967296) 0) (< 0 main_~y~0) (forall ((v_it_20 Int)) (or (< 0 (mod (+ (* 4294967295 v_it_20) main_~n~0) 4294967296)) (not (<= (+ v_it_20 1) main_~y~0)) (not (<= 1 v_it_20)))))} is VALID [2022-04-28 03:45:21,419 INFO L272 TraceCheckUtils]: 24: Hoare triple {8384#(and (<= (div (+ main_~y~0 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296)) (<= (mod (+ 4294967292 main_~y~0) 4294967296) 0) (< 0 main_~y~0) (forall ((v_it_20 Int)) (or (< 0 (mod (+ (* 4294967295 v_it_20) main_~n~0) 4294967296)) (not (<= (+ v_it_20 1) main_~y~0)) (not (<= 1 v_it_20)))))} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {8422#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:45:21,420 INFO L290 TraceCheckUtils]: 25: Hoare triple {8422#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8426#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:45:21,420 INFO L290 TraceCheckUtils]: 26: Hoare triple {8426#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8314#false} is VALID [2022-04-28 03:45:21,420 INFO L290 TraceCheckUtils]: 27: Hoare triple {8314#false} assume !false; {8314#false} is VALID [2022-04-28 03:45:21,421 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 24 refuted. 2 times theorem prover too weak. 0 trivial. 4 not checked. [2022-04-28 03:45:21,421 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:46:32,382 INFO L290 TraceCheckUtils]: 27: Hoare triple {8314#false} assume !false; {8314#false} is VALID [2022-04-28 03:46:32,383 INFO L290 TraceCheckUtils]: 26: Hoare triple {8426#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8314#false} is VALID [2022-04-28 03:46:32,383 INFO L290 TraceCheckUtils]: 25: Hoare triple {8422#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8426#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:46:32,384 INFO L272 TraceCheckUtils]: 24: Hoare triple {8331#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {8422#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:46:32,385 INFO L290 TraceCheckUtils]: 23: Hoare triple {8331#(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); {8331#(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 03:46:32,386 INFO L290 TraceCheckUtils]: 22: Hoare triple {8448#(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~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {8331#(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 03:46:32,387 INFO L290 TraceCheckUtils]: 21: Hoare triple {8452#(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)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {8448#(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 03:46:32,389 INFO L290 TraceCheckUtils]: 20: Hoare triple {8456#(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)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {8452#(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)))} is VALID [2022-04-28 03:46:32,390 INFO L290 TraceCheckUtils]: 19: Hoare triple {8460#(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)))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {8456#(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)))} is VALID [2022-04-28 03:46:32,391 INFO L290 TraceCheckUtils]: 18: Hoare triple {8464#(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 main_~y~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {8460#(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)))))} is VALID [2022-04-28 03:46:32,400 INFO L290 TraceCheckUtils]: 17: Hoare triple {8468#(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_~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; {8464#(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 main_~y~0 4294967296)))} is VALID [2022-04-28 03:46:32,404 INFO L290 TraceCheckUtils]: 16: Hoare triple {8472#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (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))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {8468#(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_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 03:46:32,407 INFO L290 TraceCheckUtils]: 15: Hoare triple {8476#(or (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)))) (< 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; {8472#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (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))))} is VALID [2022-04-28 03:46:32,408 INFO L290 TraceCheckUtils]: 14: Hoare triple {8480#(or (< 0 (mod (+ 4294967292 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))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {8476#(or (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)))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-28 03:46:32,409 INFO L290 TraceCheckUtils]: 13: Hoare triple {8484#(or (< 0 (mod main_~z~0 4294967296)) (< 0 (mod (+ 4294967292 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))))} assume !(~z~0 % 4294967296 > 0); {8480#(or (< 0 (mod (+ 4294967292 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 03:46:32,411 INFO L290 TraceCheckUtils]: 12: Hoare triple {8488#(or (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)) (< 0 (mod (+ main_~z~0 4294967295) 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 !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8484#(or (< 0 (mod main_~z~0 4294967296)) (< 0 (mod (+ 4294967292 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 03:46:32,414 INFO L290 TraceCheckUtils]: 11: Hoare triple {8492#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (< 0 (mod (+ 4294967292 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))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8488#(or (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)) (< 0 (mod (+ main_~z~0 4294967295) 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 03:46:32,416 INFO L290 TraceCheckUtils]: 10: Hoare triple {8496#(or (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)) (< 0 (mod (+ main_~z~0 4294967293) 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 !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8492#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (< 0 (mod (+ 4294967292 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 03:46:32,417 INFO L290 TraceCheckUtils]: 9: Hoare triple {8500#(or (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)) (< 0 (mod (+ 4294967292 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))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8496#(or (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)) (< 0 (mod (+ main_~z~0 4294967293) 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 03:46:32,418 INFO L290 TraceCheckUtils]: 8: Hoare triple {8480#(or (< 0 (mod (+ 4294967292 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; {8500#(or (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)) (< 0 (mod (+ 4294967292 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 03:46:32,419 INFO L290 TraceCheckUtils]: 7: Hoare triple {8507#(or (< 0 (mod main_~x~0 4294967296)) (< 0 (mod (+ 4294967292 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))))} [113] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {8480#(or (< 0 (mod (+ 4294967292 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 03:46:34,468 WARN L290 TraceCheckUtils]: 6: Hoare triple {8511#(and (forall ((aux_mod_aux_mod_v_main_~y~0_268_47_104 Int) (aux_div_v_main_~y~0_268_47 Int) (aux_div_aux_mod_v_main_~y~0_268_47_104 Int)) (or (< (+ 4294967292 (* aux_div_aux_mod_v_main_~y~0_268_47_104 4294967296) aux_mod_aux_mod_v_main_~y~0_268_47_104) (* 4294967296 aux_div_v_main_~y~0_268_47)) (and (or (not (= (+ 4294967292 (* aux_div_aux_mod_v_main_~y~0_268_47_104 4294967296) aux_mod_aux_mod_v_main_~y~0_268_47_104) (+ 4294967292 main_~y~0))) (< (div (+ (- 1) (* (- 1) main_~x~0)) (- 4294967296)) (+ 2 (div (+ (- 1) main_~x~0) 4294967296)))) (or (not (< 0 (mod main_~x~0 4294967296))) (not (< main_~y~0 (+ (* aux_div_aux_mod_v_main_~y~0_268_47_104 4294967296) aux_mod_aux_mod_v_main_~y~0_268_47_104))) (forall ((aux_div_v_main_~x~0_246_32 Int)) (or (< (+ (* 4294967296 aux_div_v_main_~x~0_246_32) (* aux_div_aux_mod_v_main_~y~0_268_47_104 4294967296) aux_mod_aux_mod_v_main_~y~0_268_47_104) (+ main_~y~0 main_~x~0)) (< (+ main_~y~0 main_~x~0) (+ (* 4294967296 aux_div_v_main_~x~0_246_32) (* aux_div_aux_mod_v_main_~y~0_268_47_104 4294967296) aux_mod_aux_mod_v_main_~y~0_268_47_104)))) (exists ((v_it_20 Int)) (and (<= (+ main_~y~0 v_it_20 1) (+ (* aux_div_aux_mod_v_main_~y~0_268_47_104 4294967296) aux_mod_aux_mod_v_main_~y~0_268_47_104)) (not (< 0 (mod (+ (* 4294967295 v_it_20) main_~x~0) 4294967296))) (<= 1 v_it_20))))) (<= (+ (* (div main_~n~0 4294967296) 4294967296) aux_mod_aux_mod_v_main_~y~0_268_47_104) main_~n~0) (< (* 4294967296 aux_div_v_main_~y~0_268_47) (+ 4294967292 (* aux_div_aux_mod_v_main_~y~0_268_47_104 4294967296) aux_mod_aux_mod_v_main_~y~0_268_47_104)) (<= 4294967296 aux_mod_aux_mod_v_main_~y~0_268_47_104))) (forall ((aux_mod_aux_mod_v_main_~y~0_268_47_104 Int) (aux_div_v_main_~y~0_268_47 Int) (aux_div_aux_mod_v_main_~y~0_268_47_104 Int)) (or (< (+ 4294967292 (* aux_div_aux_mod_v_main_~y~0_268_47_104 4294967296) aux_mod_aux_mod_v_main_~y~0_268_47_104) (* 4294967296 aux_div_v_main_~y~0_268_47)) (< main_~n~0 (+ (* (div main_~n~0 4294967296) 4294967296) aux_mod_aux_mod_v_main_~y~0_268_47_104 1)) (and (or (not (= (+ 4294967292 (* aux_div_aux_mod_v_main_~y~0_268_47_104 4294967296) aux_mod_aux_mod_v_main_~y~0_268_47_104) (+ 4294967292 main_~y~0))) (< (div (+ (- 1) (* (- 1) main_~x~0)) (- 4294967296)) (+ 2 (div (+ (- 1) main_~x~0) 4294967296)))) (or (not (< 0 (mod main_~x~0 4294967296))) (not (< main_~y~0 (+ (* aux_div_aux_mod_v_main_~y~0_268_47_104 4294967296) aux_mod_aux_mod_v_main_~y~0_268_47_104))) (forall ((aux_div_v_main_~x~0_246_32 Int)) (or (< (+ (* 4294967296 aux_div_v_main_~x~0_246_32) (* aux_div_aux_mod_v_main_~y~0_268_47_104 4294967296) aux_mod_aux_mod_v_main_~y~0_268_47_104) (+ main_~y~0 main_~x~0)) (< (+ main_~y~0 main_~x~0) (+ (* 4294967296 aux_div_v_main_~x~0_246_32) (* aux_div_aux_mod_v_main_~y~0_268_47_104 4294967296) aux_mod_aux_mod_v_main_~y~0_268_47_104)))) (exists ((v_it_20 Int)) (and (<= (+ main_~y~0 v_it_20 1) (+ (* aux_div_aux_mod_v_main_~y~0_268_47_104 4294967296) aux_mod_aux_mod_v_main_~y~0_268_47_104)) (not (< 0 (mod (+ (* 4294967295 v_it_20) main_~x~0) 4294967296))) (<= 1 v_it_20))))) (< aux_mod_aux_mod_v_main_~y~0_268_47_104 0) (< (* 4294967296 aux_div_v_main_~y~0_268_47) (+ 4294967292 (* aux_div_aux_mod_v_main_~y~0_268_47_104 4294967296) aux_mod_aux_mod_v_main_~y~0_268_47_104)))))} [114] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_233 v_main_~x~0_232)) (.cse1 (mod v_main_~x~0_233 4294967296))) (or (and .cse0 (= |v_main_#t~post6_100| |v_main_#t~post6_99|) (= v_main_~y~0_247 v_main_~y~0_246) (= |v_main_#t~post5_100| |v_main_#t~post5_99|)) (and .cse0 (<= .cse1 0) (= |v_main_#t~post6_99| |v_main_#t~post6_100|) (= v_main_~y~0_246 v_main_~y~0_247) (= |v_main_#t~post5_99| |v_main_#t~post5_100|)) (and (= v_main_~y~0_246 (+ v_main_~x~0_233 v_main_~y~0_247 (* v_main_~x~0_232 (- 1)))) (forall ((v_it_20 Int)) (or (< 0 (mod (+ v_main_~x~0_233 (* 4294967295 v_it_20)) 4294967296)) (not (<= (+ v_main_~x~0_232 v_it_20 1) v_main_~x~0_233)) (not (<= 1 v_it_20)))) (< 0 .cse1) (< v_main_~x~0_232 v_main_~x~0_233)))) InVars {main_~y~0=v_main_~y~0_247, main_#t~post5=|v_main_#t~post5_100|, main_~x~0=v_main_~x~0_233, main_#t~post6=|v_main_#t~post6_100|} OutVars{main_~y~0=v_main_~y~0_246, main_#t~post5=|v_main_#t~post5_99|, main_~x~0=v_main_~x~0_232, main_#t~post6=|v_main_#t~post6_99|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {8507#(or (< 0 (mod main_~x~0 4294967296)) (< 0 (mod (+ 4294967292 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 UNKNOWN [2022-04-28 03:46:34,504 INFO L290 TraceCheckUtils]: 5: Hoare triple {8313#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {8511#(and (forall ((aux_mod_aux_mod_v_main_~y~0_268_47_104 Int) (aux_div_v_main_~y~0_268_47 Int) (aux_div_aux_mod_v_main_~y~0_268_47_104 Int)) (or (< (+ 4294967292 (* aux_div_aux_mod_v_main_~y~0_268_47_104 4294967296) aux_mod_aux_mod_v_main_~y~0_268_47_104) (* 4294967296 aux_div_v_main_~y~0_268_47)) (and (or (not (= (+ 4294967292 (* aux_div_aux_mod_v_main_~y~0_268_47_104 4294967296) aux_mod_aux_mod_v_main_~y~0_268_47_104) (+ 4294967292 main_~y~0))) (< (div (+ (- 1) (* (- 1) main_~x~0)) (- 4294967296)) (+ 2 (div (+ (- 1) main_~x~0) 4294967296)))) (or (not (< 0 (mod main_~x~0 4294967296))) (not (< main_~y~0 (+ (* aux_div_aux_mod_v_main_~y~0_268_47_104 4294967296) aux_mod_aux_mod_v_main_~y~0_268_47_104))) (forall ((aux_div_v_main_~x~0_246_32 Int)) (or (< (+ (* 4294967296 aux_div_v_main_~x~0_246_32) (* aux_div_aux_mod_v_main_~y~0_268_47_104 4294967296) aux_mod_aux_mod_v_main_~y~0_268_47_104) (+ main_~y~0 main_~x~0)) (< (+ main_~y~0 main_~x~0) (+ (* 4294967296 aux_div_v_main_~x~0_246_32) (* aux_div_aux_mod_v_main_~y~0_268_47_104 4294967296) aux_mod_aux_mod_v_main_~y~0_268_47_104)))) (exists ((v_it_20 Int)) (and (<= (+ main_~y~0 v_it_20 1) (+ (* aux_div_aux_mod_v_main_~y~0_268_47_104 4294967296) aux_mod_aux_mod_v_main_~y~0_268_47_104)) (not (< 0 (mod (+ (* 4294967295 v_it_20) main_~x~0) 4294967296))) (<= 1 v_it_20))))) (<= (+ (* (div main_~n~0 4294967296) 4294967296) aux_mod_aux_mod_v_main_~y~0_268_47_104) main_~n~0) (< (* 4294967296 aux_div_v_main_~y~0_268_47) (+ 4294967292 (* aux_div_aux_mod_v_main_~y~0_268_47_104 4294967296) aux_mod_aux_mod_v_main_~y~0_268_47_104)) (<= 4294967296 aux_mod_aux_mod_v_main_~y~0_268_47_104))) (forall ((aux_mod_aux_mod_v_main_~y~0_268_47_104 Int) (aux_div_v_main_~y~0_268_47 Int) (aux_div_aux_mod_v_main_~y~0_268_47_104 Int)) (or (< (+ 4294967292 (* aux_div_aux_mod_v_main_~y~0_268_47_104 4294967296) aux_mod_aux_mod_v_main_~y~0_268_47_104) (* 4294967296 aux_div_v_main_~y~0_268_47)) (< main_~n~0 (+ (* (div main_~n~0 4294967296) 4294967296) aux_mod_aux_mod_v_main_~y~0_268_47_104 1)) (and (or (not (= (+ 4294967292 (* aux_div_aux_mod_v_main_~y~0_268_47_104 4294967296) aux_mod_aux_mod_v_main_~y~0_268_47_104) (+ 4294967292 main_~y~0))) (< (div (+ (- 1) (* (- 1) main_~x~0)) (- 4294967296)) (+ 2 (div (+ (- 1) main_~x~0) 4294967296)))) (or (not (< 0 (mod main_~x~0 4294967296))) (not (< main_~y~0 (+ (* aux_div_aux_mod_v_main_~y~0_268_47_104 4294967296) aux_mod_aux_mod_v_main_~y~0_268_47_104))) (forall ((aux_div_v_main_~x~0_246_32 Int)) (or (< (+ (* 4294967296 aux_div_v_main_~x~0_246_32) (* aux_div_aux_mod_v_main_~y~0_268_47_104 4294967296) aux_mod_aux_mod_v_main_~y~0_268_47_104) (+ main_~y~0 main_~x~0)) (< (+ main_~y~0 main_~x~0) (+ (* 4294967296 aux_div_v_main_~x~0_246_32) (* aux_div_aux_mod_v_main_~y~0_268_47_104 4294967296) aux_mod_aux_mod_v_main_~y~0_268_47_104)))) (exists ((v_it_20 Int)) (and (<= (+ main_~y~0 v_it_20 1) (+ (* aux_div_aux_mod_v_main_~y~0_268_47_104 4294967296) aux_mod_aux_mod_v_main_~y~0_268_47_104)) (not (< 0 (mod (+ (* 4294967295 v_it_20) main_~x~0) 4294967296))) (<= 1 v_it_20))))) (< aux_mod_aux_mod_v_main_~y~0_268_47_104 0) (< (* 4294967296 aux_div_v_main_~y~0_268_47) (+ 4294967292 (* aux_div_aux_mod_v_main_~y~0_268_47_104 4294967296) aux_mod_aux_mod_v_main_~y~0_268_47_104)))))} is VALID [2022-04-28 03:46:34,505 INFO L272 TraceCheckUtils]: 4: Hoare triple {8313#true} call #t~ret13 := main(); {8313#true} is VALID [2022-04-28 03:46:34,505 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8313#true} {8313#true} #72#return; {8313#true} is VALID [2022-04-28 03:46:34,505 INFO L290 TraceCheckUtils]: 2: Hoare triple {8313#true} assume true; {8313#true} is VALID [2022-04-28 03:46:34,505 INFO L290 TraceCheckUtils]: 1: Hoare triple {8313#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {8313#true} is VALID [2022-04-28 03:46:34,505 INFO L272 TraceCheckUtils]: 0: Hoare triple {8313#true} call ULTIMATE.init(); {8313#true} is VALID [2022-04-28 03:46:34,505 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 03:46:34,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1042835046] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:46:34,505 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:46:34,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 21] total 49 [2022-04-28 03:47:15,870 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:47:15,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [505468886] [2022-04-28 03:47:15,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [505468886] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:47:15,871 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:47:15,871 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-28 03:47:15,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405870703] [2022-04-28 03:47:15,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:47:15,871 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 19 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 30 [2022-04-28 03:47:15,871 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:47:15,871 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 19 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 03:47:15,920 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 03:47:15,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-28 03:47:15,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:47:15,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-28 03:47:15,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=369, Invalid=2131, Unknown=54, NotChecked=98, Total=2652 [2022-04-28 03:47:15,921 INFO L87 Difference]: Start difference. First operand 62 states and 76 transitions. Second operand has 21 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 19 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 03:47:26,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:47:26,378 INFO L93 Difference]: Finished difference Result 81 states and 95 transitions. [2022-04-28 03:47:26,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-28 03:47:26,378 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 19 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 30 [2022-04-28 03:47:26,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:47:26,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 19 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 03:47:26,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 51 transitions. [2022-04-28 03:47:26,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 19 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 03:47:26,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 51 transitions. [2022-04-28 03:47:26,380 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 51 transitions. [2022-04-28 03:47:28,544 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 50 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 03:47:28,545 INFO L225 Difference]: With dead ends: 81 [2022-04-28 03:47:28,545 INFO L226 Difference]: Without dead ends: 57 [2022-04-28 03:47:28,546 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 26 SyntacticMatches, 5 SemanticMatches, 68 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1389 ImplicationChecksByTransitivity, 196.5s TimeCoverageRelationStatistics Valid=639, Invalid=4001, Unknown=56, NotChecked=134, Total=4830 [2022-04-28 03:47:28,546 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 22 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 61 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-28 03:47:28,546 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 67 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 232 Invalid, 0 Unknown, 61 Unchecked, 0.9s Time] [2022-04-28 03:47:28,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-04-28 03:47:28,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2022-04-28 03:47:28,815 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:47:28,815 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand has 57 states, 52 states have (on average 1.25) internal successors, (65), 52 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 03:47:28,815 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand has 57 states, 52 states have (on average 1.25) internal successors, (65), 52 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 03:47:28,815 INFO L87 Difference]: Start difference. First operand 57 states. Second operand has 57 states, 52 states have (on average 1.25) internal successors, (65), 52 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 03:47:28,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:47:28,816 INFO L93 Difference]: Finished difference Result 57 states and 69 transitions. [2022-04-28 03:47:28,816 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 69 transitions. [2022-04-28 03:47:28,816 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:47:28,816 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:47:28,816 INFO L74 IsIncluded]: Start isIncluded. First operand has 57 states, 52 states have (on average 1.25) internal successors, (65), 52 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 57 states. [2022-04-28 03:47:28,816 INFO L87 Difference]: Start difference. First operand has 57 states, 52 states have (on average 1.25) internal successors, (65), 52 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 57 states. [2022-04-28 03:47:28,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:47:28,817 INFO L93 Difference]: Finished difference Result 57 states and 69 transitions. [2022-04-28 03:47:28,817 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 69 transitions. [2022-04-28 03:47:28,817 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:47:28,817 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:47:28,817 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:47:28,817 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:47:28,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 52 states have (on average 1.25) internal successors, (65), 52 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 03:47:28,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 69 transitions. [2022-04-28 03:47:28,818 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 69 transitions. Word has length 30 [2022-04-28 03:47:28,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:47:28,818 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 69 transitions. [2022-04-28 03:47:28,818 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 19 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 03:47:28,818 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 57 states and 69 transitions. [2022-04-28 03:47:38,462 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 65 inductive. 0 not inductive. 4 times theorem prover too weak to decide inductivity. [2022-04-28 03:47:38,463 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 69 transitions. [2022-04-28 03:47:38,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-28 03:47:38,463 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:47:38,463 INFO L195 NwaCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:47:38,481 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-04-28 03:47:38,663 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,SelfDestructingSolverStorable21 [2022-04-28 03:47:38,664 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:47:38,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:47:38,664 INFO L85 PathProgramCache]: Analyzing trace with hash -2085098719, now seen corresponding path program 15 times [2022-04-28 03:47:38,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:47:38,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1318562235] [2022-04-28 03:47:38,938 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:47:38,939 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:47:38,941 INFO L85 PathProgramCache]: Analyzing trace with hash 1785965282, now seen corresponding path program 1 times [2022-04-28 03:47:38,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:47:38,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993705286] [2022-04-28 03:47:38,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:47:38,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:47:38,949 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_21.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:47:38,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:47:38,965 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_21.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:47:39,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:47:39,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:47:39,374 INFO L290 TraceCheckUtils]: 0: Hoare triple {8975#(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); {8961#true} is VALID [2022-04-28 03:47:39,374 INFO L290 TraceCheckUtils]: 1: Hoare triple {8961#true} assume true; {8961#true} is VALID [2022-04-28 03:47:39,374 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8961#true} {8961#true} #72#return; {8961#true} is VALID [2022-04-28 03:47:39,375 INFO L272 TraceCheckUtils]: 0: Hoare triple {8961#true} call ULTIMATE.init(); {8975#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:47:39,375 INFO L290 TraceCheckUtils]: 1: Hoare triple {8975#(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); {8961#true} is VALID [2022-04-28 03:47:39,375 INFO L290 TraceCheckUtils]: 2: Hoare triple {8961#true} assume true; {8961#true} is VALID [2022-04-28 03:47:39,375 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8961#true} {8961#true} #72#return; {8961#true} is VALID [2022-04-28 03:47:39,375 INFO L272 TraceCheckUtils]: 4: Hoare triple {8961#true} call #t~ret13 := main(); {8961#true} is VALID [2022-04-28 03:47:39,375 INFO L290 TraceCheckUtils]: 5: Hoare triple {8961#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {8961#true} is VALID [2022-04-28 03:47:39,375 INFO L290 TraceCheckUtils]: 6: Hoare triple {8961#true} [116] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_107| |v_main_#t~post5_106|)) (.cse1 (= |v_main_#t~post6_107| |v_main_#t~post6_106|)) (.cse2 (= v_main_~y~0_275 v_main_~y~0_274)) (.cse4 (mod v_main_~x~0_253 4294967296)) (.cse3 (= v_main_~x~0_253 v_main_~x~0_252))) (or (and .cse0 .cse1 .cse2 .cse3) (and (= v_main_~x~0_252 (+ v_main_~x~0_253 (* (- 1) v_main_~y~0_274) v_main_~y~0_275)) (forall ((v_it_21 Int)) (or (< 0 (mod (+ v_main_~x~0_253 (* 4294967295 v_it_21)) 4294967296)) (not (<= 1 v_it_21)) (not (<= (+ v_main_~y~0_275 v_it_21 1) v_main_~y~0_274)))) (< v_main_~y~0_275 v_main_~y~0_274) (< 0 .cse4)) (and .cse0 .cse1 .cse2 (<= .cse4 0) .cse3))) InVars {main_~y~0=v_main_~y~0_275, main_#t~post5=|v_main_#t~post5_107|, main_~x~0=v_main_~x~0_253, main_#t~post6=|v_main_#t~post6_107|} OutVars{main_~y~0=v_main_~y~0_274, main_#t~post5=|v_main_#t~post5_106|, main_~x~0=v_main_~x~0_252, main_#t~post6=|v_main_#t~post6_106|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {8961#true} is VALID [2022-04-28 03:47:39,376 INFO L290 TraceCheckUtils]: 7: Hoare triple {8961#true} [115] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {8966#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:47:39,376 INFO L290 TraceCheckUtils]: 8: Hoare triple {8966#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {8966#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:47:39,377 INFO L290 TraceCheckUtils]: 9: Hoare triple {8966#(<= main_~x~0 (* 4294967296 (div main_~x~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; {8967#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:47:39,378 INFO L290 TraceCheckUtils]: 10: Hoare triple {8967#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 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; {8968#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:47:39,380 INFO L290 TraceCheckUtils]: 11: Hoare triple {8968#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~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; {8969#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:47:39,381 INFO L290 TraceCheckUtils]: 12: Hoare triple {8969#(<= main_~x~0 (+ 3 (* (div (+ main_~x~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; {8970#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:47:39,382 INFO L290 TraceCheckUtils]: 13: Hoare triple {8970#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 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; {8971#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 03:47:39,383 INFO L290 TraceCheckUtils]: 14: Hoare triple {8971#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 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; {8972#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:47:39,384 INFO L290 TraceCheckUtils]: 15: Hoare triple {8972#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 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; {8973#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:47:39,385 INFO L290 TraceCheckUtils]: 16: Hoare triple {8973#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {8973#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:47:39,385 INFO L290 TraceCheckUtils]: 17: Hoare triple {8973#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 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; {8973#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:47:39,385 INFO L290 TraceCheckUtils]: 18: Hoare triple {8973#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 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; {8973#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:47:39,386 INFO L290 TraceCheckUtils]: 19: Hoare triple {8973#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 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; {8973#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:47:39,386 INFO L290 TraceCheckUtils]: 20: Hoare triple {8973#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 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; {8973#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:47:39,386 INFO L290 TraceCheckUtils]: 21: Hoare triple {8973#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {8973#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:47:39,388 INFO L290 TraceCheckUtils]: 22: Hoare triple {8973#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {8974#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 03:47:39,389 INFO L290 TraceCheckUtils]: 23: Hoare triple {8974#(<= (+ 6 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {8962#false} is VALID [2022-04-28 03:47:39,389 INFO L272 TraceCheckUtils]: 24: Hoare triple {8962#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {8962#false} is VALID [2022-04-28 03:47:39,389 INFO L290 TraceCheckUtils]: 25: Hoare triple {8962#false} ~cond := #in~cond; {8962#false} is VALID [2022-04-28 03:47:39,389 INFO L290 TraceCheckUtils]: 26: Hoare triple {8962#false} assume 0 == ~cond; {8962#false} is VALID [2022-04-28 03:47:39,389 INFO L290 TraceCheckUtils]: 27: Hoare triple {8962#false} assume !false; {8962#false} is VALID [2022-04-28 03:47:39,389 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 03:47:39,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:47:39,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993705286] [2022-04-28 03:47:39,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993705286] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:47:39,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1108139129] [2022-04-28 03:47:39,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:47:39,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:47:39,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:47:39,390 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 03:47:39,395 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 03:47:39,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:47:39,430 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-28 03:47:39,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:47:39,439 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:47:40,331 INFO L272 TraceCheckUtils]: 0: Hoare triple {8961#true} call ULTIMATE.init(); {8961#true} is VALID [2022-04-28 03:47:40,332 INFO L290 TraceCheckUtils]: 1: Hoare triple {8961#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {8961#true} is VALID [2022-04-28 03:47:40,332 INFO L290 TraceCheckUtils]: 2: Hoare triple {8961#true} assume true; {8961#true} is VALID [2022-04-28 03:47:40,332 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8961#true} {8961#true} #72#return; {8961#true} is VALID [2022-04-28 03:47:40,332 INFO L272 TraceCheckUtils]: 4: Hoare triple {8961#true} call #t~ret13 := main(); {8961#true} is VALID [2022-04-28 03:47:40,332 INFO L290 TraceCheckUtils]: 5: Hoare triple {8961#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {8961#true} is VALID [2022-04-28 03:47:40,332 INFO L290 TraceCheckUtils]: 6: Hoare triple {8961#true} [116] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_107| |v_main_#t~post5_106|)) (.cse1 (= |v_main_#t~post6_107| |v_main_#t~post6_106|)) (.cse2 (= v_main_~y~0_275 v_main_~y~0_274)) (.cse4 (mod v_main_~x~0_253 4294967296)) (.cse3 (= v_main_~x~0_253 v_main_~x~0_252))) (or (and .cse0 .cse1 .cse2 .cse3) (and (= v_main_~x~0_252 (+ v_main_~x~0_253 (* (- 1) v_main_~y~0_274) v_main_~y~0_275)) (forall ((v_it_21 Int)) (or (< 0 (mod (+ v_main_~x~0_253 (* 4294967295 v_it_21)) 4294967296)) (not (<= 1 v_it_21)) (not (<= (+ v_main_~y~0_275 v_it_21 1) v_main_~y~0_274)))) (< v_main_~y~0_275 v_main_~y~0_274) (< 0 .cse4)) (and .cse0 .cse1 .cse2 (<= .cse4 0) .cse3))) InVars {main_~y~0=v_main_~y~0_275, main_#t~post5=|v_main_#t~post5_107|, main_~x~0=v_main_~x~0_253, main_#t~post6=|v_main_#t~post6_107|} OutVars{main_~y~0=v_main_~y~0_274, main_#t~post5=|v_main_#t~post5_106|, main_~x~0=v_main_~x~0_252, main_#t~post6=|v_main_#t~post6_106|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {8961#true} is VALID [2022-04-28 03:47:40,332 INFO L290 TraceCheckUtils]: 7: Hoare triple {8961#true} [115] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {8961#true} is VALID [2022-04-28 03:47:40,332 INFO L290 TraceCheckUtils]: 8: Hoare triple {8961#true} ~z~0 := ~y~0; {9003#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 03:47:40,333 INFO L290 TraceCheckUtils]: 9: Hoare triple {9003#(= 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; {9007#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-28 03:47:40,334 INFO L290 TraceCheckUtils]: 10: Hoare triple {9007#(= 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; {9011#(= main_~y~0 (+ main_~z~0 2))} is VALID [2022-04-28 03:47:40,335 INFO L290 TraceCheckUtils]: 11: Hoare triple {9011#(= 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; {9015#(= (+ (- 2) main_~y~0) (+ main_~z~0 1))} is VALID [2022-04-28 03:47:40,335 INFO L290 TraceCheckUtils]: 12: Hoare triple {9015#(= (+ (- 2) 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; {9019#(= (+ main_~y~0 (- 3)) (+ main_~z~0 1))} is VALID [2022-04-28 03:47:40,336 INFO L290 TraceCheckUtils]: 13: Hoare triple {9019#(= (+ main_~y~0 (- 3)) (+ 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; {9023#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-28 03:47:40,337 INFO L290 TraceCheckUtils]: 14: Hoare triple {9023#(< 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; {9023#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-28 03:47:40,337 INFO L290 TraceCheckUtils]: 15: Hoare triple {9023#(< 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; {9023#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-28 03:47:40,337 INFO L290 TraceCheckUtils]: 16: Hoare triple {9023#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !(~z~0 % 4294967296 > 0); {9023#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-28 03:47:40,338 INFO L290 TraceCheckUtils]: 17: Hoare triple {9023#(< 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; {9036#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 03:47:40,339 INFO L290 TraceCheckUtils]: 18: Hoare triple {9036#(< 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; {9040#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 03:47:40,340 INFO L290 TraceCheckUtils]: 19: Hoare triple {9040#(< 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; {9044#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 03:47:40,341 INFO L290 TraceCheckUtils]: 20: Hoare triple {9044#(< 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; {9048#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:47:40,342 INFO L290 TraceCheckUtils]: 21: Hoare triple {9048#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {8962#false} is VALID [2022-04-28 03:47:40,342 INFO L290 TraceCheckUtils]: 22: Hoare triple {8962#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {8962#false} is VALID [2022-04-28 03:47:40,342 INFO L290 TraceCheckUtils]: 23: Hoare triple {8962#false} assume !(~x~0 % 4294967296 > 0); {8962#false} is VALID [2022-04-28 03:47:40,342 INFO L272 TraceCheckUtils]: 24: Hoare triple {8962#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {8962#false} is VALID [2022-04-28 03:47:40,342 INFO L290 TraceCheckUtils]: 25: Hoare triple {8962#false} ~cond := #in~cond; {8962#false} is VALID [2022-04-28 03:47:40,342 INFO L290 TraceCheckUtils]: 26: Hoare triple {8962#false} assume 0 == ~cond; {8962#false} is VALID [2022-04-28 03:47:40,342 INFO L290 TraceCheckUtils]: 27: Hoare triple {8962#false} assume !false; {8962#false} is VALID [2022-04-28 03:47:40,342 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 03:47:40,342 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:47:41,132 INFO L290 TraceCheckUtils]: 27: Hoare triple {8962#false} assume !false; {8962#false} is VALID [2022-04-28 03:47:41,132 INFO L290 TraceCheckUtils]: 26: Hoare triple {8962#false} assume 0 == ~cond; {8962#false} is VALID [2022-04-28 03:47:41,132 INFO L290 TraceCheckUtils]: 25: Hoare triple {8962#false} ~cond := #in~cond; {8962#false} is VALID [2022-04-28 03:47:41,132 INFO L272 TraceCheckUtils]: 24: Hoare triple {8962#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {8962#false} is VALID [2022-04-28 03:47:41,132 INFO L290 TraceCheckUtils]: 23: Hoare triple {8962#false} assume !(~x~0 % 4294967296 > 0); {8962#false} is VALID [2022-04-28 03:47:41,132 INFO L290 TraceCheckUtils]: 22: Hoare triple {8962#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {8962#false} is VALID [2022-04-28 03:47:41,133 INFO L290 TraceCheckUtils]: 21: Hoare triple {9048#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {8962#false} is VALID [2022-04-28 03:47:41,134 INFO L290 TraceCheckUtils]: 20: Hoare triple {9044#(< 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; {9048#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:47:41,135 INFO L290 TraceCheckUtils]: 19: Hoare triple {9040#(< 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; {9044#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 03:47:41,136 INFO L290 TraceCheckUtils]: 18: Hoare triple {9036#(< 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; {9040#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 03:47:41,139 INFO L290 TraceCheckUtils]: 17: Hoare triple {9023#(< 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; {9036#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 03:47:41,139 INFO L290 TraceCheckUtils]: 16: Hoare triple {9023#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !(~z~0 % 4294967296 > 0); {9023#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-28 03:47:41,139 INFO L290 TraceCheckUtils]: 15: Hoare triple {9023#(< 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; {9023#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-28 03:47:41,139 INFO L290 TraceCheckUtils]: 14: Hoare triple {9023#(< 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; {9023#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-28 03:47:41,140 INFO L290 TraceCheckUtils]: 13: Hoare triple {9112#(or (not (< 0 (mod main_~z~0 4294967296))) (< 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; {9023#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-28 03:47:41,141 INFO L290 TraceCheckUtils]: 12: Hoare triple {9116#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 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; {9112#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-28 03:47:41,143 INFO L290 TraceCheckUtils]: 11: Hoare triple {9120#(or (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))) (< 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; {9116#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-28 03:47:41,144 INFO L290 TraceCheckUtils]: 10: Hoare triple {9124#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 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; {9120#(or (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-28 03:47:41,145 INFO L290 TraceCheckUtils]: 9: Hoare triple {9128#(or (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))) (< 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; {9124#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-28 03:47:41,146 INFO L290 TraceCheckUtils]: 8: Hoare triple {8961#true} ~z~0 := ~y~0; {9128#(or (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-28 03:47:41,146 INFO L290 TraceCheckUtils]: 7: Hoare triple {8961#true} [115] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {8961#true} is VALID [2022-04-28 03:47:41,146 INFO L290 TraceCheckUtils]: 6: Hoare triple {8961#true} [116] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_107| |v_main_#t~post5_106|)) (.cse1 (= |v_main_#t~post6_107| |v_main_#t~post6_106|)) (.cse2 (= v_main_~y~0_275 v_main_~y~0_274)) (.cse4 (mod v_main_~x~0_253 4294967296)) (.cse3 (= v_main_~x~0_253 v_main_~x~0_252))) (or (and .cse0 .cse1 .cse2 .cse3) (and (= v_main_~x~0_252 (+ v_main_~x~0_253 (* (- 1) v_main_~y~0_274) v_main_~y~0_275)) (forall ((v_it_21 Int)) (or (< 0 (mod (+ v_main_~x~0_253 (* 4294967295 v_it_21)) 4294967296)) (not (<= 1 v_it_21)) (not (<= (+ v_main_~y~0_275 v_it_21 1) v_main_~y~0_274)))) (< v_main_~y~0_275 v_main_~y~0_274) (< 0 .cse4)) (and .cse0 .cse1 .cse2 (<= .cse4 0) .cse3))) InVars {main_~y~0=v_main_~y~0_275, main_#t~post5=|v_main_#t~post5_107|, main_~x~0=v_main_~x~0_253, main_#t~post6=|v_main_#t~post6_107|} OutVars{main_~y~0=v_main_~y~0_274, main_#t~post5=|v_main_#t~post5_106|, main_~x~0=v_main_~x~0_252, main_#t~post6=|v_main_#t~post6_106|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {8961#true} is VALID [2022-04-28 03:47:41,146 INFO L290 TraceCheckUtils]: 5: Hoare triple {8961#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {8961#true} is VALID [2022-04-28 03:47:41,146 INFO L272 TraceCheckUtils]: 4: Hoare triple {8961#true} call #t~ret13 := main(); {8961#true} is VALID [2022-04-28 03:47:41,146 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8961#true} {8961#true} #72#return; {8961#true} is VALID [2022-04-28 03:47:41,146 INFO L290 TraceCheckUtils]: 2: Hoare triple {8961#true} assume true; {8961#true} is VALID [2022-04-28 03:47:41,146 INFO L290 TraceCheckUtils]: 1: Hoare triple {8961#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {8961#true} is VALID [2022-04-28 03:47:41,146 INFO L272 TraceCheckUtils]: 0: Hoare triple {8961#true} call ULTIMATE.init(); {8961#true} is VALID [2022-04-28 03:47:41,146 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 15 proven. 20 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 03:47:41,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1108139129] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:47:41,147 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:47:41,147 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 27 [2022-04-28 03:47:41,594 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:47:41,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1318562235] [2022-04-28 03:47:41,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1318562235] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:47:41,594 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:47:41,594 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-28 03:47:41,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669967928] [2022-04-28 03:47:41,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:47:41,595 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 14 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 30 [2022-04-28 03:47:41,595 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:47:41,595 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 14 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 03:47:41,627 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 03:47:41,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-28 03:47:41,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:47:41,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-28 03:47:41,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=774, Unknown=0, NotChecked=0, Total=870 [2022-04-28 03:47:41,628 INFO L87 Difference]: Start difference. First operand 57 states and 69 transitions. Second operand has 15 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 14 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 03:47:45,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:47:45,955 INFO L93 Difference]: Finished difference Result 98 states and 126 transitions. [2022-04-28 03:47:45,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-28 03:47:45,955 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 14 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 30 [2022-04-28 03:47:45,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:47:45,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 14 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 03:47:45,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 87 transitions. [2022-04-28 03:47:45,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 14 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 03:47:45,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 87 transitions. [2022-04-28 03:47:45,957 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 87 transitions. [2022-04-28 03:47:46,134 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 03:47:46,135 INFO L225 Difference]: With dead ends: 98 [2022-04-28 03:47:46,135 INFO L226 Difference]: Without dead ends: 92 [2022-04-28 03:47:46,136 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=238, Invalid=1742, Unknown=0, NotChecked=0, Total=1980 [2022-04-28 03:47:46,136 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 84 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-28 03:47:46,136 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 53 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-28 03:47:46,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-04-28 03:47:46,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 64. [2022-04-28 03:47:46,493 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:47:46,493 INFO L82 GeneralOperation]: Start isEquivalent. First operand 92 states. Second operand has 64 states, 59 states have (on average 1.2542372881355932) internal successors, (74), 59 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 03:47:46,494 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand has 64 states, 59 states have (on average 1.2542372881355932) internal successors, (74), 59 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 03:47:46,494 INFO L87 Difference]: Start difference. First operand 92 states. Second operand has 64 states, 59 states have (on average 1.2542372881355932) internal successors, (74), 59 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 03:47:46,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:47:46,495 INFO L93 Difference]: Finished difference Result 92 states and 112 transitions. [2022-04-28 03:47:46,495 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 112 transitions. [2022-04-28 03:47:46,495 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:47:46,495 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:47:46,495 INFO L74 IsIncluded]: Start isIncluded. First operand has 64 states, 59 states have (on average 1.2542372881355932) internal successors, (74), 59 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 92 states. [2022-04-28 03:47:46,495 INFO L87 Difference]: Start difference. First operand has 64 states, 59 states have (on average 1.2542372881355932) internal successors, (74), 59 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 92 states. [2022-04-28 03:47:46,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:47:46,496 INFO L93 Difference]: Finished difference Result 92 states and 112 transitions. [2022-04-28 03:47:46,496 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 112 transitions. [2022-04-28 03:47:46,497 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:47:46,497 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:47:46,497 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:47:46,497 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:47:46,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 59 states have (on average 1.2542372881355932) internal successors, (74), 59 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 03:47:46,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 78 transitions. [2022-04-28 03:47:46,498 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 78 transitions. Word has length 30 [2022-04-28 03:47:46,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:47:46,498 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 78 transitions. [2022-04-28 03:47:46,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 14 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 03:47:46,498 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 64 states and 78 transitions. [2022-04-28 03:47:55,370 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 75 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-28 03:47:55,371 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 78 transitions. [2022-04-28 03:47:55,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-28 03:47:55,371 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:47:55,371 INFO L195 NwaCegarLoop]: trace histogram [8, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:47:55,387 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2022-04-28 03:47:55,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:47:55,572 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:47:55,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:47:55,572 INFO L85 PathProgramCache]: Analyzing trace with hash -1905929705, now seen corresponding path program 16 times [2022-04-28 03:47:55,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:47:55,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [756971212] [2022-04-28 03:47:55,933 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:47:55,934 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:47:55,936 INFO L85 PathProgramCache]: Analyzing trace with hash 546353718, now seen corresponding path program 1 times [2022-04-28 03:47:55,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:47:55,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750223306] [2022-04-28 03:47:55,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:47:55,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:47:55,944 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_22.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:47:55,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:47:55,954 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_22.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:47:56,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:47:56,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:47:56,404 INFO L290 TraceCheckUtils]: 0: Hoare triple {9714#(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); {9699#true} is VALID [2022-04-28 03:47:56,404 INFO L290 TraceCheckUtils]: 1: Hoare triple {9699#true} assume true; {9699#true} is VALID [2022-04-28 03:47:56,404 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9699#true} {9699#true} #72#return; {9699#true} is VALID [2022-04-28 03:47:56,405 INFO L272 TraceCheckUtils]: 0: Hoare triple {9699#true} call ULTIMATE.init(); {9714#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:47:56,405 INFO L290 TraceCheckUtils]: 1: Hoare triple {9714#(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); {9699#true} is VALID [2022-04-28 03:47:56,405 INFO L290 TraceCheckUtils]: 2: Hoare triple {9699#true} assume true; {9699#true} is VALID [2022-04-28 03:47:56,405 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9699#true} {9699#true} #72#return; {9699#true} is VALID [2022-04-28 03:47:56,405 INFO L272 TraceCheckUtils]: 4: Hoare triple {9699#true} call #t~ret13 := main(); {9699#true} is VALID [2022-04-28 03:47:56,405 INFO L290 TraceCheckUtils]: 5: Hoare triple {9699#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {9699#true} is VALID [2022-04-28 03:47:56,405 INFO L290 TraceCheckUtils]: 6: Hoare triple {9699#true} [118] L16-2-->L16-3_primed: Formula: (let ((.cse3 (mod v_main_~x~0_270 4294967296)) (.cse0 (= v_main_~y~0_293 v_main_~y~0_292)) (.cse1 (= |v_main_#t~post5_112| |v_main_#t~post5_111|)) (.cse2 (= |v_main_#t~post6_112| |v_main_#t~post6_111|))) (or (and .cse0 (= v_main_~x~0_269 v_main_~x~0_270) .cse1 .cse2 (<= .cse3 0)) (and (= v_main_~x~0_269 (+ v_main_~x~0_270 (* (- 1) v_main_~y~0_292) v_main_~y~0_293)) (forall ((v_it_22 Int)) (or (< 0 (mod (+ v_main_~x~0_270 (* 4294967295 v_it_22)) 4294967296)) (not (<= (+ v_main_~y~0_293 v_it_22 1) v_main_~y~0_292)) (not (<= 1 v_it_22)))) (< v_main_~y~0_293 v_main_~y~0_292) (< 0 .cse3)) (and .cse0 .cse1 .cse2 (= v_main_~x~0_270 v_main_~x~0_269)))) InVars {main_~y~0=v_main_~y~0_293, main_#t~post5=|v_main_#t~post5_112|, main_~x~0=v_main_~x~0_270, main_#t~post6=|v_main_#t~post6_112|} OutVars{main_~y~0=v_main_~y~0_292, main_#t~post5=|v_main_#t~post5_111|, main_~x~0=v_main_~x~0_269, main_#t~post6=|v_main_#t~post6_111|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {9699#true} is VALID [2022-04-28 03:47:56,406 INFO L290 TraceCheckUtils]: 7: Hoare triple {9699#true} [117] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {9704#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:47:56,406 INFO L290 TraceCheckUtils]: 8: Hoare triple {9704#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {9704#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:47:56,408 INFO L290 TraceCheckUtils]: 9: Hoare triple {9704#(<= main_~x~0 (* 4294967296 (div main_~x~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; {9705#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:47:56,409 INFO L290 TraceCheckUtils]: 10: Hoare triple {9705#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 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; {9706#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:47:56,410 INFO L290 TraceCheckUtils]: 11: Hoare triple {9706#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~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; {9707#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:47:56,411 INFO L290 TraceCheckUtils]: 12: Hoare triple {9707#(<= main_~x~0 (+ 3 (* (div (+ main_~x~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; {9708#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:47:56,412 INFO L290 TraceCheckUtils]: 13: Hoare triple {9708#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 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; {9709#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 03:47:56,413 INFO L290 TraceCheckUtils]: 14: Hoare triple {9709#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 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; {9710#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:47:56,414 INFO L290 TraceCheckUtils]: 15: Hoare triple {9710#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 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; {9711#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:47:56,415 INFO L290 TraceCheckUtils]: 16: Hoare triple {9711#(<= main_~x~0 (+ 7 (* (div (+ main_~x~0 (- 7)) 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; {9712#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:47:56,415 INFO L290 TraceCheckUtils]: 17: Hoare triple {9712#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {9712#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:47:56,416 INFO L290 TraceCheckUtils]: 18: Hoare triple {9712#(<= main_~x~0 (+ 8 (* (div (+ main_~x~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; {9712#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:47:56,416 INFO L290 TraceCheckUtils]: 19: Hoare triple {9712#(<= main_~x~0 (+ 8 (* (div (+ main_~x~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; {9712#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:47:56,417 INFO L290 TraceCheckUtils]: 20: Hoare triple {9712#(<= main_~x~0 (+ 8 (* (div (+ main_~x~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; {9712#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:47:56,417 INFO L290 TraceCheckUtils]: 21: Hoare triple {9712#(<= main_~x~0 (+ 8 (* (div (+ main_~x~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; {9712#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:47:56,417 INFO L290 TraceCheckUtils]: 22: Hoare triple {9712#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {9712#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:47:56,419 INFO L290 TraceCheckUtils]: 23: Hoare triple {9712#(<= main_~x~0 (+ 8 (* (div (+ main_~x~0 (- 8)) 4294967296) 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {9713#(<= (+ 7 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 03:47:56,419 INFO L290 TraceCheckUtils]: 24: Hoare triple {9713#(<= (+ 7 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {9700#false} is VALID [2022-04-28 03:47:56,419 INFO L272 TraceCheckUtils]: 25: Hoare triple {9700#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {9700#false} is VALID [2022-04-28 03:47:56,419 INFO L290 TraceCheckUtils]: 26: Hoare triple {9700#false} ~cond := #in~cond; {9700#false} is VALID [2022-04-28 03:47:56,419 INFO L290 TraceCheckUtils]: 27: Hoare triple {9700#false} assume 0 == ~cond; {9700#false} is VALID [2022-04-28 03:47:56,419 INFO L290 TraceCheckUtils]: 28: Hoare triple {9700#false} assume !false; {9700#false} is VALID [2022-04-28 03:47:56,420 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 03:47:56,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:47:56,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750223306] [2022-04-28 03:47:56,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750223306] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:47:56,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2078861907] [2022-04-28 03:47:56,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:47:56,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:47:56,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:47:56,421 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 03:47:56,422 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 03:47:56,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:47:56,459 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-28 03:47:56,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:47:56,466 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:47:57,321 INFO L272 TraceCheckUtils]: 0: Hoare triple {9699#true} call ULTIMATE.init(); {9699#true} is VALID [2022-04-28 03:47:57,321 INFO L290 TraceCheckUtils]: 1: Hoare triple {9699#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {9699#true} is VALID [2022-04-28 03:47:57,321 INFO L290 TraceCheckUtils]: 2: Hoare triple {9699#true} assume true; {9699#true} is VALID [2022-04-28 03:47:57,321 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9699#true} {9699#true} #72#return; {9699#true} is VALID [2022-04-28 03:47:57,321 INFO L272 TraceCheckUtils]: 4: Hoare triple {9699#true} call #t~ret13 := main(); {9699#true} is VALID [2022-04-28 03:47:57,321 INFO L290 TraceCheckUtils]: 5: Hoare triple {9699#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {9699#true} is VALID [2022-04-28 03:47:57,321 INFO L290 TraceCheckUtils]: 6: Hoare triple {9699#true} [118] L16-2-->L16-3_primed: Formula: (let ((.cse3 (mod v_main_~x~0_270 4294967296)) (.cse0 (= v_main_~y~0_293 v_main_~y~0_292)) (.cse1 (= |v_main_#t~post5_112| |v_main_#t~post5_111|)) (.cse2 (= |v_main_#t~post6_112| |v_main_#t~post6_111|))) (or (and .cse0 (= v_main_~x~0_269 v_main_~x~0_270) .cse1 .cse2 (<= .cse3 0)) (and (= v_main_~x~0_269 (+ v_main_~x~0_270 (* (- 1) v_main_~y~0_292) v_main_~y~0_293)) (forall ((v_it_22 Int)) (or (< 0 (mod (+ v_main_~x~0_270 (* 4294967295 v_it_22)) 4294967296)) (not (<= (+ v_main_~y~0_293 v_it_22 1) v_main_~y~0_292)) (not (<= 1 v_it_22)))) (< v_main_~y~0_293 v_main_~y~0_292) (< 0 .cse3)) (and .cse0 .cse1 .cse2 (= v_main_~x~0_270 v_main_~x~0_269)))) InVars {main_~y~0=v_main_~y~0_293, main_#t~post5=|v_main_#t~post5_112|, main_~x~0=v_main_~x~0_270, main_#t~post6=|v_main_#t~post6_112|} OutVars{main_~y~0=v_main_~y~0_292, main_#t~post5=|v_main_#t~post5_111|, main_~x~0=v_main_~x~0_269, main_#t~post6=|v_main_#t~post6_111|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {9699#true} is VALID [2022-04-28 03:47:57,322 INFO L290 TraceCheckUtils]: 7: Hoare triple {9699#true} [117] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {9699#true} is VALID [2022-04-28 03:47:57,322 INFO L290 TraceCheckUtils]: 8: Hoare triple {9699#true} ~z~0 := ~y~0; {9742#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 03:47:57,322 INFO L290 TraceCheckUtils]: 9: Hoare triple {9742#(= 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; {9746#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-28 03:47:57,323 INFO L290 TraceCheckUtils]: 10: Hoare triple {9746#(= 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; {9750#(= main_~y~0 (+ main_~z~0 2))} is VALID [2022-04-28 03:47:57,324 INFO L290 TraceCheckUtils]: 11: Hoare triple {9750#(= 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; {9754#(= (+ (- 2) main_~y~0) (+ main_~z~0 1))} is VALID [2022-04-28 03:47:57,324 INFO L290 TraceCheckUtils]: 12: Hoare triple {9754#(= (+ (- 2) 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; {9758#(= (+ main_~y~0 (- 3)) (+ main_~z~0 1))} is VALID [2022-04-28 03:47:57,325 INFO L290 TraceCheckUtils]: 13: Hoare triple {9758#(= (+ main_~y~0 (- 3)) (+ 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; {9762#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-28 03:47:57,326 INFO L290 TraceCheckUtils]: 14: Hoare triple {9762#(< 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; {9762#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-28 03:47:57,326 INFO L290 TraceCheckUtils]: 15: Hoare triple {9762#(< 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; {9762#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-28 03:47:57,326 INFO L290 TraceCheckUtils]: 16: Hoare triple {9762#(< 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; {9762#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-28 03:47:57,326 INFO L290 TraceCheckUtils]: 17: Hoare triple {9762#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !(~z~0 % 4294967296 > 0); {9762#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-28 03:47:57,328 INFO L290 TraceCheckUtils]: 18: Hoare triple {9762#(< 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; {9778#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 03:47:57,328 INFO L290 TraceCheckUtils]: 19: Hoare triple {9778#(< 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; {9782#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 03:47:57,330 INFO L290 TraceCheckUtils]: 20: Hoare triple {9782#(< 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; {9786#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 03:47:57,332 INFO L290 TraceCheckUtils]: 21: Hoare triple {9786#(< 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; {9790#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:47:57,332 INFO L290 TraceCheckUtils]: 22: Hoare triple {9790#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {9700#false} is VALID [2022-04-28 03:47:57,332 INFO L290 TraceCheckUtils]: 23: Hoare triple {9700#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {9700#false} is VALID [2022-04-28 03:47:57,332 INFO L290 TraceCheckUtils]: 24: Hoare triple {9700#false} assume !(~x~0 % 4294967296 > 0); {9700#false} is VALID [2022-04-28 03:47:57,333 INFO L272 TraceCheckUtils]: 25: Hoare triple {9700#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {9700#false} is VALID [2022-04-28 03:47:57,333 INFO L290 TraceCheckUtils]: 26: Hoare triple {9700#false} ~cond := #in~cond; {9700#false} is VALID [2022-04-28 03:47:57,333 INFO L290 TraceCheckUtils]: 27: Hoare triple {9700#false} assume 0 == ~cond; {9700#false} is VALID [2022-04-28 03:47:57,333 INFO L290 TraceCheckUtils]: 28: Hoare triple {9700#false} assume !false; {9700#false} is VALID [2022-04-28 03:47:57,333 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-28 03:47:57,333 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:47:58,103 INFO L290 TraceCheckUtils]: 28: Hoare triple {9700#false} assume !false; {9700#false} is VALID [2022-04-28 03:47:58,103 INFO L290 TraceCheckUtils]: 27: Hoare triple {9700#false} assume 0 == ~cond; {9700#false} is VALID [2022-04-28 03:47:58,103 INFO L290 TraceCheckUtils]: 26: Hoare triple {9700#false} ~cond := #in~cond; {9700#false} is VALID [2022-04-28 03:47:58,103 INFO L272 TraceCheckUtils]: 25: Hoare triple {9700#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {9700#false} is VALID [2022-04-28 03:47:58,103 INFO L290 TraceCheckUtils]: 24: Hoare triple {9700#false} assume !(~x~0 % 4294967296 > 0); {9700#false} is VALID [2022-04-28 03:47:58,103 INFO L290 TraceCheckUtils]: 23: Hoare triple {9700#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {9700#false} is VALID [2022-04-28 03:47:58,104 INFO L290 TraceCheckUtils]: 22: Hoare triple {9790#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {9700#false} is VALID [2022-04-28 03:47:58,106 INFO L290 TraceCheckUtils]: 21: Hoare triple {9786#(< 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; {9790#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:47:58,107 INFO L290 TraceCheckUtils]: 20: Hoare triple {9782#(< 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; {9786#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 03:47:58,108 INFO L290 TraceCheckUtils]: 19: Hoare triple {9778#(< 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; {9782#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 03:47:58,109 INFO L290 TraceCheckUtils]: 18: Hoare triple {9762#(< 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; {9778#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 03:47:58,110 INFO L290 TraceCheckUtils]: 17: Hoare triple {9762#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !(~z~0 % 4294967296 > 0); {9762#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-28 03:47:58,110 INFO L290 TraceCheckUtils]: 16: Hoare triple {9762#(< 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; {9762#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-28 03:47:58,110 INFO L290 TraceCheckUtils]: 15: Hoare triple {9762#(< 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; {9762#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-28 03:47:58,110 INFO L290 TraceCheckUtils]: 14: Hoare triple {9762#(< 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; {9762#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-28 03:47:58,111 INFO L290 TraceCheckUtils]: 13: Hoare triple {9857#(or (not (< 0 (mod main_~z~0 4294967296))) (< 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; {9762#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-28 03:47:58,113 INFO L290 TraceCheckUtils]: 12: Hoare triple {9861#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 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; {9857#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-28 03:47:58,114 INFO L290 TraceCheckUtils]: 11: Hoare triple {9865#(or (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))) (< 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; {9861#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-28 03:47:58,115 INFO L290 TraceCheckUtils]: 10: Hoare triple {9869#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 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; {9865#(or (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-28 03:47:58,116 INFO L290 TraceCheckUtils]: 9: Hoare triple {9873#(or (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))) (< 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; {9869#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-28 03:47:58,117 INFO L290 TraceCheckUtils]: 8: Hoare triple {9699#true} ~z~0 := ~y~0; {9873#(or (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-28 03:47:58,117 INFO L290 TraceCheckUtils]: 7: Hoare triple {9699#true} [117] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {9699#true} is VALID [2022-04-28 03:47:58,117 INFO L290 TraceCheckUtils]: 6: Hoare triple {9699#true} [118] L16-2-->L16-3_primed: Formula: (let ((.cse3 (mod v_main_~x~0_270 4294967296)) (.cse0 (= v_main_~y~0_293 v_main_~y~0_292)) (.cse1 (= |v_main_#t~post5_112| |v_main_#t~post5_111|)) (.cse2 (= |v_main_#t~post6_112| |v_main_#t~post6_111|))) (or (and .cse0 (= v_main_~x~0_269 v_main_~x~0_270) .cse1 .cse2 (<= .cse3 0)) (and (= v_main_~x~0_269 (+ v_main_~x~0_270 (* (- 1) v_main_~y~0_292) v_main_~y~0_293)) (forall ((v_it_22 Int)) (or (< 0 (mod (+ v_main_~x~0_270 (* 4294967295 v_it_22)) 4294967296)) (not (<= (+ v_main_~y~0_293 v_it_22 1) v_main_~y~0_292)) (not (<= 1 v_it_22)))) (< v_main_~y~0_293 v_main_~y~0_292) (< 0 .cse3)) (and .cse0 .cse1 .cse2 (= v_main_~x~0_270 v_main_~x~0_269)))) InVars {main_~y~0=v_main_~y~0_293, main_#t~post5=|v_main_#t~post5_112|, main_~x~0=v_main_~x~0_270, main_#t~post6=|v_main_#t~post6_112|} OutVars{main_~y~0=v_main_~y~0_292, main_#t~post5=|v_main_#t~post5_111|, main_~x~0=v_main_~x~0_269, main_#t~post6=|v_main_#t~post6_111|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {9699#true} is VALID [2022-04-28 03:47:58,117 INFO L290 TraceCheckUtils]: 5: Hoare triple {9699#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {9699#true} is VALID [2022-04-28 03:47:58,117 INFO L272 TraceCheckUtils]: 4: Hoare triple {9699#true} call #t~ret13 := main(); {9699#true} is VALID [2022-04-28 03:47:58,117 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9699#true} {9699#true} #72#return; {9699#true} is VALID [2022-04-28 03:47:58,117 INFO L290 TraceCheckUtils]: 2: Hoare triple {9699#true} assume true; {9699#true} is VALID [2022-04-28 03:47:58,117 INFO L290 TraceCheckUtils]: 1: Hoare triple {9699#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {9699#true} is VALID [2022-04-28 03:47:58,117 INFO L272 TraceCheckUtils]: 0: Hoare triple {9699#true} call ULTIMATE.init(); {9699#true} is VALID [2022-04-28 03:47:58,118 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 20 proven. 20 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-28 03:47:58,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2078861907] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:47:58,118 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:47:58,118 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 28 [2022-04-28 03:47:58,518 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:47:58,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [756971212] [2022-04-28 03:47:58,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [756971212] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:47:58,518 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:47:58,518 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-28 03:47:58,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655482955] [2022-04-28 03:47:58,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:47:58,518 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.5) internal successors, (24), 15 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 31 [2022-04-28 03:47:58,519 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:47:58,519 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 1.5) internal successors, (24), 15 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 03:47:58,554 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 03:47:58,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-28 03:47:58,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:47:58,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-28 03:47:58,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=829, Unknown=0, NotChecked=0, Total=930 [2022-04-28 03:47:58,555 INFO L87 Difference]: Start difference. First operand 64 states and 78 transitions. Second operand has 16 states, 16 states have (on average 1.5) internal successors, (24), 15 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 03:48:02,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:48:02,936 INFO L93 Difference]: Finished difference Result 106 states and 137 transitions. [2022-04-28 03:48:02,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-28 03:48:02,936 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.5) internal successors, (24), 15 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 31 [2022-04-28 03:48:02,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:48:02,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.5) internal successors, (24), 15 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 03:48:02,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 93 transitions. [2022-04-28 03:48:02,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.5) internal successors, (24), 15 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 03:48:02,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 93 transitions. [2022-04-28 03:48:02,938 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 93 transitions. [2022-04-28 03:48:03,078 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:48:03,079 INFO L225 Difference]: With dead ends: 106 [2022-04-28 03:48:03,079 INFO L226 Difference]: Without dead ends: 100 [2022-04-28 03:48:03,080 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=253, Invalid=1909, Unknown=0, NotChecked=0, Total=2162 [2022-04-28 03:48:03,080 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 94 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:48:03,080 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 46 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-28 03:48:03,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-04-28 03:48:03,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 71. [2022-04-28 03:48:03,449 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:48:03,449 INFO L82 GeneralOperation]: Start isEquivalent. First operand 100 states. Second operand has 71 states, 66 states have (on average 1.2575757575757576) internal successors, (83), 66 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 03:48:03,449 INFO L74 IsIncluded]: Start isIncluded. First operand 100 states. Second operand has 71 states, 66 states have (on average 1.2575757575757576) internal successors, (83), 66 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 03:48:03,450 INFO L87 Difference]: Start difference. First operand 100 states. Second operand has 71 states, 66 states have (on average 1.2575757575757576) internal successors, (83), 66 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 03:48:03,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:48:03,451 INFO L93 Difference]: Finished difference Result 100 states and 122 transitions. [2022-04-28 03:48:03,451 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 122 transitions. [2022-04-28 03:48:03,451 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:48:03,451 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:48:03,451 INFO L74 IsIncluded]: Start isIncluded. First operand has 71 states, 66 states have (on average 1.2575757575757576) internal successors, (83), 66 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 100 states. [2022-04-28 03:48:03,451 INFO L87 Difference]: Start difference. First operand has 71 states, 66 states have (on average 1.2575757575757576) internal successors, (83), 66 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 100 states. [2022-04-28 03:48:03,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:48:03,452 INFO L93 Difference]: Finished difference Result 100 states and 122 transitions. [2022-04-28 03:48:03,452 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 122 transitions. [2022-04-28 03:48:03,452 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:48:03,452 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:48:03,452 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:48:03,452 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:48:03,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 66 states have (on average 1.2575757575757576) internal successors, (83), 66 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 03:48:03,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 87 transitions. [2022-04-28 03:48:03,453 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 87 transitions. Word has length 31 [2022-04-28 03:48:03,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:48:03,453 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 87 transitions. [2022-04-28 03:48:03,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.5) internal successors, (24), 15 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 03:48:03,454 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 71 states and 87 transitions. [2022-04-28 03:48:13,921 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 83 inductive. 0 not inductive. 4 times theorem prover too weak to decide inductivity. [2022-04-28 03:48:13,921 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 87 transitions. [2022-04-28 03:48:13,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-28 03:48:13,922 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:48:13,922 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:48:13,937 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-04-28 03:48:14,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:48:14,122 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:48:14,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:48:14,123 INFO L85 PathProgramCache]: Analyzing trace with hash 630858209, now seen corresponding path program 17 times [2022-04-28 03:48:14,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:48:14,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2118059589] [2022-04-28 03:48:18,247 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:48:18,368 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:48:18,370 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:48:18,371 INFO L85 PathProgramCache]: Analyzing trace with hash 1697748450, now seen corresponding path program 1 times [2022-04-28 03:48:18,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:48:18,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240848224] [2022-04-28 03:48:18,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:48:18,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:48:18,383 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_23.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:48:18,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:48:18,408 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_23.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:48:18,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:48:18,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:48:18,882 INFO L290 TraceCheckUtils]: 0: Hoare triple {10507#(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); {10492#true} is VALID [2022-04-28 03:48:18,882 INFO L290 TraceCheckUtils]: 1: Hoare triple {10492#true} assume true; {10492#true} is VALID [2022-04-28 03:48:18,882 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10492#true} {10492#true} #72#return; {10492#true} is VALID [2022-04-28 03:48:18,882 INFO L272 TraceCheckUtils]: 0: Hoare triple {10492#true} call ULTIMATE.init(); {10507#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:48:18,883 INFO L290 TraceCheckUtils]: 1: Hoare triple {10507#(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); {10492#true} is VALID [2022-04-28 03:48:18,883 INFO L290 TraceCheckUtils]: 2: Hoare triple {10492#true} assume true; {10492#true} is VALID [2022-04-28 03:48:18,883 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10492#true} {10492#true} #72#return; {10492#true} is VALID [2022-04-28 03:48:18,883 INFO L272 TraceCheckUtils]: 4: Hoare triple {10492#true} call #t~ret13 := main(); {10492#true} is VALID [2022-04-28 03:48:18,883 INFO L290 TraceCheckUtils]: 5: Hoare triple {10492#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {10492#true} is VALID [2022-04-28 03:48:18,883 INFO L290 TraceCheckUtils]: 6: Hoare triple {10492#true} [120] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= |v_main_#t~post6_117| |v_main_#t~post6_116|)) (.cse2 (= v_main_~x~0_288 v_main_~x~0_287)) (.cse3 (= v_main_~y~0_311 v_main_~y~0_310)) (.cse4 (= |v_main_#t~post5_117| |v_main_#t~post5_116|)) (.cse0 (mod v_main_~x~0_288 4294967296))) (or (and (<= .cse0 0) .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4) (and (< 0 .cse0) (< v_main_~x~0_287 v_main_~x~0_288) (forall ((v_it_23 Int)) (or (not (<= 1 v_it_23)) (not (<= (+ v_main_~x~0_287 v_it_23 1) v_main_~x~0_288)) (< 0 (mod (+ v_main_~x~0_288 (* 4294967295 v_it_23)) 4294967296)))) (= v_main_~y~0_310 (+ v_main_~x~0_288 v_main_~y~0_311 (* v_main_~x~0_287 (- 1))))))) InVars {main_~y~0=v_main_~y~0_311, main_#t~post5=|v_main_#t~post5_117|, main_~x~0=v_main_~x~0_288, main_#t~post6=|v_main_#t~post6_117|} OutVars{main_~y~0=v_main_~y~0_310, main_#t~post5=|v_main_#t~post5_116|, main_~x~0=v_main_~x~0_287, main_#t~post6=|v_main_#t~post6_116|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {10492#true} is VALID [2022-04-28 03:48:18,883 INFO L290 TraceCheckUtils]: 7: Hoare triple {10492#true} [119] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {10492#true} is VALID [2022-04-28 03:48:18,883 INFO L290 TraceCheckUtils]: 8: Hoare triple {10492#true} ~z~0 := ~y~0; {10497#(= (+ main_~z~0 (* (- 1) main_~y~0)) 0)} is VALID [2022-04-28 03:48:18,884 INFO L290 TraceCheckUtils]: 9: Hoare triple {10497#(= (+ main_~z~0 (* (- 1) main_~y~0)) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10498#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-28 03:48:18,885 INFO L290 TraceCheckUtils]: 10: Hoare triple {10498#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 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; {10499#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-28 03:48:18,886 INFO L290 TraceCheckUtils]: 11: Hoare triple {10499#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) 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; {10500#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-28 03:48:18,887 INFO L290 TraceCheckUtils]: 12: Hoare triple {10500#(and (<= (+ main_~z~0 3) 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; {10501#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-28 03:48:18,888 INFO L290 TraceCheckUtils]: 13: Hoare triple {10501#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 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; {10502#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} is VALID [2022-04-28 03:48:18,888 INFO L290 TraceCheckUtils]: 14: Hoare triple {10502#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} assume !(~z~0 % 4294967296 > 0); {10502#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} is VALID [2022-04-28 03:48:18,889 INFO L290 TraceCheckUtils]: 15: Hoare triple {10502#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10503#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-28 03:48:18,890 INFO L290 TraceCheckUtils]: 16: Hoare triple {10503#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10504#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-28 03:48:18,891 INFO L290 TraceCheckUtils]: 17: Hoare triple {10504#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10505#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-28 03:48:18,893 INFO L290 TraceCheckUtils]: 18: Hoare triple {10505#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 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; {10506#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-28 03:48:18,893 INFO L290 TraceCheckUtils]: 19: Hoare triple {10506#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {10493#false} is VALID [2022-04-28 03:48:18,893 INFO L290 TraceCheckUtils]: 20: Hoare triple {10493#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {10493#false} is VALID [2022-04-28 03:48:18,893 INFO L290 TraceCheckUtils]: 21: Hoare triple {10493#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {10493#false} is VALID [2022-04-28 03:48:18,893 INFO L290 TraceCheckUtils]: 22: Hoare triple {10493#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {10493#false} is VALID [2022-04-28 03:48:18,893 INFO L290 TraceCheckUtils]: 23: Hoare triple {10493#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {10493#false} is VALID [2022-04-28 03:48:18,893 INFO L290 TraceCheckUtils]: 24: Hoare triple {10493#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {10493#false} is VALID [2022-04-28 03:48:18,893 INFO L290 TraceCheckUtils]: 25: Hoare triple {10493#false} assume !(~x~0 % 4294967296 > 0); {10493#false} is VALID [2022-04-28 03:48:18,894 INFO L272 TraceCheckUtils]: 26: Hoare triple {10493#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {10493#false} is VALID [2022-04-28 03:48:18,894 INFO L290 TraceCheckUtils]: 27: Hoare triple {10493#false} ~cond := #in~cond; {10493#false} is VALID [2022-04-28 03:48:18,894 INFO L290 TraceCheckUtils]: 28: Hoare triple {10493#false} assume 0 == ~cond; {10493#false} is VALID [2022-04-28 03:48:18,894 INFO L290 TraceCheckUtils]: 29: Hoare triple {10493#false} assume !false; {10493#false} is VALID [2022-04-28 03:48:18,894 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 03:48:18,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:48:18,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240848224] [2022-04-28 03:48:18,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240848224] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:48:18,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1826785429] [2022-04-28 03:48:18,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:48:18,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:48:18,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:48:18,895 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 03:48:18,931 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 03:48:18,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:48:18,945 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-28 03:48:18,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:48:18,952 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:48:19,629 INFO L272 TraceCheckUtils]: 0: Hoare triple {10492#true} call ULTIMATE.init(); {10492#true} is VALID [2022-04-28 03:48:19,629 INFO L290 TraceCheckUtils]: 1: Hoare triple {10492#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {10492#true} is VALID [2022-04-28 03:48:19,629 INFO L290 TraceCheckUtils]: 2: Hoare triple {10492#true} assume true; {10492#true} is VALID [2022-04-28 03:48:19,629 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10492#true} {10492#true} #72#return; {10492#true} is VALID [2022-04-28 03:48:19,629 INFO L272 TraceCheckUtils]: 4: Hoare triple {10492#true} call #t~ret13 := main(); {10492#true} is VALID [2022-04-28 03:48:19,629 INFO L290 TraceCheckUtils]: 5: Hoare triple {10492#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {10492#true} is VALID [2022-04-28 03:48:19,629 INFO L290 TraceCheckUtils]: 6: Hoare triple {10492#true} [120] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= |v_main_#t~post6_117| |v_main_#t~post6_116|)) (.cse2 (= v_main_~x~0_288 v_main_~x~0_287)) (.cse3 (= v_main_~y~0_311 v_main_~y~0_310)) (.cse4 (= |v_main_#t~post5_117| |v_main_#t~post5_116|)) (.cse0 (mod v_main_~x~0_288 4294967296))) (or (and (<= .cse0 0) .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4) (and (< 0 .cse0) (< v_main_~x~0_287 v_main_~x~0_288) (forall ((v_it_23 Int)) (or (not (<= 1 v_it_23)) (not (<= (+ v_main_~x~0_287 v_it_23 1) v_main_~x~0_288)) (< 0 (mod (+ v_main_~x~0_288 (* 4294967295 v_it_23)) 4294967296)))) (= v_main_~y~0_310 (+ v_main_~x~0_288 v_main_~y~0_311 (* v_main_~x~0_287 (- 1))))))) InVars {main_~y~0=v_main_~y~0_311, main_#t~post5=|v_main_#t~post5_117|, main_~x~0=v_main_~x~0_288, main_#t~post6=|v_main_#t~post6_117|} OutVars{main_~y~0=v_main_~y~0_310, main_#t~post5=|v_main_#t~post5_116|, main_~x~0=v_main_~x~0_287, main_#t~post6=|v_main_#t~post6_116|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {10492#true} is VALID [2022-04-28 03:48:19,629 INFO L290 TraceCheckUtils]: 7: Hoare triple {10492#true} [119] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {10492#true} is VALID [2022-04-28 03:48:19,630 INFO L290 TraceCheckUtils]: 8: Hoare triple {10492#true} ~z~0 := ~y~0; {10497#(= (+ main_~z~0 (* (- 1) main_~y~0)) 0)} is VALID [2022-04-28 03:48:19,631 INFO L290 TraceCheckUtils]: 9: Hoare triple {10497#(= (+ main_~z~0 (* (- 1) main_~y~0)) 0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10498#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-28 03:48:19,631 INFO L290 TraceCheckUtils]: 10: Hoare triple {10498#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 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; {10499#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-28 03:48:19,632 INFO L290 TraceCheckUtils]: 11: Hoare triple {10499#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) 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; {10500#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-28 03:48:19,633 INFO L290 TraceCheckUtils]: 12: Hoare triple {10500#(and (<= (+ main_~z~0 3) 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; {10501#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-28 03:48:19,634 INFO L290 TraceCheckUtils]: 13: Hoare triple {10501#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 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; {10502#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} is VALID [2022-04-28 03:48:19,634 INFO L290 TraceCheckUtils]: 14: Hoare triple {10502#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} assume !(~z~0 % 4294967296 > 0); {10502#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} is VALID [2022-04-28 03:48:19,635 INFO L290 TraceCheckUtils]: 15: Hoare triple {10502#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10503#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-28 03:48:19,637 INFO L290 TraceCheckUtils]: 16: Hoare triple {10503#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10504#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-28 03:48:19,638 INFO L290 TraceCheckUtils]: 17: Hoare triple {10504#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10505#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-28 03:48:19,639 INFO L290 TraceCheckUtils]: 18: Hoare triple {10505#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 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; {10506#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-28 03:48:19,639 INFO L290 TraceCheckUtils]: 19: Hoare triple {10506#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {10493#false} is VALID [2022-04-28 03:48:19,640 INFO L290 TraceCheckUtils]: 20: Hoare triple {10493#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {10493#false} is VALID [2022-04-28 03:48:19,640 INFO L290 TraceCheckUtils]: 21: Hoare triple {10493#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {10493#false} is VALID [2022-04-28 03:48:19,640 INFO L290 TraceCheckUtils]: 22: Hoare triple {10493#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {10493#false} is VALID [2022-04-28 03:48:19,640 INFO L290 TraceCheckUtils]: 23: Hoare triple {10493#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {10493#false} is VALID [2022-04-28 03:48:19,640 INFO L290 TraceCheckUtils]: 24: Hoare triple {10493#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {10493#false} is VALID [2022-04-28 03:48:19,640 INFO L290 TraceCheckUtils]: 25: Hoare triple {10493#false} assume !(~x~0 % 4294967296 > 0); {10493#false} is VALID [2022-04-28 03:48:19,640 INFO L272 TraceCheckUtils]: 26: Hoare triple {10493#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {10493#false} is VALID [2022-04-28 03:48:19,640 INFO L290 TraceCheckUtils]: 27: Hoare triple {10493#false} ~cond := #in~cond; {10493#false} is VALID [2022-04-28 03:48:19,640 INFO L290 TraceCheckUtils]: 28: Hoare triple {10493#false} assume 0 == ~cond; {10493#false} is VALID [2022-04-28 03:48:19,640 INFO L290 TraceCheckUtils]: 29: Hoare triple {10493#false} assume !false; {10493#false} is VALID [2022-04-28 03:48:19,641 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 03:48:19,641 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:48:20,575 INFO L290 TraceCheckUtils]: 29: Hoare triple {10493#false} assume !false; {10493#false} is VALID [2022-04-28 03:48:20,575 INFO L290 TraceCheckUtils]: 28: Hoare triple {10493#false} assume 0 == ~cond; {10493#false} is VALID [2022-04-28 03:48:20,575 INFO L290 TraceCheckUtils]: 27: Hoare triple {10493#false} ~cond := #in~cond; {10493#false} is VALID [2022-04-28 03:48:20,575 INFO L272 TraceCheckUtils]: 26: Hoare triple {10493#false} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {10493#false} is VALID [2022-04-28 03:48:20,575 INFO L290 TraceCheckUtils]: 25: Hoare triple {10493#false} assume !(~x~0 % 4294967296 > 0); {10493#false} is VALID [2022-04-28 03:48:20,575 INFO L290 TraceCheckUtils]: 24: Hoare triple {10493#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {10493#false} is VALID [2022-04-28 03:48:20,575 INFO L290 TraceCheckUtils]: 23: Hoare triple {10493#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {10493#false} is VALID [2022-04-28 03:48:20,576 INFO L290 TraceCheckUtils]: 22: Hoare triple {10493#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {10493#false} is VALID [2022-04-28 03:48:20,576 INFO L290 TraceCheckUtils]: 21: Hoare triple {10493#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {10493#false} is VALID [2022-04-28 03:48:20,576 INFO L290 TraceCheckUtils]: 20: Hoare triple {10493#false} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {10493#false} is VALID [2022-04-28 03:48:20,576 INFO L290 TraceCheckUtils]: 19: Hoare triple {10506#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {10493#false} is VALID [2022-04-28 03:48:20,578 INFO L290 TraceCheckUtils]: 18: Hoare triple {10505#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 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; {10506#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-28 03:48:20,579 INFO L290 TraceCheckUtils]: 17: Hoare triple {10504#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10505#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-28 03:48:20,580 INFO L290 TraceCheckUtils]: 16: Hoare triple {10503#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10504#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-28 03:48:20,581 INFO L290 TraceCheckUtils]: 15: Hoare triple {10502#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10503#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-28 03:48:20,582 INFO L290 TraceCheckUtils]: 14: Hoare triple {10502#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} assume !(~z~0 % 4294967296 > 0); {10502#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} is VALID [2022-04-28 03:48:20,582 INFO L290 TraceCheckUtils]: 13: Hoare triple {10646#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299)) (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; {10502#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299))} is VALID [2022-04-28 03:48:20,584 INFO L290 TraceCheckUtils]: 12: Hoare triple {10650#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10646#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299)) (not (< 0 (mod main_~z~0 4294967296))))} is VALID [2022-04-28 03:48:20,585 INFO L290 TraceCheckUtils]: 11: Hoare triple {10654#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299)) (not (< 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; {10650#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299)))} is VALID [2022-04-28 03:48:20,586 INFO L290 TraceCheckUtils]: 10: Hoare triple {10658#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299)) (not (< 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; {10654#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299)) (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))))} is VALID [2022-04-28 03:48:20,588 INFO L290 TraceCheckUtils]: 9: Hoare triple {10662#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299)) (not (< 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; {10658#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299)) (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))))} is VALID [2022-04-28 03:48:20,589 INFO L290 TraceCheckUtils]: 8: Hoare triple {10492#true} ~z~0 := ~y~0; {10662#(or (<= main_~y~0 (+ (* (div (+ main_~y~0 (- 5)) 4294967296) 4294967296) 4294967299)) (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))))} is VALID [2022-04-28 03:48:20,589 INFO L290 TraceCheckUtils]: 7: Hoare triple {10492#true} [119] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {10492#true} is VALID [2022-04-28 03:48:20,589 INFO L290 TraceCheckUtils]: 6: Hoare triple {10492#true} [120] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= |v_main_#t~post6_117| |v_main_#t~post6_116|)) (.cse2 (= v_main_~x~0_288 v_main_~x~0_287)) (.cse3 (= v_main_~y~0_311 v_main_~y~0_310)) (.cse4 (= |v_main_#t~post5_117| |v_main_#t~post5_116|)) (.cse0 (mod v_main_~x~0_288 4294967296))) (or (and (<= .cse0 0) .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4) (and (< 0 .cse0) (< v_main_~x~0_287 v_main_~x~0_288) (forall ((v_it_23 Int)) (or (not (<= 1 v_it_23)) (not (<= (+ v_main_~x~0_287 v_it_23 1) v_main_~x~0_288)) (< 0 (mod (+ v_main_~x~0_288 (* 4294967295 v_it_23)) 4294967296)))) (= v_main_~y~0_310 (+ v_main_~x~0_288 v_main_~y~0_311 (* v_main_~x~0_287 (- 1))))))) InVars {main_~y~0=v_main_~y~0_311, main_#t~post5=|v_main_#t~post5_117|, main_~x~0=v_main_~x~0_288, main_#t~post6=|v_main_#t~post6_117|} OutVars{main_~y~0=v_main_~y~0_310, main_#t~post5=|v_main_#t~post5_116|, main_~x~0=v_main_~x~0_287, main_#t~post6=|v_main_#t~post6_116|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {10492#true} is VALID [2022-04-28 03:48:20,589 INFO L290 TraceCheckUtils]: 5: Hoare triple {10492#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {10492#true} is VALID [2022-04-28 03:48:20,589 INFO L272 TraceCheckUtils]: 4: Hoare triple {10492#true} call #t~ret13 := main(); {10492#true} is VALID [2022-04-28 03:48:20,589 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10492#true} {10492#true} #72#return; {10492#true} is VALID [2022-04-28 03:48:20,589 INFO L290 TraceCheckUtils]: 2: Hoare triple {10492#true} assume true; {10492#true} is VALID [2022-04-28 03:48:20,589 INFO L290 TraceCheckUtils]: 1: Hoare triple {10492#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {10492#true} is VALID [2022-04-28 03:48:20,589 INFO L272 TraceCheckUtils]: 0: Hoare triple {10492#true} call ULTIMATE.init(); {10492#true} is VALID [2022-04-28 03:48:20,590 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 03:48:20,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1826785429] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:48:20,590 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:48:20,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 18 [2022-04-28 03:48:20,878 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:48:20,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2118059589] [2022-04-28 03:48:20,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2118059589] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:48:20,878 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:48:20,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-28 03:48:20,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043239304] [2022-04-28 03:48:20,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:48:20,878 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.5) internal successors, (24), 15 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 32 [2022-04-28 03:48:20,879 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:48:20,879 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 1.5) internal successors, (24), 15 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 03:48:20,915 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 03:48:20,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-28 03:48:20,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:48:20,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-28 03:48:20,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=368, Unknown=0, NotChecked=0, Total=420 [2022-04-28 03:48:20,916 INFO L87 Difference]: Start difference. First operand 71 states and 87 transitions. Second operand has 16 states, 16 states have (on average 1.5) internal successors, (24), 15 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 03:48:27,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:48:27,335 INFO L93 Difference]: Finished difference Result 120 states and 147 transitions. [2022-04-28 03:48:27,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-28 03:48:27,335 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.5) internal successors, (24), 15 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 32 [2022-04-28 03:48:27,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:48:27,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.5) internal successors, (24), 15 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 03:48:27,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 59 transitions. [2022-04-28 03:48:27,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.5) internal successors, (24), 15 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 03:48:27,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 59 transitions. [2022-04-28 03:48:27,337 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 59 transitions. [2022-04-28 03:48:27,544 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 03:48:27,545 INFO L225 Difference]: With dead ends: 120 [2022-04-28 03:48:27,546 INFO L226 Difference]: Without dead ends: 104 [2022-04-28 03:48:27,546 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 64 SyntacticMatches, 7 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 287 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=347, Invalid=1545, Unknown=0, NotChecked=0, Total=1892 [2022-04-28 03:48:27,546 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 42 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-04-28 03:48:27,547 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 77 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-04-28 03:48:27,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-04-28 03:48:27,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 77. [2022-04-28 03:48:27,969 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:48:27,969 INFO L82 GeneralOperation]: Start isEquivalent. First operand 104 states. Second operand has 77 states, 72 states have (on average 1.2361111111111112) internal successors, (89), 72 states have internal predecessors, (89), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:48:27,970 INFO L74 IsIncluded]: Start isIncluded. First operand 104 states. Second operand has 77 states, 72 states have (on average 1.2361111111111112) internal successors, (89), 72 states have internal predecessors, (89), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:48:27,970 INFO L87 Difference]: Start difference. First operand 104 states. Second operand has 77 states, 72 states have (on average 1.2361111111111112) internal successors, (89), 72 states have internal predecessors, (89), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:48:27,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:48:27,971 INFO L93 Difference]: Finished difference Result 104 states and 125 transitions. [2022-04-28 03:48:27,971 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 125 transitions. [2022-04-28 03:48:27,971 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:48:27,971 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:48:27,972 INFO L74 IsIncluded]: Start isIncluded. First operand has 77 states, 72 states have (on average 1.2361111111111112) internal successors, (89), 72 states have internal predecessors, (89), 3 states have call successors, (3), 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 104 states. [2022-04-28 03:48:27,972 INFO L87 Difference]: Start difference. First operand has 77 states, 72 states have (on average 1.2361111111111112) internal successors, (89), 72 states have internal predecessors, (89), 3 states have call successors, (3), 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 104 states. [2022-04-28 03:48:27,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:48:27,973 INFO L93 Difference]: Finished difference Result 104 states and 125 transitions. [2022-04-28 03:48:27,973 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 125 transitions. [2022-04-28 03:48:27,973 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:48:27,973 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:48:27,973 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:48:27,973 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:48:27,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 72 states have (on average 1.2361111111111112) internal successors, (89), 72 states have internal predecessors, (89), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:48:27,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 93 transitions. [2022-04-28 03:48:27,974 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 93 transitions. Word has length 32 [2022-04-28 03:48:27,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:48:27,974 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 93 transitions. [2022-04-28 03:48:27,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.5) internal successors, (24), 15 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 03:48:27,975 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 77 states and 93 transitions. [2022-04-28 03:48:39,213 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 89 inductive. 0 not inductive. 4 times theorem prover too weak to decide inductivity. [2022-04-28 03:48:39,213 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 93 transitions. [2022-04-28 03:48:39,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-28 03:48:39,214 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:48:39,214 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:48:39,229 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 03:48:39,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:48:39,415 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:48:39,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:48:39,416 INFO L85 PathProgramCache]: Analyzing trace with hash 259959720, now seen corresponding path program 18 times [2022-04-28 03:48:39,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:48:39,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2049769579] [2022-04-28 03:48:39,672 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:48:39,673 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:48:39,675 INFO L85 PathProgramCache]: Analyzing trace with hash -1019646073, now seen corresponding path program 1 times [2022-04-28 03:48:39,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:48:39,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447704546] [2022-04-28 03:48:39,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:48:39,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:48:39,686 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_24.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:48:39,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:48:39,726 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_24.5))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:48:41,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:48:41,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:48:41,968 INFO L290 TraceCheckUtils]: 0: Hoare triple {11374#(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); {11346#true} is VALID [2022-04-28 03:48:41,968 INFO L290 TraceCheckUtils]: 1: Hoare triple {11346#true} assume true; {11346#true} is VALID [2022-04-28 03:48:41,968 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11346#true} {11346#true} #72#return; {11346#true} is VALID [2022-04-28 03:48:41,969 INFO L272 TraceCheckUtils]: 0: Hoare triple {11346#true} call ULTIMATE.init(); {11374#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:48:41,969 INFO L290 TraceCheckUtils]: 1: Hoare triple {11374#(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); {11346#true} is VALID [2022-04-28 03:48:41,969 INFO L290 TraceCheckUtils]: 2: Hoare triple {11346#true} assume true; {11346#true} is VALID [2022-04-28 03:48:41,969 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11346#true} {11346#true} #72#return; {11346#true} is VALID [2022-04-28 03:48:41,969 INFO L272 TraceCheckUtils]: 4: Hoare triple {11346#true} call #t~ret13 := main(); {11346#true} is VALID [2022-04-28 03:48:41,970 INFO L290 TraceCheckUtils]: 5: Hoare triple {11346#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {11351#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-28 03:48:41,971 INFO L290 TraceCheckUtils]: 6: Hoare triple {11351#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} [122] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_122| |v_main_#t~post5_121|)) (.cse1 (= v_main_~x~0_307 v_main_~x~0_306)) (.cse4 (mod v_main_~x~0_307 4294967296)) (.cse2 (= v_main_~y~0_333 v_main_~y~0_332)) (.cse3 (= |v_main_#t~post6_122| |v_main_#t~post6_121|))) (or (and .cse0 .cse1 .cse2 .cse3) (and (forall ((v_it_24 Int)) (or (< 0 (mod (+ v_main_~x~0_307 (* 4294967295 v_it_24)) 4294967296)) (not (<= (+ v_main_~x~0_306 v_it_24 1) v_main_~x~0_307)) (not (<= 1 v_it_24)))) (< 0 .cse4) (= v_main_~y~0_332 (+ (* v_main_~x~0_306 (- 1)) v_main_~x~0_307 v_main_~y~0_333)) (< v_main_~x~0_306 v_main_~x~0_307)) (and .cse0 .cse1 (<= .cse4 0) .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_333, main_#t~post5=|v_main_#t~post5_122|, main_~x~0=v_main_~x~0_307, main_#t~post6=|v_main_#t~post6_122|} OutVars{main_~y~0=v_main_~y~0_332, main_#t~post5=|v_main_#t~post5_121|, main_~x~0=v_main_~x~0_306, main_#t~post6=|v_main_#t~post6_121|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {11352#(or (and (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= main_~n~0 (+ main_~y~0 main_~x~0))) (= main_~y~0 0))} is VALID [2022-04-28 03:48:41,972 INFO L290 TraceCheckUtils]: 7: Hoare triple {11352#(or (and (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= main_~n~0 (+ main_~y~0 main_~x~0))) (= main_~y~0 0))} [121] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {11353#(or (= main_~y~0 0) (and (<= (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))))))} is VALID [2022-04-28 03:48:41,973 INFO L290 TraceCheckUtils]: 8: Hoare triple {11353#(or (= main_~y~0 0) (and (<= (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))))))} ~z~0 := ~y~0; {11354#(and (= (+ main_~z~0 (* (- 1) main_~y~0)) 0) (or (= main_~y~0 0) (and (<= (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296)))))))} is VALID [2022-04-28 03:48:41,974 INFO L290 TraceCheckUtils]: 9: Hoare triple {11354#(and (= (+ main_~z~0 (* (- 1) main_~y~0)) 0) (or (= main_~y~0 0) (and (<= (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~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; {11355#(and (or (= main_~y~0 0) (<= main_~n~0 (+ main_~z~0 (* (div (+ (- 1) main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 1))) (or (not (= main_~y~0 0)) (and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))))} is VALID [2022-04-28 03:48:41,976 INFO L290 TraceCheckUtils]: 10: Hoare triple {11355#(and (or (= main_~y~0 0) (<= main_~n~0 (+ main_~z~0 (* (div (+ (- 1) main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296) 1))) (or (not (= main_~y~0 0)) (and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 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; {11356#(and (or (= main_~y~0 0) (<= main_~n~0 (+ main_~z~0 2 (* (div (+ (- 2) main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)))) (or (not (= main_~y~0 0)) (and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))))} is VALID [2022-04-28 03:48:41,978 INFO L290 TraceCheckUtils]: 11: Hoare triple {11356#(and (or (= main_~y~0 0) (<= main_~n~0 (+ main_~z~0 2 (* (div (+ (- 2) main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296)))) (or (not (= main_~y~0 0)) (and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) 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; {11357#(and (or (<= main_~n~0 (+ main_~z~0 3 (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) (- 3)) 4294967296)))) (= main_~y~0 0)) (or (not (= main_~y~0 0)) (and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))))} is VALID [2022-04-28 03:48:41,979 INFO L290 TraceCheckUtils]: 12: Hoare triple {11357#(and (or (<= main_~n~0 (+ main_~z~0 3 (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) (- 3)) 4294967296)))) (= main_~y~0 0)) (or (not (= main_~y~0 0)) (and (<= (+ main_~z~0 3) 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; {11358#(and (or (= main_~y~0 0) (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (* (- 1) main_~z~0) (- 4)) 4294967296) 4294967296) 4))) (or (not (= main_~y~0 0)) (and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))))} is VALID [2022-04-28 03:48:41,981 INFO L290 TraceCheckUtils]: 13: Hoare triple {11358#(and (or (= main_~y~0 0) (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (* (- 1) main_~z~0) (- 4)) 4294967296) 4294967296) 4))) (or (not (= main_~y~0 0)) (and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 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; {11359#(and (or (= main_~y~0 0) (<= main_~n~0 (+ 5 main_~z~0 (* (div (+ main_~n~0 (* (- 1) main_~z~0) (- 5)) 4294967296) 4294967296)))) (or (not (= main_~y~0 0)) (and (<= (+ (div main_~z~0 4294967296) 1) 0) (<= main_~y~0 (+ 5 main_~z~0)))))} is VALID [2022-04-28 03:48:41,983 INFO L290 TraceCheckUtils]: 14: Hoare triple {11359#(and (or (= main_~y~0 0) (<= main_~n~0 (+ 5 main_~z~0 (* (div (+ main_~n~0 (* (- 1) main_~z~0) (- 5)) 4294967296) 4294967296)))) (or (not (= main_~y~0 0)) (and (<= (+ (div main_~z~0 4294967296) 1) 0) (<= main_~y~0 (+ 5 main_~z~0)))))} assume !(~z~0 % 4294967296 > 0); {11360#(and (not (= main_~y~0 0)) (<= main_~n~0 (+ (* (div (+ main_~n~0 (- 5) (* (div main_~z~0 4294967296) (- 4294967296))) 4294967296) 4294967296) 5 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-28 03:48:41,984 INFO L290 TraceCheckUtils]: 15: Hoare triple {11360#(and (not (= main_~y~0 0)) (<= main_~n~0 (+ (* (div (+ main_~n~0 (- 5) (* (div main_~z~0 4294967296) (- 4294967296))) 4294967296) 4294967296) 5 (* (div 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; {11361#(<= main_~n~0 (+ 5 (* (div (+ main_~n~0 (- 5)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:48:41,992 INFO L290 TraceCheckUtils]: 16: Hoare triple {11361#(<= main_~n~0 (+ 5 (* (div (+ main_~n~0 (- 5)) 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; {11362#(<= main_~y~0 (+ 4294967294 (* (div (+ (* (div (+ 4294967290 main_~n~0) 4294967296) (- 4294967296)) (* (div main_~y~0 4294967296) 4294967296) main_~n~0 (- 5)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:48:42,018 INFO L290 TraceCheckUtils]: 17: Hoare triple {11362#(<= main_~y~0 (+ 4294967294 (* (div (+ (* (div (+ 4294967290 main_~n~0) 4294967296) (- 4294967296)) (* (div main_~y~0 4294967296) 4294967296) main_~n~0 (- 5)) 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; {11363#(<= main_~y~0 (+ (* (div (+ (* (div (+ 4294967290 main_~n~0) 4294967296) (- 4294967296)) (* (div main_~y~0 4294967296) 4294967296) main_~n~0 (- 5)) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 03:48:42,024 INFO L290 TraceCheckUtils]: 18: Hoare triple {11363#(<= main_~y~0 (+ (* (div (+ (* (div (+ 4294967290 main_~n~0) 4294967296) (- 4294967296)) (* (div main_~y~0 4294967296) 4294967296) main_~n~0 (- 5)) 4294967296) 4294967296) 4294967293))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {11364#(<= main_~y~0 (+ 4294967292 (* (div (+ (* (div (+ 4294967290 main_~n~0) 4294967296) (- 4294967296)) (* (div main_~y~0 4294967296) 4294967296) main_~n~0 (- 5)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:48:42,030 INFO L290 TraceCheckUtils]: 19: Hoare triple {11364#(<= main_~y~0 (+ 4294967292 (* (div (+ (* (div (+ 4294967290 main_~n~0) 4294967296) (- 4294967296)) (* (div main_~y~0 4294967296) 4294967296) main_~n~0 (- 5)) 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; {11365#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (- 5) (* (div main_~y~0 4294967296) (- 4294967296))) 4294967296) 4294967296) 5 main_~y~0)) (<= (+ 5 (* (div main_~n~0 4294967296) 4294967296)) main_~n~0))} is VALID [2022-04-28 03:48:42,033 INFO L290 TraceCheckUtils]: 20: Hoare triple {11365#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (- 5) (* (div main_~y~0 4294967296) (- 4294967296))) 4294967296) 4294967296) 5 main_~y~0)) (<= (+ 5 (* (div main_~n~0 4294967296) 4294967296)) main_~n~0))} assume !(~y~0 % 4294967296 > 0); {11366#(and (<= (+ 5 main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)) (<= main_~n~0 (+ 5 main_~y~0 (* (div (+ main_~n~0 (- 5) (* (- 1) main_~y~0)) 4294967296) 4294967296))))} is VALID [2022-04-28 03:48:42,037 INFO L290 TraceCheckUtils]: 21: Hoare triple {11366#(and (<= (+ 5 main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)) (<= main_~n~0 (+ 5 main_~y~0 (* (div (+ main_~n~0 (- 5) (* (- 1) main_~y~0)) 4294967296) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {11367#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (- 4) (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0 4)) (<= (+ (* (div (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 4294967299 (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~y~0))} is VALID [2022-04-28 03:48:42,040 INFO L290 TraceCheckUtils]: 22: Hoare triple {11367#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (- 4) (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0 4)) (<= (+ (* (div (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 4294967299 (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {11368#(and (<= (+ 2 (* (div (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 4294967298) 4294967296) 4294967296)) main_~y~0) (<= main_~n~0 (+ main_~y~0 3 (* (div (+ main_~n~0 (- 3) (* (- 1) main_~y~0)) 4294967296) 4294967296))))} is VALID [2022-04-28 03:48:42,044 INFO L290 TraceCheckUtils]: 23: Hoare triple {11368#(and (<= (+ 2 (* (div (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 4294967298) 4294967296) 4294967296)) main_~y~0) (<= main_~n~0 (+ main_~y~0 3 (* (div (+ main_~n~0 (- 3) (* (- 1) main_~y~0)) 4294967296) 4294967296))))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {11369#(and (<= main_~n~0 (+ (* (div (+ (- 2) main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0 2)) (<= (+ 3 (* (div (+ main_~y~0 4294967297 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296)) main_~y~0))} is VALID [2022-04-28 03:48:42,051 INFO L290 TraceCheckUtils]: 24: Hoare triple {11369#(and (<= main_~n~0 (+ (* (div (+ (- 2) main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0 2)) (<= (+ 3 (* (div (+ main_~y~0 4294967297 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296)) main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {11370#(and (<= (+ (* 4294967296 (div (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 4294967296 (* (- 1) main_~n~0)) 4294967296)) 4) main_~y~0) (<= main_~n~0 (+ (* (div (+ (- 1) main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0 1)))} is VALID [2022-04-28 03:48:42,055 INFO L290 TraceCheckUtils]: 25: Hoare triple {11370#(and (<= (+ (* 4294967296 (div (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 4294967296 (* (- 1) main_~n~0)) 4294967296)) 4) main_~y~0) (<= main_~n~0 (+ (* (div (+ (- 1) main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0 1)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {11371#(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 03:48:42,055 INFO L290 TraceCheckUtils]: 26: Hoare triple {11371#(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); {11371#(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 03:48:42,056 INFO L272 TraceCheckUtils]: 27: Hoare triple {11371#(and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0)))} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {11372#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:48:42,057 INFO L290 TraceCheckUtils]: 28: Hoare triple {11372#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {11373#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:48:42,057 INFO L290 TraceCheckUtils]: 29: Hoare triple {11373#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {11347#false} is VALID [2022-04-28 03:48:42,057 INFO L290 TraceCheckUtils]: 30: Hoare triple {11347#false} assume !false; {11347#false} is VALID [2022-04-28 03:48:42,057 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 6 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:48:42,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:48:42,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447704546] [2022-04-28 03:48:42,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447704546] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:48:42,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [720413153] [2022-04-28 03:48:42,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:48:42,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:48:42,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:48:42,059 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 03:48:42,060 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 03:49:05,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:49:05,711 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 60 conjunts are in the unsatisfiable core [2022-04-28 03:49:06,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:49:06,230 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:49:33,821 WARN L232 SmtUtils]: Spent 5.75s on a formula simplification that was a NOOP. DAG size: 42 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-28 03:49:59,722 WARN L232 SmtUtils]: Spent 7.53s on a formula simplification that was a NOOP. DAG size: 46 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)