/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-de51.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 03:41:21,652 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 03:41:21,681 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 03:41:21,721 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 03:41:21,721 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 03:41:21,722 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 03:41:21,724 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 03:41:21,725 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 03:41:21,728 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 03:41:21,731 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 03:41:21,732 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 03:41:21,733 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 03:41:21,733 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 03:41:21,734 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 03:41:21,735 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 03:41:21,737 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 03:41:21,738 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 03:41:21,738 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 03:41:21,740 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 03:41:21,743 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 03:41:21,744 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 03:41:21,745 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 03:41:21,746 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 03:41:21,746 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 03:41:21,747 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 03:41:21,752 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 03:41:21,752 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 03:41:21,752 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 03:41:21,753 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 03:41:21,753 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 03:41:21,754 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 03:41:21,754 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 03:41:21,755 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 03:41:21,755 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 03:41:21,756 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 03:41:21,756 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 03:41:21,756 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 03:41:21,757 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 03:41:21,757 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 03:41:21,757 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 03:41:21,757 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 03:41:21,759 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 03:41:21,759 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:41:21,768 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 03:41:21,768 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 03:41:21,769 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 03:41:21,769 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 03:41:21,769 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 03:41:21,769 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 03:41:21,769 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 03:41:21,770 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 03:41:21,770 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 03:41:21,770 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 03:41:21,770 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 03:41:21,770 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 03:41:21,770 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 03:41:21,771 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 03:41:21,771 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 03:41:21,771 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 03:41:21,771 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 03:41:21,771 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 03:41:21,771 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 03:41:21,771 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 03:41:21,771 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 03:41:21,772 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 03:41:21,772 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 03:41:21,772 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 03:41:21,772 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 03:41:21,772 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:41:21,950 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 03:41:21,981 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 03:41:21,982 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 03:41:21,983 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 03:41:21,984 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 03:41:21,984 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/in-de51.c [2022-04-28 03:41:22,028 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/821bbb255/7c159607678c449b848f75943f250792/FLAGf2111a984 [2022-04-28 03:41:22,347 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 03:41:22,348 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/in-de51.c [2022-04-28 03:41:22,351 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/821bbb255/7c159607678c449b848f75943f250792/FLAGf2111a984 [2022-04-28 03:41:22,799 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/821bbb255/7c159607678c449b848f75943f250792 [2022-04-28 03:41:22,801 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 03:41:22,802 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 03:41:22,804 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 03:41:22,805 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 03:41:22,807 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 03:41:22,808 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 03:41:22" (1/1) ... [2022-04-28 03:41:22,808 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73c4fd15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:41:22, skipping insertion in model container [2022-04-28 03:41:22,808 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 03:41:22" (1/1) ... [2022-04-28 03:41:22,812 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 03:41:22,821 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 03:41:22,937 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-de51.c[368,381] [2022-04-28 03:41:22,948 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 03:41:22,954 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 03:41:22,962 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-de51.c[368,381] [2022-04-28 03:41:22,966 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 03:41:22,974 INFO L208 MainTranslator]: Completed translation [2022-04-28 03:41:22,974 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:41:22 WrapperNode [2022-04-28 03:41:22,974 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 03:41:22,975 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 03:41:22,975 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 03:41:22,975 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 03:41:22,981 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:41:22" (1/1) ... [2022-04-28 03:41:22,981 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:41:22" (1/1) ... [2022-04-28 03:41:22,988 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:41:22" (1/1) ... [2022-04-28 03:41:22,988 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:41:22" (1/1) ... [2022-04-28 03:41:23,001 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:41:22" (1/1) ... [2022-04-28 03:41:23,008 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:41:22" (1/1) ... [2022-04-28 03:41:23,012 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:41:22" (1/1) ... [2022-04-28 03:41:23,013 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 03:41:23,013 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 03:41:23,013 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 03:41:23,013 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 03:41:23,014 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:41:22" (1/1) ... [2022-04-28 03:41:23,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 03:41:23,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:41:23,038 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:41:23,039 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:41:23,061 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 03:41:23,061 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 03:41:23,061 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 03:41:23,061 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 03:41:23,061 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 03:41:23,062 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 03:41:23,062 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 03:41:23,062 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 03:41:23,062 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 03:41:23,062 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-28 03:41:23,062 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 03:41:23,062 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 03:41:23,062 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 03:41:23,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 03:41:23,062 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 03:41:23,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 03:41:23,062 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 03:41:23,062 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 03:41:23,103 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 03:41:23,104 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 03:41:23,288 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 03:41:23,292 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 03:41:23,292 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-04-28 03:41:23,293 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 03:41:23 BoogieIcfgContainer [2022-04-28 03:41:23,294 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 03:41:23,295 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 03:41:23,295 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 03:41:23,297 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 03:41:23,297 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 03:41:22" (1/3) ... [2022-04-28 03:41:23,298 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7252bbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 03:41:23, skipping insertion in model container [2022-04-28 03:41:23,298 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:41:22" (2/3) ... [2022-04-28 03:41:23,298 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7252bbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 03:41:23, skipping insertion in model container [2022-04-28 03:41:23,298 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 03:41:23" (3/3) ... [2022-04-28 03:41:23,299 INFO L111 eAbstractionObserver]: Analyzing ICFG in-de51.c [2022-04-28 03:41:23,307 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 03:41:23,308 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 03:41:23,334 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 03:41:23,338 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@19b444ef, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6d5229a8 [2022-04-28 03:41:23,338 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 03:41:23,343 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 16 states have (on average 1.75) internal successors, (28), 17 states have internal predecessors, (28), 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:41:23,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-28 03:41:23,347 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:41:23,347 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:41:23,348 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:41:23,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:41:23,350 INFO L85 PathProgramCache]: Analyzing trace with hash -1060076674, now seen corresponding path program 1 times [2022-04-28 03:41:23,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:41:23,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1053362660] [2022-04-28 03:41:23,361 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:41:23,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1060076674, now seen corresponding path program 2 times [2022-04-28 03:41:23,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:41:23,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614287507] [2022-04-28 03:41:23,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:41:23,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:41:23,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:23,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:41:23,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:23,474 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {27#true} is VALID [2022-04-28 03:41:23,474 INFO L290 TraceCheckUtils]: 1: Hoare triple {27#true} assume true; {27#true} is VALID [2022-04-28 03:41:23,475 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {27#true} {27#true} #83#return; {27#true} is VALID [2022-04-28 03:41:23,476 INFO L272 TraceCheckUtils]: 0: Hoare triple {27#true} call ULTIMATE.init(); {32#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:41:23,476 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {27#true} is VALID [2022-04-28 03:41:23,476 INFO L290 TraceCheckUtils]: 2: Hoare triple {27#true} assume true; {27#true} is VALID [2022-04-28 03:41:23,476 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27#true} {27#true} #83#return; {27#true} is VALID [2022-04-28 03:41:23,476 INFO L272 TraceCheckUtils]: 4: Hoare triple {27#true} call #t~ret15 := main(); {27#true} is VALID [2022-04-28 03:41:23,477 INFO L290 TraceCheckUtils]: 5: Hoare triple {27#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {27#true} is VALID [2022-04-28 03:41:23,477 INFO L290 TraceCheckUtils]: 6: Hoare triple {27#true} assume !(~x~0 % 4294967296 > 0); {27#true} is VALID [2022-04-28 03:41:23,477 INFO L290 TraceCheckUtils]: 7: Hoare triple {27#true} ~z~0 := ~y~0; {27#true} is VALID [2022-04-28 03:41:23,477 INFO L290 TraceCheckUtils]: 8: Hoare triple {27#true} assume !(~z~0 % 4294967296 > 0); {27#true} is VALID [2022-04-28 03:41:23,477 INFO L290 TraceCheckUtils]: 9: Hoare triple {27#true} assume !(~y~0 % 4294967296 > 0); {27#true} is VALID [2022-04-28 03:41:23,478 INFO L290 TraceCheckUtils]: 10: Hoare triple {27#true} assume !true; {28#false} is VALID [2022-04-28 03:41:23,478 INFO L290 TraceCheckUtils]: 11: Hoare triple {28#false} assume !(~z~0 % 4294967296 > 0); {28#false} is VALID [2022-04-28 03:41:23,478 INFO L272 TraceCheckUtils]: 12: Hoare triple {28#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {28#false} is VALID [2022-04-28 03:41:23,478 INFO L290 TraceCheckUtils]: 13: Hoare triple {28#false} ~cond := #in~cond; {28#false} is VALID [2022-04-28 03:41:23,478 INFO L290 TraceCheckUtils]: 14: Hoare triple {28#false} assume 0 == ~cond; {28#false} is VALID [2022-04-28 03:41:23,479 INFO L290 TraceCheckUtils]: 15: Hoare triple {28#false} assume !false; {28#false} is VALID [2022-04-28 03:41:23,479 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:41:23,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:41:23,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614287507] [2022-04-28 03:41:23,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614287507] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:41:23,480 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:41:23,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 03:41:23,483 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:41:23,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1053362660] [2022-04-28 03:41:23,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1053362660] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:41:23,484 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:41:23,484 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 03:41:23,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895034296] [2022-04-28 03:41:23,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:41:23,488 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 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:41:23,489 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:41:23,491 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 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:41:23,515 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:41:23,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 03:41:23,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:41:23,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 03:41:23,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 03:41:23,536 INFO L87 Difference]: Start difference. First operand has 24 states, 16 states have (on average 1.75) internal successors, (28), 17 states have internal predecessors, (28), 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 4.0) internal successors, (12), 2 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:41:23,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:23,630 INFO L93 Difference]: Finished difference Result 41 states and 60 transitions. [2022-04-28 03:41:23,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 03:41:23,630 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 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:41:23,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:41:23,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 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:41:23,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2022-04-28 03:41:23,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 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:41:23,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2022-04-28 03:41:23,646 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 60 transitions. [2022-04-28 03:41:23,715 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:41:23,723 INFO L225 Difference]: With dead ends: 41 [2022-04-28 03:41:23,724 INFO L226 Difference]: Without dead ends: 17 [2022-04-28 03:41:23,726 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:41:23,728 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 19 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 30 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:41:23,729 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 30 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 03:41:23,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-28 03:41:23,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-28 03:41:23,756 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:41:23,757 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have 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:23,757 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have 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:23,758 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have 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:23,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:23,762 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2022-04-28 03:41:23,762 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2022-04-28 03:41:23,763 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:41:23,763 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:41:23,763 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-28 03:41:23,763 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-28 03:41:23,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:23,766 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2022-04-28 03:41:23,766 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2022-04-28 03:41:23,766 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:41:23,766 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:41:23,767 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:41:23,767 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:41:23,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have 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:23,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2022-04-28 03:41:23,770 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 16 [2022-04-28 03:41:23,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:41:23,772 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2022-04-28 03:41:23,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 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:41:23,772 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 21 transitions. [2022-04-28 03:41:23,793 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:41:23,793 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2022-04-28 03:41:23,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-28 03:41:23,794 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:41:23,794 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:41:23,794 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 03:41:23,794 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:41:23,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:41:23,795 INFO L85 PathProgramCache]: Analyzing trace with hash -1174593278, now seen corresponding path program 1 times [2022-04-28 03:41:23,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:41:23,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [287515811] [2022-04-28 03:41:23,799 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:41:23,799 INFO L85 PathProgramCache]: Analyzing trace with hash -1174593278, now seen corresponding path program 2 times [2022-04-28 03:41:23,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:41:23,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564957456] [2022-04-28 03:41:23,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:41:23,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:41:23,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:23,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:41:23,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:23,982 INFO L290 TraceCheckUtils]: 0: Hoare triple {193#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {185#true} is VALID [2022-04-28 03:41:23,983 INFO L290 TraceCheckUtils]: 1: Hoare triple {185#true} assume true; {185#true} is VALID [2022-04-28 03:41:23,983 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {185#true} {185#true} #83#return; {185#true} is VALID [2022-04-28 03:41:23,984 INFO L272 TraceCheckUtils]: 0: Hoare triple {185#true} call ULTIMATE.init(); {193#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:41:23,984 INFO L290 TraceCheckUtils]: 1: Hoare triple {193#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {185#true} is VALID [2022-04-28 03:41:23,984 INFO L290 TraceCheckUtils]: 2: Hoare triple {185#true} assume true; {185#true} is VALID [2022-04-28 03:41:23,985 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {185#true} {185#true} #83#return; {185#true} is VALID [2022-04-28 03:41:23,985 INFO L272 TraceCheckUtils]: 4: Hoare triple {185#true} call #t~ret15 := main(); {185#true} is VALID [2022-04-28 03:41:23,985 INFO L290 TraceCheckUtils]: 5: Hoare triple {185#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {190#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-28 03:41:23,986 INFO L290 TraceCheckUtils]: 6: Hoare triple {190#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !(~x~0 % 4294967296 > 0); {190#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-28 03:41:23,986 INFO L290 TraceCheckUtils]: 7: Hoare triple {190#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} ~z~0 := ~y~0; {190#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-28 03:41:23,991 INFO L290 TraceCheckUtils]: 8: Hoare triple {190#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !(~z~0 % 4294967296 > 0); {190#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-28 03:41:23,992 INFO L290 TraceCheckUtils]: 9: Hoare triple {190#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !(~y~0 % 4294967296 > 0); {190#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-28 03:41:23,992 INFO L290 TraceCheckUtils]: 10: Hoare triple {190#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !(~x~0 % 4294967296 > 0); {190#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-28 03:41:23,993 INFO L290 TraceCheckUtils]: 11: Hoare triple {190#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !(~z~0 % 4294967296 > 0); {190#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-28 03:41:23,994 INFO L272 TraceCheckUtils]: 12: Hoare triple {190#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {191#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:41:23,995 INFO L290 TraceCheckUtils]: 13: Hoare triple {191#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {192#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:41:23,995 INFO L290 TraceCheckUtils]: 14: Hoare triple {192#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {186#false} is VALID [2022-04-28 03:41:23,996 INFO L290 TraceCheckUtils]: 15: Hoare triple {186#false} assume !false; {186#false} is VALID [2022-04-28 03:41:23,996 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:41:23,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:41:23,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564957456] [2022-04-28 03:41:23,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564957456] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:41:23,997 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:41:23,997 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 03:41:23,997 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:41:23,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [287515811] [2022-04-28 03:41:23,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [287515811] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:41:23,998 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:41:23,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 03:41:23,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109067751] [2022-04-28 03:41:23,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:41:23,999 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 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:41:24,000 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:41:24,001 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 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:41:24,014 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:41:24,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 03:41:24,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:41:24,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 03:41:24,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 03:41:24,015 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 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:41:24,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:24,155 INFO L93 Difference]: Finished difference Result 28 states and 36 transitions. [2022-04-28 03:41:24,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 03:41:24,156 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 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:41:24,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:41:24,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 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:41:24,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 36 transitions. [2022-04-28 03:41:24,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 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:41:24,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 36 transitions. [2022-04-28 03:41:24,160 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 36 transitions. [2022-04-28 03:41:24,186 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:41:24,187 INFO L225 Difference]: With dead ends: 28 [2022-04-28 03:41:24,188 INFO L226 Difference]: Without dead ends: 23 [2022-04-28 03:41:24,188 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-04-28 03:41:24,190 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 25 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 03:41:24,190 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 31 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 03:41:24,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-28 03:41:24,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-04-28 03:41:24,203 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:41:24,203 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have 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:24,204 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have 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:24,204 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have 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:24,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:24,206 INFO L93 Difference]: Finished difference Result 23 states and 31 transitions. [2022-04-28 03:41:24,206 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2022-04-28 03:41:24,206 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:41:24,206 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:41:24,206 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 3 states have call successors, (3), 3 states 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:41:24,207 INFO L87 Difference]: Start difference. First operand has 23 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 3 states have call successors, (3), 3 states 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:41:24,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:24,208 INFO L93 Difference]: Finished difference Result 23 states and 31 transitions. [2022-04-28 03:41:24,208 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2022-04-28 03:41:24,208 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:41:24,209 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:41:24,209 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:41:24,209 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:41:24,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have 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:24,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2022-04-28 03:41:24,211 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 31 transitions. Word has length 16 [2022-04-28 03:41:24,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:41:24,211 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 31 transitions. [2022-04-28 03:41:24,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 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:41:24,212 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 31 transitions. [2022-04-28 03:41:24,234 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:41:24,235 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2022-04-28 03:41:24,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 03:41:24,235 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:41:24,235 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:41:24,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 03:41:24,237 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:41:24,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:41:24,238 INFO L85 PathProgramCache]: Analyzing trace with hash -2018158143, now seen corresponding path program 1 times [2022-04-28 03:41:24,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:41:24,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1872817610] [2022-04-28 03:41:24,241 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 03:41:24,241 INFO L85 PathProgramCache]: Analyzing trace with hash -2018158143, now seen corresponding path program 2 times [2022-04-28 03:41:24,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:41:24,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268714996] [2022-04-28 03:41:24,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:41:24,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:41:24,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:24,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:41:24,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:24,285 INFO L290 TraceCheckUtils]: 0: Hoare triple {356#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {350#true} is VALID [2022-04-28 03:41:24,285 INFO L290 TraceCheckUtils]: 1: Hoare triple {350#true} assume true; {350#true} is VALID [2022-04-28 03:41:24,285 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {350#true} {350#true} #83#return; {350#true} is VALID [2022-04-28 03:41:24,286 INFO L272 TraceCheckUtils]: 0: Hoare triple {350#true} call ULTIMATE.init(); {356#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:41:24,286 INFO L290 TraceCheckUtils]: 1: Hoare triple {356#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {350#true} is VALID [2022-04-28 03:41:24,286 INFO L290 TraceCheckUtils]: 2: Hoare triple {350#true} assume true; {350#true} is VALID [2022-04-28 03:41:24,286 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {350#true} {350#true} #83#return; {350#true} is VALID [2022-04-28 03:41:24,286 INFO L272 TraceCheckUtils]: 4: Hoare triple {350#true} call #t~ret15 := main(); {350#true} is VALID [2022-04-28 03:41:24,286 INFO L290 TraceCheckUtils]: 5: Hoare triple {350#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {350#true} is VALID [2022-04-28 03:41:24,286 INFO L290 TraceCheckUtils]: 6: Hoare triple {350#true} assume !(~x~0 % 4294967296 > 0); {350#true} is VALID [2022-04-28 03:41:24,287 INFO L290 TraceCheckUtils]: 7: Hoare triple {350#true} ~z~0 := ~y~0; {350#true} is VALID [2022-04-28 03:41:24,290 INFO L290 TraceCheckUtils]: 8: Hoare triple {350#true} assume !(~z~0 % 4294967296 > 0); {355#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} is VALID [2022-04-28 03:41:24,291 INFO L290 TraceCheckUtils]: 9: Hoare triple {355#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} assume !(~y~0 % 4294967296 > 0); {355#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} is VALID [2022-04-28 03:41:24,291 INFO L290 TraceCheckUtils]: 10: Hoare triple {355#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} assume !(~x~0 % 4294967296 > 0); {355#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} is VALID [2022-04-28 03:41:24,292 INFO L290 TraceCheckUtils]: 11: Hoare triple {355#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {351#false} is VALID [2022-04-28 03:41:24,292 INFO L290 TraceCheckUtils]: 12: Hoare triple {351#false} assume !(~z~0 % 4294967296 > 0); {351#false} is VALID [2022-04-28 03:41:24,292 INFO L272 TraceCheckUtils]: 13: Hoare triple {351#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {351#false} is VALID [2022-04-28 03:41:24,292 INFO L290 TraceCheckUtils]: 14: Hoare triple {351#false} ~cond := #in~cond; {351#false} is VALID [2022-04-28 03:41:24,292 INFO L290 TraceCheckUtils]: 15: Hoare triple {351#false} assume 0 == ~cond; {351#false} is VALID [2022-04-28 03:41:24,292 INFO L290 TraceCheckUtils]: 16: Hoare triple {351#false} assume !false; {351#false} is VALID [2022-04-28 03:41:24,292 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:41:24,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:41:24,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268714996] [2022-04-28 03:41:24,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268714996] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:41:24,293 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:41:24,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 03:41:24,293 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:41:24,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1872817610] [2022-04-28 03:41:24,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1872817610] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:41:24,293 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:41:24,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 03:41:24,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449679675] [2022-04-28 03:41:24,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:41:24,294 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 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:41:24,294 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:41:24,294 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 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:41:24,313 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:41:24,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 03:41:24,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:41:24,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 03:41:24,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 03:41:24,314 INFO L87 Difference]: Start difference. First operand 23 states and 31 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 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:41:24,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:24,383 INFO L93 Difference]: Finished difference Result 35 states and 48 transitions. [2022-04-28 03:41:24,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 03:41:24,384 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 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:41:24,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:41:24,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 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:41:24,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 33 transitions. [2022-04-28 03:41:24,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 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:41:24,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 33 transitions. [2022-04-28 03:41:24,386 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 33 transitions. [2022-04-28 03:41:24,412 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:41:24,413 INFO L225 Difference]: With dead ends: 35 [2022-04-28 03:41:24,413 INFO L226 Difference]: Without dead ends: 28 [2022-04-28 03:41:24,413 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 03:41:24,414 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 21 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 03:41:24,414 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 26 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 03:41:24,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-28 03:41:24,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-04-28 03:41:24,424 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:41:24,424 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 28 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have 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:24,424 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 28 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have 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:24,425 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 28 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have 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:24,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:24,426 INFO L93 Difference]: Finished difference Result 28 states and 39 transitions. [2022-04-28 03:41:24,426 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 39 transitions. [2022-04-28 03:41:24,426 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:41:24,426 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:41:24,426 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 states have internal predecessors, (35), 3 states have call successors, (3), 3 states 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:41:24,426 INFO L87 Difference]: Start difference. First operand has 28 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 states have internal predecessors, (35), 3 states have call successors, (3), 3 states 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:41:24,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:24,427 INFO L93 Difference]: Finished difference Result 28 states and 39 transitions. [2022-04-28 03:41:24,427 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 39 transitions. [2022-04-28 03:41:24,428 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:41:24,428 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:41:24,428 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:41:24,428 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:41:24,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have 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:24,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 39 transitions. [2022-04-28 03:41:24,429 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 39 transitions. Word has length 17 [2022-04-28 03:41:24,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:41:24,429 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 39 transitions. [2022-04-28 03:41:24,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 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:41:24,429 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 39 transitions. [2022-04-28 03:41:24,492 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:41:24,493 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 39 transitions. [2022-04-28 03:41:24,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 03:41:24,493 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:41:24,493 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:41:24,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-28 03:41:24,493 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:41:24,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:41:24,494 INFO L85 PathProgramCache]: Analyzing trace with hash -615329744, now seen corresponding path program 1 times [2022-04-28 03:41:24,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:41:24,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1881053523] [2022-04-28 03:41:24,494 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 03:41:24,494 INFO L85 PathProgramCache]: Analyzing trace with hash -615329744, now seen corresponding path program 2 times [2022-04-28 03:41:24,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:41:24,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848528908] [2022-04-28 03:41:24,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:41:24,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:41:24,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:24,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:41:24,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:24,525 INFO L290 TraceCheckUtils]: 0: Hoare triple {549#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~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:41:24,525 INFO L290 TraceCheckUtils]: 1: Hoare triple {543#true} assume true; {543#true} is VALID [2022-04-28 03:41:24,525 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {543#true} {543#true} #83#return; {543#true} is VALID [2022-04-28 03:41:24,526 INFO L272 TraceCheckUtils]: 0: Hoare triple {543#true} call ULTIMATE.init(); {549#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:41:24,526 INFO L290 TraceCheckUtils]: 1: Hoare triple {549#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~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:41:24,526 INFO L290 TraceCheckUtils]: 2: Hoare triple {543#true} assume true; {543#true} is VALID [2022-04-28 03:41:24,526 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {543#true} {543#true} #83#return; {543#true} is VALID [2022-04-28 03:41:24,526 INFO L272 TraceCheckUtils]: 4: Hoare triple {543#true} call #t~ret15 := main(); {543#true} is VALID [2022-04-28 03:41:24,527 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; {543#true} is VALID [2022-04-28 03:41:24,527 INFO L290 TraceCheckUtils]: 6: Hoare triple {543#true} assume !(~x~0 % 4294967296 > 0); {548#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:41:24,527 INFO L290 TraceCheckUtils]: 7: Hoare triple {548#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {548#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:41:24,528 INFO L290 TraceCheckUtils]: 8: Hoare triple {548#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {548#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:41:24,528 INFO L290 TraceCheckUtils]: 9: Hoare triple {548#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {548#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:41:24,529 INFO L290 TraceCheckUtils]: 10: Hoare triple {548#(<= 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:41:24,529 INFO L290 TraceCheckUtils]: 11: Hoare triple {544#false} assume !(~x~0 % 4294967296 > 0); {544#false} is VALID [2022-04-28 03:41:24,529 INFO L290 TraceCheckUtils]: 12: Hoare triple {544#false} assume !(~z~0 % 4294967296 > 0); {544#false} is VALID [2022-04-28 03:41:24,529 INFO L272 TraceCheckUtils]: 13: Hoare triple {544#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {544#false} is VALID [2022-04-28 03:41:24,529 INFO L290 TraceCheckUtils]: 14: Hoare triple {544#false} ~cond := #in~cond; {544#false} is VALID [2022-04-28 03:41:24,530 INFO L290 TraceCheckUtils]: 15: Hoare triple {544#false} assume 0 == ~cond; {544#false} is VALID [2022-04-28 03:41:24,530 INFO L290 TraceCheckUtils]: 16: Hoare triple {544#false} assume !false; {544#false} is VALID [2022-04-28 03:41:24,530 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:41:24,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:41:24,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848528908] [2022-04-28 03:41:24,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848528908] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:41:24,530 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:41:24,530 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 03:41:24,531 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:41:24,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1881053523] [2022-04-28 03:41:24,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1881053523] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:41:24,531 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:41:24,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 03:41:24,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706133527] [2022-04-28 03:41:24,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:41:24,531 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 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:41:24,532 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:41:24,532 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 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:41:24,542 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:41:24,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 03:41:24,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:41:24,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 03:41:24,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 03:41:24,543 INFO L87 Difference]: Start difference. First operand 28 states and 39 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 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:41:24,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:24,643 INFO L93 Difference]: Finished difference Result 44 states and 63 transitions. [2022-04-28 03:41:24,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 03:41:24,643 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 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:41:24,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:41:24,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 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:41:24,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-04-28 03:41:24,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 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:41:24,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-04-28 03:41:24,645 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 38 transitions. [2022-04-28 03:41:24,688 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:41:24,689 INFO L225 Difference]: With dead ends: 44 [2022-04-28 03:41:24,689 INFO L226 Difference]: Without dead ends: 34 [2022-04-28 03:41:24,690 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 03:41:24,691 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 23 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 03:41:24,691 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 25 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 03:41:24,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-28 03:41:24,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2022-04-28 03:41:24,707 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:41:24,708 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 32 states, 27 states have (on average 1.4814814814814814) internal successors, (40), 27 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:41:24,708 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 32 states, 27 states have (on average 1.4814814814814814) internal successors, (40), 27 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:41:24,708 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 32 states, 27 states have (on average 1.4814814814814814) internal successors, (40), 27 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:41:24,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:24,710 INFO L93 Difference]: Finished difference Result 34 states and 47 transitions. [2022-04-28 03:41:24,710 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 47 transitions. [2022-04-28 03:41:24,710 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:41:24,710 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:41:24,710 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 27 states have (on average 1.4814814814814814) internal successors, (40), 27 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 34 states. [2022-04-28 03:41:24,710 INFO L87 Difference]: Start difference. First operand has 32 states, 27 states have (on average 1.4814814814814814) internal successors, (40), 27 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 34 states. [2022-04-28 03:41:24,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:24,711 INFO L93 Difference]: Finished difference Result 34 states and 47 transitions. [2022-04-28 03:41:24,712 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 47 transitions. [2022-04-28 03:41:24,712 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:41:24,712 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:41:24,712 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:41:24,712 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:41:24,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.4814814814814814) internal successors, (40), 27 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:41:24,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 44 transitions. [2022-04-28 03:41:24,713 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 44 transitions. Word has length 17 [2022-04-28 03:41:24,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:41:24,713 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 44 transitions. [2022-04-28 03:41:24,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 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:41:24,713 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 44 transitions. [2022-04-28 03:41:24,749 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:41:24,750 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 44 transitions. [2022-04-28 03:41:24,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 03:41:24,750 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:41:24,750 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:41:24,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-28 03:41:24,750 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:41:24,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:41:24,751 INFO L85 PathProgramCache]: Analyzing trace with hash -578961840, now seen corresponding path program 1 times [2022-04-28 03:41:24,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:41:24,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1705342136] [2022-04-28 03:41:24,999 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:25,002 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:41:25,006 INFO L85 PathProgramCache]: Analyzing trace with hash 1386235727, now seen corresponding path program 1 times [2022-04-28 03:41:25,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:41:25,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396280785] [2022-04-28 03:41:25,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:41:25,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:41:25,039 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_1.0))) (+ main_~z~0_7 .cse0 (* (- 4294967296) (div (+ main_~z~0_7 .cse0) 4294967296)))) 0)) [2022-04-28 03:41:25,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:25,058 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_1.1))) (+ main_~z~0_7 .cse0 (* (- 4294967296) (div (+ main_~z~0_7 .cse0) 4294967296)))) 0)) [2022-04-28 03:41:25,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:41:25,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:25,146 INFO L290 TraceCheckUtils]: 0: Hoare triple {785#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {774#true} is VALID [2022-04-28 03:41:25,147 INFO L290 TraceCheckUtils]: 1: Hoare triple {774#true} assume true; {774#true} is VALID [2022-04-28 03:41:25,147 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {774#true} {774#true} #83#return; {774#true} is VALID [2022-04-28 03:41:25,147 INFO L272 TraceCheckUtils]: 0: Hoare triple {774#true} call ULTIMATE.init(); {785#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:41:25,147 INFO L290 TraceCheckUtils]: 1: Hoare triple {785#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {774#true} is VALID [2022-04-28 03:41:25,147 INFO L290 TraceCheckUtils]: 2: Hoare triple {774#true} assume true; {774#true} is VALID [2022-04-28 03:41:25,148 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {774#true} {774#true} #83#return; {774#true} is VALID [2022-04-28 03:41:25,148 INFO L272 TraceCheckUtils]: 4: Hoare triple {774#true} call #t~ret15 := main(); {774#true} is VALID [2022-04-28 03:41:25,148 INFO L290 TraceCheckUtils]: 5: Hoare triple {774#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {779#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-28 03:41:25,149 INFO L290 TraceCheckUtils]: 6: Hoare triple {779#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !(~x~0 % 4294967296 > 0); {780#(and (= main_~n~0 main_~x~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 03:41:25,149 INFO L290 TraceCheckUtils]: 7: Hoare triple {780#(and (= main_~n~0 main_~x~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))))} ~z~0 := ~y~0; {780#(and (= main_~n~0 main_~x~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 03:41:25,150 INFO L290 TraceCheckUtils]: 8: Hoare triple {780#(and (= main_~n~0 main_~x~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))))} [87] L23-2-->L29-1_primed: Formula: (let ((.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_~x~0_15 v_main_~x~0_14)) (.cse4 (= v_main_~z~0_12 v_main_~z~0_11)) (.cse0 (mod v_main_~z~0_12 4294967296))) (or (and (<= .cse0 0) .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4) (and (= v_main_~x~0_14 (+ v_main_~x~0_15 v_main_~z~0_12 (* (- 1) v_main_~z~0_11))) (< v_main_~z~0_11 v_main_~z~0_12) (< 0 .cse0) (forall ((v_it_1 Int)) (or (not (<= (+ v_main_~z~0_11 v_it_1 1) v_main_~z~0_12)) (< 0 (mod (+ v_main_~z~0_12 (* v_it_1 4294967295)) 4294967296)) (not (<= 1 v_it_1))))))) InVars {main_~x~0=v_main_~x~0_15, main_#t~post8=|v_main_#t~post8_4|, main_~z~0=v_main_~z~0_12, main_#t~post7=|v_main_#t~post7_4|} OutVars{main_~x~0=v_main_~x~0_14, main_#t~post8=|v_main_#t~post8_3|, main_~z~0=v_main_~z~0_11, main_#t~post7=|v_main_#t~post7_3|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {781#(< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:41:25,151 INFO L290 TraceCheckUtils]: 9: Hoare triple {781#(< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1))} [86] 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[] {781#(< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:41:25,151 INFO L290 TraceCheckUtils]: 10: Hoare triple {781#(< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1))} assume !(~y~0 % 4294967296 > 0); {781#(< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:41:25,152 INFO L290 TraceCheckUtils]: 11: Hoare triple {781#(< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1))} assume !(~x~0 % 4294967296 > 0); {782#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-28 03:41:25,152 INFO L290 TraceCheckUtils]: 12: Hoare triple {782#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !(~z~0 % 4294967296 > 0); {782#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-28 03:41:25,153 INFO L272 TraceCheckUtils]: 13: Hoare triple {782#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {783#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:41:25,153 INFO L290 TraceCheckUtils]: 14: Hoare triple {783#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {784#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:41:25,154 INFO L290 TraceCheckUtils]: 15: Hoare triple {784#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {775#false} is VALID [2022-04-28 03:41:25,154 INFO L290 TraceCheckUtils]: 16: Hoare triple {775#false} assume !false; {775#false} is VALID [2022-04-28 03:41:25,154 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:41:25,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:41:25,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396280785] [2022-04-28 03:41:25,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396280785] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:41:25,154 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:41:25,154 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 03:41:25,479 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:41:25,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1705342136] [2022-04-28 03:41:25,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1705342136] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:41:25,479 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:41:25,479 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 03:41:25,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566793249] [2022-04-28 03:41:25,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:41:25,480 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 9 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-28 03:41:25,480 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:41:25,480 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 9 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:25,497 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:41:25,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 03:41:25,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:41:25,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 03:41:25,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-04-28 03:41:25,497 INFO L87 Difference]: Start difference. First operand 32 states and 44 transitions. Second operand has 11 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 9 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:25,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:25,859 INFO L93 Difference]: Finished difference Result 47 states and 66 transitions. [2022-04-28 03:41:25,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 03:41:25,859 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 9 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-28 03:41:25,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:41:25,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 9 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:25,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 49 transitions. [2022-04-28 03:41:25,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 9 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:25,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 49 transitions. [2022-04-28 03:41:25,861 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 49 transitions. [2022-04-28 03:41:27,602 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:41:27,603 INFO L225 Difference]: With dead ends: 47 [2022-04-28 03:41:27,603 INFO L226 Difference]: Without dead ends: 41 [2022-04-28 03:41:27,604 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2022-04-28 03:41:27,604 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 45 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 17 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:41:27,604 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 35 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 64 Invalid, 0 Unknown, 17 Unchecked, 0.1s Time] [2022-04-28 03:41:27,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-04-28 03:41:27,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 37. [2022-04-28 03:41:27,634 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:41:27,634 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand has 37 states, 32 states have (on average 1.53125) internal successors, (49), 32 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have 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:27,634 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand has 37 states, 32 states have (on average 1.53125) internal successors, (49), 32 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have 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:27,634 INFO L87 Difference]: Start difference. First operand 41 states. Second operand has 37 states, 32 states have (on average 1.53125) internal successors, (49), 32 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have 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:27,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:27,635 INFO L93 Difference]: Finished difference Result 41 states and 59 transitions. [2022-04-28 03:41:27,635 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 59 transitions. [2022-04-28 03:41:27,636 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:41:27,636 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:41:27,636 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 32 states have (on average 1.53125) internal successors, (49), 32 states have internal predecessors, (49), 3 states have call successors, (3), 3 states 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:41:27,636 INFO L87 Difference]: Start difference. First operand has 37 states, 32 states have (on average 1.53125) internal successors, (49), 32 states have internal predecessors, (49), 3 states have call successors, (3), 3 states 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:41:27,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:27,637 INFO L93 Difference]: Finished difference Result 41 states and 59 transitions. [2022-04-28 03:41:27,637 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 59 transitions. [2022-04-28 03:41:27,637 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:41:27,637 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:41:27,637 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:41:27,637 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:41:27,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.53125) internal successors, (49), 32 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have 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:27,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 53 transitions. [2022-04-28 03:41:27,639 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 53 transitions. Word has length 17 [2022-04-28 03:41:27,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:41:27,639 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 53 transitions. [2022-04-28 03:41:27,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 9 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:27,639 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 53 transitions. [2022-04-28 03:41:29,704 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 52 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 03:41:29,704 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 53 transitions. [2022-04-28 03:41:29,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 03:41:29,705 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:41:29,705 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:41:29,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-28 03:41:29,705 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:41:29,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:41:29,705 INFO L85 PathProgramCache]: Analyzing trace with hash 388404751, now seen corresponding path program 1 times [2022-04-28 03:41:29,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:41:29,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1696789963] [2022-04-28 03:41:29,943 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:29,945 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:41:29,947 INFO L85 PathProgramCache]: Analyzing trace with hash -679545490, now seen corresponding path program 1 times [2022-04-28 03:41:29,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:41:29,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561642041] [2022-04-28 03:41:29,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:41:29,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:41:29,972 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_2.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:41:29,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:29,990 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_2.1))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:41:30,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:41:30,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:30,143 INFO L290 TraceCheckUtils]: 0: Hoare triple {1066#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1055#true} is VALID [2022-04-28 03:41:30,143 INFO L290 TraceCheckUtils]: 1: Hoare triple {1055#true} assume true; {1055#true} is VALID [2022-04-28 03:41:30,143 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1055#true} {1055#true} #83#return; {1055#true} is VALID [2022-04-28 03:41:30,143 INFO L272 TraceCheckUtils]: 0: Hoare triple {1055#true} call ULTIMATE.init(); {1066#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:41:30,143 INFO L290 TraceCheckUtils]: 1: Hoare triple {1066#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1055#true} is VALID [2022-04-28 03:41:30,144 INFO L290 TraceCheckUtils]: 2: Hoare triple {1055#true} assume true; {1055#true} is VALID [2022-04-28 03:41:30,144 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1055#true} {1055#true} #83#return; {1055#true} is VALID [2022-04-28 03:41:30,144 INFO L272 TraceCheckUtils]: 4: Hoare triple {1055#true} call #t~ret15 := main(); {1055#true} is VALID [2022-04-28 03:41:30,145 INFO L290 TraceCheckUtils]: 5: Hoare triple {1055#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1060#(and (= main_~n~0 main_~x~0) (= main_~y~0 0))} is VALID [2022-04-28 03:41:30,153 INFO L290 TraceCheckUtils]: 6: Hoare triple {1060#(and (= main_~n~0 main_~x~0) (= main_~y~0 0))} [89] L16-2-->L16-3_primed: Formula: (let ((.cse1 (mod v_main_~x~0_22 4294967296)) (.cse0 (= |v_main_#t~post6_4| |v_main_#t~post6_3|)) (.cse2 (= v_main_~y~0_11 v_main_~y~0_10)) (.cse3 (= |v_main_#t~post5_4| |v_main_#t~post5_3|)) (.cse4 (= v_main_~x~0_22 v_main_~x~0_21))) (or (and .cse0 (<= .cse1 0) .cse2 .cse3 .cse4) (and (< v_main_~y~0_11 v_main_~y~0_10) (forall ((v_it_2 Int)) (or (not (<= (+ v_main_~y~0_11 v_it_2 1) v_main_~y~0_10)) (not (<= 1 v_it_2)) (< 0 (mod (+ v_main_~x~0_22 (* v_it_2 4294967295)) 4294967296)))) (= v_main_~x~0_21 (+ v_main_~x~0_22 v_main_~y~0_11 (* (- 1) v_main_~y~0_10))) (< 0 .cse1)) (and .cse0 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_11, main_#t~post5=|v_main_#t~post5_4|, main_~x~0=v_main_~x~0_22, main_#t~post6=|v_main_#t~post6_4|} OutVars{main_~y~0=v_main_~y~0_10, main_#t~post5=|v_main_#t~post5_3|, main_~x~0=v_main_~x~0_21, main_#t~post6=|v_main_#t~post6_3|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1061#(or (<= (+ (* (div main_~y~0 4294967296) 4294967296) (* 4294967296 (div main_~x~0 4294967296)) 1) (+ main_~y~0 main_~x~0)) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-28 03:41:30,154 INFO L290 TraceCheckUtils]: 7: Hoare triple {1061#(or (<= (+ (* (div main_~y~0 4294967296) 4294967296) (* 4294967296 (div main_~x~0 4294967296)) 1) (+ main_~y~0 main_~x~0)) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} [88] 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[] {1062#(or (and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1))) (<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0))} is VALID [2022-04-28 03:41:30,154 INFO L290 TraceCheckUtils]: 8: Hoare triple {1062#(or (and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1))) (<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0))} ~z~0 := ~y~0; {1062#(or (and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1))) (<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0))} is VALID [2022-04-28 03:41:30,155 INFO L290 TraceCheckUtils]: 9: Hoare triple {1062#(or (and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1))) (<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0))} assume !(~z~0 % 4294967296 > 0); {1062#(or (and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1))) (<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0))} is VALID [2022-04-28 03:41:30,155 INFO L290 TraceCheckUtils]: 10: Hoare triple {1062#(or (and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1))) (<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0))} assume !(~y~0 % 4294967296 > 0); {1063#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-28 03:41:30,156 INFO L290 TraceCheckUtils]: 11: Hoare triple {1063#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !(~x~0 % 4294967296 > 0); {1063#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-28 03:41:30,156 INFO L290 TraceCheckUtils]: 12: Hoare triple {1063#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !(~z~0 % 4294967296 > 0); {1063#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-28 03:41:30,157 INFO L272 TraceCheckUtils]: 13: Hoare triple {1063#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1064#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:41:30,158 INFO L290 TraceCheckUtils]: 14: Hoare triple {1064#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {1065#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:41:30,158 INFO L290 TraceCheckUtils]: 15: Hoare triple {1065#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1056#false} is VALID [2022-04-28 03:41:30,158 INFO L290 TraceCheckUtils]: 16: Hoare triple {1056#false} assume !false; {1056#false} is VALID [2022-04-28 03:41:30,158 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:41:30,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:41:30,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561642041] [2022-04-28 03:41:30,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561642041] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:41:30,159 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:41:30,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 03:41:30,497 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:41:30,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1696789963] [2022-04-28 03:41:30,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1696789963] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:41:30,498 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:41:30,498 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 03:41:30,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147247047] [2022-04-28 03:41:30,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:41:30,498 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-28 03:41:30,498 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:41:30,498 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:30,516 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:41:30,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 03:41:30,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:41:30,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 03:41:30,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-04-28 03:41:30,517 INFO L87 Difference]: Start difference. First operand 37 states and 53 transitions. Second operand has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:30,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:30,934 INFO L93 Difference]: Finished difference Result 49 states and 66 transitions. [2022-04-28 03:41:30,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 03:41:30,934 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-28 03:41:30,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:41:30,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:30,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 47 transitions. [2022-04-28 03:41:30,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:30,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 47 transitions. [2022-04-28 03:41:30,937 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 47 transitions. [2022-04-28 03:41:31,122 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:41:31,123 INFO L225 Difference]: With dead ends: 49 [2022-04-28 03:41:31,123 INFO L226 Difference]: Without dead ends: 34 [2022-04-28 03:41:31,123 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2022-04-28 03:41:31,124 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 28 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 28 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:41:31,124 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 42 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 74 Invalid, 0 Unknown, 28 Unchecked, 0.1s Time] [2022-04-28 03:41:31,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-28 03:41:31,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2022-04-28 03:41:31,155 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:41:31,155 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 33 states, 28 states have (on average 1.5) internal successors, (42), 28 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:41:31,156 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 33 states, 28 states have (on average 1.5) internal successors, (42), 28 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:41:31,156 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 33 states, 28 states have (on average 1.5) internal successors, (42), 28 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:41:31,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:31,157 INFO L93 Difference]: Finished difference Result 34 states and 48 transitions. [2022-04-28 03:41:31,157 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 48 transitions. [2022-04-28 03:41:31,157 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:41:31,157 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:41:31,157 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 28 states have (on average 1.5) internal successors, (42), 28 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 34 states. [2022-04-28 03:41:31,157 INFO L87 Difference]: Start difference. First operand has 33 states, 28 states have (on average 1.5) internal successors, (42), 28 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 34 states. [2022-04-28 03:41:31,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:31,159 INFO L93 Difference]: Finished difference Result 34 states and 48 transitions. [2022-04-28 03:41:31,159 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 48 transitions. [2022-04-28 03:41:31,159 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:41:31,159 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:41:31,159 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:41:31,159 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:41:31,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.5) internal successors, (42), 28 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:41:31,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 46 transitions. [2022-04-28 03:41:31,160 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 46 transitions. Word has length 17 [2022-04-28 03:41:31,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:41:31,160 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 46 transitions. [2022-04-28 03:41:31,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:31,160 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 46 transitions. [2022-04-28 03:41:31,717 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:41:31,717 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 46 transitions. [2022-04-28 03:41:31,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-28 03:41:31,718 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:41:31,718 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:41:31,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-28 03:41:31,718 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:41:31,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:41:31,718 INFO L85 PathProgramCache]: Analyzing trace with hash 669375650, now seen corresponding path program 1 times [2022-04-28 03:41:31,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:41:31,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1409615120] [2022-04-28 03:41:31,907 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:31,909 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:41:31,911 INFO L85 PathProgramCache]: Analyzing trace with hash 2035020803, now seen corresponding path program 1 times [2022-04-28 03:41:31,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:41:31,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411031189] [2022-04-28 03:41:31,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:41:31,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:41:31,919 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.0))) (+ main_~z~0_7 .cse0 (* (- 4294967296) (div (+ main_~z~0_7 .cse0) 4294967296)))) 0)) [2022-04-28 03:41:31,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:31,929 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.1))) (+ main_~z~0_7 .cse0 (* (- 4294967296) (div (+ main_~z~0_7 .cse0) 4294967296)))) 0)) [2022-04-28 03:41:31,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:41:31,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:31,980 INFO L290 TraceCheckUtils]: 0: Hoare triple {1324#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1315#true} is VALID [2022-04-28 03:41:31,987 INFO L290 TraceCheckUtils]: 1: Hoare triple {1315#true} assume true; {1315#true} is VALID [2022-04-28 03:41:31,987 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1315#true} {1315#true} #83#return; {1315#true} is VALID [2022-04-28 03:41:31,988 INFO L272 TraceCheckUtils]: 0: Hoare triple {1315#true} call ULTIMATE.init(); {1324#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:41:31,988 INFO L290 TraceCheckUtils]: 1: Hoare triple {1324#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1315#true} is VALID [2022-04-28 03:41:31,988 INFO L290 TraceCheckUtils]: 2: Hoare triple {1315#true} assume true; {1315#true} is VALID [2022-04-28 03:41:31,988 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1315#true} {1315#true} #83#return; {1315#true} is VALID [2022-04-28 03:41:31,988 INFO L272 TraceCheckUtils]: 4: Hoare triple {1315#true} call #t~ret15 := main(); {1315#true} is VALID [2022-04-28 03:41:31,989 INFO L290 TraceCheckUtils]: 5: Hoare triple {1315#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1320#(= main_~y~0 0)} is VALID [2022-04-28 03:41:31,990 INFO L290 TraceCheckUtils]: 6: Hoare triple {1320#(= main_~y~0 0)} assume !(~x~0 % 4294967296 > 0); {1321#(and (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} is VALID [2022-04-28 03:41:31,990 INFO L290 TraceCheckUtils]: 7: Hoare triple {1321#(and (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} ~z~0 := ~y~0; {1322#(and (= main_~z~0 0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-28 03:41:31,991 INFO L290 TraceCheckUtils]: 8: Hoare triple {1322#(and (= main_~z~0 0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))))} [91] L23-2-->L29-1_primed: Formula: (let ((.cse0 (mod v_main_~z~0_19 4294967296)) (.cse1 (= v_main_~z~0_19 v_main_~z~0_18)) (.cse2 (= v_main_~x~0_29 v_main_~x~0_28)) (.cse3 (= |v_main_#t~post8_9| |v_main_#t~post8_8|)) (.cse4 (= |v_main_#t~post7_9| |v_main_#t~post7_8|))) (or (and (forall ((v_it_3 Int)) (or (< 0 (mod (+ v_main_~z~0_19 (* v_it_3 4294967295)) 4294967296)) (not (<= 1 v_it_3)) (not (<= (+ v_main_~x~0_29 v_it_3 1) v_main_~x~0_28)))) (= v_main_~z~0_18 (+ v_main_~x~0_29 v_main_~z~0_19 (* (- 1) v_main_~x~0_28))) (< v_main_~x~0_29 v_main_~x~0_28) (< 0 .cse0)) (and .cse1 .cse2 .cse3 (<= .cse0 0) .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~x~0=v_main_~x~0_29, main_#t~post8=|v_main_#t~post8_9|, main_~z~0=v_main_~z~0_19, main_#t~post7=|v_main_#t~post7_9|} OutVars{main_~x~0=v_main_~x~0_28, main_#t~post8=|v_main_#t~post8_8|, main_~z~0=v_main_~z~0_18, main_#t~post7=|v_main_#t~post7_8|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {1323#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:41:31,991 INFO L290 TraceCheckUtils]: 9: Hoare triple {1323#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} [90] 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[] {1323#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:41:31,992 INFO L290 TraceCheckUtils]: 10: Hoare triple {1323#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {1323#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:41:31,992 INFO L290 TraceCheckUtils]: 11: Hoare triple {1323#(<= 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; {1316#false} is VALID [2022-04-28 03:41:31,992 INFO L290 TraceCheckUtils]: 12: Hoare triple {1316#false} assume !(~x~0 % 4294967296 > 0); {1316#false} is VALID [2022-04-28 03:41:31,992 INFO L290 TraceCheckUtils]: 13: Hoare triple {1316#false} assume !(~z~0 % 4294967296 > 0); {1316#false} is VALID [2022-04-28 03:41:31,992 INFO L272 TraceCheckUtils]: 14: Hoare triple {1316#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1316#false} is VALID [2022-04-28 03:41:31,992 INFO L290 TraceCheckUtils]: 15: Hoare triple {1316#false} ~cond := #in~cond; {1316#false} is VALID [2022-04-28 03:41:31,992 INFO L290 TraceCheckUtils]: 16: Hoare triple {1316#false} assume 0 == ~cond; {1316#false} is VALID [2022-04-28 03:41:31,992 INFO L290 TraceCheckUtils]: 17: Hoare triple {1316#false} assume !false; {1316#false} is VALID [2022-04-28 03:41:31,993 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:41:31,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:41:31,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411031189] [2022-04-28 03:41:31,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411031189] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:41:31,993 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:41:31,993 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 03:41:32,027 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:41:32,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1409615120] [2022-04-28 03:41:32,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1409615120] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:41:32,027 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:41:32,027 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 03:41:32,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076417509] [2022-04-28 03:41:32,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:41:32,028 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-28 03:41:32,028 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:41:32,028 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:32,039 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:41:32,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 03:41:32,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:41:32,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 03:41:32,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-04-28 03:41:32,039 INFO L87 Difference]: Start difference. First operand 33 states and 46 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:32,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:32,195 INFO L93 Difference]: Finished difference Result 44 states and 60 transitions. [2022-04-28 03:41:32,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 03:41:32,196 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-28 03:41:32,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:41:32,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:32,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 45 transitions. [2022-04-28 03:41:32,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:32,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 45 transitions. [2022-04-28 03:41:32,198 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 45 transitions. [2022-04-28 03:41:32,229 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:32,230 INFO L225 Difference]: With dead ends: 44 [2022-04-28 03:41:32,230 INFO L226 Difference]: Without dead ends: 27 [2022-04-28 03:41:32,230 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-04-28 03:41:32,231 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 31 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 03:41:32,231 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 33 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 03:41:32,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-28 03:41:32,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2022-04-28 03:41:32,255 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:41:32,256 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 25 states, 20 states have (on average 1.45) internal successors, (29), 20 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:32,256 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 25 states, 20 states have (on average 1.45) internal successors, (29), 20 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:32,256 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 25 states, 20 states have (on average 1.45) internal successors, (29), 20 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:32,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:32,257 INFO L93 Difference]: Finished difference Result 27 states and 36 transitions. [2022-04-28 03:41:32,257 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 36 transitions. [2022-04-28 03:41:32,257 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:41:32,257 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:41:32,257 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 20 states have (on average 1.45) internal successors, (29), 20 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 27 states. [2022-04-28 03:41:32,257 INFO L87 Difference]: Start difference. First operand has 25 states, 20 states have (on average 1.45) internal successors, (29), 20 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 27 states. [2022-04-28 03:41:32,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:32,258 INFO L93 Difference]: Finished difference Result 27 states and 36 transitions. [2022-04-28 03:41:32,258 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 36 transitions. [2022-04-28 03:41:32,258 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:41:32,258 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:41:32,258 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:41:32,258 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:41:32,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.45) internal successors, (29), 20 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:32,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2022-04-28 03:41:32,259 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 33 transitions. Word has length 18 [2022-04-28 03:41:32,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:41:32,259 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 33 transitions. [2022-04-28 03:41:32,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:41:32,259 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 33 transitions. [2022-04-28 03:41:32,438 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:41:32,439 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 33 transitions. [2022-04-28 03:41:32,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-28 03:41:32,439 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:41:32,439 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:41:32,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-28 03:41:32,439 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:41:32,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:41:32,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1130976308, now seen corresponding path program 1 times [2022-04-28 03:41:32,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:41:32,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1603921955] [2022-04-28 03:41:32,591 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:32,593 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:41:32,595 INFO L85 PathProgramCache]: Analyzing trace with hash 7749941, now seen corresponding path program 1 times [2022-04-28 03:41:32,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:41:32,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489509980] [2022-04-28 03:41:32,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:41:32,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:41:32,603 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:41:32,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:32,611 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:41:32,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:41:32,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:32,643 INFO L290 TraceCheckUtils]: 0: Hoare triple {1534#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1527#true} is VALID [2022-04-28 03:41:32,643 INFO L290 TraceCheckUtils]: 1: Hoare triple {1527#true} assume true; {1527#true} is VALID [2022-04-28 03:41:32,643 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1527#true} {1527#true} #83#return; {1527#true} is VALID [2022-04-28 03:41:32,643 INFO L272 TraceCheckUtils]: 0: Hoare triple {1527#true} call ULTIMATE.init(); {1534#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:41:32,643 INFO L290 TraceCheckUtils]: 1: Hoare triple {1534#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1527#true} is VALID [2022-04-28 03:41:32,643 INFO L290 TraceCheckUtils]: 2: Hoare triple {1527#true} assume true; {1527#true} is VALID [2022-04-28 03:41:32,644 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1527#true} {1527#true} #83#return; {1527#true} is VALID [2022-04-28 03:41:32,644 INFO L272 TraceCheckUtils]: 4: Hoare triple {1527#true} call #t~ret15 := main(); {1527#true} is VALID [2022-04-28 03:41:32,644 INFO L290 TraceCheckUtils]: 5: Hoare triple {1527#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1527#true} is VALID [2022-04-28 03:41:32,644 INFO L290 TraceCheckUtils]: 6: Hoare triple {1527#true} [93] L16-2-->L16-3_primed: Formula: (let ((.cse4 (mod v_main_~x~0_37 4294967296)) (.cse0 (= v_main_~x~0_37 v_main_~x~0_36)) (.cse1 (= |v_main_#t~post6_9| |v_main_#t~post6_8|)) (.cse2 (= |v_main_#t~post5_9| |v_main_#t~post5_8|)) (.cse3 (= v_main_~y~0_19 v_main_~y~0_18))) (or (and .cse0 .cse1 .cse2 .cse3) (and (< 0 .cse4) (< v_main_~x~0_36 v_main_~x~0_37) (= (+ v_main_~x~0_37 v_main_~y~0_19 (* (- 1) v_main_~x~0_36)) v_main_~y~0_18) (forall ((v_it_4 Int)) (or (< 0 (mod (+ (* v_it_4 4294967295) v_main_~x~0_37) 4294967296)) (not (<= 1 v_it_4)) (not (<= (+ v_main_~x~0_36 v_it_4 1) v_main_~x~0_37))))) (and (<= .cse4 0) .cse0 .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_19, main_#t~post5=|v_main_#t~post5_9|, main_~x~0=v_main_~x~0_37, main_#t~post6=|v_main_#t~post6_9|} OutVars{main_~y~0=v_main_~y~0_18, main_#t~post5=|v_main_#t~post5_8|, main_~x~0=v_main_~x~0_36, main_#t~post6=|v_main_#t~post6_8|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1527#true} is VALID [2022-04-28 03:41:32,644 INFO L290 TraceCheckUtils]: 7: Hoare triple {1527#true} [92] 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[] {1527#true} is VALID [2022-04-28 03:41:32,644 INFO L290 TraceCheckUtils]: 8: Hoare triple {1527#true} ~z~0 := ~y~0; {1532#(= (+ main_~z~0 (* (- 1) main_~y~0)) 0)} is VALID [2022-04-28 03:41:32,645 INFO L290 TraceCheckUtils]: 9: Hoare triple {1532#(= (+ main_~z~0 (* (- 1) main_~y~0)) 0)} assume !(~z~0 % 4294967296 > 0); {1533#(and (= main_~z~0 main_~y~0) (<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-28 03:41:32,646 INFO L290 TraceCheckUtils]: 10: Hoare triple {1533#(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; {1528#false} is VALID [2022-04-28 03:41:32,646 INFO L290 TraceCheckUtils]: 11: Hoare triple {1528#false} assume !(~y~0 % 4294967296 > 0); {1528#false} is VALID [2022-04-28 03:41:32,646 INFO L290 TraceCheckUtils]: 12: Hoare triple {1528#false} assume !(~x~0 % 4294967296 > 0); {1528#false} is VALID [2022-04-28 03:41:32,646 INFO L290 TraceCheckUtils]: 13: Hoare triple {1528#false} assume !(~z~0 % 4294967296 > 0); {1528#false} is VALID [2022-04-28 03:41:32,646 INFO L272 TraceCheckUtils]: 14: Hoare triple {1528#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1528#false} is VALID [2022-04-28 03:41:32,646 INFO L290 TraceCheckUtils]: 15: Hoare triple {1528#false} ~cond := #in~cond; {1528#false} is VALID [2022-04-28 03:41:32,646 INFO L290 TraceCheckUtils]: 16: Hoare triple {1528#false} assume 0 == ~cond; {1528#false} is VALID [2022-04-28 03:41:32,646 INFO L290 TraceCheckUtils]: 17: Hoare triple {1528#false} assume !false; {1528#false} is VALID [2022-04-28 03:41:32,646 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:41:32,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:41:32,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489509980] [2022-04-28 03:41:32,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489509980] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:41:32,646 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:41:32,647 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 03:41:32,672 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:41:32,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1603921955] [2022-04-28 03:41:32,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1603921955] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:41:32,672 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:41:32,672 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 03:41:32,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493751081] [2022-04-28 03:41:32,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:41:32,672 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:41:32,672 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:41:32,672 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:41:32,685 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:41:32,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 03:41:32,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:41:32,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 03:41:32,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-28 03:41:32,686 INFO L87 Difference]: Start difference. First operand 25 states and 33 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:41:32,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:32,845 INFO L93 Difference]: Finished difference Result 35 states and 46 transitions. [2022-04-28 03:41:32,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 03:41:32,845 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:41:32,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:41:32,845 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:41:32,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 39 transitions. [2022-04-28 03:41:32,846 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:41:32,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 39 transitions. [2022-04-28 03:41:32,847 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 39 transitions. [2022-04-28 03:41:32,877 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:41:32,878 INFO L225 Difference]: With dead ends: 35 [2022-04-28 03:41:32,878 INFO L226 Difference]: Without dead ends: 26 [2022-04-28 03:41:32,878 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 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:41:32,878 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 22 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 03:41:32,878 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 34 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 03:41:32,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-28 03:41:32,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 22. [2022-04-28 03:41:32,899 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:41:32,899 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 22 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have 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:32,900 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 22 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have 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:32,900 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 22 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have 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:32,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:32,901 INFO L93 Difference]: Finished difference Result 26 states and 35 transitions. [2022-04-28 03:41:32,901 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 35 transitions. [2022-04-28 03:41:32,901 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:41:32,901 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:41:32,901 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 3 states have call successors, (3), 3 states 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:41:32,902 INFO L87 Difference]: Start difference. First operand has 22 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 3 states have call successors, (3), 3 states 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:41:32,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:32,903 INFO L93 Difference]: Finished difference Result 26 states and 35 transitions. [2022-04-28 03:41:32,903 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 35 transitions. [2022-04-28 03:41:32,903 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:41:32,903 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:41:32,903 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:41:32,903 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:41:32,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have 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:32,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2022-04-28 03:41:32,905 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 28 transitions. Word has length 18 [2022-04-28 03:41:32,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:41:32,905 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 28 transitions. [2022-04-28 03:41:32,906 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:41:32,906 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 28 transitions. [2022-04-28 03:41:34,959 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 27 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 03:41:34,959 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2022-04-28 03:41:34,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-28 03:41:34,959 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:41:34,959 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:41:34,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-28 03:41:34,959 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:41:34,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:41:34,960 INFO L85 PathProgramCache]: Analyzing trace with hash 629336803, now seen corresponding path program 1 times [2022-04-28 03:41:34,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:41:34,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [478931937] [2022-04-28 03:41:35,147 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:35,149 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:41:35,151 INFO L85 PathProgramCache]: Analyzing trace with hash 465340452, now seen corresponding path program 1 times [2022-04-28 03:41:35,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:41:35,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791468413] [2022-04-28 03:41:35,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:41:35,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:41:35,157 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:41:35,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:35,165 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:41:35,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:41:35,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:35,209 INFO L290 TraceCheckUtils]: 0: Hoare triple {1718#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1711#true} is VALID [2022-04-28 03:41:35,209 INFO L290 TraceCheckUtils]: 1: Hoare triple {1711#true} assume true; {1711#true} is VALID [2022-04-28 03:41:35,209 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1711#true} {1711#true} #83#return; {1711#true} is VALID [2022-04-28 03:41:35,209 INFO L272 TraceCheckUtils]: 0: Hoare triple {1711#true} call ULTIMATE.init(); {1718#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:41:35,209 INFO L290 TraceCheckUtils]: 1: Hoare triple {1718#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1711#true} is VALID [2022-04-28 03:41:35,209 INFO L290 TraceCheckUtils]: 2: Hoare triple {1711#true} assume true; {1711#true} is VALID [2022-04-28 03:41:35,210 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1711#true} {1711#true} #83#return; {1711#true} is VALID [2022-04-28 03:41:35,210 INFO L272 TraceCheckUtils]: 4: Hoare triple {1711#true} call #t~ret15 := main(); {1711#true} is VALID [2022-04-28 03:41:35,210 INFO L290 TraceCheckUtils]: 5: Hoare triple {1711#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1711#true} is VALID [2022-04-28 03:41:35,210 INFO L290 TraceCheckUtils]: 6: Hoare triple {1711#true} [95] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_44 4294967296)) (.cse1 (= |v_main_#t~post6_14| |v_main_#t~post6_13|)) (.cse2 (= v_main_~x~0_44 v_main_~x~0_43)) (.cse3 (= v_main_~y~0_27 v_main_~y~0_26)) (.cse4 (= |v_main_#t~post5_14| |v_main_#t~post5_13|))) (or (and (< v_main_~x~0_43 v_main_~x~0_44) (< 0 .cse0) (forall ((v_it_5 Int)) (or (not (<= (+ v_main_~x~0_43 v_it_5 1) v_main_~x~0_44)) (< 0 (mod (+ v_main_~x~0_44 (* v_it_5 4294967295)) 4294967296)) (not (<= 1 v_it_5)))) (= v_main_~y~0_26 (+ v_main_~x~0_44 v_main_~y~0_27 (* (- 1) v_main_~x~0_43)))) (and .cse1 .cse2 .cse3 .cse4) (and (<= .cse0 0) .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_27, main_#t~post5=|v_main_#t~post5_14|, main_~x~0=v_main_~x~0_44, main_#t~post6=|v_main_#t~post6_14|} OutVars{main_~y~0=v_main_~y~0_26, main_#t~post5=|v_main_#t~post5_13|, main_~x~0=v_main_~x~0_43, main_#t~post6=|v_main_#t~post6_13|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1711#true} is VALID [2022-04-28 03:41:35,210 INFO L290 TraceCheckUtils]: 7: Hoare triple {1711#true} [94] 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[] {1716#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:41:35,211 INFO L290 TraceCheckUtils]: 8: Hoare triple {1716#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {1716#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:41:35,212 INFO L290 TraceCheckUtils]: 9: Hoare triple {1716#(<= 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; {1717#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-28 03:41:35,212 INFO L290 TraceCheckUtils]: 10: Hoare triple {1717#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {1717#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-28 03:41:35,212 INFO L290 TraceCheckUtils]: 11: Hoare triple {1717#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {1717#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-28 03:41:35,213 INFO L290 TraceCheckUtils]: 12: Hoare triple {1717#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {1712#false} is VALID [2022-04-28 03:41:35,213 INFO L290 TraceCheckUtils]: 13: Hoare triple {1712#false} assume !(~z~0 % 4294967296 > 0); {1712#false} is VALID [2022-04-28 03:41:35,213 INFO L272 TraceCheckUtils]: 14: Hoare triple {1712#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1712#false} is VALID [2022-04-28 03:41:35,213 INFO L290 TraceCheckUtils]: 15: Hoare triple {1712#false} ~cond := #in~cond; {1712#false} is VALID [2022-04-28 03:41:35,213 INFO L290 TraceCheckUtils]: 16: Hoare triple {1712#false} assume 0 == ~cond; {1712#false} is VALID [2022-04-28 03:41:35,213 INFO L290 TraceCheckUtils]: 17: Hoare triple {1712#false} assume !false; {1712#false} is VALID [2022-04-28 03:41:35,213 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:41:35,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:41:35,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791468413] [2022-04-28 03:41:35,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791468413] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:41:35,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [761147893] [2022-04-28 03:41:35,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:41:35,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:41:35,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:41:35,215 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:41:35,237 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:41:35,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:35,271 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-28 03:41:35,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:35,280 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:41:35,322 INFO L272 TraceCheckUtils]: 0: Hoare triple {1711#true} call ULTIMATE.init(); {1711#true} is VALID [2022-04-28 03:41:35,322 INFO L290 TraceCheckUtils]: 1: Hoare triple {1711#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1711#true} is VALID [2022-04-28 03:41:35,322 INFO L290 TraceCheckUtils]: 2: Hoare triple {1711#true} assume true; {1711#true} is VALID [2022-04-28 03:41:35,331 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1711#true} {1711#true} #83#return; {1711#true} is VALID [2022-04-28 03:41:35,332 INFO L272 TraceCheckUtils]: 4: Hoare triple {1711#true} call #t~ret15 := main(); {1711#true} is VALID [2022-04-28 03:41:35,332 INFO L290 TraceCheckUtils]: 5: Hoare triple {1711#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1711#true} is VALID [2022-04-28 03:41:35,332 INFO L290 TraceCheckUtils]: 6: Hoare triple {1711#true} [95] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_44 4294967296)) (.cse1 (= |v_main_#t~post6_14| |v_main_#t~post6_13|)) (.cse2 (= v_main_~x~0_44 v_main_~x~0_43)) (.cse3 (= v_main_~y~0_27 v_main_~y~0_26)) (.cse4 (= |v_main_#t~post5_14| |v_main_#t~post5_13|))) (or (and (< v_main_~x~0_43 v_main_~x~0_44) (< 0 .cse0) (forall ((v_it_5 Int)) (or (not (<= (+ v_main_~x~0_43 v_it_5 1) v_main_~x~0_44)) (< 0 (mod (+ v_main_~x~0_44 (* v_it_5 4294967295)) 4294967296)) (not (<= 1 v_it_5)))) (= v_main_~y~0_26 (+ v_main_~x~0_44 v_main_~y~0_27 (* (- 1) v_main_~x~0_43)))) (and .cse1 .cse2 .cse3 .cse4) (and (<= .cse0 0) .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_27, main_#t~post5=|v_main_#t~post5_14|, main_~x~0=v_main_~x~0_44, main_#t~post6=|v_main_#t~post6_14|} OutVars{main_~y~0=v_main_~y~0_26, main_#t~post5=|v_main_#t~post5_13|, main_~x~0=v_main_~x~0_43, main_#t~post6=|v_main_#t~post6_13|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1711#true} is VALID [2022-04-28 03:41:35,332 INFO L290 TraceCheckUtils]: 7: Hoare triple {1711#true} [94] 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[] {1711#true} is VALID [2022-04-28 03:41:35,333 INFO L290 TraceCheckUtils]: 8: Hoare triple {1711#true} ~z~0 := ~y~0; {1746#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 03:41:35,333 INFO L290 TraceCheckUtils]: 9: Hoare triple {1746#(= 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; {1750#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:41:35,333 INFO L290 TraceCheckUtils]: 10: Hoare triple {1750#(< 0 (mod main_~y~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {1750#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:41:35,334 INFO L290 TraceCheckUtils]: 11: Hoare triple {1750#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {1712#false} is VALID [2022-04-28 03:41:35,334 INFO L290 TraceCheckUtils]: 12: Hoare triple {1712#false} assume !(~x~0 % 4294967296 > 0); {1712#false} is VALID [2022-04-28 03:41:35,334 INFO L290 TraceCheckUtils]: 13: Hoare triple {1712#false} assume !(~z~0 % 4294967296 > 0); {1712#false} is VALID [2022-04-28 03:41:35,334 INFO L272 TraceCheckUtils]: 14: Hoare triple {1712#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1712#false} is VALID [2022-04-28 03:41:35,334 INFO L290 TraceCheckUtils]: 15: Hoare triple {1712#false} ~cond := #in~cond; {1712#false} is VALID [2022-04-28 03:41:35,334 INFO L290 TraceCheckUtils]: 16: Hoare triple {1712#false} assume 0 == ~cond; {1712#false} is VALID [2022-04-28 03:41:35,334 INFO L290 TraceCheckUtils]: 17: Hoare triple {1712#false} assume !false; {1712#false} is VALID [2022-04-28 03:41:35,334 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:41:35,335 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:41:35,387 INFO L290 TraceCheckUtils]: 17: Hoare triple {1712#false} assume !false; {1712#false} is VALID [2022-04-28 03:41:35,387 INFO L290 TraceCheckUtils]: 16: Hoare triple {1712#false} assume 0 == ~cond; {1712#false} is VALID [2022-04-28 03:41:35,387 INFO L290 TraceCheckUtils]: 15: Hoare triple {1712#false} ~cond := #in~cond; {1712#false} is VALID [2022-04-28 03:41:35,387 INFO L272 TraceCheckUtils]: 14: Hoare triple {1712#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1712#false} is VALID [2022-04-28 03:41:35,387 INFO L290 TraceCheckUtils]: 13: Hoare triple {1712#false} assume !(~z~0 % 4294967296 > 0); {1712#false} is VALID [2022-04-28 03:41:35,388 INFO L290 TraceCheckUtils]: 12: Hoare triple {1712#false} assume !(~x~0 % 4294967296 > 0); {1712#false} is VALID [2022-04-28 03:41:35,389 INFO L290 TraceCheckUtils]: 11: Hoare triple {1750#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {1712#false} is VALID [2022-04-28 03:41:35,389 INFO L290 TraceCheckUtils]: 10: Hoare triple {1750#(< 0 (mod main_~y~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {1750#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:41:35,389 INFO L290 TraceCheckUtils]: 9: Hoare triple {1799#(or (not (< 0 (mod main_~z~0 4294967296))) (< 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; {1750#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:41:35,390 INFO L290 TraceCheckUtils]: 8: Hoare triple {1711#true} ~z~0 := ~y~0; {1799#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 03:41:35,390 INFO L290 TraceCheckUtils]: 7: Hoare triple {1711#true} [94] 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[] {1711#true} is VALID [2022-04-28 03:41:35,390 INFO L290 TraceCheckUtils]: 6: Hoare triple {1711#true} [95] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_44 4294967296)) (.cse1 (= |v_main_#t~post6_14| |v_main_#t~post6_13|)) (.cse2 (= v_main_~x~0_44 v_main_~x~0_43)) (.cse3 (= v_main_~y~0_27 v_main_~y~0_26)) (.cse4 (= |v_main_#t~post5_14| |v_main_#t~post5_13|))) (or (and (< v_main_~x~0_43 v_main_~x~0_44) (< 0 .cse0) (forall ((v_it_5 Int)) (or (not (<= (+ v_main_~x~0_43 v_it_5 1) v_main_~x~0_44)) (< 0 (mod (+ v_main_~x~0_44 (* v_it_5 4294967295)) 4294967296)) (not (<= 1 v_it_5)))) (= v_main_~y~0_26 (+ v_main_~x~0_44 v_main_~y~0_27 (* (- 1) v_main_~x~0_43)))) (and .cse1 .cse2 .cse3 .cse4) (and (<= .cse0 0) .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_27, main_#t~post5=|v_main_#t~post5_14|, main_~x~0=v_main_~x~0_44, main_#t~post6=|v_main_#t~post6_14|} OutVars{main_~y~0=v_main_~y~0_26, main_#t~post5=|v_main_#t~post5_13|, main_~x~0=v_main_~x~0_43, main_#t~post6=|v_main_#t~post6_13|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1711#true} is VALID [2022-04-28 03:41:35,390 INFO L290 TraceCheckUtils]: 5: Hoare triple {1711#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1711#true} is VALID [2022-04-28 03:41:35,390 INFO L272 TraceCheckUtils]: 4: Hoare triple {1711#true} call #t~ret15 := main(); {1711#true} is VALID [2022-04-28 03:41:35,390 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1711#true} {1711#true} #83#return; {1711#true} is VALID [2022-04-28 03:41:35,390 INFO L290 TraceCheckUtils]: 2: Hoare triple {1711#true} assume true; {1711#true} is VALID [2022-04-28 03:41:35,390 INFO L290 TraceCheckUtils]: 1: Hoare triple {1711#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1711#true} is VALID [2022-04-28 03:41:35,390 INFO L272 TraceCheckUtils]: 0: Hoare triple {1711#true} call ULTIMATE.init(); {1711#true} is VALID [2022-04-28 03:41:35,391 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:41:35,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [761147893] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-28 03:41:35,391 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-28 03:41:35,391 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 8 [2022-04-28 03:41:35,438 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:41:35,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [478931937] [2022-04-28 03:41:35,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [478931937] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:41:35,439 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:41:35,439 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 03:41:35,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704247588] [2022-04-28 03:41:35,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:41:35,439 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have 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:41:35,439 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:41:35,439 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have 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:35,448 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:41:35,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 03:41:35,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:41:35,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 03:41:35,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-04-28 03:41:35,449 INFO L87 Difference]: Start difference. First operand 22 states and 28 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have 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:35,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:35,557 INFO L93 Difference]: Finished difference Result 30 states and 37 transitions. [2022-04-28 03:41:35,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 03:41:35,558 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have 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:41:35,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:41:35,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have 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:35,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 37 transitions. [2022-04-28 03:41:35,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have 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:35,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 37 transitions. [2022-04-28 03:41:35,559 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 37 transitions. [2022-04-28 03:41:35,586 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:41:35,586 INFO L225 Difference]: With dead ends: 30 [2022-04-28 03:41:35,586 INFO L226 Difference]: Without dead ends: 23 [2022-04-28 03:41:35,587 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-04-28 03:41:35,587 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 5 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 03:41:35,587 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 48 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 03:41:35,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-28 03:41:35,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 20. [2022-04-28 03:41:35,605 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:41:35,606 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 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:41:35,606 INFO L74 IsIncluded]: Start isIncluded. First operand 23 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:41:35,606 INFO L87 Difference]: Start difference. First operand 23 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:41:35,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:35,607 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2022-04-28 03:41:35,607 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2022-04-28 03:41:35,607 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:41:35,607 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:41:35,607 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 23 states. [2022-04-28 03:41:35,607 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 23 states. [2022-04-28 03:41:35,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:35,608 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2022-04-28 03:41:35,608 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2022-04-28 03:41:35,608 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:41:35,608 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:41:35,608 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:41:35,608 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:41:35,613 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:41:35,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2022-04-28 03:41:35,614 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 18 [2022-04-28 03:41:35,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:41:35,614 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2022-04-28 03:41:35,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have 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:35,615 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 24 transitions. [2022-04-28 03:41:35,673 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:41:35,674 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2022-04-28 03:41:35,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-28 03:41:35,674 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:41:35,674 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:41:35,693 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-28 03:41:35,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:41:35,875 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:41:35,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:41:35,875 INFO L85 PathProgramCache]: Analyzing trace with hash 9935328, now seen corresponding path program 1 times [2022-04-28 03:41:35,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:41:35,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1173674063] [2022-04-28 03:41:36,126 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:36,127 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:41:36,129 INFO L85 PathProgramCache]: Analyzing trace with hash -1107624833, now seen corresponding path program 1 times [2022-04-28 03:41:36,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:41:36,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619718864] [2022-04-28 03:41:36,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:41:36,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:41:36,136 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:41:36,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:36,145 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.1))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:41:36,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:41:36,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:36,180 INFO L290 TraceCheckUtils]: 0: Hoare triple {1985#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1978#true} is VALID [2022-04-28 03:41:36,180 INFO L290 TraceCheckUtils]: 1: Hoare triple {1978#true} assume true; {1978#true} is VALID [2022-04-28 03:41:36,180 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1978#true} {1978#true} #83#return; {1978#true} is VALID [2022-04-28 03:41:36,181 INFO L272 TraceCheckUtils]: 0: Hoare triple {1978#true} call ULTIMATE.init(); {1985#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:41:36,181 INFO L290 TraceCheckUtils]: 1: Hoare triple {1985#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1978#true} is VALID [2022-04-28 03:41:36,181 INFO L290 TraceCheckUtils]: 2: Hoare triple {1978#true} assume true; {1978#true} is VALID [2022-04-28 03:41:36,181 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1978#true} {1978#true} #83#return; {1978#true} is VALID [2022-04-28 03:41:36,181 INFO L272 TraceCheckUtils]: 4: Hoare triple {1978#true} call #t~ret15 := main(); {1978#true} is VALID [2022-04-28 03:41:36,181 INFO L290 TraceCheckUtils]: 5: Hoare triple {1978#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1978#true} is VALID [2022-04-28 03:41:36,182 INFO L290 TraceCheckUtils]: 6: Hoare triple {1978#true} [97] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_52 v_main_~x~0_51)) (.cse1 (= v_main_~y~0_34 v_main_~y~0_33)) (.cse3 (= |v_main_#t~post6_19| |v_main_#t~post6_18|)) (.cse4 (= |v_main_#t~post5_19| |v_main_#t~post5_18|)) (.cse2 (mod v_main_~x~0_52 4294967296))) (or (and .cse0 .cse1 (<= .cse2 0) .cse3 .cse4) (and .cse0 .cse1 .cse3 .cse4) (and (< 0 .cse2) (< v_main_~y~0_34 v_main_~y~0_33) (forall ((v_it_6 Int)) (or (< 0 (mod (+ v_main_~x~0_52 (* v_it_6 4294967295)) 4294967296)) (not (<= (+ v_main_~y~0_34 v_it_6 1) v_main_~y~0_33)) (not (<= 1 v_it_6)))) (= v_main_~x~0_51 (+ v_main_~x~0_52 v_main_~y~0_34 (* (- 1) v_main_~y~0_33)))))) InVars {main_~y~0=v_main_~y~0_34, main_#t~post5=|v_main_#t~post5_19|, main_~x~0=v_main_~x~0_52, main_#t~post6=|v_main_#t~post6_19|} OutVars{main_~y~0=v_main_~y~0_33, main_#t~post5=|v_main_#t~post5_18|, main_~x~0=v_main_~x~0_51, main_#t~post6=|v_main_#t~post6_18|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1978#true} is VALID [2022-04-28 03:41:36,182 INFO L290 TraceCheckUtils]: 7: Hoare triple {1978#true} [96] 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[] {1983#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:41:36,182 INFO L290 TraceCheckUtils]: 8: Hoare triple {1983#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {1983#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:41:36,183 INFO L290 TraceCheckUtils]: 9: Hoare triple {1983#(<= 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; {1984#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-28 03:41:36,184 INFO L290 TraceCheckUtils]: 10: Hoare triple {1984#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {1984#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-28 03:41:36,184 INFO L290 TraceCheckUtils]: 11: Hoare triple {1984#(<= (+ (* 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; {1984#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-28 03:41:36,184 INFO L290 TraceCheckUtils]: 12: Hoare triple {1984#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {1984#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-28 03:41:36,185 INFO L290 TraceCheckUtils]: 13: Hoare triple {1984#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {1979#false} is VALID [2022-04-28 03:41:36,185 INFO L290 TraceCheckUtils]: 14: Hoare triple {1979#false} assume !(~z~0 % 4294967296 > 0); {1979#false} is VALID [2022-04-28 03:41:36,185 INFO L272 TraceCheckUtils]: 15: Hoare triple {1979#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1979#false} is VALID [2022-04-28 03:41:36,185 INFO L290 TraceCheckUtils]: 16: Hoare triple {1979#false} ~cond := #in~cond; {1979#false} is VALID [2022-04-28 03:41:36,185 INFO L290 TraceCheckUtils]: 17: Hoare triple {1979#false} assume 0 == ~cond; {1979#false} is VALID [2022-04-28 03:41:36,185 INFO L290 TraceCheckUtils]: 18: Hoare triple {1979#false} assume !false; {1979#false} is VALID [2022-04-28 03:41:36,185 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:41:36,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:41:36,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619718864] [2022-04-28 03:41:36,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619718864] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:41:36,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1852685316] [2022-04-28 03:41:36,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:41:36,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:41:36,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:41:36,187 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:41:36,188 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:41:36,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:36,217 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-28 03:41:36,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:36,222 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:41:36,275 INFO L272 TraceCheckUtils]: 0: Hoare triple {1978#true} call ULTIMATE.init(); {1978#true} is VALID [2022-04-28 03:41:36,276 INFO L290 TraceCheckUtils]: 1: Hoare triple {1978#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1978#true} is VALID [2022-04-28 03:41:36,276 INFO L290 TraceCheckUtils]: 2: Hoare triple {1978#true} assume true; {1978#true} is VALID [2022-04-28 03:41:36,276 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1978#true} {1978#true} #83#return; {1978#true} is VALID [2022-04-28 03:41:36,276 INFO L272 TraceCheckUtils]: 4: Hoare triple {1978#true} call #t~ret15 := main(); {1978#true} is VALID [2022-04-28 03:41:36,276 INFO L290 TraceCheckUtils]: 5: Hoare triple {1978#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1978#true} is VALID [2022-04-28 03:41:36,277 INFO L290 TraceCheckUtils]: 6: Hoare triple {1978#true} [97] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_52 v_main_~x~0_51)) (.cse1 (= v_main_~y~0_34 v_main_~y~0_33)) (.cse3 (= |v_main_#t~post6_19| |v_main_#t~post6_18|)) (.cse4 (= |v_main_#t~post5_19| |v_main_#t~post5_18|)) (.cse2 (mod v_main_~x~0_52 4294967296))) (or (and .cse0 .cse1 (<= .cse2 0) .cse3 .cse4) (and .cse0 .cse1 .cse3 .cse4) (and (< 0 .cse2) (< v_main_~y~0_34 v_main_~y~0_33) (forall ((v_it_6 Int)) (or (< 0 (mod (+ v_main_~x~0_52 (* v_it_6 4294967295)) 4294967296)) (not (<= (+ v_main_~y~0_34 v_it_6 1) v_main_~y~0_33)) (not (<= 1 v_it_6)))) (= v_main_~x~0_51 (+ v_main_~x~0_52 v_main_~y~0_34 (* (- 1) v_main_~y~0_33)))))) InVars {main_~y~0=v_main_~y~0_34, main_#t~post5=|v_main_#t~post5_19|, main_~x~0=v_main_~x~0_52, main_#t~post6=|v_main_#t~post6_19|} OutVars{main_~y~0=v_main_~y~0_33, main_#t~post5=|v_main_#t~post5_18|, main_~x~0=v_main_~x~0_51, main_#t~post6=|v_main_#t~post6_18|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1978#true} is VALID [2022-04-28 03:41:36,278 INFO L290 TraceCheckUtils]: 7: Hoare triple {1978#true} [96] 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[] {1978#true} is VALID [2022-04-28 03:41:36,278 INFO L290 TraceCheckUtils]: 8: Hoare triple {1978#true} ~z~0 := ~y~0; {1978#true} is VALID [2022-04-28 03:41:36,279 INFO L290 TraceCheckUtils]: 9: Hoare triple {1978#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2016#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-28 03:41:36,280 INFO L290 TraceCheckUtils]: 10: Hoare triple {2016#(< 0 (mod (+ main_~z~0 1) 4294967296))} assume !(~z~0 % 4294967296 > 0); {2016#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-28 03:41:36,282 INFO L290 TraceCheckUtils]: 11: Hoare triple {2016#(< 0 (mod (+ main_~z~0 1) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2023#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 03:41:36,282 INFO L290 TraceCheckUtils]: 12: Hoare triple {2023#(< 0 (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {2023#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 03:41:36,282 INFO L290 TraceCheckUtils]: 13: Hoare triple {2023#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {2023#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 03:41:36,283 INFO L290 TraceCheckUtils]: 14: Hoare triple {2023#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {1979#false} is VALID [2022-04-28 03:41:36,283 INFO L272 TraceCheckUtils]: 15: Hoare triple {1979#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1979#false} is VALID [2022-04-28 03:41:36,283 INFO L290 TraceCheckUtils]: 16: Hoare triple {1979#false} ~cond := #in~cond; {1979#false} is VALID [2022-04-28 03:41:36,283 INFO L290 TraceCheckUtils]: 17: Hoare triple {1979#false} assume 0 == ~cond; {1979#false} is VALID [2022-04-28 03:41:36,283 INFO L290 TraceCheckUtils]: 18: Hoare triple {1979#false} assume !false; {1979#false} is VALID [2022-04-28 03:41:36,283 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:41:36,283 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:41:36,333 INFO L290 TraceCheckUtils]: 18: Hoare triple {1979#false} assume !false; {1979#false} is VALID [2022-04-28 03:41:36,333 INFO L290 TraceCheckUtils]: 17: Hoare triple {1979#false} assume 0 == ~cond; {1979#false} is VALID [2022-04-28 03:41:36,333 INFO L290 TraceCheckUtils]: 16: Hoare triple {1979#false} ~cond := #in~cond; {1979#false} is VALID [2022-04-28 03:41:36,333 INFO L272 TraceCheckUtils]: 15: Hoare triple {1979#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1979#false} is VALID [2022-04-28 03:41:36,333 INFO L290 TraceCheckUtils]: 14: Hoare triple {2023#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {1979#false} is VALID [2022-04-28 03:41:36,334 INFO L290 TraceCheckUtils]: 13: Hoare triple {2023#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {2023#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 03:41:36,334 INFO L290 TraceCheckUtils]: 12: Hoare triple {2023#(< 0 (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {2023#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 03:41:36,335 INFO L290 TraceCheckUtils]: 11: Hoare triple {2016#(< 0 (mod (+ main_~z~0 1) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2023#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 03:41:36,335 INFO L290 TraceCheckUtils]: 10: Hoare triple {2016#(< 0 (mod (+ main_~z~0 1) 4294967296))} assume !(~z~0 % 4294967296 > 0); {2016#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-28 03:41:36,336 INFO L290 TraceCheckUtils]: 9: Hoare triple {1978#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2016#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-28 03:41:36,336 INFO L290 TraceCheckUtils]: 8: Hoare triple {1978#true} ~z~0 := ~y~0; {1978#true} is VALID [2022-04-28 03:41:36,336 INFO L290 TraceCheckUtils]: 7: Hoare triple {1978#true} [96] 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[] {1978#true} is VALID [2022-04-28 03:41:36,336 INFO L290 TraceCheckUtils]: 6: Hoare triple {1978#true} [97] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_52 v_main_~x~0_51)) (.cse1 (= v_main_~y~0_34 v_main_~y~0_33)) (.cse3 (= |v_main_#t~post6_19| |v_main_#t~post6_18|)) (.cse4 (= |v_main_#t~post5_19| |v_main_#t~post5_18|)) (.cse2 (mod v_main_~x~0_52 4294967296))) (or (and .cse0 .cse1 (<= .cse2 0) .cse3 .cse4) (and .cse0 .cse1 .cse3 .cse4) (and (< 0 .cse2) (< v_main_~y~0_34 v_main_~y~0_33) (forall ((v_it_6 Int)) (or (< 0 (mod (+ v_main_~x~0_52 (* v_it_6 4294967295)) 4294967296)) (not (<= (+ v_main_~y~0_34 v_it_6 1) v_main_~y~0_33)) (not (<= 1 v_it_6)))) (= v_main_~x~0_51 (+ v_main_~x~0_52 v_main_~y~0_34 (* (- 1) v_main_~y~0_33)))))) InVars {main_~y~0=v_main_~y~0_34, main_#t~post5=|v_main_#t~post5_19|, main_~x~0=v_main_~x~0_52, main_#t~post6=|v_main_#t~post6_19|} OutVars{main_~y~0=v_main_~y~0_33, main_#t~post5=|v_main_#t~post5_18|, main_~x~0=v_main_~x~0_51, main_#t~post6=|v_main_#t~post6_18|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1978#true} is VALID [2022-04-28 03:41:36,336 INFO L290 TraceCheckUtils]: 5: Hoare triple {1978#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1978#true} is VALID [2022-04-28 03:41:36,336 INFO L272 TraceCheckUtils]: 4: Hoare triple {1978#true} call #t~ret15 := main(); {1978#true} is VALID [2022-04-28 03:41:36,336 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1978#true} {1978#true} #83#return; {1978#true} is VALID [2022-04-28 03:41:36,336 INFO L290 TraceCheckUtils]: 2: Hoare triple {1978#true} assume true; {1978#true} is VALID [2022-04-28 03:41:36,336 INFO L290 TraceCheckUtils]: 1: Hoare triple {1978#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {1978#true} is VALID [2022-04-28 03:41:36,336 INFO L272 TraceCheckUtils]: 0: Hoare triple {1978#true} call ULTIMATE.init(); {1978#true} is VALID [2022-04-28 03:41:36,337 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:41:36,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1852685316] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:41:36,337 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:41:36,337 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 7 [2022-04-28 03:41:36,391 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:41:36,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1173674063] [2022-04-28 03:41:36,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1173674063] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:41:36,391 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:41:36,391 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 03:41:36,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210773781] [2022-04-28 03:41:36,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:41:36,391 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have 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:41:36,391 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:41:36,392 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have 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:36,404 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:41:36,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 03:41:36,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:41:36,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 03:41:36,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-04-28 03:41:36,405 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have 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:36,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:36,614 INFO L93 Difference]: Finished difference Result 41 states and 55 transitions. [2022-04-28 03:41:36,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 03:41:36,614 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have 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:41:36,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:41:36,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have 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:36,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 52 transitions. [2022-04-28 03:41:36,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have 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:36,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 52 transitions. [2022-04-28 03:41:36,616 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 52 transitions. [2022-04-28 03:41:36,658 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:41:36,659 INFO L225 Difference]: With dead ends: 41 [2022-04-28 03:41:36,659 INFO L226 Difference]: Without dead ends: 35 [2022-04-28 03:41:36,659 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-04-28 03:41:36,659 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 36 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:41:36,660 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 30 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 03:41:36,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-28 03:41:36,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 25. [2022-04-28 03:41:36,683 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:41:36,683 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 25 states, 20 states have (on average 1.4) internal successors, (28), 20 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have 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:36,683 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 25 states, 20 states have (on average 1.4) internal successors, (28), 20 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have 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:36,684 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 25 states, 20 states have (on average 1.4) internal successors, (28), 20 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have 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:36,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:36,684 INFO L93 Difference]: Finished difference Result 35 states and 47 transitions. [2022-04-28 03:41:36,685 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 47 transitions. [2022-04-28 03:41:36,685 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:41:36,685 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:41:36,685 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 20 states have (on average 1.4) internal successors, (28), 20 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 35 states. [2022-04-28 03:41:36,685 INFO L87 Difference]: Start difference. First operand has 25 states, 20 states have (on average 1.4) internal successors, (28), 20 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 35 states. [2022-04-28 03:41:36,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:36,686 INFO L93 Difference]: Finished difference Result 35 states and 47 transitions. [2022-04-28 03:41:36,686 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 47 transitions. [2022-04-28 03:41:36,686 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:41:36,686 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:41:36,686 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:41:36,686 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:41:36,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.4) internal successors, (28), 20 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have 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:36,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2022-04-28 03:41:36,687 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 19 [2022-04-28 03:41:36,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:41:36,687 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 32 transitions. [2022-04-28 03:41:36,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have 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:36,687 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 32 transitions. [2022-04-28 03:41:36,781 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:41:36,782 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2022-04-28 03:41:36,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-28 03:41:36,782 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:41:36,782 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:41:36,798 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-28 03:41:36,992 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,SelfDestructingSolverStorable9 [2022-04-28 03:41:36,992 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:41:36,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:41:36,992 INFO L85 PathProgramCache]: Analyzing trace with hash 1745318674, now seen corresponding path program 1 times [2022-04-28 03:41:36,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:41:36,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [502366046] [2022-04-28 03:41:37,181 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:37,182 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:41:37,185 INFO L85 PathProgramCache]: Analyzing trace with hash -137231213, now seen corresponding path program 1 times [2022-04-28 03:41:37,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:41:37,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889663236] [2022-04-28 03:41:37,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:41:37,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:41:37,201 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:41:37,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:37,208 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:41:37,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:41:37,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:37,239 INFO L290 TraceCheckUtils]: 0: Hoare triple {2319#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2312#true} is VALID [2022-04-28 03:41:37,239 INFO L290 TraceCheckUtils]: 1: Hoare triple {2312#true} assume true; {2312#true} is VALID [2022-04-28 03:41:37,239 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2312#true} {2312#true} #83#return; {2312#true} is VALID [2022-04-28 03:41:37,239 INFO L272 TraceCheckUtils]: 0: Hoare triple {2312#true} call ULTIMATE.init(); {2319#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:41:37,239 INFO L290 TraceCheckUtils]: 1: Hoare triple {2319#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2312#true} is VALID [2022-04-28 03:41:37,239 INFO L290 TraceCheckUtils]: 2: Hoare triple {2312#true} assume true; {2312#true} is VALID [2022-04-28 03:41:37,239 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2312#true} {2312#true} #83#return; {2312#true} is VALID [2022-04-28 03:41:37,240 INFO L272 TraceCheckUtils]: 4: Hoare triple {2312#true} call #t~ret15 := main(); {2312#true} is VALID [2022-04-28 03:41:37,240 INFO L290 TraceCheckUtils]: 5: Hoare triple {2312#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2312#true} is VALID [2022-04-28 03:41:37,240 INFO L290 TraceCheckUtils]: 6: Hoare triple {2312#true} [99] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_42 v_main_~y~0_41)) (.cse1 (= |v_main_#t~post5_24| |v_main_#t~post5_23|)) (.cse2 (= v_main_~x~0_60 v_main_~x~0_59)) (.cse4 (= |v_main_#t~post6_24| |v_main_#t~post6_23|)) (.cse3 (mod v_main_~x~0_60 4294967296))) (or (and .cse0 .cse1 .cse2 (<= .cse3 0) .cse4) (and .cse0 .cse1 .cse2 .cse4) (and (forall ((v_it_7 Int)) (or (not (<= (+ v_main_~x~0_59 v_it_7 1) v_main_~x~0_60)) (< 0 (mod (+ v_main_~x~0_60 (* v_it_7 4294967295)) 4294967296)) (not (<= 1 v_it_7)))) (< v_main_~x~0_59 v_main_~x~0_60) (< 0 .cse3) (= v_main_~y~0_41 (+ v_main_~x~0_60 v_main_~y~0_42 (* (- 1) v_main_~x~0_59)))))) InVars {main_~y~0=v_main_~y~0_42, main_#t~post5=|v_main_#t~post5_24|, main_~x~0=v_main_~x~0_60, main_#t~post6=|v_main_#t~post6_24|} OutVars{main_~y~0=v_main_~y~0_41, main_#t~post5=|v_main_#t~post5_23|, main_~x~0=v_main_~x~0_59, main_#t~post6=|v_main_#t~post6_23|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2312#true} is VALID [2022-04-28 03:41:37,240 INFO L290 TraceCheckUtils]: 7: Hoare triple {2312#true} [98] 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[] {2312#true} is VALID [2022-04-28 03:41:37,240 INFO L290 TraceCheckUtils]: 8: Hoare triple {2312#true} ~z~0 := ~y~0; {2312#true} is VALID [2022-04-28 03:41:37,241 INFO L290 TraceCheckUtils]: 9: Hoare triple {2312#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2317#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-28 03:41:37,241 INFO L290 TraceCheckUtils]: 10: Hoare triple {2317#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {2317#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-28 03:41:37,242 INFO L290 TraceCheckUtils]: 11: Hoare triple {2317#(<= main_~z~0 (+ 4294967294 (* (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; {2318#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-28 03:41:37,242 INFO L290 TraceCheckUtils]: 12: Hoare triple {2318#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !(~y~0 % 4294967296 > 0); {2318#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-28 03:41:37,242 INFO L290 TraceCheckUtils]: 13: Hoare triple {2318#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~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; {2318#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-28 03:41:37,243 INFO L290 TraceCheckUtils]: 14: Hoare triple {2318#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !(~x~0 % 4294967296 > 0); {2318#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-28 03:41:37,243 INFO L290 TraceCheckUtils]: 15: Hoare triple {2318#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !(~z~0 % 4294967296 > 0); {2313#false} is VALID [2022-04-28 03:41:37,243 INFO L272 TraceCheckUtils]: 16: Hoare triple {2313#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2313#false} is VALID [2022-04-28 03:41:37,243 INFO L290 TraceCheckUtils]: 17: Hoare triple {2313#false} ~cond := #in~cond; {2313#false} is VALID [2022-04-28 03:41:37,243 INFO L290 TraceCheckUtils]: 18: Hoare triple {2313#false} assume 0 == ~cond; {2313#false} is VALID [2022-04-28 03:41:37,243 INFO L290 TraceCheckUtils]: 19: Hoare triple {2313#false} assume !false; {2313#false} is VALID [2022-04-28 03:41:37,244 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:41:37,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:41:37,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889663236] [2022-04-28 03:41:37,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889663236] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:41:37,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1416437308] [2022-04-28 03:41:37,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:41:37,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:41:37,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:41:37,247 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:41:37,248 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:41:37,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:37,276 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-28 03:41:37,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:37,282 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:41:37,446 INFO L272 TraceCheckUtils]: 0: Hoare triple {2312#true} call ULTIMATE.init(); {2312#true} is VALID [2022-04-28 03:41:37,446 INFO L290 TraceCheckUtils]: 1: Hoare triple {2312#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2312#true} is VALID [2022-04-28 03:41:37,446 INFO L290 TraceCheckUtils]: 2: Hoare triple {2312#true} assume true; {2312#true} is VALID [2022-04-28 03:41:37,446 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2312#true} {2312#true} #83#return; {2312#true} is VALID [2022-04-28 03:41:37,446 INFO L272 TraceCheckUtils]: 4: Hoare triple {2312#true} call #t~ret15 := main(); {2312#true} is VALID [2022-04-28 03:41:37,446 INFO L290 TraceCheckUtils]: 5: Hoare triple {2312#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2312#true} is VALID [2022-04-28 03:41:37,446 INFO L290 TraceCheckUtils]: 6: Hoare triple {2312#true} [99] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_42 v_main_~y~0_41)) (.cse1 (= |v_main_#t~post5_24| |v_main_#t~post5_23|)) (.cse2 (= v_main_~x~0_60 v_main_~x~0_59)) (.cse4 (= |v_main_#t~post6_24| |v_main_#t~post6_23|)) (.cse3 (mod v_main_~x~0_60 4294967296))) (or (and .cse0 .cse1 .cse2 (<= .cse3 0) .cse4) (and .cse0 .cse1 .cse2 .cse4) (and (forall ((v_it_7 Int)) (or (not (<= (+ v_main_~x~0_59 v_it_7 1) v_main_~x~0_60)) (< 0 (mod (+ v_main_~x~0_60 (* v_it_7 4294967295)) 4294967296)) (not (<= 1 v_it_7)))) (< v_main_~x~0_59 v_main_~x~0_60) (< 0 .cse3) (= v_main_~y~0_41 (+ v_main_~x~0_60 v_main_~y~0_42 (* (- 1) v_main_~x~0_59)))))) InVars {main_~y~0=v_main_~y~0_42, main_#t~post5=|v_main_#t~post5_24|, main_~x~0=v_main_~x~0_60, main_#t~post6=|v_main_#t~post6_24|} OutVars{main_~y~0=v_main_~y~0_41, main_#t~post5=|v_main_#t~post5_23|, main_~x~0=v_main_~x~0_59, main_#t~post6=|v_main_#t~post6_23|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2312#true} is VALID [2022-04-28 03:41:37,447 INFO L290 TraceCheckUtils]: 7: Hoare triple {2312#true} [98] 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[] {2312#true} is VALID [2022-04-28 03:41:37,447 INFO L290 TraceCheckUtils]: 8: Hoare triple {2312#true} ~z~0 := ~y~0; {2312#true} is VALID [2022-04-28 03:41:37,447 INFO L290 TraceCheckUtils]: 9: Hoare triple {2312#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2317#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-28 03:41:37,448 INFO L290 TraceCheckUtils]: 10: Hoare triple {2317#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {2317#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-28 03:41:37,449 INFO L290 TraceCheckUtils]: 11: Hoare triple {2317#(<= main_~z~0 (+ 4294967294 (* (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; {2318#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-28 03:41:37,449 INFO L290 TraceCheckUtils]: 12: Hoare triple {2318#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !(~y~0 % 4294967296 > 0); {2318#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-28 03:41:37,449 INFO L290 TraceCheckUtils]: 13: Hoare triple {2318#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~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; {2318#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-28 03:41:37,449 INFO L290 TraceCheckUtils]: 14: Hoare triple {2318#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !(~x~0 % 4294967296 > 0); {2318#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-28 03:41:37,450 INFO L290 TraceCheckUtils]: 15: Hoare triple {2318#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !(~z~0 % 4294967296 > 0); {2313#false} is VALID [2022-04-28 03:41:37,450 INFO L272 TraceCheckUtils]: 16: Hoare triple {2313#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2313#false} is VALID [2022-04-28 03:41:37,450 INFO L290 TraceCheckUtils]: 17: Hoare triple {2313#false} ~cond := #in~cond; {2313#false} is VALID [2022-04-28 03:41:37,450 INFO L290 TraceCheckUtils]: 18: Hoare triple {2313#false} assume 0 == ~cond; {2313#false} is VALID [2022-04-28 03:41:37,450 INFO L290 TraceCheckUtils]: 19: Hoare triple {2313#false} assume !false; {2313#false} is VALID [2022-04-28 03:41:37,450 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:41:37,450 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:41:37,650 INFO L290 TraceCheckUtils]: 19: Hoare triple {2313#false} assume !false; {2313#false} is VALID [2022-04-28 03:41:37,650 INFO L290 TraceCheckUtils]: 18: Hoare triple {2313#false} assume 0 == ~cond; {2313#false} is VALID [2022-04-28 03:41:37,650 INFO L290 TraceCheckUtils]: 17: Hoare triple {2313#false} ~cond := #in~cond; {2313#false} is VALID [2022-04-28 03:41:37,650 INFO L272 TraceCheckUtils]: 16: Hoare triple {2313#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2313#false} is VALID [2022-04-28 03:41:37,650 INFO L290 TraceCheckUtils]: 15: Hoare triple {2318#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !(~z~0 % 4294967296 > 0); {2313#false} is VALID [2022-04-28 03:41:37,651 INFO L290 TraceCheckUtils]: 14: Hoare triple {2318#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !(~x~0 % 4294967296 > 0); {2318#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-28 03:41:37,651 INFO L290 TraceCheckUtils]: 13: Hoare triple {2318#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~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; {2318#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-28 03:41:37,651 INFO L290 TraceCheckUtils]: 12: Hoare triple {2318#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !(~y~0 % 4294967296 > 0); {2318#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-28 03:41:37,652 INFO L290 TraceCheckUtils]: 11: Hoare triple {2317#(<= main_~z~0 (+ 4294967294 (* (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; {2318#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-28 03:41:37,652 INFO L290 TraceCheckUtils]: 10: Hoare triple {2317#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {2317#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-28 03:41:37,653 INFO L290 TraceCheckUtils]: 9: Hoare triple {2312#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2317#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-28 03:41:37,653 INFO L290 TraceCheckUtils]: 8: Hoare triple {2312#true} ~z~0 := ~y~0; {2312#true} is VALID [2022-04-28 03:41:37,653 INFO L290 TraceCheckUtils]: 7: Hoare triple {2312#true} [98] 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[] {2312#true} is VALID [2022-04-28 03:41:37,654 INFO L290 TraceCheckUtils]: 6: Hoare triple {2312#true} [99] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_42 v_main_~y~0_41)) (.cse1 (= |v_main_#t~post5_24| |v_main_#t~post5_23|)) (.cse2 (= v_main_~x~0_60 v_main_~x~0_59)) (.cse4 (= |v_main_#t~post6_24| |v_main_#t~post6_23|)) (.cse3 (mod v_main_~x~0_60 4294967296))) (or (and .cse0 .cse1 .cse2 (<= .cse3 0) .cse4) (and .cse0 .cse1 .cse2 .cse4) (and (forall ((v_it_7 Int)) (or (not (<= (+ v_main_~x~0_59 v_it_7 1) v_main_~x~0_60)) (< 0 (mod (+ v_main_~x~0_60 (* v_it_7 4294967295)) 4294967296)) (not (<= 1 v_it_7)))) (< v_main_~x~0_59 v_main_~x~0_60) (< 0 .cse3) (= v_main_~y~0_41 (+ v_main_~x~0_60 v_main_~y~0_42 (* (- 1) v_main_~x~0_59)))))) InVars {main_~y~0=v_main_~y~0_42, main_#t~post5=|v_main_#t~post5_24|, main_~x~0=v_main_~x~0_60, main_#t~post6=|v_main_#t~post6_24|} OutVars{main_~y~0=v_main_~y~0_41, main_#t~post5=|v_main_#t~post5_23|, main_~x~0=v_main_~x~0_59, main_#t~post6=|v_main_#t~post6_23|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2312#true} is VALID [2022-04-28 03:41:37,654 INFO L290 TraceCheckUtils]: 5: Hoare triple {2312#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2312#true} is VALID [2022-04-28 03:41:37,654 INFO L272 TraceCheckUtils]: 4: Hoare triple {2312#true} call #t~ret15 := main(); {2312#true} is VALID [2022-04-28 03:41:37,654 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2312#true} {2312#true} #83#return; {2312#true} is VALID [2022-04-28 03:41:37,654 INFO L290 TraceCheckUtils]: 2: Hoare triple {2312#true} assume true; {2312#true} is VALID [2022-04-28 03:41:37,654 INFO L290 TraceCheckUtils]: 1: Hoare triple {2312#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2312#true} is VALID [2022-04-28 03:41:37,654 INFO L272 TraceCheckUtils]: 0: Hoare triple {2312#true} call ULTIMATE.init(); {2312#true} is VALID [2022-04-28 03:41:37,654 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:41:37,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1416437308] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:41:37,654 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:41:37,654 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 5 [2022-04-28 03:41:37,717 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:41:37,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [502366046] [2022-04-28 03:41:37,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [502366046] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:41:37,717 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:41:37,717 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 03:41:37,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499700118] [2022-04-28 03:41:37,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:41:37,718 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:41:37,718 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:41:37,718 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:41:37,757 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:41:37,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 03:41:37,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:41:37,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 03:41:37,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 03:41:37,758 INFO L87 Difference]: Start difference. First operand 25 states and 32 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:41:37,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:37,995 INFO L93 Difference]: Finished difference Result 39 states and 52 transitions. [2022-04-28 03:41:37,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 03:41:37,996 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:41:37,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:41:37,996 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:41:37,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 41 transitions. [2022-04-28 03:41:37,997 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:41:37,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 41 transitions. [2022-04-28 03:41:37,997 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 41 transitions. [2022-04-28 03:41:38,034 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:41:38,034 INFO L225 Difference]: With dead ends: 39 [2022-04-28 03:41:38,034 INFO L226 Difference]: Without dead ends: 34 [2022-04-28 03:41:38,035 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 43 SyntacticMatches, 5 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-04-28 03:41:38,035 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 25 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:41:38,035 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 33 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 03:41:38,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-28 03:41:38,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30. [2022-04-28 03:41:38,070 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:41:38,070 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 30 states, 25 states have (on average 1.44) internal successors, (36), 25 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have 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:38,070 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 30 states, 25 states have (on average 1.44) internal successors, (36), 25 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have 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:38,070 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 30 states, 25 states have (on average 1.44) internal successors, (36), 25 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have 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:38,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:38,071 INFO L93 Difference]: Finished difference Result 34 states and 47 transitions. [2022-04-28 03:41:38,071 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 47 transitions. [2022-04-28 03:41:38,071 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:41:38,071 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:41:38,071 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 25 states have (on average 1.44) internal successors, (36), 25 states have internal predecessors, (36), 3 states have call successors, (3), 3 states 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:41:38,071 INFO L87 Difference]: Start difference. First operand has 30 states, 25 states have (on average 1.44) internal successors, (36), 25 states have internal predecessors, (36), 3 states have call successors, (3), 3 states 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:41:38,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:41:38,072 INFO L93 Difference]: Finished difference Result 34 states and 47 transitions. [2022-04-28 03:41:38,072 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 47 transitions. [2022-04-28 03:41:38,072 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:41:38,072 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:41:38,072 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:41:38,072 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:41:38,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.44) internal successors, (36), 25 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have 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:38,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 40 transitions. [2022-04-28 03:41:38,073 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 40 transitions. Word has length 20 [2022-04-28 03:41:38,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:41:38,073 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 40 transitions. [2022-04-28 03:41:38,073 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:41:38,073 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 40 transitions. [2022-04-28 03:41:40,136 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 39 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 03:41:40,136 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 40 transitions. [2022-04-28 03:41:40,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-28 03:41:40,137 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:41:40,137 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:41:40,153 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:41:40,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:41:40,339 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:41:40,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:41:40,340 INFO L85 PathProgramCache]: Analyzing trace with hash -1695200847, now seen corresponding path program 1 times [2022-04-28 03:41:40,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:41:40,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [653665649] [2022-04-28 03:41:40,507 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:40,508 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:41:40,510 INFO L85 PathProgramCache]: Analyzing trace with hash 2079281168, now seen corresponding path program 1 times [2022-04-28 03:41:40,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:41:40,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600829736] [2022-04-28 03:41:40,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:41:40,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:41:40,517 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:41:40,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:40,560 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_8.5))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-04-28 03:41:40,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:41:40,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:40,908 INFO L290 TraceCheckUtils]: 0: Hoare triple {2672#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2657#true} is VALID [2022-04-28 03:41:40,908 INFO L290 TraceCheckUtils]: 1: Hoare triple {2657#true} assume true; {2657#true} is VALID [2022-04-28 03:41:40,908 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2657#true} {2657#true} #83#return; {2657#true} is VALID [2022-04-28 03:41:40,909 INFO L272 TraceCheckUtils]: 0: Hoare triple {2657#true} call ULTIMATE.init(); {2672#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:41:40,909 INFO L290 TraceCheckUtils]: 1: Hoare triple {2672#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2657#true} is VALID [2022-04-28 03:41:40,909 INFO L290 TraceCheckUtils]: 2: Hoare triple {2657#true} assume true; {2657#true} is VALID [2022-04-28 03:41:40,909 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2657#true} {2657#true} #83#return; {2657#true} is VALID [2022-04-28 03:41:40,909 INFO L272 TraceCheckUtils]: 4: Hoare triple {2657#true} call #t~ret15 := main(); {2657#true} is VALID [2022-04-28 03:41:40,909 INFO L290 TraceCheckUtils]: 5: Hoare triple {2657#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2662#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-28 03:41:41,093 INFO L290 TraceCheckUtils]: 6: Hoare triple {2662#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} [101] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_51 v_main_~y~0_50)) (.cse1 (= v_main_~x~0_69 v_main_~x~0_68)) (.cse2 (= |v_main_#t~post5_29| |v_main_#t~post5_28|)) (.cse3 (mod v_main_~x~0_69 4294967296))) (or (and (= |v_main_#t~post6_29| |v_main_#t~post6_28|) .cse0 .cse1 .cse2) (and (= |v_main_#t~post6_28| |v_main_#t~post6_29|) .cse0 (<= .cse3 0) .cse1 .cse2) (and (forall ((v_it_8 Int)) (or (< 0 (mod (+ (* v_it_8 4294967295) v_main_~x~0_69) 4294967296)) (not (<= (+ v_main_~x~0_68 v_it_8 1) v_main_~x~0_69)) (not (<= 1 v_it_8)))) (= v_main_~y~0_50 (+ v_main_~x~0_69 v_main_~y~0_51 (* (- 1) v_main_~x~0_68))) (< v_main_~x~0_68 v_main_~x~0_69) (< 0 .cse3)))) InVars {main_~y~0=v_main_~y~0_51, main_#t~post5=|v_main_#t~post5_29|, main_~x~0=v_main_~x~0_69, main_#t~post6=|v_main_#t~post6_29|} OutVars{main_~y~0=v_main_~y~0_50, main_#t~post5=|v_main_#t~post5_28|, main_~x~0=v_main_~x~0_68, main_#t~post6=|v_main_#t~post6_28|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2663#(or (and (<= (+ main_~y~0 main_~x~0) (+ (* (div (+ main_~y~0 main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967295)) (<= main_~n~0 (+ 4294967295 (* (div (+ (- 1) main_~n~0) 4294967296) 4294967296)))) (= main_~y~0 0))} is VALID [2022-04-28 03:41:41,095 INFO L290 TraceCheckUtils]: 7: Hoare triple {2663#(or (and (<= (+ main_~y~0 main_~x~0) (+ (* (div (+ main_~y~0 main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967295)) (<= main_~n~0 (+ 4294967295 (* (div (+ (- 1) main_~n~0) 4294967296) 4294967296)))) (= main_~y~0 0))} [100] 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[] {2664#(or (and (<= main_~n~0 (+ 4294967295 (* (div (+ (- 1) main_~n~0 (* (- 1) main_~x~0) (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296))) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (<= (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) (+ (* (div (+ main_~y~0 main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967295))) (= main_~y~0 0))} is VALID [2022-04-28 03:41:41,097 INFO L290 TraceCheckUtils]: 8: Hoare triple {2664#(or (and (<= main_~n~0 (+ 4294967295 (* (div (+ (- 1) main_~n~0 (* (- 1) main_~x~0) (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296))) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (<= (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) (+ (* (div (+ main_~y~0 main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967295))) (= main_~y~0 0))} ~z~0 := ~y~0; {2665#(and (= (+ main_~z~0 (* (- 1) main_~y~0)) 0) (or (and (<= main_~n~0 (+ 4294967295 (* (div (+ (- 1) main_~n~0 (* (- 1) main_~x~0) (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296))) (<= (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296) (* 4294967296 (div main_~x~0 4294967296))) (+ main_~y~0 main_~x~0 (* (div main_~n~0 4294967296) 4294967296))) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))) (= main_~y~0 0)))} is VALID [2022-04-28 03:41:41,104 INFO L290 TraceCheckUtils]: 9: Hoare triple {2665#(and (= (+ main_~z~0 (* (- 1) main_~y~0)) 0) (or (and (<= main_~n~0 (+ 4294967295 (* (div (+ (- 1) main_~n~0 (* (- 1) main_~x~0) (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296))) (<= (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296) (* 4294967296 (div main_~x~0 4294967296))) (+ main_~y~0 main_~x~0 (* (div main_~n~0 4294967296) 4294967296))) (<= main_~x~0 (* 4294967296 (div main_~x~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; {2666#(and (<= (+ (* (div (+ (* (div (+ main_~n~0 (* (- 1) main_~x~0)) 4294967296) (- 4294967296)) main_~n~0) 4294967296) 4294967296) 1) main_~x~0) (<= main_~x~0 (+ (* 4294967296 (div (+ main_~z~0 main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (div main_~z~0 4294967296) (- 4294967296)) (* (- 1) main_~n~0)) 4294967296)) 1)))} is VALID [2022-04-28 03:41:41,107 INFO L290 TraceCheckUtils]: 10: Hoare triple {2666#(and (<= (+ (* (div (+ (* (div (+ main_~n~0 (* (- 1) main_~x~0)) 4294967296) (- 4294967296)) main_~n~0) 4294967296) 4294967296) 1) main_~x~0) (<= main_~x~0 (+ (* 4294967296 (div (+ main_~z~0 main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (div main_~z~0 4294967296) (- 4294967296)) (* (- 1) main_~n~0)) 4294967296)) 1)))} assume !(~z~0 % 4294967296 > 0); {2667#(and (<= (+ (* (div (+ (* (div (+ main_~n~0 (* (- 1) main_~x~0)) 4294967296) (- 4294967296)) main_~n~0) 4294967296) 4294967296) 1) main_~x~0) (<= main_~x~0 (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 1)))} is VALID [2022-04-28 03:41:41,108 INFO L290 TraceCheckUtils]: 11: Hoare triple {2667#(and (<= (+ (* (div (+ (* (div (+ main_~n~0 (* (- 1) main_~x~0)) 4294967296) (- 4294967296)) main_~n~0) 4294967296) 4294967296) 1) main_~x~0) (<= main_~x~0 (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~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; {2667#(and (<= (+ (* (div (+ (* (div (+ main_~n~0 (* (- 1) main_~x~0)) 4294967296) (- 4294967296)) main_~n~0) 4294967296) 4294967296) 1) main_~x~0) (<= main_~x~0 (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 1)))} is VALID [2022-04-28 03:41:41,108 INFO L290 TraceCheckUtils]: 12: Hoare triple {2667#(and (<= (+ (* (div (+ (* (div (+ main_~n~0 (* (- 1) main_~x~0)) 4294967296) (- 4294967296)) main_~n~0) 4294967296) 4294967296) 1) main_~x~0) (<= main_~x~0 (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 1)))} assume !(~y~0 % 4294967296 > 0); {2667#(and (<= (+ (* (div (+ (* (div (+ main_~n~0 (* (- 1) main_~x~0)) 4294967296) (- 4294967296)) main_~n~0) 4294967296) 4294967296) 1) main_~x~0) (<= main_~x~0 (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 1)))} is VALID [2022-04-28 03:41:41,116 INFO L290 TraceCheckUtils]: 13: Hoare triple {2667#(and (<= (+ (* (div (+ (* (div (+ main_~n~0 (* (- 1) main_~x~0)) 4294967296) (- 4294967296)) main_~n~0) 4294967296) 4294967296) 1) main_~x~0) (<= main_~x~0 (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~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; {2668#(and (<= main_~x~0 (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 1) 4294967296) 4294967296)) (<= (* (div (+ (* (div (+ (- 1) main_~n~0 (* (- 1) main_~x~0)) 4294967296) (- 4294967296)) main_~n~0) 4294967296) 4294967296) main_~x~0))} is VALID [2022-04-28 03:41:41,117 INFO L290 TraceCheckUtils]: 14: Hoare triple {2668#(and (<= main_~x~0 (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 1) 4294967296) 4294967296)) (<= (* (div (+ (* (div (+ (- 1) main_~n~0 (* (- 1) main_~x~0)) 4294967296) (- 4294967296)) main_~n~0) 4294967296) 4294967296) main_~x~0))} assume !(~x~0 % 4294967296 > 0); {2668#(and (<= main_~x~0 (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 1) 4294967296) 4294967296)) (<= (* (div (+ (* (div (+ (- 1) main_~n~0 (* (- 1) main_~x~0)) 4294967296) (- 4294967296)) main_~n~0) 4294967296) 4294967296) main_~x~0))} is VALID [2022-04-28 03:41:41,120 INFO L290 TraceCheckUtils]: 15: Hoare triple {2668#(and (<= main_~x~0 (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 1) 4294967296) 4294967296)) (<= (* (div (+ (* (div (+ (- 1) main_~n~0 (* (- 1) main_~x~0)) 4294967296) (- 4294967296)) main_~n~0) 4294967296) 4294967296) main_~x~0))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {2669#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-28 03:41:41,120 INFO L290 TraceCheckUtils]: 16: Hoare triple {2669#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !(~z~0 % 4294967296 > 0); {2669#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-28 03:41:41,121 INFO L272 TraceCheckUtils]: 17: Hoare triple {2669#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2670#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:41:41,121 INFO L290 TraceCheckUtils]: 18: Hoare triple {2670#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {2671#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:41:41,121 INFO L290 TraceCheckUtils]: 19: Hoare triple {2671#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {2658#false} is VALID [2022-04-28 03:41:41,122 INFO L290 TraceCheckUtils]: 20: Hoare triple {2658#false} assume !false; {2658#false} is VALID [2022-04-28 03:41:41,122 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:41:41,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:41:41,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600829736] [2022-04-28 03:41:41,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600829736] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:41:41,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [99378831] [2022-04-28 03:41:41,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:41:41,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:41:41,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:41:41,123 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:41:41,124 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:41:41,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:41,251 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-28 03:41:41,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:41:41,303 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:41:50,885 WARN L232 SmtUtils]: Spent 6.27s on a formula simplification that was a NOOP. DAG size: 41 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-28 03:42:03,085 WARN L833 $PredicateComparison]: unable to prove that (and (not (< 0 (mod c_main_~y~0 4294967296))) (<= (div (+ (* (- 1) c_main_~n~0) c_main_~y~0 1) (- 4294967296)) (div (+ (- 1) (* (- 1) c_main_~y~0) c_main_~n~0) 4294967296)) (< 0 (+ c_main_~y~0 1)) (forall ((v_it_8 Int)) (or (not (<= v_it_8 c_main_~y~0)) (< 0 (mod (+ (* v_it_8 4294967295) c_main_~n~0) 4294967296)) (not (<= 1 v_it_8))))) is different from false [2022-04-28 03:42:55,854 INFO L272 TraceCheckUtils]: 0: Hoare triple {2657#true} call ULTIMATE.init(); {2657#true} is VALID [2022-04-28 03:42:55,855 INFO L290 TraceCheckUtils]: 1: Hoare triple {2657#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2657#true} is VALID [2022-04-28 03:42:55,855 INFO L290 TraceCheckUtils]: 2: Hoare triple {2657#true} assume true; {2657#true} is VALID [2022-04-28 03:42:55,855 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2657#true} {2657#true} #83#return; {2657#true} is VALID [2022-04-28 03:42:55,855 INFO L272 TraceCheckUtils]: 4: Hoare triple {2657#true} call #t~ret15 := main(); {2657#true} is VALID [2022-04-28 03:42:55,855 INFO L290 TraceCheckUtils]: 5: Hoare triple {2657#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2662#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-28 03:42:55,858 INFO L290 TraceCheckUtils]: 6: Hoare triple {2662#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} [101] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_51 v_main_~y~0_50)) (.cse1 (= v_main_~x~0_69 v_main_~x~0_68)) (.cse2 (= |v_main_#t~post5_29| |v_main_#t~post5_28|)) (.cse3 (mod v_main_~x~0_69 4294967296))) (or (and (= |v_main_#t~post6_29| |v_main_#t~post6_28|) .cse0 .cse1 .cse2) (and (= |v_main_#t~post6_28| |v_main_#t~post6_29|) .cse0 (<= .cse3 0) .cse1 .cse2) (and (forall ((v_it_8 Int)) (or (< 0 (mod (+ (* v_it_8 4294967295) v_main_~x~0_69) 4294967296)) (not (<= (+ v_main_~x~0_68 v_it_8 1) v_main_~x~0_69)) (not (<= 1 v_it_8)))) (= v_main_~y~0_50 (+ v_main_~x~0_69 v_main_~y~0_51 (* (- 1) v_main_~x~0_68))) (< v_main_~x~0_68 v_main_~x~0_69) (< 0 .cse3)))) InVars {main_~y~0=v_main_~y~0_51, main_#t~post5=|v_main_#t~post5_29|, main_~x~0=v_main_~x~0_69, main_#t~post6=|v_main_#t~post6_29|} OutVars{main_~y~0=v_main_~y~0_50, main_#t~post5=|v_main_#t~post5_28|, main_~x~0=v_main_~x~0_68, main_#t~post6=|v_main_#t~post6_28|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2694#(or (and (= main_~n~0 main_~x~0) (= main_~y~0 0)) (and (< main_~x~0 main_~n~0) (forall ((v_it_8 Int)) (or (< 0 (mod (+ (* v_it_8 4294967295) main_~n~0) 4294967296)) (not (<= (+ v_it_8 main_~x~0 1) main_~n~0)) (not (<= 1 v_it_8)))) (< 0 (mod main_~n~0 4294967296)) (= main_~y~0 (+ main_~n~0 (* (- 1) main_~x~0)))))} is VALID [2022-04-28 03:42:55,862 INFO L290 TraceCheckUtils]: 7: Hoare triple {2694#(or (and (= main_~n~0 main_~x~0) (= main_~y~0 0)) (and (< main_~x~0 main_~n~0) (forall ((v_it_8 Int)) (or (< 0 (mod (+ (* v_it_8 4294967295) main_~n~0) 4294967296)) (not (<= (+ v_it_8 main_~x~0 1) main_~n~0)) (not (<= 1 v_it_8)))) (< 0 (mod main_~n~0 4294967296)) (= main_~y~0 (+ main_~n~0 (* (- 1) main_~x~0)))))} [100] 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[] {2698#(or (and (forall ((v_it_8 Int)) (or (< 0 (mod (+ (* v_it_8 4294967295) main_~n~0) 4294967296)) (not (<= (+ v_it_8 1) main_~y~0)) (not (<= 1 v_it_8)))) (<= (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)) (and (<= (div (- main_~n~0) (- 4294967296)) (div main_~n~0 4294967296)) (= main_~y~0 0)))} is VALID [2022-04-28 03:42:55,863 INFO L290 TraceCheckUtils]: 8: Hoare triple {2698#(or (and (forall ((v_it_8 Int)) (or (< 0 (mod (+ (* v_it_8 4294967295) main_~n~0) 4294967296)) (not (<= (+ v_it_8 1) main_~y~0)) (not (<= 1 v_it_8)))) (<= (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)) (and (<= (div (- main_~n~0) (- 4294967296)) (div main_~n~0 4294967296)) (= main_~y~0 0)))} ~z~0 := ~y~0; {2702#(and (= main_~z~0 main_~y~0) (or (and (forall ((v_it_8 Int)) (or (< 0 (mod (+ (* v_it_8 4294967295) main_~n~0) 4294967296)) (not (<= (+ v_it_8 1) main_~y~0)) (not (<= 1 v_it_8)))) (<= (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)) (and (<= (div (- main_~n~0) (- 4294967296)) (div main_~n~0 4294967296)) (= main_~y~0 0))))} is VALID [2022-04-28 03:42:55,866 INFO L290 TraceCheckUtils]: 9: Hoare triple {2702#(and (= main_~z~0 main_~y~0) (or (and (forall ((v_it_8 Int)) (or (< 0 (mod (+ (* v_it_8 4294967295) main_~n~0) 4294967296)) (not (<= (+ v_it_8 1) main_~y~0)) (not (<= 1 v_it_8)))) (<= (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)) (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; {2706#(and (or (and (forall ((v_it_8 Int)) (or (< 0 (mod (+ (* v_it_8 4294967295) main_~n~0) 4294967296)) (not (<= (+ v_it_8 1) main_~y~0)) (not (<= 1 v_it_8)))) (<= (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)) (and (<= (div (- main_~n~0) (- 4294967296)) (div main_~n~0 4294967296)) (= main_~y~0 0))) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-28 03:42:55,877 INFO L290 TraceCheckUtils]: 10: Hoare triple {2706#(and (or (and (forall ((v_it_8 Int)) (or (< 0 (mod (+ (* v_it_8 4294967295) main_~n~0) 4294967296)) (not (<= (+ v_it_8 1) main_~y~0)) (not (<= 1 v_it_8)))) (<= (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)) (and (<= (div (- main_~n~0) (- 4294967296)) (div main_~n~0 4294967296)) (= main_~y~0 0))) (= main_~y~0 (+ main_~z~0 1)))} assume !(~z~0 % 4294967296 > 0); {2710#(and (forall ((v_it_8 Int)) (or (< 0 (mod (+ (* v_it_8 4294967295) main_~n~0) 4294967296)) (not (<= (+ v_it_8 1) main_~y~0)) (not (<= 1 v_it_8)))) (<= (div (+ main_~y~0 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296)) (< 0 main_~y~0) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-28 03:42:56,105 INFO L290 TraceCheckUtils]: 11: Hoare triple {2710#(and (forall ((v_it_8 Int)) (or (< 0 (mod (+ (* v_it_8 4294967295) main_~n~0) 4294967296)) (not (<= (+ v_it_8 1) main_~y~0)) (not (<= 1 v_it_8)))) (<= (div (+ main_~y~0 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296)) (< 0 main_~y~0) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2714#(and (forall ((v_it_8 Int)) (or (< 0 (mod (+ (* v_it_8 4294967295) main_~n~0) 4294967296)) (not (<= v_it_8 main_~y~0)) (not (<= 1 v_it_8)))) (not (< 0 (mod main_~y~0 4294967296))) (<= (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:42:58,130 WARN L290 TraceCheckUtils]: 12: Hoare triple {2714#(and (forall ((v_it_8 Int)) (or (< 0 (mod (+ (* v_it_8 4294967295) main_~n~0) 4294967296)) (not (<= v_it_8 main_~y~0)) (not (<= 1 v_it_8)))) (not (< 0 (mod main_~y~0 4294967296))) (<= (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); {2718#(exists ((aux_div_aux_mod_main_~y~0_26_103 Int) (aux_div_main_~y~0_26 Int) (aux_mod_aux_mod_aux_mod_main_~y~0_26_103_111 Int) (aux_div_aux_mod_aux_mod_main_~y~0_26_103_111 Int)) (and (forall ((v_it_8 Int)) (or (< 0 (mod (+ (* v_it_8 4294967295) main_~n~0) 4294967296)) (not (<= (+ aux_mod_aux_mod_aux_mod_main_~y~0_26_103_111 v_it_8 (* aux_div_aux_mod_aux_mod_main_~y~0_26_103_111 4294967296) 1) main_~n~0)) (not (<= 1 v_it_8)))) (<= main_~n~0 (+ aux_mod_aux_mod_aux_mod_main_~y~0_26_103_111 (* aux_div_aux_mod_aux_mod_main_~y~0_26_103_111 4294967296) (* 4294967296 aux_div_main_~y~0_26) 1)) (<= aux_div_aux_mod_main_~y~0_26_103 aux_div_aux_mod_aux_mod_main_~y~0_26_103_111) (< (+ aux_mod_aux_mod_aux_mod_main_~y~0_26_103_111 (* aux_div_aux_mod_aux_mod_main_~y~0_26_103_111 4294967296)) main_~n~0) (<= (+ aux_mod_aux_mod_aux_mod_main_~y~0_26_103_111 (* aux_div_aux_mod_aux_mod_main_~y~0_26_103_111 4294967296)) (* aux_div_aux_mod_main_~y~0_26_103 4294967296)) (<= 0 aux_mod_aux_mod_aux_mod_main_~y~0_26_103_111) (<= (+ aux_mod_aux_mod_aux_mod_main_~y~0_26_103_111 (* aux_div_aux_mod_aux_mod_main_~y~0_26_103_111 4294967296) (* 4294967296 aux_div_main_~y~0_26) 1) main_~n~0)))} is UNKNOWN [2022-04-28 03:43:00,187 WARN L290 TraceCheckUtils]: 13: Hoare triple {2718#(exists ((aux_div_aux_mod_main_~y~0_26_103 Int) (aux_div_main_~y~0_26 Int) (aux_mod_aux_mod_aux_mod_main_~y~0_26_103_111 Int) (aux_div_aux_mod_aux_mod_main_~y~0_26_103_111 Int)) (and (forall ((v_it_8 Int)) (or (< 0 (mod (+ (* v_it_8 4294967295) main_~n~0) 4294967296)) (not (<= (+ aux_mod_aux_mod_aux_mod_main_~y~0_26_103_111 v_it_8 (* aux_div_aux_mod_aux_mod_main_~y~0_26_103_111 4294967296) 1) main_~n~0)) (not (<= 1 v_it_8)))) (<= main_~n~0 (+ aux_mod_aux_mod_aux_mod_main_~y~0_26_103_111 (* aux_div_aux_mod_aux_mod_main_~y~0_26_103_111 4294967296) (* 4294967296 aux_div_main_~y~0_26) 1)) (<= aux_div_aux_mod_main_~y~0_26_103 aux_div_aux_mod_aux_mod_main_~y~0_26_103_111) (< (+ aux_mod_aux_mod_aux_mod_main_~y~0_26_103_111 (* aux_div_aux_mod_aux_mod_main_~y~0_26_103_111 4294967296)) main_~n~0) (<= (+ aux_mod_aux_mod_aux_mod_main_~y~0_26_103_111 (* aux_div_aux_mod_aux_mod_main_~y~0_26_103_111 4294967296)) (* aux_div_aux_mod_main_~y~0_26_103 4294967296)) (<= 0 aux_mod_aux_mod_aux_mod_main_~y~0_26_103_111) (<= (+ aux_mod_aux_mod_aux_mod_main_~y~0_26_103_111 (* aux_div_aux_mod_aux_mod_main_~y~0_26_103_111 4294967296) (* 4294967296 aux_div_main_~y~0_26) 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; {2722#(and (< 0 (mod (+ main_~x~0 1) 4294967296)) (exists ((aux_div_aux_mod_main_~y~0_26_103 Int) (aux_div_main_~y~0_26 Int) (aux_mod_aux_mod_aux_mod_main_~y~0_26_103_111 Int) (aux_div_aux_mod_aux_mod_main_~y~0_26_103_111 Int)) (and (forall ((v_it_8 Int)) (or (< 0 (mod (+ (* v_it_8 4294967295) main_~n~0) 4294967296)) (not (<= (+ aux_mod_aux_mod_aux_mod_main_~y~0_26_103_111 v_it_8 (* aux_div_aux_mod_aux_mod_main_~y~0_26_103_111 4294967296) 1) main_~n~0)) (not (<= 1 v_it_8)))) (<= main_~n~0 (+ aux_mod_aux_mod_aux_mod_main_~y~0_26_103_111 (* aux_div_aux_mod_aux_mod_main_~y~0_26_103_111 4294967296) (* 4294967296 aux_div_main_~y~0_26) 1)) (<= aux_div_aux_mod_main_~y~0_26_103 aux_div_aux_mod_aux_mod_main_~y~0_26_103_111) (< (+ aux_mod_aux_mod_aux_mod_main_~y~0_26_103_111 (* aux_div_aux_mod_aux_mod_main_~y~0_26_103_111 4294967296)) main_~n~0) (<= (+ aux_mod_aux_mod_aux_mod_main_~y~0_26_103_111 (* aux_div_aux_mod_aux_mod_main_~y~0_26_103_111 4294967296)) (* aux_div_aux_mod_main_~y~0_26_103 4294967296)) (<= 0 aux_mod_aux_mod_aux_mod_main_~y~0_26_103_111) (<= (+ aux_mod_aux_mod_aux_mod_main_~y~0_26_103_111 (* aux_div_aux_mod_aux_mod_main_~y~0_26_103_111 4294967296) (* 4294967296 aux_div_main_~y~0_26) 1) main_~n~0))))} is UNKNOWN [2022-04-28 03:43:01,824 INFO L290 TraceCheckUtils]: 14: Hoare triple {2722#(and (< 0 (mod (+ main_~x~0 1) 4294967296)) (exists ((aux_div_aux_mod_main_~y~0_26_103 Int) (aux_div_main_~y~0_26 Int) (aux_mod_aux_mod_aux_mod_main_~y~0_26_103_111 Int) (aux_div_aux_mod_aux_mod_main_~y~0_26_103_111 Int)) (and (forall ((v_it_8 Int)) (or (< 0 (mod (+ (* v_it_8 4294967295) main_~n~0) 4294967296)) (not (<= (+ aux_mod_aux_mod_aux_mod_main_~y~0_26_103_111 v_it_8 (* aux_div_aux_mod_aux_mod_main_~y~0_26_103_111 4294967296) 1) main_~n~0)) (not (<= 1 v_it_8)))) (<= main_~n~0 (+ aux_mod_aux_mod_aux_mod_main_~y~0_26_103_111 (* aux_div_aux_mod_aux_mod_main_~y~0_26_103_111 4294967296) (* 4294967296 aux_div_main_~y~0_26) 1)) (<= aux_div_aux_mod_main_~y~0_26_103 aux_div_aux_mod_aux_mod_main_~y~0_26_103_111) (< (+ aux_mod_aux_mod_aux_mod_main_~y~0_26_103_111 (* aux_div_aux_mod_aux_mod_main_~y~0_26_103_111 4294967296)) main_~n~0) (<= (+ aux_mod_aux_mod_aux_mod_main_~y~0_26_103_111 (* aux_div_aux_mod_aux_mod_main_~y~0_26_103_111 4294967296)) (* aux_div_aux_mod_main_~y~0_26_103 4294967296)) (<= 0 aux_mod_aux_mod_aux_mod_main_~y~0_26_103_111) (<= (+ aux_mod_aux_mod_aux_mod_main_~y~0_26_103_111 (* aux_div_aux_mod_aux_mod_main_~y~0_26_103_111 4294967296) (* 4294967296 aux_div_main_~y~0_26) 1) main_~n~0))))} assume !(~x~0 % 4294967296 > 0); {2726#(and (exists ((aux_div_aux_mod_main_~y~0_26_103 Int) (aux_div_main_~y~0_26 Int) (aux_mod_aux_mod_aux_mod_main_~y~0_26_103_111 Int) (aux_div_aux_mod_aux_mod_main_~y~0_26_103_111 Int)) (and (forall ((v_it_8 Int)) (or (< 0 (mod (+ (* v_it_8 4294967295) main_~n~0) 4294967296)) (not (<= (+ aux_mod_aux_mod_aux_mod_main_~y~0_26_103_111 v_it_8 (* aux_div_aux_mod_aux_mod_main_~y~0_26_103_111 4294967296) 1) main_~n~0)) (not (<= 1 v_it_8)))) (<= main_~n~0 (+ aux_mod_aux_mod_aux_mod_main_~y~0_26_103_111 (* aux_div_aux_mod_aux_mod_main_~y~0_26_103_111 4294967296) (* 4294967296 aux_div_main_~y~0_26) 1)) (<= aux_div_aux_mod_main_~y~0_26_103 aux_div_aux_mod_aux_mod_main_~y~0_26_103_111) (< (+ aux_mod_aux_mod_aux_mod_main_~y~0_26_103_111 (* aux_div_aux_mod_aux_mod_main_~y~0_26_103_111 4294967296)) main_~n~0) (<= (+ aux_mod_aux_mod_aux_mod_main_~y~0_26_103_111 (* aux_div_aux_mod_aux_mod_main_~y~0_26_103_111 4294967296)) (* aux_div_aux_mod_main_~y~0_26_103 4294967296)) (<= 0 aux_mod_aux_mod_aux_mod_main_~y~0_26_103_111) (<= (+ aux_mod_aux_mod_aux_mod_main_~y~0_26_103_111 (* aux_div_aux_mod_aux_mod_main_~y~0_26_103_111 4294967296) (* 4294967296 aux_div_main_~y~0_26) 1) main_~n~0))) (<= (mod main_~x~0 4294967296) 0))} is VALID [2022-04-28 03:43:02,129 INFO L290 TraceCheckUtils]: 15: Hoare triple {2726#(and (exists ((aux_div_aux_mod_main_~y~0_26_103 Int) (aux_div_main_~y~0_26 Int) (aux_mod_aux_mod_aux_mod_main_~y~0_26_103_111 Int) (aux_div_aux_mod_aux_mod_main_~y~0_26_103_111 Int)) (and (forall ((v_it_8 Int)) (or (< 0 (mod (+ (* v_it_8 4294967295) main_~n~0) 4294967296)) (not (<= (+ aux_mod_aux_mod_aux_mod_main_~y~0_26_103_111 v_it_8 (* aux_div_aux_mod_aux_mod_main_~y~0_26_103_111 4294967296) 1) main_~n~0)) (not (<= 1 v_it_8)))) (<= main_~n~0 (+ aux_mod_aux_mod_aux_mod_main_~y~0_26_103_111 (* aux_div_aux_mod_aux_mod_main_~y~0_26_103_111 4294967296) (* 4294967296 aux_div_main_~y~0_26) 1)) (<= aux_div_aux_mod_main_~y~0_26_103 aux_div_aux_mod_aux_mod_main_~y~0_26_103_111) (< (+ aux_mod_aux_mod_aux_mod_main_~y~0_26_103_111 (* aux_div_aux_mod_aux_mod_main_~y~0_26_103_111 4294967296)) main_~n~0) (<= (+ aux_mod_aux_mod_aux_mod_main_~y~0_26_103_111 (* aux_div_aux_mod_aux_mod_main_~y~0_26_103_111 4294967296)) (* aux_div_aux_mod_main_~y~0_26_103 4294967296)) (<= 0 aux_mod_aux_mod_aux_mod_main_~y~0_26_103_111) (<= (+ aux_mod_aux_mod_aux_mod_main_~y~0_26_103_111 (* aux_div_aux_mod_aux_mod_main_~y~0_26_103_111 4294967296) (* 4294967296 aux_div_main_~y~0_26) 1) main_~n~0))) (<= (mod main_~x~0 4294967296) 0))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {2730#(and (exists ((aux_div_aux_mod_main_~y~0_26_103 Int) (aux_div_main_~y~0_26 Int) (aux_mod_aux_mod_aux_mod_main_~y~0_26_103_111 Int) (aux_div_aux_mod_aux_mod_main_~y~0_26_103_111 Int)) (and (forall ((v_it_8 Int)) (or (< 0 (mod (+ (* v_it_8 4294967295) main_~n~0) 4294967296)) (not (<= (+ aux_mod_aux_mod_aux_mod_main_~y~0_26_103_111 v_it_8 (* aux_div_aux_mod_aux_mod_main_~y~0_26_103_111 4294967296) 1) main_~n~0)) (not (<= 1 v_it_8)))) (<= main_~n~0 (+ aux_mod_aux_mod_aux_mod_main_~y~0_26_103_111 (* aux_div_aux_mod_aux_mod_main_~y~0_26_103_111 4294967296) (* 4294967296 aux_div_main_~y~0_26) 1)) (<= aux_div_aux_mod_main_~y~0_26_103 aux_div_aux_mod_aux_mod_main_~y~0_26_103_111) (< (+ aux_mod_aux_mod_aux_mod_main_~y~0_26_103_111 (* aux_div_aux_mod_aux_mod_main_~y~0_26_103_111 4294967296)) main_~n~0) (<= (+ aux_mod_aux_mod_aux_mod_main_~y~0_26_103_111 (* aux_div_aux_mod_aux_mod_main_~y~0_26_103_111 4294967296)) (* aux_div_aux_mod_main_~y~0_26_103 4294967296)) (<= 0 aux_mod_aux_mod_aux_mod_main_~y~0_26_103_111) (<= (+ aux_mod_aux_mod_aux_mod_main_~y~0_26_103_111 (* aux_div_aux_mod_aux_mod_main_~y~0_26_103_111 4294967296) (* 4294967296 aux_div_main_~y~0_26) 1) main_~n~0))) (<= (mod (+ main_~x~0 4294967295) 4294967296) 0))} is VALID [2022-04-28 03:43:04,019 INFO L290 TraceCheckUtils]: 16: Hoare triple {2730#(and (exists ((aux_div_aux_mod_main_~y~0_26_103 Int) (aux_div_main_~y~0_26 Int) (aux_mod_aux_mod_aux_mod_main_~y~0_26_103_111 Int) (aux_div_aux_mod_aux_mod_main_~y~0_26_103_111 Int)) (and (forall ((v_it_8 Int)) (or (< 0 (mod (+ (* v_it_8 4294967295) main_~n~0) 4294967296)) (not (<= (+ aux_mod_aux_mod_aux_mod_main_~y~0_26_103_111 v_it_8 (* aux_div_aux_mod_aux_mod_main_~y~0_26_103_111 4294967296) 1) main_~n~0)) (not (<= 1 v_it_8)))) (<= main_~n~0 (+ aux_mod_aux_mod_aux_mod_main_~y~0_26_103_111 (* aux_div_aux_mod_aux_mod_main_~y~0_26_103_111 4294967296) (* 4294967296 aux_div_main_~y~0_26) 1)) (<= aux_div_aux_mod_main_~y~0_26_103 aux_div_aux_mod_aux_mod_main_~y~0_26_103_111) (< (+ aux_mod_aux_mod_aux_mod_main_~y~0_26_103_111 (* aux_div_aux_mod_aux_mod_main_~y~0_26_103_111 4294967296)) main_~n~0) (<= (+ aux_mod_aux_mod_aux_mod_main_~y~0_26_103_111 (* aux_div_aux_mod_aux_mod_main_~y~0_26_103_111 4294967296)) (* aux_div_aux_mod_main_~y~0_26_103 4294967296)) (<= 0 aux_mod_aux_mod_aux_mod_main_~y~0_26_103_111) (<= (+ aux_mod_aux_mod_aux_mod_main_~y~0_26_103_111 (* aux_div_aux_mod_aux_mod_main_~y~0_26_103_111 4294967296) (* 4294967296 aux_div_main_~y~0_26) 1) main_~n~0))) (<= (mod (+ main_~x~0 4294967295) 4294967296) 0))} assume !(~z~0 % 4294967296 > 0); {2730#(and (exists ((aux_div_aux_mod_main_~y~0_26_103 Int) (aux_div_main_~y~0_26 Int) (aux_mod_aux_mod_aux_mod_main_~y~0_26_103_111 Int) (aux_div_aux_mod_aux_mod_main_~y~0_26_103_111 Int)) (and (forall ((v_it_8 Int)) (or (< 0 (mod (+ (* v_it_8 4294967295) main_~n~0) 4294967296)) (not (<= (+ aux_mod_aux_mod_aux_mod_main_~y~0_26_103_111 v_it_8 (* aux_div_aux_mod_aux_mod_main_~y~0_26_103_111 4294967296) 1) main_~n~0)) (not (<= 1 v_it_8)))) (<= main_~n~0 (+ aux_mod_aux_mod_aux_mod_main_~y~0_26_103_111 (* aux_div_aux_mod_aux_mod_main_~y~0_26_103_111 4294967296) (* 4294967296 aux_div_main_~y~0_26) 1)) (<= aux_div_aux_mod_main_~y~0_26_103 aux_div_aux_mod_aux_mod_main_~y~0_26_103_111) (< (+ aux_mod_aux_mod_aux_mod_main_~y~0_26_103_111 (* aux_div_aux_mod_aux_mod_main_~y~0_26_103_111 4294967296)) main_~n~0) (<= (+ aux_mod_aux_mod_aux_mod_main_~y~0_26_103_111 (* aux_div_aux_mod_aux_mod_main_~y~0_26_103_111 4294967296)) (* aux_div_aux_mod_main_~y~0_26_103 4294967296)) (<= 0 aux_mod_aux_mod_aux_mod_main_~y~0_26_103_111) (<= (+ aux_mod_aux_mod_aux_mod_main_~y~0_26_103_111 (* aux_div_aux_mod_aux_mod_main_~y~0_26_103_111 4294967296) (* 4294967296 aux_div_main_~y~0_26) 1) main_~n~0))) (<= (mod (+ main_~x~0 4294967295) 4294967296) 0))} is VALID [2022-04-28 03:43:04,033 INFO L272 TraceCheckUtils]: 17: Hoare triple {2730#(and (exists ((aux_div_aux_mod_main_~y~0_26_103 Int) (aux_div_main_~y~0_26 Int) (aux_mod_aux_mod_aux_mod_main_~y~0_26_103_111 Int) (aux_div_aux_mod_aux_mod_main_~y~0_26_103_111 Int)) (and (forall ((v_it_8 Int)) (or (< 0 (mod (+ (* v_it_8 4294967295) main_~n~0) 4294967296)) (not (<= (+ aux_mod_aux_mod_aux_mod_main_~y~0_26_103_111 v_it_8 (* aux_div_aux_mod_aux_mod_main_~y~0_26_103_111 4294967296) 1) main_~n~0)) (not (<= 1 v_it_8)))) (<= main_~n~0 (+ aux_mod_aux_mod_aux_mod_main_~y~0_26_103_111 (* aux_div_aux_mod_aux_mod_main_~y~0_26_103_111 4294967296) (* 4294967296 aux_div_main_~y~0_26) 1)) (<= aux_div_aux_mod_main_~y~0_26_103 aux_div_aux_mod_aux_mod_main_~y~0_26_103_111) (< (+ aux_mod_aux_mod_aux_mod_main_~y~0_26_103_111 (* aux_div_aux_mod_aux_mod_main_~y~0_26_103_111 4294967296)) main_~n~0) (<= (+ aux_mod_aux_mod_aux_mod_main_~y~0_26_103_111 (* aux_div_aux_mod_aux_mod_main_~y~0_26_103_111 4294967296)) (* aux_div_aux_mod_main_~y~0_26_103 4294967296)) (<= 0 aux_mod_aux_mod_aux_mod_main_~y~0_26_103_111) (<= (+ aux_mod_aux_mod_aux_mod_main_~y~0_26_103_111 (* aux_div_aux_mod_aux_mod_main_~y~0_26_103_111 4294967296) (* 4294967296 aux_div_main_~y~0_26) 1) main_~n~0))) (<= (mod (+ main_~x~0 4294967295) 4294967296) 0))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2737#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:43:04,034 INFO L290 TraceCheckUtils]: 18: Hoare triple {2737#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2741#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:43:04,034 INFO L290 TraceCheckUtils]: 19: Hoare triple {2741#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2658#false} is VALID [2022-04-28 03:43:04,035 INFO L290 TraceCheckUtils]: 20: Hoare triple {2658#false} assume !false; {2658#false} is VALID [2022-04-28 03:43:04,035 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-04-28 03:43:04,035 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:43:27,601 INFO L290 TraceCheckUtils]: 20: Hoare triple {2658#false} assume !false; {2658#false} is VALID [2022-04-28 03:43:27,602 INFO L290 TraceCheckUtils]: 19: Hoare triple {2741#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2658#false} is VALID [2022-04-28 03:43:27,602 INFO L290 TraceCheckUtils]: 18: Hoare triple {2737#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2741#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:43:27,603 INFO L272 TraceCheckUtils]: 17: Hoare triple {2669#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2737#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:43:27,603 INFO L290 TraceCheckUtils]: 16: Hoare triple {2669#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !(~z~0 % 4294967296 > 0); {2669#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-28 03:43:27,604 INFO L290 TraceCheckUtils]: 15: Hoare triple {2763#(and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {2669#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-28 03:43:27,605 INFO L290 TraceCheckUtils]: 14: Hoare triple {2767#(or (< 0 (mod main_~x~0 4294967296)) (and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)))))} assume !(~x~0 % 4294967296 > 0); {2763#(and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296))))} is VALID [2022-04-28 03:43:27,606 INFO L290 TraceCheckUtils]: 13: Hoare triple {2771#(and (<= (+ (div main_~n~0 4294967296) 1) (div (+ main_~n~0 4294967295) 4294967296)) (<= (div (+ (- 4294967295) (* (- 1) main_~n~0)) (- 4294967296)) (+ (div main_~n~0 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; {2767#(or (< 0 (mod main_~x~0 4294967296)) (and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)))))} is VALID [2022-04-28 03:43:27,607 INFO L290 TraceCheckUtils]: 12: Hoare triple {2775#(or (and (<= (+ (div main_~n~0 4294967296) 1) (div (+ main_~n~0 4294967295) 4294967296)) (<= (div (+ (- 4294967295) (* (- 1) main_~n~0)) (- 4294967296)) (+ (div main_~n~0 4294967296) 1))) (< 0 (mod main_~y~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {2771#(and (<= (+ (div main_~n~0 4294967296) 1) (div (+ main_~n~0 4294967295) 4294967296)) (<= (div (+ (- 4294967295) (* (- 1) main_~n~0)) (- 4294967296)) (+ (div main_~n~0 4294967296) 1)))} is VALID [2022-04-28 03:43:27,608 INFO L290 TraceCheckUtils]: 11: Hoare triple {2779#(or (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (and (<= (+ (div main_~n~0 4294967296) 1) (div (+ main_~n~0 4294967295) 4294967296)) (<= (div (+ (- 4294967295) (* (- 1) main_~n~0)) (- 4294967296)) (+ (div main_~n~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; {2775#(or (and (<= (+ (div main_~n~0 4294967296) 1) (div (+ main_~n~0 4294967295) 4294967296)) (<= (div (+ (- 4294967295) (* (- 1) main_~n~0)) (- 4294967296)) (+ (div main_~n~0 4294967296) 1))) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 03:43:27,609 INFO L290 TraceCheckUtils]: 10: Hoare triple {2783#(or (< 0 (mod main_~z~0 4294967296)) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (and (<= (+ (div main_~n~0 4294967296) 1) (div (+ main_~n~0 4294967295) 4294967296)) (<= (div (+ (- 4294967295) (* (- 1) main_~n~0)) (- 4294967296)) (+ (div main_~n~0 4294967296) 1))))} assume !(~z~0 % 4294967296 > 0); {2779#(or (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (and (<= (+ (div main_~n~0 4294967296) 1) (div (+ main_~n~0 4294967295) 4294967296)) (<= (div (+ (- 4294967295) (* (- 1) main_~n~0)) (- 4294967296)) (+ (div main_~n~0 4294967296) 1))))} is VALID [2022-04-28 03:43:27,611 INFO L290 TraceCheckUtils]: 9: Hoare triple {2787#(or (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (and (<= (+ (div main_~n~0 4294967296) 1) (div (+ main_~n~0 4294967295) 4294967296)) (<= (div (+ (- 4294967295) (* (- 1) main_~n~0)) (- 4294967296)) (+ (div main_~n~0 4294967296) 1))) (< 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; {2783#(or (< 0 (mod main_~z~0 4294967296)) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (and (<= (+ (div main_~n~0 4294967296) 1) (div (+ main_~n~0 4294967295) 4294967296)) (<= (div (+ (- 4294967295) (* (- 1) main_~n~0)) (- 4294967296)) (+ (div main_~n~0 4294967296) 1))))} is VALID [2022-04-28 03:43:27,611 INFO L290 TraceCheckUtils]: 8: Hoare triple {2779#(or (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (and (<= (+ (div main_~n~0 4294967296) 1) (div (+ main_~n~0 4294967295) 4294967296)) (<= (div (+ (- 4294967295) (* (- 1) main_~n~0)) (- 4294967296)) (+ (div main_~n~0 4294967296) 1))))} ~z~0 := ~y~0; {2787#(or (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (and (<= (+ (div main_~n~0 4294967296) 1) (div (+ main_~n~0 4294967295) 4294967296)) (<= (div (+ (- 4294967295) (* (- 1) main_~n~0)) (- 4294967296)) (+ (div main_~n~0 4294967296) 1))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-28 03:43:27,612 INFO L290 TraceCheckUtils]: 7: Hoare triple {2794#(or (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (and (<= (+ (div main_~n~0 4294967296) 1) (div (+ main_~n~0 4294967295) 4294967296)) (<= (div (+ (- 4294967295) (* (- 1) main_~n~0)) (- 4294967296)) (+ (div main_~n~0 4294967296) 1))) (< 0 (mod main_~x~0 4294967296)))} [100] 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[] {2779#(or (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (and (<= (+ (div main_~n~0 4294967296) 1) (div (+ main_~n~0 4294967295) 4294967296)) (<= (div (+ (- 4294967295) (* (- 1) main_~n~0)) (- 4294967296)) (+ (div main_~n~0 4294967296) 1))))} is VALID [2022-04-28 03:43:27,909 INFO L290 TraceCheckUtils]: 6: Hoare triple {2798#(or (forall ((aux_mod_v_main_~x~0_79_31 Int)) (or (and (or (< (div (+ (- 4294967296) (* (- 1) main_~y~0)) (- 4294967296)) (+ 2 (div (+ main_~y~0 4294967294) 4294967296))) (forall ((aux_div_v_main_~x~0_79_31 Int)) (not (= (+ aux_mod_v_main_~x~0_79_31 (* aux_div_v_main_~x~0_79_31 4294967296)) main_~x~0)))) (or (< (div (+ (- 4294967296) (* (- 1) main_~y~0)) (- 4294967296)) (+ 2 (div (+ main_~y~0 4294967294) 4294967296))) (< 0 (mod main_~x~0 4294967296)) (forall ((aux_div_v_main_~x~0_79_31 Int)) (not (= (+ aux_mod_v_main_~x~0_79_31 (* aux_div_v_main_~x~0_79_31 4294967296)) main_~x~0)))) (or (forall ((aux_div_v_main_~y~0_59_46 Int) (aux_div_v_main_~x~0_79_31 Int)) (or (exists ((v_it_8 Int)) (and (not (< 0 (mod (+ (* v_it_8 4294967295) main_~x~0) 4294967296))) (<= 1 v_it_8) (<= (+ aux_mod_v_main_~x~0_79_31 v_it_8 (* aux_div_v_main_~x~0_79_31 4294967296) 1) main_~x~0))) (< (+ main_~y~0 main_~x~0 4294967295) (+ aux_mod_v_main_~x~0_79_31 (* aux_div_v_main_~x~0_79_31 4294967296) (* aux_div_v_main_~y~0_59_46 4294967296))) (not (< (+ aux_mod_v_main_~x~0_79_31 (* aux_div_v_main_~x~0_79_31 4294967296)) main_~x~0)) (< (+ aux_mod_v_main_~x~0_79_31 (* aux_div_v_main_~x~0_79_31 4294967296) (* aux_div_v_main_~y~0_59_46 4294967296)) (+ main_~y~0 main_~x~0 4294967295)))) (not (< 0 (mod main_~x~0 4294967296))))) (< 0 aux_mod_v_main_~x~0_79_31) (< aux_mod_v_main_~x~0_79_31 0))) (and (<= (+ (div main_~n~0 4294967296) 1) (div (+ main_~n~0 4294967295) 4294967296)) (<= (div (+ (- 4294967295) (* (- 1) main_~n~0)) (- 4294967296)) (+ (div main_~n~0 4294967296) 1))))} [101] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_51 v_main_~y~0_50)) (.cse1 (= v_main_~x~0_69 v_main_~x~0_68)) (.cse2 (= |v_main_#t~post5_29| |v_main_#t~post5_28|)) (.cse3 (mod v_main_~x~0_69 4294967296))) (or (and (= |v_main_#t~post6_29| |v_main_#t~post6_28|) .cse0 .cse1 .cse2) (and (= |v_main_#t~post6_28| |v_main_#t~post6_29|) .cse0 (<= .cse3 0) .cse1 .cse2) (and (forall ((v_it_8 Int)) (or (< 0 (mod (+ (* v_it_8 4294967295) v_main_~x~0_69) 4294967296)) (not (<= (+ v_main_~x~0_68 v_it_8 1) v_main_~x~0_69)) (not (<= 1 v_it_8)))) (= v_main_~y~0_50 (+ v_main_~x~0_69 v_main_~y~0_51 (* (- 1) v_main_~x~0_68))) (< v_main_~x~0_68 v_main_~x~0_69) (< 0 .cse3)))) InVars {main_~y~0=v_main_~y~0_51, main_#t~post5=|v_main_#t~post5_29|, main_~x~0=v_main_~x~0_69, main_#t~post6=|v_main_#t~post6_29|} OutVars{main_~y~0=v_main_~y~0_50, main_#t~post5=|v_main_#t~post5_28|, main_~x~0=v_main_~x~0_68, main_#t~post6=|v_main_#t~post6_28|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2794#(or (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (and (<= (+ (div main_~n~0 4294967296) 1) (div (+ main_~n~0 4294967295) 4294967296)) (<= (div (+ (- 4294967295) (* (- 1) main_~n~0)) (- 4294967296)) (+ (div main_~n~0 4294967296) 1))) (< 0 (mod main_~x~0 4294967296)))} is VALID [2022-04-28 03:43:27,915 INFO L290 TraceCheckUtils]: 5: Hoare triple {2657#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2798#(or (forall ((aux_mod_v_main_~x~0_79_31 Int)) (or (and (or (< (div (+ (- 4294967296) (* (- 1) main_~y~0)) (- 4294967296)) (+ 2 (div (+ main_~y~0 4294967294) 4294967296))) (forall ((aux_div_v_main_~x~0_79_31 Int)) (not (= (+ aux_mod_v_main_~x~0_79_31 (* aux_div_v_main_~x~0_79_31 4294967296)) main_~x~0)))) (or (< (div (+ (- 4294967296) (* (- 1) main_~y~0)) (- 4294967296)) (+ 2 (div (+ main_~y~0 4294967294) 4294967296))) (< 0 (mod main_~x~0 4294967296)) (forall ((aux_div_v_main_~x~0_79_31 Int)) (not (= (+ aux_mod_v_main_~x~0_79_31 (* aux_div_v_main_~x~0_79_31 4294967296)) main_~x~0)))) (or (forall ((aux_div_v_main_~y~0_59_46 Int) (aux_div_v_main_~x~0_79_31 Int)) (or (exists ((v_it_8 Int)) (and (not (< 0 (mod (+ (* v_it_8 4294967295) main_~x~0) 4294967296))) (<= 1 v_it_8) (<= (+ aux_mod_v_main_~x~0_79_31 v_it_8 (* aux_div_v_main_~x~0_79_31 4294967296) 1) main_~x~0))) (< (+ main_~y~0 main_~x~0 4294967295) (+ aux_mod_v_main_~x~0_79_31 (* aux_div_v_main_~x~0_79_31 4294967296) (* aux_div_v_main_~y~0_59_46 4294967296))) (not (< (+ aux_mod_v_main_~x~0_79_31 (* aux_div_v_main_~x~0_79_31 4294967296)) main_~x~0)) (< (+ aux_mod_v_main_~x~0_79_31 (* aux_div_v_main_~x~0_79_31 4294967296) (* aux_div_v_main_~y~0_59_46 4294967296)) (+ main_~y~0 main_~x~0 4294967295)))) (not (< 0 (mod main_~x~0 4294967296))))) (< 0 aux_mod_v_main_~x~0_79_31) (< aux_mod_v_main_~x~0_79_31 0))) (and (<= (+ (div main_~n~0 4294967296) 1) (div (+ main_~n~0 4294967295) 4294967296)) (<= (div (+ (- 4294967295) (* (- 1) main_~n~0)) (- 4294967296)) (+ (div main_~n~0 4294967296) 1))))} is VALID [2022-04-28 03:43:27,915 INFO L272 TraceCheckUtils]: 4: Hoare triple {2657#true} call #t~ret15 := main(); {2657#true} is VALID [2022-04-28 03:43:27,915 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2657#true} {2657#true} #83#return; {2657#true} is VALID [2022-04-28 03:43:27,915 INFO L290 TraceCheckUtils]: 2: Hoare triple {2657#true} assume true; {2657#true} is VALID [2022-04-28 03:43:27,915 INFO L290 TraceCheckUtils]: 1: Hoare triple {2657#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {2657#true} is VALID [2022-04-28 03:43:27,915 INFO L272 TraceCheckUtils]: 0: Hoare triple {2657#true} call ULTIMATE.init(); {2657#true} is VALID [2022-04-28 03:43:27,915 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:43:27,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [99378831] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:43:27,916 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:43:27,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 14] total 34 [2022-04-28 03:43:30,608 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:43:30,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [653665649] [2022-04-28 03:43:30,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [653665649] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:43:30,609 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:43:30,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 03:43:30,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701737457] [2022-04-28 03:43:30,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:43:30,609 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 11 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-28 03:43:30,609 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:43:30,609 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 11 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:30,703 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:43:30,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 03:43:30,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:43:30,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 03:43:30,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=900, Unknown=29, NotChecked=64, Total=1190 [2022-04-28 03:43:30,704 INFO L87 Difference]: Start difference. First operand 30 states and 40 transitions. Second operand has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 11 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:54,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:43:54,137 INFO L93 Difference]: Finished difference Result 54 states and 73 transitions. [2022-04-28 03:43:54,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 03:43:54,137 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 11 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-28 03:43:54,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:43:54,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 11 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:54,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 48 transitions. [2022-04-28 03:43:54,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 11 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:54,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 48 transitions. [2022-04-28 03:43:54,139 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 48 transitions. [2022-04-28 03:43:54,310 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:43:54,311 INFO L225 Difference]: With dead ends: 54 [2022-04-28 03:43:54,311 INFO L226 Difference]: Without dead ends: 42 [2022-04-28 03:43:54,312 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 22 SyntacticMatches, 4 SemanticMatches, 41 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 518 ImplicationChecksByTransitivity, 113.9s TimeCoverageRelationStatistics Valid=273, Invalid=1416, Unknown=37, NotChecked=80, Total=1806 [2022-04-28 03:43:54,312 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 28 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 30 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 03:43:54,312 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 51 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 117 Invalid, 0 Unknown, 30 Unchecked, 0.3s Time] [2022-04-28 03:43:54,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-04-28 03:43:54,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 39. [2022-04-28 03:43:54,383 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:43:54,383 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand has 39 states, 34 states have (on average 1.411764705882353) internal successors, (48), 34 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:54,383 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand has 39 states, 34 states have (on average 1.411764705882353) internal successors, (48), 34 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:54,383 INFO L87 Difference]: Start difference. First operand 42 states. Second operand has 39 states, 34 states have (on average 1.411764705882353) internal successors, (48), 34 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:54,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:43:54,384 INFO L93 Difference]: Finished difference Result 42 states and 56 transitions. [2022-04-28 03:43:54,384 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 56 transitions. [2022-04-28 03:43:54,384 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:43:54,384 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:43:54,384 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 34 states have (on average 1.411764705882353) internal successors, (48), 34 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 42 states. [2022-04-28 03:43:54,384 INFO L87 Difference]: Start difference. First operand has 39 states, 34 states have (on average 1.411764705882353) internal successors, (48), 34 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 42 states. [2022-04-28 03:43:54,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:43:54,385 INFO L93 Difference]: Finished difference Result 42 states and 56 transitions. [2022-04-28 03:43:54,385 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 56 transitions. [2022-04-28 03:43:54,385 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:43:54,385 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:43:54,385 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:43:54,385 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:43:54,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 34 states have (on average 1.411764705882353) internal successors, (48), 34 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:54,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 52 transitions. [2022-04-28 03:43:54,386 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 52 transitions. Word has length 21 [2022-04-28 03:43:54,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:43:54,386 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 52 transitions. [2022-04-28 03:43:54,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 11 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:43:54,386 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 52 transitions. [2022-04-28 03:43:55,216 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:43:55,217 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 52 transitions. [2022-04-28 03:43:55,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-28 03:43:55,217 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:43:55,217 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:43:55,235 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:43:55,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:43:55,419 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:43:55,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:43:55,420 INFO L85 PathProgramCache]: Analyzing trace with hash -794011953, now seen corresponding path program 2 times [2022-04-28 03:43:55,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:43:55,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [715760581] [2022-04-28 03:43:55,619 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:55,620 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:43:55,622 INFO L85 PathProgramCache]: Analyzing trace with hash 689489134, now seen corresponding path program 1 times [2022-04-28 03:43:55,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:43:55,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110078708] [2022-04-28 03:43:55,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:43:55,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:43:55,637 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:43:55,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:43:55,649 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_9.3))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:43:55,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:43:55,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:43:55,803 INFO L290 TraceCheckUtils]: 0: Hoare triple {3118#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3106#true} is VALID [2022-04-28 03:43:55,803 INFO L290 TraceCheckUtils]: 1: Hoare triple {3106#true} assume true; {3106#true} is VALID [2022-04-28 03:43:55,803 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3106#true} {3106#true} #83#return; {3106#true} is VALID [2022-04-28 03:43:55,804 INFO L272 TraceCheckUtils]: 0: Hoare triple {3106#true} call ULTIMATE.init(); {3118#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:43:55,804 INFO L290 TraceCheckUtils]: 1: Hoare triple {3118#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3106#true} is VALID [2022-04-28 03:43:55,804 INFO L290 TraceCheckUtils]: 2: Hoare triple {3106#true} assume true; {3106#true} is VALID [2022-04-28 03:43:55,804 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3106#true} {3106#true} #83#return; {3106#true} is VALID [2022-04-28 03:43:55,804 INFO L272 TraceCheckUtils]: 4: Hoare triple {3106#true} call #t~ret15 := main(); {3106#true} is VALID [2022-04-28 03:43:55,804 INFO L290 TraceCheckUtils]: 5: Hoare triple {3106#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3111#(= main_~y~0 0)} is VALID [2022-04-28 03:43:55,806 INFO L290 TraceCheckUtils]: 6: Hoare triple {3111#(= main_~y~0 0)} [103] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_84 4294967296)) (.cse1 (= v_main_~y~0_64 v_main_~y~0_63)) (.cse2 (= |v_main_#t~post6_36| |v_main_#t~post6_35|)) (.cse3 (= |v_main_#t~post5_36| |v_main_#t~post5_35|)) (.cse4 (= v_main_~x~0_84 v_main_~x~0_83))) (or (and (= v_main_~x~0_83 (+ v_main_~x~0_84 v_main_~y~0_64 (* (- 1) v_main_~y~0_63))) (< v_main_~y~0_64 v_main_~y~0_63) (forall ((v_it_9 Int)) (or (not (<= 1 v_it_9)) (< 0 (mod (+ v_main_~x~0_84 (* v_it_9 4294967295)) 4294967296)) (not (<= (+ v_main_~y~0_64 v_it_9 1) v_main_~y~0_63)))) (< 0 .cse0)) (and .cse1 .cse2 (<= .cse0 0) .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_64, main_#t~post5=|v_main_#t~post5_36|, main_~x~0=v_main_~x~0_84, main_#t~post6=|v_main_#t~post6_36|} OutVars{main_~y~0=v_main_~y~0_63, main_#t~post5=|v_main_#t~post5_35|, main_~x~0=v_main_~x~0_83, main_#t~post6=|v_main_#t~post6_35|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {3112#(or (and (<= 0 main_~y~0) (<= main_~y~0 0)) (<= (+ (* (div (+ main_~y~0 main_~x~0) 4294967296) 4294967296) 1) (+ main_~y~0 main_~x~0)))} is VALID [2022-04-28 03:43:55,807 INFO L290 TraceCheckUtils]: 7: Hoare triple {3112#(or (and (<= 0 main_~y~0) (<= main_~y~0 0)) (<= (+ (* (div (+ main_~y~0 main_~x~0) 4294967296) 4294967296) 1) (+ main_~y~0 main_~x~0)))} [102] 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[] {3113#(or (and (<= 0 main_~y~0) (<= main_~y~0 0)) (<= (+ (* (div (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296) 1) (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296)))))} is VALID [2022-04-28 03:43:55,809 INFO L290 TraceCheckUtils]: 8: Hoare triple {3113#(or (and (<= 0 main_~y~0) (<= main_~y~0 0)) (<= (+ (* (div (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296) 1) (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296)))))} ~z~0 := ~y~0; {3114#(or (<= (+ main_~z~0 (* 4294967296 (div main_~x~0 4294967296))) (+ 4294967295 (* 4294967296 (div (+ main_~z~0 (* (div (+ (- 1) main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296) (* (- 1) main_~y~0)) 4294967296)))) (and (<= main_~z~0 0) (<= 0 main_~z~0)))} is VALID [2022-04-28 03:43:55,812 INFO L290 TraceCheckUtils]: 9: Hoare triple {3114#(or (<= (+ main_~z~0 (* 4294967296 (div main_~x~0 4294967296))) (+ 4294967295 (* 4294967296 (div (+ main_~z~0 (* (div (+ (- 1) main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296) (* (- 1) main_~y~0)) 4294967296)))) (and (<= main_~z~0 0) (<= 0 main_~z~0)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3115#(<= (+ (* (div (+ main_~y~0 (* (- 1) main_~z~0) 4294967294 (* (div main_~z~0 4294967296) 4294967296)) 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-28 03:43:55,813 INFO L290 TraceCheckUtils]: 10: Hoare triple {3115#(<= (+ (* (div (+ main_~y~0 (* (- 1) main_~z~0) 4294967294 (* (div main_~z~0 4294967296) 4294967296)) 4294967296) 4294967296) 1) main_~y~0)} assume !(~z~0 % 4294967296 > 0); {3116#(<= (+ (* (div (+ main_~y~0 4294967294) 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-28 03:43:55,814 INFO L290 TraceCheckUtils]: 11: Hoare triple {3116#(<= (+ (* (div (+ main_~y~0 4294967294) 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; {3117#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:43:55,814 INFO L290 TraceCheckUtils]: 12: Hoare triple {3117#(<= 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; {3107#false} is VALID [2022-04-28 03:43:55,815 INFO L290 TraceCheckUtils]: 13: Hoare triple {3107#false} assume !(~y~0 % 4294967296 > 0); {3107#false} is VALID [2022-04-28 03:43:55,815 INFO L290 TraceCheckUtils]: 14: Hoare triple {3107#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; {3107#false} is VALID [2022-04-28 03:43:55,815 INFO L290 TraceCheckUtils]: 15: Hoare triple {3107#false} assume !(~x~0 % 4294967296 > 0); {3107#false} is VALID [2022-04-28 03:43:55,815 INFO L290 TraceCheckUtils]: 16: Hoare triple {3107#false} assume !(~z~0 % 4294967296 > 0); {3107#false} is VALID [2022-04-28 03:43:55,815 INFO L272 TraceCheckUtils]: 17: Hoare triple {3107#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {3107#false} is VALID [2022-04-28 03:43:55,815 INFO L290 TraceCheckUtils]: 18: Hoare triple {3107#false} ~cond := #in~cond; {3107#false} is VALID [2022-04-28 03:43:55,815 INFO L290 TraceCheckUtils]: 19: Hoare triple {3107#false} assume 0 == ~cond; {3107#false} is VALID [2022-04-28 03:43:55,815 INFO L290 TraceCheckUtils]: 20: Hoare triple {3107#false} assume !false; {3107#false} is VALID [2022-04-28 03:43:55,815 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:43:55,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:43:55,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110078708] [2022-04-28 03:43:55,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110078708] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:43:55,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [381908931] [2022-04-28 03:43:55,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:43:55,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:43:55,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:43:55,816 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:43:55,817 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:43:55,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:43:55,850 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-28 03:43:55,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:43:55,869 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:43:56,105 INFO L272 TraceCheckUtils]: 0: Hoare triple {3106#true} call ULTIMATE.init(); {3106#true} is VALID [2022-04-28 03:43:56,105 INFO L290 TraceCheckUtils]: 1: Hoare triple {3106#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3106#true} is VALID [2022-04-28 03:43:56,105 INFO L290 TraceCheckUtils]: 2: Hoare triple {3106#true} assume true; {3106#true} is VALID [2022-04-28 03:43:56,105 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3106#true} {3106#true} #83#return; {3106#true} is VALID [2022-04-28 03:43:56,105 INFO L272 TraceCheckUtils]: 4: Hoare triple {3106#true} call #t~ret15 := main(); {3106#true} is VALID [2022-04-28 03:43:56,105 INFO L290 TraceCheckUtils]: 5: Hoare triple {3106#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3106#true} is VALID [2022-04-28 03:43:56,106 INFO L290 TraceCheckUtils]: 6: Hoare triple {3106#true} [103] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_84 4294967296)) (.cse1 (= v_main_~y~0_64 v_main_~y~0_63)) (.cse2 (= |v_main_#t~post6_36| |v_main_#t~post6_35|)) (.cse3 (= |v_main_#t~post5_36| |v_main_#t~post5_35|)) (.cse4 (= v_main_~x~0_84 v_main_~x~0_83))) (or (and (= v_main_~x~0_83 (+ v_main_~x~0_84 v_main_~y~0_64 (* (- 1) v_main_~y~0_63))) (< v_main_~y~0_64 v_main_~y~0_63) (forall ((v_it_9 Int)) (or (not (<= 1 v_it_9)) (< 0 (mod (+ v_main_~x~0_84 (* v_it_9 4294967295)) 4294967296)) (not (<= (+ v_main_~y~0_64 v_it_9 1) v_main_~y~0_63)))) (< 0 .cse0)) (and .cse1 .cse2 (<= .cse0 0) .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_64, main_#t~post5=|v_main_#t~post5_36|, main_~x~0=v_main_~x~0_84, main_#t~post6=|v_main_#t~post6_36|} OutVars{main_~y~0=v_main_~y~0_63, main_#t~post5=|v_main_#t~post5_35|, main_~x~0=v_main_~x~0_83, main_#t~post6=|v_main_#t~post6_35|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {3106#true} is VALID [2022-04-28 03:43:56,106 INFO L290 TraceCheckUtils]: 7: Hoare triple {3106#true} [102] 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[] {3106#true} is VALID [2022-04-28 03:43:56,106 INFO L290 TraceCheckUtils]: 8: Hoare triple {3106#true} ~z~0 := ~y~0; {3146#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 03:43:56,106 INFO L290 TraceCheckUtils]: 9: Hoare triple {3146#(= 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; {3150#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-28 03:43:56,107 INFO L290 TraceCheckUtils]: 10: Hoare triple {3150#(= main_~y~0 (+ main_~z~0 1))} assume !(~z~0 % 4294967296 > 0); {3116#(<= (+ (* (div (+ main_~y~0 4294967294) 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-28 03:43:56,108 INFO L290 TraceCheckUtils]: 11: Hoare triple {3116#(<= (+ (* (div (+ main_~y~0 4294967294) 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; {3117#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:43:56,109 INFO L290 TraceCheckUtils]: 12: Hoare triple {3117#(<= 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; {3107#false} is VALID [2022-04-28 03:43:56,109 INFO L290 TraceCheckUtils]: 13: Hoare triple {3107#false} assume !(~y~0 % 4294967296 > 0); {3107#false} is VALID [2022-04-28 03:43:56,109 INFO L290 TraceCheckUtils]: 14: Hoare triple {3107#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; {3107#false} is VALID [2022-04-28 03:43:56,109 INFO L290 TraceCheckUtils]: 15: Hoare triple {3107#false} assume !(~x~0 % 4294967296 > 0); {3107#false} is VALID [2022-04-28 03:43:56,109 INFO L290 TraceCheckUtils]: 16: Hoare triple {3107#false} assume !(~z~0 % 4294967296 > 0); {3107#false} is VALID [2022-04-28 03:43:56,109 INFO L272 TraceCheckUtils]: 17: Hoare triple {3107#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {3107#false} is VALID [2022-04-28 03:43:56,109 INFO L290 TraceCheckUtils]: 18: Hoare triple {3107#false} ~cond := #in~cond; {3107#false} is VALID [2022-04-28 03:43:56,109 INFO L290 TraceCheckUtils]: 19: Hoare triple {3107#false} assume 0 == ~cond; {3107#false} is VALID [2022-04-28 03:43:56,109 INFO L290 TraceCheckUtils]: 20: Hoare triple {3107#false} assume !false; {3107#false} is VALID [2022-04-28 03:43:56,110 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:43:56,110 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:43:56,397 INFO L290 TraceCheckUtils]: 20: Hoare triple {3107#false} assume !false; {3107#false} is VALID [2022-04-28 03:43:56,398 INFO L290 TraceCheckUtils]: 19: Hoare triple {3107#false} assume 0 == ~cond; {3107#false} is VALID [2022-04-28 03:43:56,398 INFO L290 TraceCheckUtils]: 18: Hoare triple {3107#false} ~cond := #in~cond; {3107#false} is VALID [2022-04-28 03:43:56,398 INFO L272 TraceCheckUtils]: 17: Hoare triple {3107#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {3107#false} is VALID [2022-04-28 03:43:56,398 INFO L290 TraceCheckUtils]: 16: Hoare triple {3107#false} assume !(~z~0 % 4294967296 > 0); {3107#false} is VALID [2022-04-28 03:43:56,398 INFO L290 TraceCheckUtils]: 15: Hoare triple {3107#false} assume !(~x~0 % 4294967296 > 0); {3107#false} is VALID [2022-04-28 03:43:56,398 INFO L290 TraceCheckUtils]: 14: Hoare triple {3107#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; {3107#false} is VALID [2022-04-28 03:43:56,398 INFO L290 TraceCheckUtils]: 13: Hoare triple {3107#false} assume !(~y~0 % 4294967296 > 0); {3107#false} is VALID [2022-04-28 03:43:56,399 INFO L290 TraceCheckUtils]: 12: Hoare triple {3117#(<= 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; {3107#false} is VALID [2022-04-28 03:43:56,400 INFO L290 TraceCheckUtils]: 11: Hoare triple {3116#(<= (+ (* (div (+ main_~y~0 4294967294) 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; {3117#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:43:56,400 INFO L290 TraceCheckUtils]: 10: Hoare triple {3214#(or (< 0 (mod main_~z~0 4294967296)) (<= (+ (* (div (+ main_~y~0 4294967294) 4294967296) 4294967296) 1) main_~y~0))} assume !(~z~0 % 4294967296 > 0); {3116#(<= (+ (* (div (+ main_~y~0 4294967294) 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-28 03:43:56,401 INFO L290 TraceCheckUtils]: 9: Hoare triple {3218#(or (<= (+ (* (div (+ main_~y~0 4294967294) 4294967296) 4294967296) 1) main_~y~0) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3214#(or (< 0 (mod main_~z~0 4294967296)) (<= (+ (* (div (+ main_~y~0 4294967294) 4294967296) 4294967296) 1) main_~y~0))} is VALID [2022-04-28 03:43:56,402 INFO L290 TraceCheckUtils]: 8: Hoare triple {3106#true} ~z~0 := ~y~0; {3218#(or (<= (+ (* (div (+ main_~y~0 4294967294) 4294967296) 4294967296) 1) main_~y~0) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-28 03:43:56,402 INFO L290 TraceCheckUtils]: 7: Hoare triple {3106#true} [102] 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[] {3106#true} is VALID [2022-04-28 03:43:56,402 INFO L290 TraceCheckUtils]: 6: Hoare triple {3106#true} [103] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_84 4294967296)) (.cse1 (= v_main_~y~0_64 v_main_~y~0_63)) (.cse2 (= |v_main_#t~post6_36| |v_main_#t~post6_35|)) (.cse3 (= |v_main_#t~post5_36| |v_main_#t~post5_35|)) (.cse4 (= v_main_~x~0_84 v_main_~x~0_83))) (or (and (= v_main_~x~0_83 (+ v_main_~x~0_84 v_main_~y~0_64 (* (- 1) v_main_~y~0_63))) (< v_main_~y~0_64 v_main_~y~0_63) (forall ((v_it_9 Int)) (or (not (<= 1 v_it_9)) (< 0 (mod (+ v_main_~x~0_84 (* v_it_9 4294967295)) 4294967296)) (not (<= (+ v_main_~y~0_64 v_it_9 1) v_main_~y~0_63)))) (< 0 .cse0)) (and .cse1 .cse2 (<= .cse0 0) .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_64, main_#t~post5=|v_main_#t~post5_36|, main_~x~0=v_main_~x~0_84, main_#t~post6=|v_main_#t~post6_36|} OutVars{main_~y~0=v_main_~y~0_63, main_#t~post5=|v_main_#t~post5_35|, main_~x~0=v_main_~x~0_83, main_#t~post6=|v_main_#t~post6_35|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {3106#true} is VALID [2022-04-28 03:43:56,402 INFO L290 TraceCheckUtils]: 5: Hoare triple {3106#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3106#true} is VALID [2022-04-28 03:43:56,402 INFO L272 TraceCheckUtils]: 4: Hoare triple {3106#true} call #t~ret15 := main(); {3106#true} is VALID [2022-04-28 03:43:56,402 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3106#true} {3106#true} #83#return; {3106#true} is VALID [2022-04-28 03:43:56,402 INFO L290 TraceCheckUtils]: 2: Hoare triple {3106#true} assume true; {3106#true} is VALID [2022-04-28 03:43:56,402 INFO L290 TraceCheckUtils]: 1: Hoare triple {3106#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3106#true} is VALID [2022-04-28 03:43:56,402 INFO L272 TraceCheckUtils]: 0: Hoare triple {3106#true} call ULTIMATE.init(); {3106#true} is VALID [2022-04-28 03:43:56,402 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:43:56,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [381908931] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:43:56,403 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:43:56,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6, 6] total 14 [2022-04-28 03:43:58,948 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:43:58,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [715760581] [2022-04-28 03:43:58,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [715760581] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:43:58,948 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:43:58,948 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 03:43:58,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591412451] [2022-04-28 03:43:58,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:43:58,949 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.7) internal successors, (17), 9 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-28 03:43:58,949 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:43:58,949 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 1.7) internal successors, (17), 9 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:43:59,024 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:43:59,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 03:43:59,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:43:59,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 03:43:59,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2022-04-28 03:43:59,025 INFO L87 Difference]: Start difference. First operand 39 states and 52 transitions. Second operand has 10 states, 10 states have (on average 1.7) internal successors, (17), 9 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:44:06,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:44:06,174 INFO L93 Difference]: Finished difference Result 78 states and 110 transitions. [2022-04-28 03:44:06,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-28 03:44:06,174 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.7) internal successors, (17), 9 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-28 03:44:06,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:44:06,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.7) internal successors, (17), 9 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:44:06,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 63 transitions. [2022-04-28 03:44:06,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.7) internal successors, (17), 9 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:44:06,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 63 transitions. [2022-04-28 03:44:06,177 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 63 transitions. [2022-04-28 03:44:09,115 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:44:09,116 INFO L225 Difference]: With dead ends: 78 [2022-04-28 03:44:09,116 INFO L226 Difference]: Without dead ends: 63 [2022-04-28 03:44:09,116 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 45 SyntacticMatches, 5 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=134, Invalid=465, Unknown=1, NotChecked=0, Total=600 [2022-04-28 03:44:09,116 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 58 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 40 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:44:09,116 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 45 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 81 Invalid, 0 Unknown, 40 Unchecked, 0.1s Time] [2022-04-28 03:44:09,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-04-28 03:44:09,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 45. [2022-04-28 03:44:09,225 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:44:09,225 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand has 45 states, 40 states have (on average 1.375) internal successors, (55), 40 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:44:09,225 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand has 45 states, 40 states have (on average 1.375) internal successors, (55), 40 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:44:09,225 INFO L87 Difference]: Start difference. First operand 63 states. Second operand has 45 states, 40 states have (on average 1.375) internal successors, (55), 40 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:44:09,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:44:09,226 INFO L93 Difference]: Finished difference Result 63 states and 87 transitions. [2022-04-28 03:44:09,226 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 87 transitions. [2022-04-28 03:44:09,227 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:44:09,227 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:44:09,227 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 40 states have (on average 1.375) internal successors, (55), 40 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 63 states. [2022-04-28 03:44:09,227 INFO L87 Difference]: Start difference. First operand has 45 states, 40 states have (on average 1.375) internal successors, (55), 40 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 63 states. [2022-04-28 03:44:09,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:44:09,228 INFO L93 Difference]: Finished difference Result 63 states and 87 transitions. [2022-04-28 03:44:09,228 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 87 transitions. [2022-04-28 03:44:09,228 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:44:09,228 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:44:09,228 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:44:09,228 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:44:09,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 40 states have (on average 1.375) internal successors, (55), 40 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:44:09,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 59 transitions. [2022-04-28 03:44:09,229 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 59 transitions. Word has length 21 [2022-04-28 03:44:09,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:44:09,229 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 59 transitions. [2022-04-28 03:44:09,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.7) internal successors, (17), 9 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:44:09,229 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 45 states and 59 transitions. [2022-04-28 03:44:12,264 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 58 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 03:44:12,264 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 59 transitions. [2022-04-28 03:44:12,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 03:44:12,264 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:44:12,264 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:44:12,280 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-04-28 03:44:12,479 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,SelfDestructingSolverStorable12 [2022-04-28 03:44:12,481 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:44:12,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:44:12,481 INFO L85 PathProgramCache]: Analyzing trace with hash -977123598, now seen corresponding path program 2 times [2022-04-28 03:44:12,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:44:12,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [536980645] [2022-04-28 03:44:12,651 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:44:12,653 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:44:12,654 INFO L85 PathProgramCache]: Analyzing trace with hash -239194893, now seen corresponding path program 1 times [2022-04-28 03:44:12,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:44:12,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599222024] [2022-04-28 03:44:12,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:44:12,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:44:12,661 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:44:12,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:44:12,669 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:44:12,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:44:12,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:44:12,700 INFO L290 TraceCheckUtils]: 0: Hoare triple {3649#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3642#true} is VALID [2022-04-28 03:44:12,700 INFO L290 TraceCheckUtils]: 1: Hoare triple {3642#true} assume true; {3642#true} is VALID [2022-04-28 03:44:12,700 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3642#true} {3642#true} #83#return; {3642#true} is VALID [2022-04-28 03:44:12,701 INFO L272 TraceCheckUtils]: 0: Hoare triple {3642#true} call ULTIMATE.init(); {3649#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:44:12,701 INFO L290 TraceCheckUtils]: 1: Hoare triple {3649#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3642#true} is VALID [2022-04-28 03:44:12,701 INFO L290 TraceCheckUtils]: 2: Hoare triple {3642#true} assume true; {3642#true} is VALID [2022-04-28 03:44:12,701 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3642#true} {3642#true} #83#return; {3642#true} is VALID [2022-04-28 03:44:12,701 INFO L272 TraceCheckUtils]: 4: Hoare triple {3642#true} call #t~ret15 := main(); {3642#true} is VALID [2022-04-28 03:44:12,701 INFO L290 TraceCheckUtils]: 5: Hoare triple {3642#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3642#true} is VALID [2022-04-28 03:44:12,701 INFO L290 TraceCheckUtils]: 6: Hoare triple {3642#true} [105] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_41| |v_main_#t~post5_40|)) (.cse1 (= v_main_~y~0_76 v_main_~y~0_75)) (.cse2 (= |v_main_#t~post6_41| |v_main_#t~post6_40|)) (.cse3 (mod v_main_~x~0_93 4294967296))) (or (and .cse0 .cse1 (= v_main_~x~0_93 v_main_~x~0_92) .cse2) (and (= v_main_~x~0_92 v_main_~x~0_93) .cse0 .cse1 (<= .cse3 0) .cse2) (and (< 0 .cse3) (forall ((v_it_10 Int)) (or (< 0 (mod (+ v_main_~x~0_93 (* 4294967295 v_it_10)) 4294967296)) (not (<= 1 v_it_10)) (not (<= (+ v_main_~y~0_76 v_it_10 1) v_main_~y~0_75)))) (= (+ v_main_~x~0_93 v_main_~y~0_76 (* (- 1) v_main_~y~0_75)) v_main_~x~0_92) (< v_main_~y~0_76 v_main_~y~0_75)))) InVars {main_~y~0=v_main_~y~0_76, main_#t~post5=|v_main_#t~post5_41|, main_~x~0=v_main_~x~0_93, main_#t~post6=|v_main_#t~post6_41|} OutVars{main_~y~0=v_main_~y~0_75, main_#t~post5=|v_main_#t~post5_40|, main_~x~0=v_main_~x~0_92, main_#t~post6=|v_main_#t~post6_40|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {3642#true} is VALID [2022-04-28 03:44:12,701 INFO L290 TraceCheckUtils]: 7: Hoare triple {3642#true} [104] 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[] {3642#true} is VALID [2022-04-28 03:44:12,701 INFO L290 TraceCheckUtils]: 8: Hoare triple {3642#true} ~z~0 := ~y~0; {3642#true} is VALID [2022-04-28 03:44:12,701 INFO L290 TraceCheckUtils]: 9: Hoare triple {3642#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {3642#true} is VALID [2022-04-28 03:44:12,702 INFO L290 TraceCheckUtils]: 10: Hoare triple {3642#true} assume !(~z~0 % 4294967296 > 0); {3647#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} is VALID [2022-04-28 03:44:12,703 INFO L290 TraceCheckUtils]: 11: Hoare triple {3647#(<= 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; {3648#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1))} is VALID [2022-04-28 03:44:12,703 INFO L290 TraceCheckUtils]: 12: Hoare triple {3648#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1))} assume !(~y~0 % 4294967296 > 0); {3648#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1))} is VALID [2022-04-28 03:44:12,703 INFO L290 TraceCheckUtils]: 13: Hoare triple {3648#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 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; {3648#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1))} is VALID [2022-04-28 03:44:12,703 INFO L290 TraceCheckUtils]: 14: Hoare triple {3648#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1))} assume !(~x~0 % 4294967296 > 0); {3648#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1))} is VALID [2022-04-28 03:44:12,705 INFO L290 TraceCheckUtils]: 15: Hoare triple {3648#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {3647#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} is VALID [2022-04-28 03:44:12,705 INFO L290 TraceCheckUtils]: 16: Hoare triple {3647#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {3643#false} is VALID [2022-04-28 03:44:12,705 INFO L290 TraceCheckUtils]: 17: Hoare triple {3643#false} assume !(~z~0 % 4294967296 > 0); {3643#false} is VALID [2022-04-28 03:44:12,705 INFO L272 TraceCheckUtils]: 18: Hoare triple {3643#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {3643#false} is VALID [2022-04-28 03:44:12,705 INFO L290 TraceCheckUtils]: 19: Hoare triple {3643#false} ~cond := #in~cond; {3643#false} is VALID [2022-04-28 03:44:12,705 INFO L290 TraceCheckUtils]: 20: Hoare triple {3643#false} assume 0 == ~cond; {3643#false} is VALID [2022-04-28 03:44:12,705 INFO L290 TraceCheckUtils]: 21: Hoare triple {3643#false} assume !false; {3643#false} is VALID [2022-04-28 03:44:12,706 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:44:12,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:44:12,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599222024] [2022-04-28 03:44:12,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599222024] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:44:12,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [132343082] [2022-04-28 03:44:12,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:44:12,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:44:12,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:44:12,707 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:44:12,708 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:44:12,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:44:12,739 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-28 03:44:12,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:44:12,744 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:44:12,921 INFO L272 TraceCheckUtils]: 0: Hoare triple {3642#true} call ULTIMATE.init(); {3642#true} is VALID [2022-04-28 03:44:12,922 INFO L290 TraceCheckUtils]: 1: Hoare triple {3642#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3642#true} is VALID [2022-04-28 03:44:12,922 INFO L290 TraceCheckUtils]: 2: Hoare triple {3642#true} assume true; {3642#true} is VALID [2022-04-28 03:44:12,922 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3642#true} {3642#true} #83#return; {3642#true} is VALID [2022-04-28 03:44:12,922 INFO L272 TraceCheckUtils]: 4: Hoare triple {3642#true} call #t~ret15 := main(); {3642#true} is VALID [2022-04-28 03:44:12,922 INFO L290 TraceCheckUtils]: 5: Hoare triple {3642#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3642#true} is VALID [2022-04-28 03:44:12,922 INFO L290 TraceCheckUtils]: 6: Hoare triple {3642#true} [105] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_41| |v_main_#t~post5_40|)) (.cse1 (= v_main_~y~0_76 v_main_~y~0_75)) (.cse2 (= |v_main_#t~post6_41| |v_main_#t~post6_40|)) (.cse3 (mod v_main_~x~0_93 4294967296))) (or (and .cse0 .cse1 (= v_main_~x~0_93 v_main_~x~0_92) .cse2) (and (= v_main_~x~0_92 v_main_~x~0_93) .cse0 .cse1 (<= .cse3 0) .cse2) (and (< 0 .cse3) (forall ((v_it_10 Int)) (or (< 0 (mod (+ v_main_~x~0_93 (* 4294967295 v_it_10)) 4294967296)) (not (<= 1 v_it_10)) (not (<= (+ v_main_~y~0_76 v_it_10 1) v_main_~y~0_75)))) (= (+ v_main_~x~0_93 v_main_~y~0_76 (* (- 1) v_main_~y~0_75)) v_main_~x~0_92) (< v_main_~y~0_76 v_main_~y~0_75)))) InVars {main_~y~0=v_main_~y~0_76, main_#t~post5=|v_main_#t~post5_41|, main_~x~0=v_main_~x~0_93, main_#t~post6=|v_main_#t~post6_41|} OutVars{main_~y~0=v_main_~y~0_75, main_#t~post5=|v_main_#t~post5_40|, main_~x~0=v_main_~x~0_92, main_#t~post6=|v_main_#t~post6_40|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {3642#true} is VALID [2022-04-28 03:44:12,922 INFO L290 TraceCheckUtils]: 7: Hoare triple {3642#true} [104] 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[] {3642#true} is VALID [2022-04-28 03:44:12,924 INFO L290 TraceCheckUtils]: 8: Hoare triple {3642#true} ~z~0 := ~y~0; {3677#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 03:44:12,924 INFO L290 TraceCheckUtils]: 9: Hoare triple {3677#(= 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; {3681#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-28 03:44:12,925 INFO L290 TraceCheckUtils]: 10: Hoare triple {3681#(= main_~y~0 (+ main_~z~0 1))} assume !(~z~0 % 4294967296 > 0); {3681#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-28 03:44:12,925 INFO L290 TraceCheckUtils]: 11: Hoare triple {3681#(= main_~y~0 (+ main_~z~0 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {3688#(= main_~z~0 (+ main_~y~0 1))} is VALID [2022-04-28 03:44:12,926 INFO L290 TraceCheckUtils]: 12: Hoare triple {3688#(= main_~z~0 (+ main_~y~0 1))} assume !(~y~0 % 4294967296 > 0); {3648#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1))} is VALID [2022-04-28 03:44:12,926 INFO L290 TraceCheckUtils]: 13: Hoare triple {3648#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 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; {3648#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1))} is VALID [2022-04-28 03:44:12,927 INFO L290 TraceCheckUtils]: 14: Hoare triple {3648#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1))} assume !(~x~0 % 4294967296 > 0); {3648#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1))} is VALID [2022-04-28 03:44:12,928 INFO L290 TraceCheckUtils]: 15: Hoare triple {3648#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {3647#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} is VALID [2022-04-28 03:44:12,928 INFO L290 TraceCheckUtils]: 16: Hoare triple {3647#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {3643#false} is VALID [2022-04-28 03:44:12,929 INFO L290 TraceCheckUtils]: 17: Hoare triple {3643#false} assume !(~z~0 % 4294967296 > 0); {3643#false} is VALID [2022-04-28 03:44:12,929 INFO L272 TraceCheckUtils]: 18: Hoare triple {3643#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {3643#false} is VALID [2022-04-28 03:44:12,929 INFO L290 TraceCheckUtils]: 19: Hoare triple {3643#false} ~cond := #in~cond; {3643#false} is VALID [2022-04-28 03:44:12,929 INFO L290 TraceCheckUtils]: 20: Hoare triple {3643#false} assume 0 == ~cond; {3643#false} is VALID [2022-04-28 03:44:12,929 INFO L290 TraceCheckUtils]: 21: Hoare triple {3643#false} assume !false; {3643#false} is VALID [2022-04-28 03:44:12,929 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:44:12,929 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:44:13,185 INFO L290 TraceCheckUtils]: 21: Hoare triple {3643#false} assume !false; {3643#false} is VALID [2022-04-28 03:44:13,185 INFO L290 TraceCheckUtils]: 20: Hoare triple {3643#false} assume 0 == ~cond; {3643#false} is VALID [2022-04-28 03:44:13,185 INFO L290 TraceCheckUtils]: 19: Hoare triple {3643#false} ~cond := #in~cond; {3643#false} is VALID [2022-04-28 03:44:13,185 INFO L272 TraceCheckUtils]: 18: Hoare triple {3643#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {3643#false} is VALID [2022-04-28 03:44:13,185 INFO L290 TraceCheckUtils]: 17: Hoare triple {3643#false} assume !(~z~0 % 4294967296 > 0); {3643#false} is VALID [2022-04-28 03:44:13,186 INFO L290 TraceCheckUtils]: 16: Hoare triple {3647#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {3643#false} is VALID [2022-04-28 03:44:13,187 INFO L290 TraceCheckUtils]: 15: Hoare triple {3648#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {3647#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} is VALID [2022-04-28 03:44:13,187 INFO L290 TraceCheckUtils]: 14: Hoare triple {3648#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1))} assume !(~x~0 % 4294967296 > 0); {3648#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1))} is VALID [2022-04-28 03:44:13,187 INFO L290 TraceCheckUtils]: 13: Hoare triple {3648#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 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; {3648#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1))} is VALID [2022-04-28 03:44:13,188 INFO L290 TraceCheckUtils]: 12: Hoare triple {3746#(or (<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1)) (< 0 (mod main_~y~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {3648#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1))} is VALID [2022-04-28 03:44:13,189 INFO L290 TraceCheckUtils]: 11: Hoare triple {3750#(or (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (<= 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; {3746#(or (<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1)) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 03:44:13,189 INFO L290 TraceCheckUtils]: 10: Hoare triple {3750#(or (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {3750#(or (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-28 03:44:13,190 INFO L290 TraceCheckUtils]: 9: Hoare triple {3757#(or (<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1)) (< 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; {3750#(or (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-28 03:44:13,191 INFO L290 TraceCheckUtils]: 8: Hoare triple {3642#true} ~z~0 := ~y~0; {3757#(or (<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1)) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 03:44:13,191 INFO L290 TraceCheckUtils]: 7: Hoare triple {3642#true} [104] 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[] {3642#true} is VALID [2022-04-28 03:44:13,191 INFO L290 TraceCheckUtils]: 6: Hoare triple {3642#true} [105] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_41| |v_main_#t~post5_40|)) (.cse1 (= v_main_~y~0_76 v_main_~y~0_75)) (.cse2 (= |v_main_#t~post6_41| |v_main_#t~post6_40|)) (.cse3 (mod v_main_~x~0_93 4294967296))) (or (and .cse0 .cse1 (= v_main_~x~0_93 v_main_~x~0_92) .cse2) (and (= v_main_~x~0_92 v_main_~x~0_93) .cse0 .cse1 (<= .cse3 0) .cse2) (and (< 0 .cse3) (forall ((v_it_10 Int)) (or (< 0 (mod (+ v_main_~x~0_93 (* 4294967295 v_it_10)) 4294967296)) (not (<= 1 v_it_10)) (not (<= (+ v_main_~y~0_76 v_it_10 1) v_main_~y~0_75)))) (= (+ v_main_~x~0_93 v_main_~y~0_76 (* (- 1) v_main_~y~0_75)) v_main_~x~0_92) (< v_main_~y~0_76 v_main_~y~0_75)))) InVars {main_~y~0=v_main_~y~0_76, main_#t~post5=|v_main_#t~post5_41|, main_~x~0=v_main_~x~0_93, main_#t~post6=|v_main_#t~post6_41|} OutVars{main_~y~0=v_main_~y~0_75, main_#t~post5=|v_main_#t~post5_40|, main_~x~0=v_main_~x~0_92, main_#t~post6=|v_main_#t~post6_40|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {3642#true} is VALID [2022-04-28 03:44:13,191 INFO L290 TraceCheckUtils]: 5: Hoare triple {3642#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {3642#true} is VALID [2022-04-28 03:44:13,191 INFO L272 TraceCheckUtils]: 4: Hoare triple {3642#true} call #t~ret15 := main(); {3642#true} is VALID [2022-04-28 03:44:13,191 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3642#true} {3642#true} #83#return; {3642#true} is VALID [2022-04-28 03:44:13,191 INFO L290 TraceCheckUtils]: 2: Hoare triple {3642#true} assume true; {3642#true} is VALID [2022-04-28 03:44:13,191 INFO L290 TraceCheckUtils]: 1: Hoare triple {3642#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {3642#true} is VALID [2022-04-28 03:44:13,191 INFO L272 TraceCheckUtils]: 0: Hoare triple {3642#true} call ULTIMATE.init(); {3642#true} is VALID [2022-04-28 03:44:13,192 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:44:13,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [132343082] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:44:13,192 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:44:13,192 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 11 [2022-04-28 03:44:13,242 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:44:13,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [536980645] [2022-04-28 03:44:13,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [536980645] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:44:13,242 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:44:13,242 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 03:44:13,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247594701] [2022-04-28 03:44:13,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:44:13,243 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have 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:44:13,243 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:44:13,243 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have 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:44:13,259 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:44:13,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 03:44:13,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:44:13,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 03:44:13,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-04-28 03:44:13,260 INFO L87 Difference]: Start difference. First operand 45 states and 59 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have 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:44:13,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:44:13,599 INFO L93 Difference]: Finished difference Result 57 states and 75 transitions. [2022-04-28 03:44:13,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 03:44:13,599 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have 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:44:13,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:44:13,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have 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:44:13,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 44 transitions. [2022-04-28 03:44:13,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have 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:44:13,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 44 transitions. [2022-04-28 03:44:13,601 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 44 transitions. [2022-04-28 03:44:13,638 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:44:13,639 INFO L225 Difference]: With dead ends: 57 [2022-04-28 03:44:13,639 INFO L226 Difference]: Without dead ends: 45 [2022-04-28 03:44:13,639 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 45 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2022-04-28 03:44:13,639 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 28 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:44:13,640 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 34 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 03:44:13,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-28 03:44:13,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 41. [2022-04-28 03:44:13,735 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:44:13,736 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 41 states, 36 states have (on average 1.3611111111111112) internal successors, (49), 36 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have 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:44:13,736 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 41 states, 36 states have (on average 1.3611111111111112) internal successors, (49), 36 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have 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:44:13,736 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 41 states, 36 states have (on average 1.3611111111111112) internal successors, (49), 36 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have 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:44:13,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:44:13,737 INFO L93 Difference]: Finished difference Result 45 states and 60 transitions. [2022-04-28 03:44:13,737 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 60 transitions. [2022-04-28 03:44:13,737 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:44:13,737 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:44:13,737 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 36 states have (on average 1.3611111111111112) internal successors, (49), 36 states have internal predecessors, (49), 3 states have call successors, (3), 3 states 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:44:13,737 INFO L87 Difference]: Start difference. First operand has 41 states, 36 states have (on average 1.3611111111111112) internal successors, (49), 36 states have internal predecessors, (49), 3 states have call successors, (3), 3 states 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:44:13,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:44:13,738 INFO L93 Difference]: Finished difference Result 45 states and 60 transitions. [2022-04-28 03:44:13,738 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 60 transitions. [2022-04-28 03:44:13,738 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:44:13,738 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:44:13,738 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:44:13,738 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:44:13,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 36 states have (on average 1.3611111111111112) internal successors, (49), 36 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have 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:44:13,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 53 transitions. [2022-04-28 03:44:13,739 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 53 transitions. Word has length 22 [2022-04-28 03:44:13,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:44:13,739 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 53 transitions. [2022-04-28 03:44:13,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have 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:44:13,739 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 53 transitions. [2022-04-28 03:44:17,721 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 52 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 03:44:17,721 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 53 transitions. [2022-04-28 03:44:17,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 03:44:17,722 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:44:17,722 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:44:17,737 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:44:17,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:44:17,937 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:44:17,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:44:17,938 INFO L85 PathProgramCache]: Analyzing trace with hash -961342331, now seen corresponding path program 3 times [2022-04-28 03:44:17,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:44:17,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1907330215] [2022-04-28 03:44:18,149 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:44:18,151 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:44:18,152 INFO L85 PathProgramCache]: Analyzing trace with hash 1770621638, now seen corresponding path program 1 times [2022-04-28 03:44:18,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:44:18,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064269577] [2022-04-28 03:44:18,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:44:18,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:44:18,161 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:44:18,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:44:18,175 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_11.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:44:18,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:44:18,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:44:18,221 INFO L290 TraceCheckUtils]: 0: Hoare triple {4094#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4085#true} is VALID [2022-04-28 03:44:18,221 INFO L290 TraceCheckUtils]: 1: Hoare triple {4085#true} assume true; {4085#true} is VALID [2022-04-28 03:44:18,221 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4085#true} {4085#true} #83#return; {4085#true} is VALID [2022-04-28 03:44:18,221 INFO L272 TraceCheckUtils]: 0: Hoare triple {4085#true} call ULTIMATE.init(); {4094#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:44:18,222 INFO L290 TraceCheckUtils]: 1: Hoare triple {4094#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4085#true} is VALID [2022-04-28 03:44:18,222 INFO L290 TraceCheckUtils]: 2: Hoare triple {4085#true} assume true; {4085#true} is VALID [2022-04-28 03:44:18,222 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4085#true} {4085#true} #83#return; {4085#true} is VALID [2022-04-28 03:44:18,222 INFO L272 TraceCheckUtils]: 4: Hoare triple {4085#true} call #t~ret15 := main(); {4085#true} is VALID [2022-04-28 03:44:18,222 INFO L290 TraceCheckUtils]: 5: Hoare triple {4085#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4085#true} is VALID [2022-04-28 03:44:18,222 INFO L290 TraceCheckUtils]: 6: Hoare triple {4085#true} [107] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_46| |v_main_#t~post5_45|)) (.cse2 (= v_main_~y~0_86 v_main_~y~0_85)) (.cse3 (= |v_main_#t~post6_46| |v_main_#t~post6_45|)) (.cse1 (mod v_main_~x~0_105 4294967296))) (or (and (= v_main_~x~0_104 v_main_~x~0_105) .cse0 (<= .cse1 0) .cse2 .cse3) (and .cse0 .cse2 (= v_main_~x~0_105 v_main_~x~0_104) .cse3) (and (< v_main_~y~0_86 v_main_~y~0_85) (< 0 .cse1) (forall ((v_it_11 Int)) (or (< 0 (mod (+ v_main_~x~0_105 (* 4294967295 v_it_11)) 4294967296)) (not (<= 1 v_it_11)) (not (<= (+ v_main_~y~0_86 v_it_11 1) v_main_~y~0_85)))) (= v_main_~x~0_104 (+ v_main_~x~0_105 v_main_~y~0_86 (* (- 1) v_main_~y~0_85)))))) InVars {main_~y~0=v_main_~y~0_86, main_#t~post5=|v_main_#t~post5_46|, main_~x~0=v_main_~x~0_105, main_#t~post6=|v_main_#t~post6_46|} OutVars{main_~y~0=v_main_~y~0_85, main_#t~post5=|v_main_#t~post5_45|, main_~x~0=v_main_~x~0_104, main_#t~post6=|v_main_#t~post6_45|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {4085#true} is VALID [2022-04-28 03:44:18,222 INFO L290 TraceCheckUtils]: 7: Hoare triple {4085#true} [106] 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[] {4090#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:44:18,223 INFO L290 TraceCheckUtils]: 8: Hoare triple {4090#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {4090#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:44:18,224 INFO L290 TraceCheckUtils]: 9: Hoare triple {4090#(<= 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; {4091#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:44:18,224 INFO L290 TraceCheckUtils]: 10: Hoare triple {4091#(<= 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; {4092#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:44:18,225 INFO L290 TraceCheckUtils]: 11: Hoare triple {4092#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {4092#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:44:18,225 INFO L290 TraceCheckUtils]: 12: Hoare triple {4092#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~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; {4092#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:44:18,225 INFO L290 TraceCheckUtils]: 13: Hoare triple {4092#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {4092#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:44:18,226 INFO L290 TraceCheckUtils]: 14: Hoare triple {4092#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~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; {4093#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-28 03:44:18,227 INFO L290 TraceCheckUtils]: 15: Hoare triple {4093#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {4086#false} is VALID [2022-04-28 03:44:18,227 INFO L290 TraceCheckUtils]: 16: Hoare triple {4086#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {4086#false} is VALID [2022-04-28 03:44:18,227 INFO L290 TraceCheckUtils]: 17: Hoare triple {4086#false} assume !(~z~0 % 4294967296 > 0); {4086#false} is VALID [2022-04-28 03:44:18,227 INFO L272 TraceCheckUtils]: 18: Hoare triple {4086#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {4086#false} is VALID [2022-04-28 03:44:18,227 INFO L290 TraceCheckUtils]: 19: Hoare triple {4086#false} ~cond := #in~cond; {4086#false} is VALID [2022-04-28 03:44:18,227 INFO L290 TraceCheckUtils]: 20: Hoare triple {4086#false} assume 0 == ~cond; {4086#false} is VALID [2022-04-28 03:44:18,227 INFO L290 TraceCheckUtils]: 21: Hoare triple {4086#false} assume !false; {4086#false} is VALID [2022-04-28 03:44:18,227 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:44:18,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:44:18,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064269577] [2022-04-28 03:44:18,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064269577] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:44:18,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [121448053] [2022-04-28 03:44:18,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:44:18,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:44:18,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:44:18,229 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:44:18,229 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:44:18,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:44:18,259 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-28 03:44:18,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:44:18,265 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:44:18,339 INFO L272 TraceCheckUtils]: 0: Hoare triple {4085#true} call ULTIMATE.init(); {4085#true} is VALID [2022-04-28 03:44:18,339 INFO L290 TraceCheckUtils]: 1: Hoare triple {4085#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4085#true} is VALID [2022-04-28 03:44:18,339 INFO L290 TraceCheckUtils]: 2: Hoare triple {4085#true} assume true; {4085#true} is VALID [2022-04-28 03:44:18,339 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4085#true} {4085#true} #83#return; {4085#true} is VALID [2022-04-28 03:44:18,339 INFO L272 TraceCheckUtils]: 4: Hoare triple {4085#true} call #t~ret15 := main(); {4085#true} is VALID [2022-04-28 03:44:18,339 INFO L290 TraceCheckUtils]: 5: Hoare triple {4085#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4085#true} is VALID [2022-04-28 03:44:18,340 INFO L290 TraceCheckUtils]: 6: Hoare triple {4085#true} [107] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_46| |v_main_#t~post5_45|)) (.cse2 (= v_main_~y~0_86 v_main_~y~0_85)) (.cse3 (= |v_main_#t~post6_46| |v_main_#t~post6_45|)) (.cse1 (mod v_main_~x~0_105 4294967296))) (or (and (= v_main_~x~0_104 v_main_~x~0_105) .cse0 (<= .cse1 0) .cse2 .cse3) (and .cse0 .cse2 (= v_main_~x~0_105 v_main_~x~0_104) .cse3) (and (< v_main_~y~0_86 v_main_~y~0_85) (< 0 .cse1) (forall ((v_it_11 Int)) (or (< 0 (mod (+ v_main_~x~0_105 (* 4294967295 v_it_11)) 4294967296)) (not (<= 1 v_it_11)) (not (<= (+ v_main_~y~0_86 v_it_11 1) v_main_~y~0_85)))) (= v_main_~x~0_104 (+ v_main_~x~0_105 v_main_~y~0_86 (* (- 1) v_main_~y~0_85)))))) InVars {main_~y~0=v_main_~y~0_86, main_#t~post5=|v_main_#t~post5_46|, main_~x~0=v_main_~x~0_105, main_#t~post6=|v_main_#t~post6_46|} OutVars{main_~y~0=v_main_~y~0_85, main_#t~post5=|v_main_#t~post5_45|, main_~x~0=v_main_~x~0_104, main_#t~post6=|v_main_#t~post6_45|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {4085#true} is VALID [2022-04-28 03:44:18,340 INFO L290 TraceCheckUtils]: 7: Hoare triple {4085#true} [106] 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[] {4085#true} is VALID [2022-04-28 03:44:18,340 INFO L290 TraceCheckUtils]: 8: Hoare triple {4085#true} ~z~0 := ~y~0; {4122#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 03:44:18,340 INFO L290 TraceCheckUtils]: 9: Hoare triple {4122#(= 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; {4126#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-28 03:44:18,341 INFO L290 TraceCheckUtils]: 10: Hoare triple {4126#(= 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; {4130#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 03:44:18,341 INFO L290 TraceCheckUtils]: 11: Hoare triple {4130#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~z~0 % 4294967296 > 0); {4130#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 03:44:18,342 INFO L290 TraceCheckUtils]: 12: Hoare triple {4130#(< 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; {4137#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:44:18,343 INFO L290 TraceCheckUtils]: 13: Hoare triple {4137#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {4086#false} is VALID [2022-04-28 03:44:18,343 INFO L290 TraceCheckUtils]: 14: Hoare triple {4086#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; {4086#false} is VALID [2022-04-28 03:44:18,343 INFO L290 TraceCheckUtils]: 15: Hoare triple {4086#false} assume !(~x~0 % 4294967296 > 0); {4086#false} is VALID [2022-04-28 03:44:18,351 INFO L290 TraceCheckUtils]: 16: Hoare triple {4086#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {4086#false} is VALID [2022-04-28 03:44:18,351 INFO L290 TraceCheckUtils]: 17: Hoare triple {4086#false} assume !(~z~0 % 4294967296 > 0); {4086#false} is VALID [2022-04-28 03:44:18,351 INFO L272 TraceCheckUtils]: 18: Hoare triple {4086#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {4086#false} is VALID [2022-04-28 03:44:18,351 INFO L290 TraceCheckUtils]: 19: Hoare triple {4086#false} ~cond := #in~cond; {4086#false} is VALID [2022-04-28 03:44:18,351 INFO L290 TraceCheckUtils]: 20: Hoare triple {4086#false} assume 0 == ~cond; {4086#false} is VALID [2022-04-28 03:44:18,351 INFO L290 TraceCheckUtils]: 21: Hoare triple {4086#false} assume !false; {4086#false} is VALID [2022-04-28 03:44:18,351 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:44:18,351 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:44:18,444 INFO L290 TraceCheckUtils]: 21: Hoare triple {4086#false} assume !false; {4086#false} is VALID [2022-04-28 03:44:18,444 INFO L290 TraceCheckUtils]: 20: Hoare triple {4086#false} assume 0 == ~cond; {4086#false} is VALID [2022-04-28 03:44:18,444 INFO L290 TraceCheckUtils]: 19: Hoare triple {4086#false} ~cond := #in~cond; {4086#false} is VALID [2022-04-28 03:44:18,444 INFO L272 TraceCheckUtils]: 18: Hoare triple {4086#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {4086#false} is VALID [2022-04-28 03:44:18,444 INFO L290 TraceCheckUtils]: 17: Hoare triple {4086#false} assume !(~z~0 % 4294967296 > 0); {4086#false} is VALID [2022-04-28 03:44:18,445 INFO L290 TraceCheckUtils]: 16: Hoare triple {4086#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {4086#false} is VALID [2022-04-28 03:44:18,445 INFO L290 TraceCheckUtils]: 15: Hoare triple {4086#false} assume !(~x~0 % 4294967296 > 0); {4086#false} is VALID [2022-04-28 03:44:18,445 INFO L290 TraceCheckUtils]: 14: Hoare triple {4086#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; {4086#false} is VALID [2022-04-28 03:44:18,445 INFO L290 TraceCheckUtils]: 13: Hoare triple {4137#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {4086#false} is VALID [2022-04-28 03:44:18,447 INFO L290 TraceCheckUtils]: 12: Hoare triple {4130#(< 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; {4137#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:44:18,447 INFO L290 TraceCheckUtils]: 11: Hoare triple {4130#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} assume !(~z~0 % 4294967296 > 0); {4130#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 03:44:18,447 INFO L290 TraceCheckUtils]: 10: Hoare triple {4198#(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; {4130#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 03:44:18,449 INFO L290 TraceCheckUtils]: 9: Hoare triple {4202#(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; {4198#(or (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (not (< 0 (mod main_~z~0 4294967296))))} is VALID [2022-04-28 03:44:18,449 INFO L290 TraceCheckUtils]: 8: Hoare triple {4085#true} ~z~0 := ~y~0; {4202#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 03:44:18,449 INFO L290 TraceCheckUtils]: 7: Hoare triple {4085#true} [106] 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[] {4085#true} is VALID [2022-04-28 03:44:18,449 INFO L290 TraceCheckUtils]: 6: Hoare triple {4085#true} [107] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_46| |v_main_#t~post5_45|)) (.cse2 (= v_main_~y~0_86 v_main_~y~0_85)) (.cse3 (= |v_main_#t~post6_46| |v_main_#t~post6_45|)) (.cse1 (mod v_main_~x~0_105 4294967296))) (or (and (= v_main_~x~0_104 v_main_~x~0_105) .cse0 (<= .cse1 0) .cse2 .cse3) (and .cse0 .cse2 (= v_main_~x~0_105 v_main_~x~0_104) .cse3) (and (< v_main_~y~0_86 v_main_~y~0_85) (< 0 .cse1) (forall ((v_it_11 Int)) (or (< 0 (mod (+ v_main_~x~0_105 (* 4294967295 v_it_11)) 4294967296)) (not (<= 1 v_it_11)) (not (<= (+ v_main_~y~0_86 v_it_11 1) v_main_~y~0_85)))) (= v_main_~x~0_104 (+ v_main_~x~0_105 v_main_~y~0_86 (* (- 1) v_main_~y~0_85)))))) InVars {main_~y~0=v_main_~y~0_86, main_#t~post5=|v_main_#t~post5_46|, main_~x~0=v_main_~x~0_105, main_#t~post6=|v_main_#t~post6_46|} OutVars{main_~y~0=v_main_~y~0_85, main_#t~post5=|v_main_#t~post5_45|, main_~x~0=v_main_~x~0_104, main_#t~post6=|v_main_#t~post6_45|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {4085#true} is VALID [2022-04-28 03:44:18,449 INFO L290 TraceCheckUtils]: 5: Hoare triple {4085#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4085#true} is VALID [2022-04-28 03:44:18,449 INFO L272 TraceCheckUtils]: 4: Hoare triple {4085#true} call #t~ret15 := main(); {4085#true} is VALID [2022-04-28 03:44:18,449 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4085#true} {4085#true} #83#return; {4085#true} is VALID [2022-04-28 03:44:18,449 INFO L290 TraceCheckUtils]: 2: Hoare triple {4085#true} assume true; {4085#true} is VALID [2022-04-28 03:44:18,449 INFO L290 TraceCheckUtils]: 1: Hoare triple {4085#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4085#true} is VALID [2022-04-28 03:44:18,450 INFO L272 TraceCheckUtils]: 0: Hoare triple {4085#true} call ULTIMATE.init(); {4085#true} is VALID [2022-04-28 03:44:18,450 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:44:18,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [121448053] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:44:18,450 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:44:18,450 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 13 [2022-04-28 03:44:18,506 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:44:18,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1907330215] [2022-04-28 03:44:18,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1907330215] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:44:18,506 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:44:18,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 03:44:18,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825986198] [2022-04-28 03:44:18,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:44:18,507 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 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:44:18,507 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:44:18,507 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 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:44:18,533 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:44:18,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 03:44:18,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:44:18,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 03:44:18,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-04-28 03:44:18,533 INFO L87 Difference]: Start difference. First operand 41 states and 53 transitions. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 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:44:19,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:44:19,167 INFO L93 Difference]: Finished difference Result 85 states and 122 transitions. [2022-04-28 03:44:19,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 03:44:19,167 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 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:44:19,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:44:19,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 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:44:19,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 70 transitions. [2022-04-28 03:44:19,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 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:44:19,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 70 transitions. [2022-04-28 03:44:19,169 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 70 transitions. [2022-04-28 03:44:19,251 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:44:19,252 INFO L225 Difference]: With dead ends: 85 [2022-04-28 03:44:19,252 INFO L226 Difference]: Without dead ends: 75 [2022-04-28 03:44:19,253 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2022-04-28 03:44:19,253 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 55 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:44:19,253 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 47 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 03:44:19,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-04-28 03:44:19,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 56. [2022-04-28 03:44:19,403 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:44:19,404 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 states. Second operand has 56 states, 51 states have (on average 1.3725490196078431) internal successors, (70), 51 states have internal predecessors, (70), 3 states have call successors, (3), 3 states have 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:44:19,404 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand has 56 states, 51 states have (on average 1.3725490196078431) internal successors, (70), 51 states have internal predecessors, (70), 3 states have call successors, (3), 3 states have 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:44:19,404 INFO L87 Difference]: Start difference. First operand 75 states. Second operand has 56 states, 51 states have (on average 1.3725490196078431) internal successors, (70), 51 states have internal predecessors, (70), 3 states have call successors, (3), 3 states have 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:44:19,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:44:19,405 INFO L93 Difference]: Finished difference Result 75 states and 102 transitions. [2022-04-28 03:44:19,405 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 102 transitions. [2022-04-28 03:44:19,405 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:44:19,405 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:44:19,405 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 51 states have (on average 1.3725490196078431) internal successors, (70), 51 states have internal predecessors, (70), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 75 states. [2022-04-28 03:44:19,405 INFO L87 Difference]: Start difference. First operand has 56 states, 51 states have (on average 1.3725490196078431) internal successors, (70), 51 states have internal predecessors, (70), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 75 states. [2022-04-28 03:44:19,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:44:19,406 INFO L93 Difference]: Finished difference Result 75 states and 102 transitions. [2022-04-28 03:44:19,406 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 102 transitions. [2022-04-28 03:44:19,407 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:44:19,407 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:44:19,407 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:44:19,407 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:44:19,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 51 states have (on average 1.3725490196078431) internal successors, (70), 51 states have internal predecessors, (70), 3 states have call successors, (3), 3 states have 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:44:19,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 74 transitions. [2022-04-28 03:44:19,408 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 74 transitions. Word has length 22 [2022-04-28 03:44:19,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:44:19,408 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 74 transitions. [2022-04-28 03:44:19,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 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:44:19,408 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 56 states and 74 transitions. [2022-04-28 03:44:25,767 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 71 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-28 03:44:25,767 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 74 transitions. [2022-04-28 03:44:25,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 03:44:25,767 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:44:25,768 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:44:25,783 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-04-28 03:44:25,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:44:25,968 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:44:25,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:44:25,969 INFO L85 PathProgramCache]: Analyzing trace with hash 835661327, now seen corresponding path program 4 times [2022-04-28 03:44:25,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:44:25,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [245843565] [2022-04-28 03:44:26,212 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:44:26,213 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:44:26,215 INFO L85 PathProgramCache]: Analyzing trace with hash 1312749486, now seen corresponding path program 1 times [2022-04-28 03:44:26,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:44:26,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188664956] [2022-04-28 03:44:26,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:44:26,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:44:26,229 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:44:26,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:44:26,237 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:44:26,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:44:26,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:44:26,292 INFO L290 TraceCheckUtils]: 0: Hoare triple {4686#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4677#true} is VALID [2022-04-28 03:44:26,292 INFO L290 TraceCheckUtils]: 1: Hoare triple {4677#true} assume true; {4677#true} is VALID [2022-04-28 03:44:26,292 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4677#true} {4677#true} #83#return; {4677#true} is VALID [2022-04-28 03:44:26,293 INFO L272 TraceCheckUtils]: 0: Hoare triple {4677#true} call ULTIMATE.init(); {4686#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:44:26,293 INFO L290 TraceCheckUtils]: 1: Hoare triple {4686#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4677#true} is VALID [2022-04-28 03:44:26,293 INFO L290 TraceCheckUtils]: 2: Hoare triple {4677#true} assume true; {4677#true} is VALID [2022-04-28 03:44:26,293 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4677#true} {4677#true} #83#return; {4677#true} is VALID [2022-04-28 03:44:26,293 INFO L272 TraceCheckUtils]: 4: Hoare triple {4677#true} call #t~ret15 := main(); {4677#true} is VALID [2022-04-28 03:44:26,293 INFO L290 TraceCheckUtils]: 5: Hoare triple {4677#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4677#true} is VALID [2022-04-28 03:44:26,293 INFO L290 TraceCheckUtils]: 6: Hoare triple {4677#true} [109] L16-2-->L16-3_primed: Formula: (let ((.cse3 (mod v_main_~x~0_116 4294967296)) (.cse0 (= v_main_~y~0_96 v_main_~y~0_95)) (.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_~x~0_116 v_main_~x~0_115))) (or (and .cse0 .cse1 .cse2 (<= .cse3 0) .cse4) (and (forall ((v_it_12 Int)) (or (< 0 (mod (+ v_main_~x~0_116 (* 4294967295 v_it_12)) 4294967296)) (not (<= (+ v_main_~x~0_115 v_it_12 1) v_main_~x~0_116)) (not (<= 1 v_it_12)))) (< 0 .cse3) (= v_main_~y~0_95 (+ v_main_~x~0_116 v_main_~y~0_96 (* v_main_~x~0_115 (- 1)))) (< v_main_~x~0_115 v_main_~x~0_116)) (and .cse0 .cse1 .cse2 .cse4))) InVars {main_~y~0=v_main_~y~0_96, main_#t~post5=|v_main_#t~post5_51|, main_~x~0=v_main_~x~0_116, main_#t~post6=|v_main_#t~post6_51|} OutVars{main_~y~0=v_main_~y~0_95, main_#t~post5=|v_main_#t~post5_50|, main_~x~0=v_main_~x~0_115, main_#t~post6=|v_main_#t~post6_50|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {4677#true} is VALID [2022-04-28 03:44:26,293 INFO L290 TraceCheckUtils]: 7: Hoare triple {4677#true} [108] 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[] {4677#true} is VALID [2022-04-28 03:44:26,294 INFO L290 TraceCheckUtils]: 8: Hoare triple {4677#true} ~z~0 := ~y~0; {4682#(= (+ main_~z~0 (* (- 1) main_~y~0)) 0)} is VALID [2022-04-28 03:44:26,294 INFO L290 TraceCheckUtils]: 9: Hoare triple {4682#(= (+ 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; {4683#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-28 03:44:26,295 INFO L290 TraceCheckUtils]: 10: Hoare triple {4683#(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; {4684#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-28 03:44:26,296 INFO L290 TraceCheckUtils]: 11: Hoare triple {4684#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !(~z~0 % 4294967296 > 0); {4684#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-28 03:44:26,297 INFO L290 TraceCheckUtils]: 12: Hoare triple {4684#(<= 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; {4685#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-28 03:44:26,297 INFO L290 TraceCheckUtils]: 13: Hoare triple {4685#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {4678#false} is VALID [2022-04-28 03:44:26,297 INFO L290 TraceCheckUtils]: 14: Hoare triple {4678#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; {4678#false} is VALID [2022-04-28 03:44:26,297 INFO L290 TraceCheckUtils]: 15: Hoare triple {4678#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; {4678#false} is VALID [2022-04-28 03:44:26,297 INFO L290 TraceCheckUtils]: 16: Hoare triple {4678#false} assume !(~x~0 % 4294967296 > 0); {4678#false} is VALID [2022-04-28 03:44:26,297 INFO L290 TraceCheckUtils]: 17: Hoare triple {4678#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {4678#false} is VALID [2022-04-28 03:44:26,298 INFO L290 TraceCheckUtils]: 18: Hoare triple {4678#false} assume !(~z~0 % 4294967296 > 0); {4678#false} is VALID [2022-04-28 03:44:26,298 INFO L272 TraceCheckUtils]: 19: Hoare triple {4678#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {4678#false} is VALID [2022-04-28 03:44:26,298 INFO L290 TraceCheckUtils]: 20: Hoare triple {4678#false} ~cond := #in~cond; {4678#false} is VALID [2022-04-28 03:44:26,298 INFO L290 TraceCheckUtils]: 21: Hoare triple {4678#false} assume 0 == ~cond; {4678#false} is VALID [2022-04-28 03:44:26,298 INFO L290 TraceCheckUtils]: 22: Hoare triple {4678#false} assume !false; {4678#false} is VALID [2022-04-28 03:44:26,298 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 03:44:26,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:44:26,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188664956] [2022-04-28 03:44:26,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188664956] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:44:26,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1377561190] [2022-04-28 03:44:26,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:44:26,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:44:26,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:44:26,299 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:44:26,300 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:44:26,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:44:26,330 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-28 03:44:26,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:44:26,336 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:44:26,679 INFO L272 TraceCheckUtils]: 0: Hoare triple {4677#true} call ULTIMATE.init(); {4677#true} is VALID [2022-04-28 03:44:26,679 INFO L290 TraceCheckUtils]: 1: Hoare triple {4677#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4677#true} is VALID [2022-04-28 03:44:26,680 INFO L290 TraceCheckUtils]: 2: Hoare triple {4677#true} assume true; {4677#true} is VALID [2022-04-28 03:44:26,680 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4677#true} {4677#true} #83#return; {4677#true} is VALID [2022-04-28 03:44:26,680 INFO L272 TraceCheckUtils]: 4: Hoare triple {4677#true} call #t~ret15 := main(); {4677#true} is VALID [2022-04-28 03:44:26,680 INFO L290 TraceCheckUtils]: 5: Hoare triple {4677#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4677#true} is VALID [2022-04-28 03:44:26,680 INFO L290 TraceCheckUtils]: 6: Hoare triple {4677#true} [109] L16-2-->L16-3_primed: Formula: (let ((.cse3 (mod v_main_~x~0_116 4294967296)) (.cse0 (= v_main_~y~0_96 v_main_~y~0_95)) (.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_~x~0_116 v_main_~x~0_115))) (or (and .cse0 .cse1 .cse2 (<= .cse3 0) .cse4) (and (forall ((v_it_12 Int)) (or (< 0 (mod (+ v_main_~x~0_116 (* 4294967295 v_it_12)) 4294967296)) (not (<= (+ v_main_~x~0_115 v_it_12 1) v_main_~x~0_116)) (not (<= 1 v_it_12)))) (< 0 .cse3) (= v_main_~y~0_95 (+ v_main_~x~0_116 v_main_~y~0_96 (* v_main_~x~0_115 (- 1)))) (< v_main_~x~0_115 v_main_~x~0_116)) (and .cse0 .cse1 .cse2 .cse4))) InVars {main_~y~0=v_main_~y~0_96, main_#t~post5=|v_main_#t~post5_51|, main_~x~0=v_main_~x~0_116, main_#t~post6=|v_main_#t~post6_51|} OutVars{main_~y~0=v_main_~y~0_95, main_#t~post5=|v_main_#t~post5_50|, main_~x~0=v_main_~x~0_115, main_#t~post6=|v_main_#t~post6_50|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {4677#true} is VALID [2022-04-28 03:44:26,680 INFO L290 TraceCheckUtils]: 7: Hoare triple {4677#true} [108] 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[] {4677#true} is VALID [2022-04-28 03:44:26,681 INFO L290 TraceCheckUtils]: 8: Hoare triple {4677#true} ~z~0 := ~y~0; {4682#(= (+ main_~z~0 (* (- 1) main_~y~0)) 0)} is VALID [2022-04-28 03:44:26,681 INFO L290 TraceCheckUtils]: 9: Hoare triple {4682#(= (+ 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; {4683#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-28 03:44:26,683 INFO L290 TraceCheckUtils]: 10: Hoare triple {4683#(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; {4684#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-28 03:44:26,683 INFO L290 TraceCheckUtils]: 11: Hoare triple {4684#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !(~z~0 % 4294967296 > 0); {4684#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-28 03:44:26,685 INFO L290 TraceCheckUtils]: 12: Hoare triple {4684#(<= 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; {4685#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-28 03:44:26,686 INFO L290 TraceCheckUtils]: 13: Hoare triple {4685#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {4678#false} is VALID [2022-04-28 03:44:26,686 INFO L290 TraceCheckUtils]: 14: Hoare triple {4678#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; {4678#false} is VALID [2022-04-28 03:44:26,686 INFO L290 TraceCheckUtils]: 15: Hoare triple {4678#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; {4678#false} is VALID [2022-04-28 03:44:26,686 INFO L290 TraceCheckUtils]: 16: Hoare triple {4678#false} assume !(~x~0 % 4294967296 > 0); {4678#false} is VALID [2022-04-28 03:44:26,686 INFO L290 TraceCheckUtils]: 17: Hoare triple {4678#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {4678#false} is VALID [2022-04-28 03:44:26,686 INFO L290 TraceCheckUtils]: 18: Hoare triple {4678#false} assume !(~z~0 % 4294967296 > 0); {4678#false} is VALID [2022-04-28 03:44:26,686 INFO L272 TraceCheckUtils]: 19: Hoare triple {4678#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {4678#false} is VALID [2022-04-28 03:44:26,686 INFO L290 TraceCheckUtils]: 20: Hoare triple {4678#false} ~cond := #in~cond; {4678#false} is VALID [2022-04-28 03:44:26,686 INFO L290 TraceCheckUtils]: 21: Hoare triple {4678#false} assume 0 == ~cond; {4678#false} is VALID [2022-04-28 03:44:26,686 INFO L290 TraceCheckUtils]: 22: Hoare triple {4678#false} assume !false; {4678#false} is VALID [2022-04-28 03:44:26,686 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 03:44:26,686 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:44:26,905 INFO L290 TraceCheckUtils]: 22: Hoare triple {4678#false} assume !false; {4678#false} is VALID [2022-04-28 03:44:26,905 INFO L290 TraceCheckUtils]: 21: Hoare triple {4678#false} assume 0 == ~cond; {4678#false} is VALID [2022-04-28 03:44:26,905 INFO L290 TraceCheckUtils]: 20: Hoare triple {4678#false} ~cond := #in~cond; {4678#false} is VALID [2022-04-28 03:44:26,905 INFO L272 TraceCheckUtils]: 19: Hoare triple {4678#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {4678#false} is VALID [2022-04-28 03:44:26,905 INFO L290 TraceCheckUtils]: 18: Hoare triple {4678#false} assume !(~z~0 % 4294967296 > 0); {4678#false} is VALID [2022-04-28 03:44:26,905 INFO L290 TraceCheckUtils]: 17: Hoare triple {4678#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {4678#false} is VALID [2022-04-28 03:44:26,905 INFO L290 TraceCheckUtils]: 16: Hoare triple {4678#false} assume !(~x~0 % 4294967296 > 0); {4678#false} is VALID [2022-04-28 03:44:26,905 INFO L290 TraceCheckUtils]: 15: Hoare triple {4678#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; {4678#false} is VALID [2022-04-28 03:44:26,905 INFO L290 TraceCheckUtils]: 14: Hoare triple {4678#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; {4678#false} is VALID [2022-04-28 03:44:26,906 INFO L290 TraceCheckUtils]: 13: Hoare triple {4685#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {4678#false} is VALID [2022-04-28 03:44:26,907 INFO L290 TraceCheckUtils]: 12: Hoare triple {4684#(<= 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; {4685#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-28 03:44:26,907 INFO L290 TraceCheckUtils]: 11: Hoare triple {4684#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} assume !(~z~0 % 4294967296 > 0); {4684#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-28 03:44:26,908 INFO L290 TraceCheckUtils]: 10: Hoare triple {4792#(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; {4684#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-28 03:44:26,909 INFO L290 TraceCheckUtils]: 9: Hoare triple {4796#(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; {4792#(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:44:26,909 INFO L290 TraceCheckUtils]: 8: Hoare triple {4677#true} ~z~0 := ~y~0; {4796#(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:44:26,910 INFO L290 TraceCheckUtils]: 7: Hoare triple {4677#true} [108] 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[] {4677#true} is VALID [2022-04-28 03:44:26,910 INFO L290 TraceCheckUtils]: 6: Hoare triple {4677#true} [109] L16-2-->L16-3_primed: Formula: (let ((.cse3 (mod v_main_~x~0_116 4294967296)) (.cse0 (= v_main_~y~0_96 v_main_~y~0_95)) (.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_~x~0_116 v_main_~x~0_115))) (or (and .cse0 .cse1 .cse2 (<= .cse3 0) .cse4) (and (forall ((v_it_12 Int)) (or (< 0 (mod (+ v_main_~x~0_116 (* 4294967295 v_it_12)) 4294967296)) (not (<= (+ v_main_~x~0_115 v_it_12 1) v_main_~x~0_116)) (not (<= 1 v_it_12)))) (< 0 .cse3) (= v_main_~y~0_95 (+ v_main_~x~0_116 v_main_~y~0_96 (* v_main_~x~0_115 (- 1)))) (< v_main_~x~0_115 v_main_~x~0_116)) (and .cse0 .cse1 .cse2 .cse4))) InVars {main_~y~0=v_main_~y~0_96, main_#t~post5=|v_main_#t~post5_51|, main_~x~0=v_main_~x~0_116, main_#t~post6=|v_main_#t~post6_51|} OutVars{main_~y~0=v_main_~y~0_95, main_#t~post5=|v_main_#t~post5_50|, main_~x~0=v_main_~x~0_115, main_#t~post6=|v_main_#t~post6_50|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {4677#true} is VALID [2022-04-28 03:44:26,910 INFO L290 TraceCheckUtils]: 5: Hoare triple {4677#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {4677#true} is VALID [2022-04-28 03:44:26,910 INFO L272 TraceCheckUtils]: 4: Hoare triple {4677#true} call #t~ret15 := main(); {4677#true} is VALID [2022-04-28 03:44:26,910 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4677#true} {4677#true} #83#return; {4677#true} is VALID [2022-04-28 03:44:26,910 INFO L290 TraceCheckUtils]: 2: Hoare triple {4677#true} assume true; {4677#true} is VALID [2022-04-28 03:44:26,910 INFO L290 TraceCheckUtils]: 1: Hoare triple {4677#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {4677#true} is VALID [2022-04-28 03:44:26,910 INFO L272 TraceCheckUtils]: 0: Hoare triple {4677#true} call ULTIMATE.init(); {4677#true} is VALID [2022-04-28 03:44:26,910 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 03:44:26,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1377561190] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:44:26,910 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:44:26,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 9 [2022-04-28 03:44:26,973 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:44:26,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [245843565] [2022-04-28 03:44:26,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [245843565] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:44:26,973 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:44:26,973 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 03:44:26,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276119856] [2022-04-28 03:44:26,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:44:26,973 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 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:44:26,973 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:44:26,974 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 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:44:26,991 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:44:26,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 03:44:26,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:44:26,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 03:44:26,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-04-28 03:44:26,992 INFO L87 Difference]: Start difference. First operand 56 states and 74 transitions. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 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:44:27,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:44:27,527 INFO L93 Difference]: Finished difference Result 68 states and 89 transitions. [2022-04-28 03:44:27,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 03:44:27,527 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 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:44:27,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:44:27,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 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:44:27,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 46 transitions. [2022-04-28 03:44:27,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 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:44:27,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 46 transitions. [2022-04-28 03:44:27,538 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 46 transitions. [2022-04-28 03:44:27,579 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:44:27,580 INFO L225 Difference]: With dead ends: 68 [2022-04-28 03:44:27,580 INFO L226 Difference]: Without dead ends: 43 [2022-04-28 03:44:27,580 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 51 SyntacticMatches, 7 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2022-04-28 03:44:27,581 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 26 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:44:27,581 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 45 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 03:44:27,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-28 03:44:27,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 36. [2022-04-28 03:44:27,677 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:44:27,677 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 36 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 31 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have 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:44:27,677 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 36 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 31 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have 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:44:27,678 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 36 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 31 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have 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:44:27,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:44:27,678 INFO L93 Difference]: Finished difference Result 43 states and 56 transitions. [2022-04-28 03:44:27,678 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 56 transitions. [2022-04-28 03:44:27,678 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:44:27,678 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:44:27,679 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 31 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 43 states. [2022-04-28 03:44:27,679 INFO L87 Difference]: Start difference. First operand has 36 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 31 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 43 states. [2022-04-28 03:44:27,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:44:27,679 INFO L93 Difference]: Finished difference Result 43 states and 56 transitions. [2022-04-28 03:44:27,679 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 56 transitions. [2022-04-28 03:44:27,679 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:44:27,679 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:44:27,679 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:44:27,679 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:44:27,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 31 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have 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:44:27,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 45 transitions. [2022-04-28 03:44:27,680 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 45 transitions. Word has length 23 [2022-04-28 03:44:27,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:44:27,680 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 45 transitions. [2022-04-28 03:44:27,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 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:44:27,680 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 45 transitions. [2022-04-28 03:44:32,381 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 43 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-28 03:44:32,381 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 45 transitions. [2022-04-28 03:44:32,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-28 03:44:32,381 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:44:32,381 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:44:32,397 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:44:32,582 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,SelfDestructingSolverStorable15 [2022-04-28 03:44:32,582 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:44:32,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:44:32,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1227757058, now seen corresponding path program 3 times [2022-04-28 03:44:32,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:44:32,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [245401982] [2022-04-28 03:44:36,161 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:44:36,237 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:44:36,238 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:44:36,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1735206158, now seen corresponding path program 1 times [2022-04-28 03:44:36,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:44:36,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925974503] [2022-04-28 03:44:36,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:44:36,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:44:36,248 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:44:36,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:44:36,258 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:44:36,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:44:36,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:44:36,306 INFO L290 TraceCheckUtils]: 0: Hoare triple {5146#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5137#true} is VALID [2022-04-28 03:44:36,306 INFO L290 TraceCheckUtils]: 1: Hoare triple {5137#true} assume true; {5137#true} is VALID [2022-04-28 03:44:36,306 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5137#true} {5137#true} #83#return; {5137#true} is VALID [2022-04-28 03:44:36,307 INFO L272 TraceCheckUtils]: 0: Hoare triple {5137#true} call ULTIMATE.init(); {5146#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:44:36,307 INFO L290 TraceCheckUtils]: 1: Hoare triple {5146#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5137#true} is VALID [2022-04-28 03:44:36,307 INFO L290 TraceCheckUtils]: 2: Hoare triple {5137#true} assume true; {5137#true} is VALID [2022-04-28 03:44:36,307 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5137#true} {5137#true} #83#return; {5137#true} is VALID [2022-04-28 03:44:36,307 INFO L272 TraceCheckUtils]: 4: Hoare triple {5137#true} call #t~ret15 := main(); {5137#true} is VALID [2022-04-28 03:44:36,307 INFO L290 TraceCheckUtils]: 5: Hoare triple {5137#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5137#true} is VALID [2022-04-28 03:44:36,307 INFO L290 TraceCheckUtils]: 6: Hoare triple {5137#true} [111] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_128 v_main_~x~0_127)) (.cse1 (= |v_main_#t~post6_56| |v_main_#t~post6_55|)) (.cse4 (mod v_main_~x~0_128 4294967296)) (.cse2 (= v_main_~y~0_107 v_main_~y~0_106)) (.cse3 (= |v_main_#t~post5_56| |v_main_#t~post5_55|))) (or (and .cse0 .cse1 .cse2 .cse3) (and (= v_main_~y~0_106 (+ v_main_~x~0_128 v_main_~y~0_107 (* v_main_~x~0_127 (- 1)))) (forall ((v_it_13 Int)) (or (not (<= (+ v_main_~x~0_127 v_it_13 1) v_main_~x~0_128)) (not (<= 1 v_it_13)) (< 0 (mod (+ v_main_~x~0_128 (* 4294967295 v_it_13)) 4294967296)))) (< v_main_~x~0_127 v_main_~x~0_128) (< 0 .cse4)) (and .cse0 .cse1 (<= .cse4 0) .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_107, main_#t~post5=|v_main_#t~post5_56|, main_~x~0=v_main_~x~0_128, main_#t~post6=|v_main_#t~post6_56|} OutVars{main_~y~0=v_main_~y~0_106, main_#t~post5=|v_main_#t~post5_55|, main_~x~0=v_main_~x~0_127, main_#t~post6=|v_main_#t~post6_55|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {5137#true} is VALID [2022-04-28 03:44:36,307 INFO L290 TraceCheckUtils]: 7: Hoare triple {5137#true} [110] 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[] {5137#true} is VALID [2022-04-28 03:44:36,307 INFO L290 TraceCheckUtils]: 8: Hoare triple {5137#true} ~z~0 := ~y~0; {5137#true} is VALID [2022-04-28 03:44:36,308 INFO L290 TraceCheckUtils]: 9: Hoare triple {5137#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5142#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-28 03:44:36,310 INFO L290 TraceCheckUtils]: 10: Hoare triple {5142#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5143#(<= main_~z~0 (+ (* (div main_~z~0 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 03:44:36,310 INFO L290 TraceCheckUtils]: 11: Hoare triple {5143#(<= main_~z~0 (+ (* (div main_~z~0 4294967296) 4294967296) 4294967293))} assume !(~z~0 % 4294967296 > 0); {5143#(<= main_~z~0 (+ (* (div main_~z~0 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 03:44:36,311 INFO L290 TraceCheckUtils]: 12: Hoare triple {5143#(<= main_~z~0 (+ (* (div main_~z~0 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; {5144#(<= main_~z~0 (+ 4294967294 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-28 03:44:36,312 INFO L290 TraceCheckUtils]: 13: Hoare triple {5144#(<= main_~z~0 (+ 4294967294 (* 4294967296 (div (+ (- 1) main_~z~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; {5145#(<= (+ 2 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-28 03:44:36,312 INFO L290 TraceCheckUtils]: 14: Hoare triple {5145#(<= (+ 2 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} assume !(~y~0 % 4294967296 > 0); {5145#(<= (+ 2 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-28 03:44:36,312 INFO L290 TraceCheckUtils]: 15: Hoare triple {5145#(<= (+ 2 (* (div main_~z~0 4294967296) 4294967296)) main_~z~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; {5145#(<= (+ 2 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-28 03:44:36,313 INFO L290 TraceCheckUtils]: 16: Hoare triple {5145#(<= (+ 2 (* (div main_~z~0 4294967296) 4294967296)) main_~z~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; {5145#(<= (+ 2 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-28 03:44:36,313 INFO L290 TraceCheckUtils]: 17: Hoare triple {5145#(<= (+ 2 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} assume !(~x~0 % 4294967296 > 0); {5145#(<= (+ 2 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-28 03:44:36,314 INFO L290 TraceCheckUtils]: 18: Hoare triple {5145#(<= (+ 2 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} assume !(~z~0 % 4294967296 > 0); {5138#false} is VALID [2022-04-28 03:44:36,314 INFO L272 TraceCheckUtils]: 19: Hoare triple {5138#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {5138#false} is VALID [2022-04-28 03:44:36,314 INFO L290 TraceCheckUtils]: 20: Hoare triple {5138#false} ~cond := #in~cond; {5138#false} is VALID [2022-04-28 03:44:36,314 INFO L290 TraceCheckUtils]: 21: Hoare triple {5138#false} assume 0 == ~cond; {5138#false} is VALID [2022-04-28 03:44:36,314 INFO L290 TraceCheckUtils]: 22: Hoare triple {5138#false} assume !false; {5138#false} is VALID [2022-04-28 03:44:36,314 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 03:44:36,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:44:36,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925974503] [2022-04-28 03:44:36,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925974503] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:44:36,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [845579880] [2022-04-28 03:44:36,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:44:36,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:44:36,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:44:36,315 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:44:36,316 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:44:36,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:44:36,358 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-28 03:44:36,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:44:36,364 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:44:36,586 INFO L272 TraceCheckUtils]: 0: Hoare triple {5137#true} call ULTIMATE.init(); {5137#true} is VALID [2022-04-28 03:44:36,586 INFO L290 TraceCheckUtils]: 1: Hoare triple {5137#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5137#true} is VALID [2022-04-28 03:44:36,586 INFO L290 TraceCheckUtils]: 2: Hoare triple {5137#true} assume true; {5137#true} is VALID [2022-04-28 03:44:36,586 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5137#true} {5137#true} #83#return; {5137#true} is VALID [2022-04-28 03:44:36,586 INFO L272 TraceCheckUtils]: 4: Hoare triple {5137#true} call #t~ret15 := main(); {5137#true} is VALID [2022-04-28 03:44:36,586 INFO L290 TraceCheckUtils]: 5: Hoare triple {5137#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5137#true} is VALID [2022-04-28 03:44:36,586 INFO L290 TraceCheckUtils]: 6: Hoare triple {5137#true} [111] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_128 v_main_~x~0_127)) (.cse1 (= |v_main_#t~post6_56| |v_main_#t~post6_55|)) (.cse4 (mod v_main_~x~0_128 4294967296)) (.cse2 (= v_main_~y~0_107 v_main_~y~0_106)) (.cse3 (= |v_main_#t~post5_56| |v_main_#t~post5_55|))) (or (and .cse0 .cse1 .cse2 .cse3) (and (= v_main_~y~0_106 (+ v_main_~x~0_128 v_main_~y~0_107 (* v_main_~x~0_127 (- 1)))) (forall ((v_it_13 Int)) (or (not (<= (+ v_main_~x~0_127 v_it_13 1) v_main_~x~0_128)) (not (<= 1 v_it_13)) (< 0 (mod (+ v_main_~x~0_128 (* 4294967295 v_it_13)) 4294967296)))) (< v_main_~x~0_127 v_main_~x~0_128) (< 0 .cse4)) (and .cse0 .cse1 (<= .cse4 0) .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_107, main_#t~post5=|v_main_#t~post5_56|, main_~x~0=v_main_~x~0_128, main_#t~post6=|v_main_#t~post6_56|} OutVars{main_~y~0=v_main_~y~0_106, main_#t~post5=|v_main_#t~post5_55|, main_~x~0=v_main_~x~0_127, main_#t~post6=|v_main_#t~post6_55|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {5137#true} is VALID [2022-04-28 03:44:36,586 INFO L290 TraceCheckUtils]: 7: Hoare triple {5137#true} [110] 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[] {5137#true} is VALID [2022-04-28 03:44:36,587 INFO L290 TraceCheckUtils]: 8: Hoare triple {5137#true} ~z~0 := ~y~0; {5137#true} is VALID [2022-04-28 03:44:36,587 INFO L290 TraceCheckUtils]: 9: Hoare triple {5137#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5142#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-28 03:44:36,588 INFO L290 TraceCheckUtils]: 10: Hoare triple {5142#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5180#(<= main_~z~0 (+ (* (div (+ main_~z~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 03:44:36,588 INFO L290 TraceCheckUtils]: 11: Hoare triple {5180#(<= main_~z~0 (+ (* (div (+ main_~z~0 1) 4294967296) 4294967296) 4294967293))} assume !(~z~0 % 4294967296 > 0); {5180#(<= main_~z~0 (+ (* (div (+ main_~z~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 03:44:36,589 INFO L290 TraceCheckUtils]: 12: Hoare triple {5180#(<= main_~z~0 (+ (* (div (+ main_~z~0 1) 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; {5142#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-28 03:44:36,590 INFO L290 TraceCheckUtils]: 13: Hoare triple {5142#(<= main_~z~0 (+ 4294967294 (* (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; {5190#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-28 03:44:36,590 INFO L290 TraceCheckUtils]: 14: Hoare triple {5190#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {5190#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-28 03:44:36,591 INFO L290 TraceCheckUtils]: 15: Hoare triple {5190#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~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; {5190#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-28 03:44:36,591 INFO L290 TraceCheckUtils]: 16: Hoare triple {5190#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~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; {5190#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-28 03:44:36,591 INFO L290 TraceCheckUtils]: 17: Hoare triple {5190#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} assume !(~x~0 % 4294967296 > 0); {5190#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-28 03:44:36,592 INFO L290 TraceCheckUtils]: 18: Hoare triple {5190#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {5138#false} is VALID [2022-04-28 03:44:36,592 INFO L272 TraceCheckUtils]: 19: Hoare triple {5138#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {5138#false} is VALID [2022-04-28 03:44:36,592 INFO L290 TraceCheckUtils]: 20: Hoare triple {5138#false} ~cond := #in~cond; {5138#false} is VALID [2022-04-28 03:44:36,592 INFO L290 TraceCheckUtils]: 21: Hoare triple {5138#false} assume 0 == ~cond; {5138#false} is VALID [2022-04-28 03:44:36,592 INFO L290 TraceCheckUtils]: 22: Hoare triple {5138#false} assume !false; {5138#false} is VALID [2022-04-28 03:44:36,592 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 03:44:36,592 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:44:36,814 INFO L290 TraceCheckUtils]: 22: Hoare triple {5138#false} assume !false; {5138#false} is VALID [2022-04-28 03:44:36,814 INFO L290 TraceCheckUtils]: 21: Hoare triple {5138#false} assume 0 == ~cond; {5138#false} is VALID [2022-04-28 03:44:36,814 INFO L290 TraceCheckUtils]: 20: Hoare triple {5138#false} ~cond := #in~cond; {5138#false} is VALID [2022-04-28 03:44:36,815 INFO L272 TraceCheckUtils]: 19: Hoare triple {5138#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {5138#false} is VALID [2022-04-28 03:44:36,815 INFO L290 TraceCheckUtils]: 18: Hoare triple {5190#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {5138#false} is VALID [2022-04-28 03:44:36,816 INFO L290 TraceCheckUtils]: 17: Hoare triple {5190#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} assume !(~x~0 % 4294967296 > 0); {5190#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-28 03:44:36,816 INFO L290 TraceCheckUtils]: 16: Hoare triple {5190#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~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; {5190#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-28 03:44:36,816 INFO L290 TraceCheckUtils]: 15: Hoare triple {5190#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~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; {5190#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-28 03:44:36,817 INFO L290 TraceCheckUtils]: 14: Hoare triple {5190#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {5190#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-28 03:44:36,817 INFO L290 TraceCheckUtils]: 13: Hoare triple {5142#(<= main_~z~0 (+ 4294967294 (* (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; {5190#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-28 03:44:36,818 INFO L290 TraceCheckUtils]: 12: Hoare triple {5180#(<= main_~z~0 (+ (* (div (+ main_~z~0 1) 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; {5142#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-28 03:44:36,818 INFO L290 TraceCheckUtils]: 11: Hoare triple {5180#(<= main_~z~0 (+ (* (div (+ main_~z~0 1) 4294967296) 4294967296) 4294967293))} assume !(~z~0 % 4294967296 > 0); {5180#(<= main_~z~0 (+ (* (div (+ main_~z~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 03:44:36,819 INFO L290 TraceCheckUtils]: 10: Hoare triple {5142#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5180#(<= main_~z~0 (+ (* (div (+ main_~z~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 03:44:36,820 INFO L290 TraceCheckUtils]: 9: Hoare triple {5137#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {5142#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-28 03:44:36,820 INFO L290 TraceCheckUtils]: 8: Hoare triple {5137#true} ~z~0 := ~y~0; {5137#true} is VALID [2022-04-28 03:44:36,820 INFO L290 TraceCheckUtils]: 7: Hoare triple {5137#true} [110] 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[] {5137#true} is VALID [2022-04-28 03:44:36,821 INFO L290 TraceCheckUtils]: 6: Hoare triple {5137#true} [111] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_128 v_main_~x~0_127)) (.cse1 (= |v_main_#t~post6_56| |v_main_#t~post6_55|)) (.cse4 (mod v_main_~x~0_128 4294967296)) (.cse2 (= v_main_~y~0_107 v_main_~y~0_106)) (.cse3 (= |v_main_#t~post5_56| |v_main_#t~post5_55|))) (or (and .cse0 .cse1 .cse2 .cse3) (and (= v_main_~y~0_106 (+ v_main_~x~0_128 v_main_~y~0_107 (* v_main_~x~0_127 (- 1)))) (forall ((v_it_13 Int)) (or (not (<= (+ v_main_~x~0_127 v_it_13 1) v_main_~x~0_128)) (not (<= 1 v_it_13)) (< 0 (mod (+ v_main_~x~0_128 (* 4294967295 v_it_13)) 4294967296)))) (< v_main_~x~0_127 v_main_~x~0_128) (< 0 .cse4)) (and .cse0 .cse1 (<= .cse4 0) .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_107, main_#t~post5=|v_main_#t~post5_56|, main_~x~0=v_main_~x~0_128, main_#t~post6=|v_main_#t~post6_56|} OutVars{main_~y~0=v_main_~y~0_106, main_#t~post5=|v_main_#t~post5_55|, main_~x~0=v_main_~x~0_127, main_#t~post6=|v_main_#t~post6_55|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {5137#true} is VALID [2022-04-28 03:44:36,821 INFO L290 TraceCheckUtils]: 5: Hoare triple {5137#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5137#true} is VALID [2022-04-28 03:44:36,821 INFO L272 TraceCheckUtils]: 4: Hoare triple {5137#true} call #t~ret15 := main(); {5137#true} is VALID [2022-04-28 03:44:36,821 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5137#true} {5137#true} #83#return; {5137#true} is VALID [2022-04-28 03:44:36,821 INFO L290 TraceCheckUtils]: 2: Hoare triple {5137#true} assume true; {5137#true} is VALID [2022-04-28 03:44:36,821 INFO L290 TraceCheckUtils]: 1: Hoare triple {5137#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5137#true} is VALID [2022-04-28 03:44:36,821 INFO L272 TraceCheckUtils]: 0: Hoare triple {5137#true} call ULTIMATE.init(); {5137#true} is VALID [2022-04-28 03:44:36,821 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 03:44:36,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [845579880] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:44:36,821 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:44:36,821 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 9 [2022-04-28 03:44:36,888 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:44:36,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [245401982] [2022-04-28 03:44:36,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [245401982] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:44:36,888 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:44:36,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 03:44:36,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909381573] [2022-04-28 03:44:36,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:44:36,889 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 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 24 [2022-04-28 03:44:36,889 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:44:36,889 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 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:44:36,907 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:44:36,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 03:44:36,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:44:36,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 03:44:36,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-04-28 03:44:36,908 INFO L87 Difference]: Start difference. First operand 36 states and 45 transitions. Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 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:44:37,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:44:37,590 INFO L93 Difference]: Finished difference Result 59 states and 79 transitions. [2022-04-28 03:44:37,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-28 03:44:37,590 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 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 24 [2022-04-28 03:44:37,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:44:37,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 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:44:37,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 53 transitions. [2022-04-28 03:44:37,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 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:44:37,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 53 transitions. [2022-04-28 03:44:37,592 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 53 transitions. [2022-04-28 03:44:37,650 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:44:37,651 INFO L225 Difference]: With dead ends: 59 [2022-04-28 03:44:37,651 INFO L226 Difference]: Without dead ends: 54 [2022-04-28 03:44:37,651 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 49 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=352, Unknown=0, NotChecked=0, Total=462 [2022-04-28 03:44:37,652 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 30 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 03:44:37,652 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 42 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 03:44:37,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-28 03:44:37,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 46. [2022-04-28 03:44:37,779 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:44:37,779 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand has 46 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 41 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:44:37,784 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand has 46 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 41 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:44:37,785 INFO L87 Difference]: Start difference. First operand 54 states. Second operand has 46 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 41 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:44:37,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:44:37,786 INFO L93 Difference]: Finished difference Result 54 states and 73 transitions. [2022-04-28 03:44:37,786 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 73 transitions. [2022-04-28 03:44:37,786 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:44:37,786 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:44:37,786 INFO L74 IsIncluded]: Start isIncluded. First operand has 46 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 41 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 54 states. [2022-04-28 03:44:37,786 INFO L87 Difference]: Start difference. First operand has 46 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 41 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 54 states. [2022-04-28 03:44:37,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:44:37,787 INFO L93 Difference]: Finished difference Result 54 states and 73 transitions. [2022-04-28 03:44:37,787 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 73 transitions. [2022-04-28 03:44:37,787 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:44:37,787 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:44:37,787 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:44:37,787 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:44:37,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 41 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:44:37,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 59 transitions. [2022-04-28 03:44:37,788 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 59 transitions. Word has length 24 [2022-04-28 03:44:37,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:44:37,788 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 59 transitions. [2022-04-28 03:44:37,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 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:44:37,788 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 59 transitions. [2022-04-28 03:44:42,565 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 57 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-28 03:44:42,565 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 59 transitions. [2022-04-28 03:44:42,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-28 03:44:42,566 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:44:42,566 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:44:42,583 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:44:42,766 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,SelfDestructingSolverStorable16 [2022-04-28 03:44:42,766 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:44:42,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:44:42,767 INFO L85 PathProgramCache]: Analyzing trace with hash -1822836127, now seen corresponding path program 4 times [2022-04-28 03:44:42,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:44:42,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1698268906] [2022-04-28 03:44:42,947 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:44:42,949 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:44:42,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1735658773, now seen corresponding path program 1 times [2022-04-28 03:44:42,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:44:42,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634133618] [2022-04-28 03:44:42,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:44:42,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:44:42,960 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:44:42,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:44:42,981 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:44:43,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:44:43,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:44:43,083 INFO L290 TraceCheckUtils]: 0: Hoare triple {5640#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5629#true} is VALID [2022-04-28 03:44:43,083 INFO L290 TraceCheckUtils]: 1: Hoare triple {5629#true} assume true; {5629#true} is VALID [2022-04-28 03:44:43,084 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5629#true} {5629#true} #83#return; {5629#true} is VALID [2022-04-28 03:44:43,084 INFO L272 TraceCheckUtils]: 0: Hoare triple {5629#true} call ULTIMATE.init(); {5640#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:44:43,084 INFO L290 TraceCheckUtils]: 1: Hoare triple {5640#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5629#true} is VALID [2022-04-28 03:44:43,084 INFO L290 TraceCheckUtils]: 2: Hoare triple {5629#true} assume true; {5629#true} is VALID [2022-04-28 03:44:43,084 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5629#true} {5629#true} #83#return; {5629#true} is VALID [2022-04-28 03:44:43,084 INFO L272 TraceCheckUtils]: 4: Hoare triple {5629#true} call #t~ret15 := main(); {5629#true} is VALID [2022-04-28 03:44:43,084 INFO L290 TraceCheckUtils]: 5: Hoare triple {5629#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5629#true} is VALID [2022-04-28 03:44:43,084 INFO L290 TraceCheckUtils]: 6: Hoare triple {5629#true} [113] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_119 v_main_~y~0_118)) (.cse1 (= |v_main_#t~post5_61| |v_main_#t~post5_60|)) (.cse2 (= |v_main_#t~post6_61| |v_main_#t~post6_60|)) (.cse3 (mod v_main_~x~0_140 4294967296))) (or (and .cse0 .cse1 .cse2 (= v_main_~x~0_140 v_main_~x~0_139)) (and (<= .cse3 0) .cse0 .cse1 .cse2 (= v_main_~x~0_139 v_main_~x~0_140)) (and (< v_main_~y~0_119 v_main_~y~0_118) (< 0 .cse3) (forall ((v_it_14 Int)) (or (not (<= 1 v_it_14)) (< 0 (mod (+ v_main_~x~0_140 (* 4294967295 v_it_14)) 4294967296)) (not (<= (+ v_main_~y~0_119 v_it_14 1) v_main_~y~0_118)))) (= v_main_~x~0_139 (+ v_main_~x~0_140 v_main_~y~0_119 (* (- 1) v_main_~y~0_118)))))) InVars {main_~y~0=v_main_~y~0_119, main_#t~post5=|v_main_#t~post5_61|, main_~x~0=v_main_~x~0_140, main_#t~post6=|v_main_#t~post6_61|} OutVars{main_~y~0=v_main_~y~0_118, main_#t~post5=|v_main_#t~post5_60|, main_~x~0=v_main_~x~0_139, main_#t~post6=|v_main_#t~post6_60|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {5629#true} is VALID [2022-04-28 03:44:43,085 INFO L290 TraceCheckUtils]: 7: Hoare triple {5629#true} [112] 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[] {5629#true} is VALID [2022-04-28 03:44:43,085 INFO L290 TraceCheckUtils]: 8: Hoare triple {5629#true} ~z~0 := ~y~0; {5634#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-28 03:44:43,086 INFO L290 TraceCheckUtils]: 9: Hoare triple {5634#(= (+ 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; {5635#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-28 03:44:43,086 INFO L290 TraceCheckUtils]: 10: Hoare triple {5635#(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; {5636#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-28 03:44:43,087 INFO L290 TraceCheckUtils]: 11: Hoare triple {5636#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} assume !(~z~0 % 4294967296 > 0); {5637#(and (<= (+ 2 (* (div main_~z~0 4294967296) 4294967296)) main_~y~0) (<= main_~y~0 (+ 2 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-28 03:44:43,088 INFO L290 TraceCheckUtils]: 12: Hoare triple {5637#(and (<= (+ 2 (* (div main_~z~0 4294967296) 4294967296)) main_~y~0) (<= main_~y~0 (+ 2 (* (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; {5638#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-28 03:44:43,089 INFO L290 TraceCheckUtils]: 13: Hoare triple {5638#(<= 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; {5639#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:44:43,090 INFO L290 TraceCheckUtils]: 14: Hoare triple {5639#(<= 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; {5630#false} is VALID [2022-04-28 03:44:43,090 INFO L290 TraceCheckUtils]: 15: Hoare triple {5630#false} assume !(~y~0 % 4294967296 > 0); {5630#false} is VALID [2022-04-28 03:44:43,090 INFO L290 TraceCheckUtils]: 16: Hoare triple {5630#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; {5630#false} is VALID [2022-04-28 03:44:43,090 INFO L290 TraceCheckUtils]: 17: Hoare triple {5630#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; {5630#false} is VALID [2022-04-28 03:44:43,090 INFO L290 TraceCheckUtils]: 18: Hoare triple {5630#false} assume !(~x~0 % 4294967296 > 0); {5630#false} is VALID [2022-04-28 03:44:43,090 INFO L290 TraceCheckUtils]: 19: Hoare triple {5630#false} assume !(~z~0 % 4294967296 > 0); {5630#false} is VALID [2022-04-28 03:44:43,090 INFO L272 TraceCheckUtils]: 20: Hoare triple {5630#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {5630#false} is VALID [2022-04-28 03:44:43,090 INFO L290 TraceCheckUtils]: 21: Hoare triple {5630#false} ~cond := #in~cond; {5630#false} is VALID [2022-04-28 03:44:43,090 INFO L290 TraceCheckUtils]: 22: Hoare triple {5630#false} assume 0 == ~cond; {5630#false} is VALID [2022-04-28 03:44:43,090 INFO L290 TraceCheckUtils]: 23: Hoare triple {5630#false} assume !false; {5630#false} is VALID [2022-04-28 03:44:43,090 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 03:44:43,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:44:43,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634133618] [2022-04-28 03:44:43,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634133618] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:44:43,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1317918080] [2022-04-28 03:44:43,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:44:43,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:44:43,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:44:43,092 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:44:43,106 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:44:43,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:44:43,135 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-28 03:44:43,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:44:43,147 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:44:43,484 INFO L272 TraceCheckUtils]: 0: Hoare triple {5629#true} call ULTIMATE.init(); {5629#true} is VALID [2022-04-28 03:44:43,484 INFO L290 TraceCheckUtils]: 1: Hoare triple {5629#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5629#true} is VALID [2022-04-28 03:44:43,484 INFO L290 TraceCheckUtils]: 2: Hoare triple {5629#true} assume true; {5629#true} is VALID [2022-04-28 03:44:43,484 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5629#true} {5629#true} #83#return; {5629#true} is VALID [2022-04-28 03:44:43,485 INFO L272 TraceCheckUtils]: 4: Hoare triple {5629#true} call #t~ret15 := main(); {5629#true} is VALID [2022-04-28 03:44:43,485 INFO L290 TraceCheckUtils]: 5: Hoare triple {5629#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5629#true} is VALID [2022-04-28 03:44:43,485 INFO L290 TraceCheckUtils]: 6: Hoare triple {5629#true} [113] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_119 v_main_~y~0_118)) (.cse1 (= |v_main_#t~post5_61| |v_main_#t~post5_60|)) (.cse2 (= |v_main_#t~post6_61| |v_main_#t~post6_60|)) (.cse3 (mod v_main_~x~0_140 4294967296))) (or (and .cse0 .cse1 .cse2 (= v_main_~x~0_140 v_main_~x~0_139)) (and (<= .cse3 0) .cse0 .cse1 .cse2 (= v_main_~x~0_139 v_main_~x~0_140)) (and (< v_main_~y~0_119 v_main_~y~0_118) (< 0 .cse3) (forall ((v_it_14 Int)) (or (not (<= 1 v_it_14)) (< 0 (mod (+ v_main_~x~0_140 (* 4294967295 v_it_14)) 4294967296)) (not (<= (+ v_main_~y~0_119 v_it_14 1) v_main_~y~0_118)))) (= v_main_~x~0_139 (+ v_main_~x~0_140 v_main_~y~0_119 (* (- 1) v_main_~y~0_118)))))) InVars {main_~y~0=v_main_~y~0_119, main_#t~post5=|v_main_#t~post5_61|, main_~x~0=v_main_~x~0_140, main_#t~post6=|v_main_#t~post6_61|} OutVars{main_~y~0=v_main_~y~0_118, main_#t~post5=|v_main_#t~post5_60|, main_~x~0=v_main_~x~0_139, main_#t~post6=|v_main_#t~post6_60|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {5629#true} is VALID [2022-04-28 03:44:43,485 INFO L290 TraceCheckUtils]: 7: Hoare triple {5629#true} [112] 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[] {5629#true} is VALID [2022-04-28 03:44:43,485 INFO L290 TraceCheckUtils]: 8: Hoare triple {5629#true} ~z~0 := ~y~0; {5634#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-28 03:44:43,486 INFO L290 TraceCheckUtils]: 9: Hoare triple {5634#(= (+ 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; {5635#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-28 03:44:43,487 INFO L290 TraceCheckUtils]: 10: Hoare triple {5635#(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; {5636#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-28 03:44:43,488 INFO L290 TraceCheckUtils]: 11: Hoare triple {5636#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} assume !(~z~0 % 4294967296 > 0); {5677#(<= (div (+ 2 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ (- 2) main_~y~0) 4294967296))} is VALID [2022-04-28 03:44:43,489 INFO L290 TraceCheckUtils]: 12: Hoare triple {5677#(<= (div (+ 2 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ (- 2) 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; {5638#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-28 03:44:43,490 INFO L290 TraceCheckUtils]: 13: Hoare triple {5638#(<= 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; {5639#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:44:43,490 INFO L290 TraceCheckUtils]: 14: Hoare triple {5639#(<= 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; {5630#false} is VALID [2022-04-28 03:44:43,490 INFO L290 TraceCheckUtils]: 15: Hoare triple {5630#false} assume !(~y~0 % 4294967296 > 0); {5630#false} is VALID [2022-04-28 03:44:43,490 INFO L290 TraceCheckUtils]: 16: Hoare triple {5630#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; {5630#false} is VALID [2022-04-28 03:44:43,490 INFO L290 TraceCheckUtils]: 17: Hoare triple {5630#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; {5630#false} is VALID [2022-04-28 03:44:43,490 INFO L290 TraceCheckUtils]: 18: Hoare triple {5630#false} assume !(~x~0 % 4294967296 > 0); {5630#false} is VALID [2022-04-28 03:44:43,490 INFO L290 TraceCheckUtils]: 19: Hoare triple {5630#false} assume !(~z~0 % 4294967296 > 0); {5630#false} is VALID [2022-04-28 03:44:43,491 INFO L272 TraceCheckUtils]: 20: Hoare triple {5630#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {5630#false} is VALID [2022-04-28 03:44:43,491 INFO L290 TraceCheckUtils]: 21: Hoare triple {5630#false} ~cond := #in~cond; {5630#false} is VALID [2022-04-28 03:44:43,491 INFO L290 TraceCheckUtils]: 22: Hoare triple {5630#false} assume 0 == ~cond; {5630#false} is VALID [2022-04-28 03:44:43,491 INFO L290 TraceCheckUtils]: 23: Hoare triple {5630#false} assume !false; {5630#false} is VALID [2022-04-28 03:44:43,491 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 03:44:43,491 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:44:43,937 INFO L290 TraceCheckUtils]: 23: Hoare triple {5630#false} assume !false; {5630#false} is VALID [2022-04-28 03:44:43,937 INFO L290 TraceCheckUtils]: 22: Hoare triple {5630#false} assume 0 == ~cond; {5630#false} is VALID [2022-04-28 03:44:43,937 INFO L290 TraceCheckUtils]: 21: Hoare triple {5630#false} ~cond := #in~cond; {5630#false} is VALID [2022-04-28 03:44:43,937 INFO L272 TraceCheckUtils]: 20: Hoare triple {5630#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {5630#false} is VALID [2022-04-28 03:44:43,938 INFO L290 TraceCheckUtils]: 19: Hoare triple {5630#false} assume !(~z~0 % 4294967296 > 0); {5630#false} is VALID [2022-04-28 03:44:43,938 INFO L290 TraceCheckUtils]: 18: Hoare triple {5630#false} assume !(~x~0 % 4294967296 > 0); {5630#false} is VALID [2022-04-28 03:44:43,938 INFO L290 TraceCheckUtils]: 17: Hoare triple {5630#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; {5630#false} is VALID [2022-04-28 03:44:43,938 INFO L290 TraceCheckUtils]: 16: Hoare triple {5630#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; {5630#false} is VALID [2022-04-28 03:44:43,938 INFO L290 TraceCheckUtils]: 15: Hoare triple {5630#false} assume !(~y~0 % 4294967296 > 0); {5630#false} is VALID [2022-04-28 03:44:43,938 INFO L290 TraceCheckUtils]: 14: Hoare triple {5639#(<= 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; {5630#false} is VALID [2022-04-28 03:44:43,939 INFO L290 TraceCheckUtils]: 13: Hoare triple {5638#(<= 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; {5639#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:44:43,940 INFO L290 TraceCheckUtils]: 12: Hoare triple {5677#(<= (div (+ 2 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ (- 2) 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; {5638#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-28 03:44:43,941 INFO L290 TraceCheckUtils]: 11: Hoare triple {5750#(or (< 0 (mod main_~z~0 4294967296)) (<= (div (+ 2 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ (- 2) main_~y~0) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {5677#(<= (div (+ 2 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ (- 2) main_~y~0) 4294967296))} is VALID [2022-04-28 03:44:43,942 INFO L290 TraceCheckUtils]: 10: Hoare triple {5754#(or (<= (div (+ 2 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ (- 2) 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; {5750#(or (< 0 (mod main_~z~0 4294967296)) (<= (div (+ 2 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ (- 2) main_~y~0) 4294967296)))} is VALID [2022-04-28 03:44:43,943 INFO L290 TraceCheckUtils]: 9: Hoare triple {5758#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (<= (div (+ 2 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ (- 2) 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; {5754#(or (<= (div (+ 2 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ (- 2) main_~y~0) 4294967296)) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-28 03:44:43,944 INFO L290 TraceCheckUtils]: 8: Hoare triple {5629#true} ~z~0 := ~y~0; {5758#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (<= (div (+ 2 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ (- 2) main_~y~0) 4294967296)))} is VALID [2022-04-28 03:44:43,944 INFO L290 TraceCheckUtils]: 7: Hoare triple {5629#true} [112] 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[] {5629#true} is VALID [2022-04-28 03:44:43,944 INFO L290 TraceCheckUtils]: 6: Hoare triple {5629#true} [113] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_119 v_main_~y~0_118)) (.cse1 (= |v_main_#t~post5_61| |v_main_#t~post5_60|)) (.cse2 (= |v_main_#t~post6_61| |v_main_#t~post6_60|)) (.cse3 (mod v_main_~x~0_140 4294967296))) (or (and .cse0 .cse1 .cse2 (= v_main_~x~0_140 v_main_~x~0_139)) (and (<= .cse3 0) .cse0 .cse1 .cse2 (= v_main_~x~0_139 v_main_~x~0_140)) (and (< v_main_~y~0_119 v_main_~y~0_118) (< 0 .cse3) (forall ((v_it_14 Int)) (or (not (<= 1 v_it_14)) (< 0 (mod (+ v_main_~x~0_140 (* 4294967295 v_it_14)) 4294967296)) (not (<= (+ v_main_~y~0_119 v_it_14 1) v_main_~y~0_118)))) (= v_main_~x~0_139 (+ v_main_~x~0_140 v_main_~y~0_119 (* (- 1) v_main_~y~0_118)))))) InVars {main_~y~0=v_main_~y~0_119, main_#t~post5=|v_main_#t~post5_61|, main_~x~0=v_main_~x~0_140, main_#t~post6=|v_main_#t~post6_61|} OutVars{main_~y~0=v_main_~y~0_118, main_#t~post5=|v_main_#t~post5_60|, main_~x~0=v_main_~x~0_139, main_#t~post6=|v_main_#t~post6_60|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {5629#true} is VALID [2022-04-28 03:44:43,944 INFO L290 TraceCheckUtils]: 5: Hoare triple {5629#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {5629#true} is VALID [2022-04-28 03:44:43,944 INFO L272 TraceCheckUtils]: 4: Hoare triple {5629#true} call #t~ret15 := main(); {5629#true} is VALID [2022-04-28 03:44:43,944 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5629#true} {5629#true} #83#return; {5629#true} is VALID [2022-04-28 03:44:43,944 INFO L290 TraceCheckUtils]: 2: Hoare triple {5629#true} assume true; {5629#true} is VALID [2022-04-28 03:44:43,944 INFO L290 TraceCheckUtils]: 1: Hoare triple {5629#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {5629#true} is VALID [2022-04-28 03:44:43,944 INFO L272 TraceCheckUtils]: 0: Hoare triple {5629#true} call ULTIMATE.init(); {5629#true} is VALID [2022-04-28 03:44:43,944 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 03:44:43,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1317918080] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:44:43,945 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:44:43,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 13 [2022-04-28 03:44:43,999 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:44:43,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1698268906] [2022-04-28 03:44:44,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1698268906] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:44:44,000 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:44:44,000 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 03:44:44,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584393538] [2022-04-28 03:44:44,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:44:44,000 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 10 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 25 [2022-04-28 03:44:44,000 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:44:44,000 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 10 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:44:44,019 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:44:44,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 03:44:44,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:44:44,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 03:44:44,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2022-04-28 03:44:44,020 INFO L87 Difference]: Start difference. First operand 46 states and 59 transitions. Second operand has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 10 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:44:45,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:44:45,116 INFO L93 Difference]: Finished difference Result 76 states and 101 transitions. [2022-04-28 03:44:45,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-28 03:44:45,116 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 10 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 25 [2022-04-28 03:44:45,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:44:45,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 10 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:44:45,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 69 transitions. [2022-04-28 03:44:45,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 10 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:44:45,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 69 transitions. [2022-04-28 03:44:45,118 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 69 transitions. [2022-04-28 03:44:45,189 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:44:45,189 INFO L225 Difference]: With dead ends: 76 [2022-04-28 03:44:45,189 INFO L226 Difference]: Without dead ends: 66 [2022-04-28 03:44:45,190 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 52 SyntacticMatches, 6 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=129, Invalid=627, Unknown=0, NotChecked=0, Total=756 [2022-04-28 03:44:45,190 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 41 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 03:44:45,190 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 52 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 03:44:45,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-04-28 03:44:45,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 42. [2022-04-28 03:44:45,333 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:44:45,333 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand has 42 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 37 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have 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:44:45,333 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand has 42 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 37 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have 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:44:45,333 INFO L87 Difference]: Start difference. First operand 66 states. Second operand has 42 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 37 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have 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:44:45,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:44:45,336 INFO L93 Difference]: Finished difference Result 66 states and 89 transitions. [2022-04-28 03:44:45,336 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 89 transitions. [2022-04-28 03:44:45,336 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:44:45,336 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:44:45,336 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 37 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 66 states. [2022-04-28 03:44:45,337 INFO L87 Difference]: Start difference. First operand has 42 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 37 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 66 states. [2022-04-28 03:44:45,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:44:45,337 INFO L93 Difference]: Finished difference Result 66 states and 89 transitions. [2022-04-28 03:44:45,337 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 89 transitions. [2022-04-28 03:44:45,338 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:44:45,338 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:44:45,338 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:44:45,338 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:44:45,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 37 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have 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:44:45,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 53 transitions. [2022-04-28 03:44:45,338 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 53 transitions. Word has length 25 [2022-04-28 03:44:45,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:44:45,338 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 53 transitions. [2022-04-28 03:44:45,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 10 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:44:45,339 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 53 transitions. [2022-04-28 03:44:50,463 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 51 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-28 03:44:50,463 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 53 transitions. [2022-04-28 03:44:50,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-28 03:44:50,463 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:44:50,463 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:44:50,478 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:44:50,663 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,SelfDestructingSolverStorable17 [2022-04-28 03:44:50,664 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:44:50,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:44:50,664 INFO L85 PathProgramCache]: Analyzing trace with hash -294389697, now seen corresponding path program 5 times [2022-04-28 03:44:50,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:44:50,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [343236615] [2022-04-28 03:44:50,850 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:44:50,852 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:44:50,854 INFO L85 PathProgramCache]: Analyzing trace with hash -318387405, now seen corresponding path program 1 times [2022-04-28 03:44:50,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:44:50,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276267655] [2022-04-28 03:44:50,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:44:50,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:44:50,863 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:44:50,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:44:50,871 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_15.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:44:50,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:44:50,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:44:50,944 INFO L290 TraceCheckUtils]: 0: Hoare triple {6196#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {6186#true} is VALID [2022-04-28 03:44:50,944 INFO L290 TraceCheckUtils]: 1: Hoare triple {6186#true} assume true; {6186#true} is VALID [2022-04-28 03:44:50,944 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6186#true} {6186#true} #83#return; {6186#true} is VALID [2022-04-28 03:44:50,944 INFO L272 TraceCheckUtils]: 0: Hoare triple {6186#true} call ULTIMATE.init(); {6196#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:44:50,944 INFO L290 TraceCheckUtils]: 1: Hoare triple {6196#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {6186#true} is VALID [2022-04-28 03:44:50,944 INFO L290 TraceCheckUtils]: 2: Hoare triple {6186#true} assume true; {6186#true} is VALID [2022-04-28 03:44:50,944 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6186#true} {6186#true} #83#return; {6186#true} is VALID [2022-04-28 03:44:50,945 INFO L272 TraceCheckUtils]: 4: Hoare triple {6186#true} call #t~ret15 := main(); {6186#true} is VALID [2022-04-28 03:44:50,945 INFO L290 TraceCheckUtils]: 5: Hoare triple {6186#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {6186#true} is VALID [2022-04-28 03:44:50,945 INFO L290 TraceCheckUtils]: 6: Hoare triple {6186#true} [115] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_152 4294967296)) (.cse1 (= |v_main_#t~post5_66| |v_main_#t~post5_65|)) (.cse2 (= |v_main_#t~post6_66| |v_main_#t~post6_65|)) (.cse3 (= v_main_~y~0_135 v_main_~y~0_134)) (.cse4 (= v_main_~x~0_152 v_main_~x~0_151))) (or (and (< v_main_~x~0_151 v_main_~x~0_152) (forall ((v_it_15 Int)) (or (not (<= (+ v_main_~x~0_151 v_it_15 1) v_main_~x~0_152)) (< 0 (mod (+ v_main_~x~0_152 (* 4294967295 v_it_15)) 4294967296)) (not (<= 1 v_it_15)))) (< 0 .cse0) (= v_main_~y~0_134 (+ v_main_~x~0_152 v_main_~y~0_135 (* v_main_~x~0_151 (- 1))))) (and .cse1 .cse2 .cse3 .cse4) (and (<= .cse0 0) .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_135, main_#t~post5=|v_main_#t~post5_66|, main_~x~0=v_main_~x~0_152, main_#t~post6=|v_main_#t~post6_66|} OutVars{main_~y~0=v_main_~y~0_134, main_#t~post5=|v_main_#t~post5_65|, main_~x~0=v_main_~x~0_151, main_#t~post6=|v_main_#t~post6_65|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {6186#true} is VALID [2022-04-28 03:44:50,945 INFO L290 TraceCheckUtils]: 7: Hoare triple {6186#true} [114] 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[] {6191#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:44:50,946 INFO L290 TraceCheckUtils]: 8: Hoare triple {6191#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {6191#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:44:50,946 INFO L290 TraceCheckUtils]: 9: Hoare triple {6191#(<= 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; {6192#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:44:50,947 INFO L290 TraceCheckUtils]: 10: Hoare triple {6192#(<= 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; {6193#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:44:50,948 INFO L290 TraceCheckUtils]: 11: Hoare triple {6193#(<= 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; {6194#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:44:50,949 INFO L290 TraceCheckUtils]: 12: Hoare triple {6194#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {6194#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:44:50,949 INFO L290 TraceCheckUtils]: 13: Hoare triple {6194#(<= 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; {6194#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:44:50,949 INFO L290 TraceCheckUtils]: 14: Hoare triple {6194#(<= 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; {6194#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:44:50,950 INFO L290 TraceCheckUtils]: 15: Hoare triple {6194#(<= 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; {6194#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:44:50,950 INFO L290 TraceCheckUtils]: 16: Hoare triple {6194#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {6194#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:44:50,951 INFO L290 TraceCheckUtils]: 17: Hoare triple {6194#(<= 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; {6195#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 03:44:50,951 INFO L290 TraceCheckUtils]: 18: Hoare triple {6195#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {6187#false} is VALID [2022-04-28 03:44:50,951 INFO L290 TraceCheckUtils]: 19: Hoare triple {6187#false} assume !(~z~0 % 4294967296 > 0); {6187#false} is VALID [2022-04-28 03:44:50,951 INFO L272 TraceCheckUtils]: 20: Hoare triple {6187#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {6187#false} is VALID [2022-04-28 03:44:50,952 INFO L290 TraceCheckUtils]: 21: Hoare triple {6187#false} ~cond := #in~cond; {6187#false} is VALID [2022-04-28 03:44:50,952 INFO L290 TraceCheckUtils]: 22: Hoare triple {6187#false} assume 0 == ~cond; {6187#false} is VALID [2022-04-28 03:44:50,952 INFO L290 TraceCheckUtils]: 23: Hoare triple {6187#false} assume !false; {6187#false} is VALID [2022-04-28 03:44:50,952 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-28 03:44:50,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:44:50,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276267655] [2022-04-28 03:44:50,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276267655] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:44:50,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1749794778] [2022-04-28 03:44:50,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:44:50,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:44:50,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:44:50,953 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:44:50,954 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:44:50,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:44:50,985 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-28 03:44:50,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:44:50,991 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:44:51,167 INFO L272 TraceCheckUtils]: 0: Hoare triple {6186#true} call ULTIMATE.init(); {6186#true} is VALID [2022-04-28 03:44:51,167 INFO L290 TraceCheckUtils]: 1: Hoare triple {6186#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {6186#true} is VALID [2022-04-28 03:44:51,167 INFO L290 TraceCheckUtils]: 2: Hoare triple {6186#true} assume true; {6186#true} is VALID [2022-04-28 03:44:51,167 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6186#true} {6186#true} #83#return; {6186#true} is VALID [2022-04-28 03:44:51,167 INFO L272 TraceCheckUtils]: 4: Hoare triple {6186#true} call #t~ret15 := main(); {6186#true} is VALID [2022-04-28 03:44:51,167 INFO L290 TraceCheckUtils]: 5: Hoare triple {6186#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {6186#true} is VALID [2022-04-28 03:44:51,168 INFO L290 TraceCheckUtils]: 6: Hoare triple {6186#true} [115] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_152 4294967296)) (.cse1 (= |v_main_#t~post5_66| |v_main_#t~post5_65|)) (.cse2 (= |v_main_#t~post6_66| |v_main_#t~post6_65|)) (.cse3 (= v_main_~y~0_135 v_main_~y~0_134)) (.cse4 (= v_main_~x~0_152 v_main_~x~0_151))) (or (and (< v_main_~x~0_151 v_main_~x~0_152) (forall ((v_it_15 Int)) (or (not (<= (+ v_main_~x~0_151 v_it_15 1) v_main_~x~0_152)) (< 0 (mod (+ v_main_~x~0_152 (* 4294967295 v_it_15)) 4294967296)) (not (<= 1 v_it_15)))) (< 0 .cse0) (= v_main_~y~0_134 (+ v_main_~x~0_152 v_main_~y~0_135 (* v_main_~x~0_151 (- 1))))) (and .cse1 .cse2 .cse3 .cse4) (and (<= .cse0 0) .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_135, main_#t~post5=|v_main_#t~post5_66|, main_~x~0=v_main_~x~0_152, main_#t~post6=|v_main_#t~post6_66|} OutVars{main_~y~0=v_main_~y~0_134, main_#t~post5=|v_main_#t~post5_65|, main_~x~0=v_main_~x~0_151, main_#t~post6=|v_main_#t~post6_65|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {6186#true} is VALID [2022-04-28 03:44:51,168 INFO L290 TraceCheckUtils]: 7: Hoare triple {6186#true} [114] 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[] {6186#true} is VALID [2022-04-28 03:44:51,168 INFO L290 TraceCheckUtils]: 8: Hoare triple {6186#true} ~z~0 := ~y~0; {6224#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 03:44:51,168 INFO L290 TraceCheckUtils]: 9: Hoare triple {6224#(= 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; {6228#(and (= main_~y~0 (+ main_~z~0 1)) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 03:44:51,169 INFO L290 TraceCheckUtils]: 10: Hoare triple {6228#(and (= main_~y~0 (+ main_~z~0 1)) (< 0 (mod main_~y~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6232#(and (= main_~y~0 (+ main_~z~0 2)) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 03:44:51,170 INFO L290 TraceCheckUtils]: 11: Hoare triple {6232#(and (= main_~y~0 (+ main_~z~0 2)) (< 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; {6236#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 03:44:51,170 INFO L290 TraceCheckUtils]: 12: Hoare triple {6236#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (< 0 (mod main_~y~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {6236#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 03:44:51,171 INFO L290 TraceCheckUtils]: 13: Hoare triple {6236#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {6243#(and (< 0 (mod (+ main_~z~0 2) 4294967296)) (= (+ main_~z~0 2) (+ main_~y~0 1)))} is VALID [2022-04-28 03:44:51,172 INFO L290 TraceCheckUtils]: 14: Hoare triple {6243#(and (< 0 (mod (+ main_~z~0 2) 4294967296)) (= (+ main_~z~0 2) (+ 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; {6247#(and (= main_~z~0 (+ main_~y~0 1)) (< 0 (mod (+ main_~y~0 2) 4294967296)))} is VALID [2022-04-28 03:44:51,172 INFO L290 TraceCheckUtils]: 15: Hoare triple {6247#(and (= main_~z~0 (+ main_~y~0 1)) (< 0 (mod (+ main_~y~0 2) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {6251#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 03:44:51,173 INFO L290 TraceCheckUtils]: 16: Hoare triple {6251#(< 0 (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {6251#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 03:44:51,173 INFO L290 TraceCheckUtils]: 17: Hoare triple {6251#(< 0 (mod main_~z~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; {6251#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 03:44:51,173 INFO L290 TraceCheckUtils]: 18: Hoare triple {6251#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {6251#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 03:44:51,173 INFO L290 TraceCheckUtils]: 19: Hoare triple {6251#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {6187#false} is VALID [2022-04-28 03:44:51,173 INFO L272 TraceCheckUtils]: 20: Hoare triple {6187#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {6187#false} is VALID [2022-04-28 03:44:51,173 INFO L290 TraceCheckUtils]: 21: Hoare triple {6187#false} ~cond := #in~cond; {6187#false} is VALID [2022-04-28 03:44:51,174 INFO L290 TraceCheckUtils]: 22: Hoare triple {6187#false} assume 0 == ~cond; {6187#false} is VALID [2022-04-28 03:44:51,174 INFO L290 TraceCheckUtils]: 23: Hoare triple {6187#false} assume !false; {6187#false} is VALID [2022-04-28 03:44:51,174 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:44:51,174 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:44:51,293 INFO L290 TraceCheckUtils]: 23: Hoare triple {6187#false} assume !false; {6187#false} is VALID [2022-04-28 03:44:51,294 INFO L290 TraceCheckUtils]: 22: Hoare triple {6187#false} assume 0 == ~cond; {6187#false} is VALID [2022-04-28 03:44:51,294 INFO L290 TraceCheckUtils]: 21: Hoare triple {6187#false} ~cond := #in~cond; {6187#false} is VALID [2022-04-28 03:44:51,294 INFO L272 TraceCheckUtils]: 20: Hoare triple {6187#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {6187#false} is VALID [2022-04-28 03:44:51,294 INFO L290 TraceCheckUtils]: 19: Hoare triple {6251#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {6187#false} is VALID [2022-04-28 03:44:51,294 INFO L290 TraceCheckUtils]: 18: Hoare triple {6251#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {6251#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 03:44:51,295 INFO L290 TraceCheckUtils]: 17: Hoare triple {6251#(< 0 (mod main_~z~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; {6251#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 03:44:51,295 INFO L290 TraceCheckUtils]: 16: Hoare triple {6251#(< 0 (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {6251#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 03:44:51,296 INFO L290 TraceCheckUtils]: 15: Hoare triple {6300#(< 0 (mod (+ main_~z~0 1) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {6251#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 03:44:51,297 INFO L290 TraceCheckUtils]: 14: Hoare triple {6304#(< 0 (mod (+ main_~z~0 2) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {6300#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-28 03:44:51,298 INFO L290 TraceCheckUtils]: 13: Hoare triple {6308#(< 0 (mod (+ main_~z~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; {6304#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-28 03:44:51,298 INFO L290 TraceCheckUtils]: 12: Hoare triple {6308#(< 0 (mod (+ main_~z~0 3) 4294967296))} assume !(~z~0 % 4294967296 > 0); {6308#(< 0 (mod (+ main_~z~0 3) 4294967296))} is VALID [2022-04-28 03:44:51,299 INFO L290 TraceCheckUtils]: 11: Hoare triple {6304#(< 0 (mod (+ main_~z~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6308#(< 0 (mod (+ main_~z~0 3) 4294967296))} is VALID [2022-04-28 03:44:51,300 INFO L290 TraceCheckUtils]: 10: Hoare triple {6300#(< 0 (mod (+ main_~z~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6304#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-28 03:44:51,301 INFO L290 TraceCheckUtils]: 9: Hoare triple {6186#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6300#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-28 03:44:51,301 INFO L290 TraceCheckUtils]: 8: Hoare triple {6186#true} ~z~0 := ~y~0; {6186#true} is VALID [2022-04-28 03:44:51,301 INFO L290 TraceCheckUtils]: 7: Hoare triple {6186#true} [114] 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[] {6186#true} is VALID [2022-04-28 03:44:51,301 INFO L290 TraceCheckUtils]: 6: Hoare triple {6186#true} [115] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_152 4294967296)) (.cse1 (= |v_main_#t~post5_66| |v_main_#t~post5_65|)) (.cse2 (= |v_main_#t~post6_66| |v_main_#t~post6_65|)) (.cse3 (= v_main_~y~0_135 v_main_~y~0_134)) (.cse4 (= v_main_~x~0_152 v_main_~x~0_151))) (or (and (< v_main_~x~0_151 v_main_~x~0_152) (forall ((v_it_15 Int)) (or (not (<= (+ v_main_~x~0_151 v_it_15 1) v_main_~x~0_152)) (< 0 (mod (+ v_main_~x~0_152 (* 4294967295 v_it_15)) 4294967296)) (not (<= 1 v_it_15)))) (< 0 .cse0) (= v_main_~y~0_134 (+ v_main_~x~0_152 v_main_~y~0_135 (* v_main_~x~0_151 (- 1))))) (and .cse1 .cse2 .cse3 .cse4) (and (<= .cse0 0) .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_135, main_#t~post5=|v_main_#t~post5_66|, main_~x~0=v_main_~x~0_152, main_#t~post6=|v_main_#t~post6_66|} OutVars{main_~y~0=v_main_~y~0_134, main_#t~post5=|v_main_#t~post5_65|, main_~x~0=v_main_~x~0_151, main_#t~post6=|v_main_#t~post6_65|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {6186#true} is VALID [2022-04-28 03:44:51,301 INFO L290 TraceCheckUtils]: 5: Hoare triple {6186#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {6186#true} is VALID [2022-04-28 03:44:51,301 INFO L272 TraceCheckUtils]: 4: Hoare triple {6186#true} call #t~ret15 := main(); {6186#true} is VALID [2022-04-28 03:44:51,301 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6186#true} {6186#true} #83#return; {6186#true} is VALID [2022-04-28 03:44:51,301 INFO L290 TraceCheckUtils]: 2: Hoare triple {6186#true} assume true; {6186#true} is VALID [2022-04-28 03:44:51,301 INFO L290 TraceCheckUtils]: 1: Hoare triple {6186#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {6186#true} is VALID [2022-04-28 03:44:51,301 INFO L272 TraceCheckUtils]: 0: Hoare triple {6186#true} call ULTIMATE.init(); {6186#true} is VALID [2022-04-28 03:44:51,301 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:44:51,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1749794778] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:44:51,302 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:44:51,302 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 6] total 18 [2022-04-28 03:44:51,364 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:44:51,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [343236615] [2022-04-28 03:44:51,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [343236615] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:44:51,364 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:44:51,364 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 03:44:51,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713818050] [2022-04-28 03:44:51,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:44:51,365 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 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:44:51,365 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:44:51,365 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 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:44:51,382 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:44:51,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 03:44:51,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:44:51,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 03:44:51,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2022-04-28 03:44:51,382 INFO L87 Difference]: Start difference. First operand 42 states and 53 transitions. Second operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 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:44:52,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:44:52,511 INFO L93 Difference]: Finished difference Result 96 states and 138 transitions. [2022-04-28 03:44:52,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 03:44:52,511 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 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:44:52,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:44:52,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 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:44:52,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 90 transitions. [2022-04-28 03:44:52,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 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:44:52,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 90 transitions. [2022-04-28 03:44:52,513 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 90 transitions. [2022-04-28 03:44:52,617 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:44:52,618 INFO L225 Difference]: With dead ends: 96 [2022-04-28 03:44:52,618 INFO L226 Difference]: Without dead ends: 86 [2022-04-28 03:44:52,618 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=124, Invalid=688, Unknown=0, NotChecked=0, Total=812 [2022-04-28 03:44:52,618 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 85 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 03:44:52,619 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 42 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 03:44:52,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-04-28 03:44:52,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 53. [2022-04-28 03:44:52,795 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:44:52,795 INFO L82 GeneralOperation]: Start isEquivalent. First operand 86 states. Second operand has 53 states, 48 states have (on average 1.3333333333333333) internal successors, (64), 48 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:44:52,795 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand has 53 states, 48 states have (on average 1.3333333333333333) internal successors, (64), 48 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:44:52,795 INFO L87 Difference]: Start difference. First operand 86 states. Second operand has 53 states, 48 states have (on average 1.3333333333333333) internal successors, (64), 48 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:44:52,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:44:52,797 INFO L93 Difference]: Finished difference Result 86 states and 116 transitions. [2022-04-28 03:44:52,797 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 116 transitions. [2022-04-28 03:44:52,797 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:44:52,797 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:44:52,797 INFO L74 IsIncluded]: Start isIncluded. First operand has 53 states, 48 states have (on average 1.3333333333333333) internal successors, (64), 48 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 86 states. [2022-04-28 03:44:52,797 INFO L87 Difference]: Start difference. First operand has 53 states, 48 states have (on average 1.3333333333333333) internal successors, (64), 48 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 86 states. [2022-04-28 03:44:52,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:44:52,798 INFO L93 Difference]: Finished difference Result 86 states and 116 transitions. [2022-04-28 03:44:52,798 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 116 transitions. [2022-04-28 03:44:52,798 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:44:52,798 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:44:52,799 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:44:52,799 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:44:52,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 48 states have (on average 1.3333333333333333) internal successors, (64), 48 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:44:52,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 68 transitions. [2022-04-28 03:44:52,799 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 68 transitions. Word has length 25 [2022-04-28 03:44:52,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:44:52,799 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 68 transitions. [2022-04-28 03:44:52,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 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:44:52,800 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 53 states and 68 transitions. [2022-04-28 03:44:57,405 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 66 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-28 03:44:57,406 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 68 transitions. [2022-04-28 03:44:57,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-28 03:44:57,406 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:44:57,406 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:44:57,421 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:44:57,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:44:57,611 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:44:57,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:44:57,612 INFO L85 PathProgramCache]: Analyzing trace with hash -137630238, now seen corresponding path program 5 times [2022-04-28 03:44:57,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:44:57,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [795058646] [2022-04-28 03:44:57,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:44:57,774 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:44:57,776 INFO L85 PathProgramCache]: Analyzing trace with hash -269680338, now seen corresponding path program 1 times [2022-04-28 03:44:57,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:44:57,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424243082] [2022-04-28 03:44:57,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:44:57,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:44:57,784 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:44:57,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:44:57,811 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_16.5))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:44:58,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:44:58,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:44:58,392 INFO L290 TraceCheckUtils]: 0: Hoare triple {6857#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {6840#true} is VALID [2022-04-28 03:44:58,392 INFO L290 TraceCheckUtils]: 1: Hoare triple {6840#true} assume true; {6840#true} is VALID [2022-04-28 03:44:58,392 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6840#true} {6840#true} #83#return; {6840#true} is VALID [2022-04-28 03:44:58,393 INFO L272 TraceCheckUtils]: 0: Hoare triple {6840#true} call ULTIMATE.init(); {6857#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:44:58,393 INFO L290 TraceCheckUtils]: 1: Hoare triple {6857#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {6840#true} is VALID [2022-04-28 03:44:58,393 INFO L290 TraceCheckUtils]: 2: Hoare triple {6840#true} assume true; {6840#true} is VALID [2022-04-28 03:44:58,393 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6840#true} {6840#true} #83#return; {6840#true} is VALID [2022-04-28 03:44:58,393 INFO L272 TraceCheckUtils]: 4: Hoare triple {6840#true} call #t~ret15 := main(); {6840#true} is VALID [2022-04-28 03:44:58,393 INFO L290 TraceCheckUtils]: 5: Hoare triple {6840#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {6845#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-28 03:44:58,397 INFO L290 TraceCheckUtils]: 6: Hoare triple {6845#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} [117] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= v_main_~x~0_164 v_main_~x~0_163)) (.cse0 (mod v_main_~x~0_164 4294967296)) (.cse2 (= |v_main_#t~post5_71| |v_main_#t~post5_70|)) (.cse3 (= |v_main_#t~post6_71| |v_main_#t~post6_70|))) (or (and (< 0 .cse0) (forall ((v_it_16 Int)) (or (< 0 (mod (+ v_main_~x~0_164 (* 4294967295 v_it_16)) 4294967296)) (not (<= 1 v_it_16)) (not (<= (+ v_main_~y~0_150 v_it_16 1) v_main_~y~0_149)))) (= v_main_~x~0_163 (+ v_main_~x~0_164 (* (- 1) v_main_~y~0_149) v_main_~y~0_150)) (< v_main_~y~0_150 v_main_~y~0_149)) (and .cse1 .cse2 .cse3 (= v_main_~y~0_150 v_main_~y~0_149)) (and .cse1 (<= .cse0 0) .cse2 .cse3 (= v_main_~y~0_149 v_main_~y~0_150)))) InVars {main_~y~0=v_main_~y~0_150, main_#t~post5=|v_main_#t~post5_71|, main_~x~0=v_main_~x~0_164, main_#t~post6=|v_main_#t~post6_71|} OutVars{main_~y~0=v_main_~y~0_149, main_#t~post5=|v_main_#t~post5_70|, main_~x~0=v_main_~x~0_163, main_#t~post6=|v_main_#t~post6_70|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {6846#(or (and (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~x~0) (* (div (+ main_~y~0 main_~x~0) 4294967296) 4294967296) (* (- 1) main_~y~0)) 4294967296) 4294967296) 1) (+ main_~y~0 main_~x~0)) (<= (+ main_~y~0 main_~x~0) main_~n~0)) (and (<= 0 main_~y~0) (<= main_~y~0 0)))} is VALID [2022-04-28 03:44:58,407 INFO L290 TraceCheckUtils]: 7: Hoare triple {6846#(or (and (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~x~0) (* (div (+ main_~y~0 main_~x~0) 4294967296) 4294967296) (* (- 1) main_~y~0)) 4294967296) 4294967296) 1) (+ main_~y~0 main_~x~0)) (<= (+ main_~y~0 main_~x~0) main_~n~0)) (and (<= 0 main_~y~0) (<= main_~y~0 0)))} [116] 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[] {6847#(or (and (<= 0 main_~y~0) (<= main_~y~0 0)) (and (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= (+ (* (div (+ 4294967295 (* (- 1) main_~x~0) (* (div main_~n~0 4294967296) 4294967296) (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296) 1) (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~x~0) (* (div (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296) (* (- 1) main_~y~0)) 4294967296) 4294967296) 1) (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))))))} is VALID [2022-04-28 03:44:58,422 INFO L290 TraceCheckUtils]: 8: Hoare triple {6847#(or (and (<= 0 main_~y~0) (<= main_~y~0 0)) (and (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= (+ (* (div (+ 4294967295 (* (- 1) main_~x~0) (* (div main_~n~0 4294967296) 4294967296) (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296) 1) (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~x~0) (* (div (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296) (* (- 1) main_~y~0)) 4294967296) 4294967296) 1) (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))))))} ~z~0 := ~y~0; {6848#(or (and (<= main_~z~0 0) (<= 0 main_~z~0)) (and (<= (* (div main_~n~0 4294967296) 4294967296) (+ main_~x~0 (* (div main_~z~0 4294967296) 4294967296))) (<= (+ main_~z~0 main_~x~0) main_~n~0) (<= (+ main_~z~0 (* 4294967296 (div main_~x~0 4294967296))) (+ (* (div (+ main_~z~0 main_~x~0 (* (div main_~z~0 4294967296) 4294967296) (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967295))))} is VALID [2022-04-28 03:44:58,485 INFO L290 TraceCheckUtils]: 9: Hoare triple {6848#(or (and (<= main_~z~0 0) (<= 0 main_~z~0)) (and (<= (* (div main_~n~0 4294967296) 4294967296) (+ main_~x~0 (* (div main_~z~0 4294967296) 4294967296))) (<= (+ main_~z~0 main_~x~0) main_~n~0) (<= (+ main_~z~0 (* 4294967296 (div main_~x~0 4294967296))) (+ (* (div (+ main_~z~0 main_~x~0 (* (div main_~z~0 4294967296) 4294967296) (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967295))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {6849#(and (<= (+ (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~x~0 (* (div main_~z~0 4294967296) 4294967296))) (<= main_~z~0 (+ 4294967294 (* 4294967296 (div (+ main_~z~0 main_~x~0 (* (div main_~z~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296)))) (<= (+ main_~z~0 main_~x~0) main_~n~0))} is VALID [2022-04-28 03:44:58,526 INFO L290 TraceCheckUtils]: 10: Hoare triple {6849#(and (<= (+ (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~x~0 (* (div main_~z~0 4294967296) 4294967296))) (<= main_~z~0 (+ 4294967294 (* 4294967296 (div (+ main_~z~0 main_~x~0 (* (div main_~z~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296)))) (<= (+ main_~z~0 main_~x~0) 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; {6850#(and (<= (+ 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~n~0 (* (- 1) main_~x~0)) 4294967296) 4294967296) main_~x~0)) (<= (+ main_~x~0 (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295 (* (- 1) main_~x~0) (* (div main_~z~0 4294967296) 4294967296)) 4294967296) 4294967296)) main_~n~0))} is VALID [2022-04-28 03:44:58,528 INFO L290 TraceCheckUtils]: 11: Hoare triple {6850#(and (<= (+ 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~n~0 (* (- 1) main_~x~0)) 4294967296) 4294967296) main_~x~0)) (<= (+ main_~x~0 (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295 (* (- 1) main_~x~0) (* (div main_~z~0 4294967296) 4294967296)) 4294967296) 4294967296)) main_~n~0))} assume !(~z~0 % 4294967296 > 0); {6851#(and (<= (+ 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~n~0 (* (- 1) main_~x~0)) 4294967296) 4294967296) main_~x~0)) (<= (+ main_~x~0 (* (div (+ main_~n~0 4294967295 (* (- 1) main_~x~0)) 4294967296) 4294967296)) main_~n~0))} is VALID [2022-04-28 03:44:58,529 INFO L290 TraceCheckUtils]: 12: Hoare triple {6851#(and (<= (+ 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~n~0 (* (- 1) main_~x~0)) 4294967296) 4294967296) main_~x~0)) (<= (+ main_~x~0 (* (div (+ main_~n~0 4294967295 (* (- 1) main_~x~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; {6851#(and (<= (+ 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~n~0 (* (- 1) main_~x~0)) 4294967296) 4294967296) main_~x~0)) (<= (+ main_~x~0 (* (div (+ main_~n~0 4294967295 (* (- 1) main_~x~0)) 4294967296) 4294967296)) main_~n~0))} is VALID [2022-04-28 03:44:58,529 INFO L290 TraceCheckUtils]: 13: Hoare triple {6851#(and (<= (+ 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~n~0 (* (- 1) main_~x~0)) 4294967296) 4294967296) main_~x~0)) (<= (+ main_~x~0 (* (div (+ main_~n~0 4294967295 (* (- 1) main_~x~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; {6851#(and (<= (+ 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~n~0 (* (- 1) main_~x~0)) 4294967296) 4294967296) main_~x~0)) (<= (+ main_~x~0 (* (div (+ main_~n~0 4294967295 (* (- 1) main_~x~0)) 4294967296) 4294967296)) main_~n~0))} is VALID [2022-04-28 03:44:58,530 INFO L290 TraceCheckUtils]: 14: Hoare triple {6851#(and (<= (+ 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~n~0 (* (- 1) main_~x~0)) 4294967296) 4294967296) main_~x~0)) (<= (+ main_~x~0 (* (div (+ main_~n~0 4294967295 (* (- 1) main_~x~0)) 4294967296) 4294967296)) main_~n~0))} assume !(~y~0 % 4294967296 > 0); {6851#(and (<= (+ 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~n~0 (* (- 1) main_~x~0)) 4294967296) 4294967296) main_~x~0)) (<= (+ main_~x~0 (* (div (+ main_~n~0 4294967295 (* (- 1) main_~x~0)) 4294967296) 4294967296)) main_~n~0))} is VALID [2022-04-28 03:44:58,532 INFO L290 TraceCheckUtils]: 15: Hoare triple {6851#(and (<= (+ 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~n~0 (* (- 1) main_~x~0)) 4294967296) 4294967296) main_~x~0)) (<= (+ main_~x~0 (* (div (+ main_~n~0 4294967295 (* (- 1) main_~x~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; {6852#(and (<= (+ (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~x~0 (* (div (+ (- 1) main_~n~0 (* (- 1) main_~x~0)) 4294967296) 4294967296))) (<= (+ (* (div (+ main_~n~0 4294967294 (* (- 1) main_~x~0)) 4294967296) 4294967296) main_~x~0 1) main_~n~0))} is VALID [2022-04-28 03:44:58,534 INFO L290 TraceCheckUtils]: 16: Hoare triple {6852#(and (<= (+ (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~x~0 (* (div (+ (- 1) main_~n~0 (* (- 1) main_~x~0)) 4294967296) 4294967296))) (<= (+ (* (div (+ main_~n~0 4294967294 (* (- 1) main_~x~0)) 4294967296) 4294967296) main_~x~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; {6853#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~x~0) 4294967293) 4294967296) 4294967296) main_~x~0 2) main_~n~0) (<= (* (div main_~n~0 4294967296) 4294967296) (+ main_~x~0 (* 4294967296 (div (+ (- 2) main_~n~0 (* (- 1) main_~x~0)) 4294967296)))))} is VALID [2022-04-28 03:44:58,535 INFO L290 TraceCheckUtils]: 17: Hoare triple {6853#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~x~0) 4294967293) 4294967296) 4294967296) main_~x~0 2) main_~n~0) (<= (* (div main_~n~0 4294967296) 4294967296) (+ main_~x~0 (* 4294967296 (div (+ (- 2) main_~n~0 (* (- 1) main_~x~0)) 4294967296)))))} assume !(~x~0 % 4294967296 > 0); {6853#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~x~0) 4294967293) 4294967296) 4294967296) main_~x~0 2) main_~n~0) (<= (* (div main_~n~0 4294967296) 4294967296) (+ main_~x~0 (* 4294967296 (div (+ (- 2) main_~n~0 (* (- 1) main_~x~0)) 4294967296)))))} is VALID [2022-04-28 03:44:58,538 INFO L290 TraceCheckUtils]: 18: Hoare triple {6853#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~x~0) 4294967293) 4294967296) 4294967296) main_~x~0 2) main_~n~0) (<= (* (div main_~n~0 4294967296) 4294967296) (+ main_~x~0 (* 4294967296 (div (+ (- 2) main_~n~0 (* (- 1) main_~x~0)) 4294967296)))))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {6852#(and (<= (+ (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~x~0 (* (div (+ (- 1) main_~n~0 (* (- 1) main_~x~0)) 4294967296) 4294967296))) (<= (+ (* (div (+ main_~n~0 4294967294 (* (- 1) main_~x~0)) 4294967296) 4294967296) main_~x~0 1) main_~n~0))} is VALID [2022-04-28 03:44:58,540 INFO L290 TraceCheckUtils]: 19: Hoare triple {6852#(and (<= (+ (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~x~0 (* (div (+ (- 1) main_~n~0 (* (- 1) main_~x~0)) 4294967296) 4294967296))) (<= (+ (* (div (+ main_~n~0 4294967294 (* (- 1) main_~x~0)) 4294967296) 4294967296) main_~x~0 1) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {6854#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-28 03:44:58,541 INFO L290 TraceCheckUtils]: 20: Hoare triple {6854#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !(~z~0 % 4294967296 > 0); {6854#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-28 03:44:58,541 INFO L272 TraceCheckUtils]: 21: Hoare triple {6854#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {6855#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:44:58,542 INFO L290 TraceCheckUtils]: 22: Hoare triple {6855#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {6856#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:44:58,542 INFO L290 TraceCheckUtils]: 23: Hoare triple {6856#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {6841#false} is VALID [2022-04-28 03:44:58,542 INFO L290 TraceCheckUtils]: 24: Hoare triple {6841#false} assume !false; {6841#false} is VALID [2022-04-28 03:44:58,542 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 03:44:58,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:44:58,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424243082] [2022-04-28 03:44:58,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424243082] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:44:58,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1916940060] [2022-04-28 03:44:58,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:44:58,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:44:58,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:44:58,544 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:44:58,544 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:44:58,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:44:58,947 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 45 conjunts are in the unsatisfiable core [2022-04-28 03:44:59,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:44:59,169 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:45:47,797 INFO L272 TraceCheckUtils]: 0: Hoare triple {6840#true} call ULTIMATE.init(); {6840#true} is VALID [2022-04-28 03:45:47,797 INFO L290 TraceCheckUtils]: 1: Hoare triple {6840#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {6840#true} is VALID [2022-04-28 03:45:47,797 INFO L290 TraceCheckUtils]: 2: Hoare triple {6840#true} assume true; {6840#true} is VALID [2022-04-28 03:45:47,797 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6840#true} {6840#true} #83#return; {6840#true} is VALID [2022-04-28 03:45:47,797 INFO L272 TraceCheckUtils]: 4: Hoare triple {6840#true} call #t~ret15 := main(); {6840#true} is VALID [2022-04-28 03:45:47,798 INFO L290 TraceCheckUtils]: 5: Hoare triple {6840#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {6845#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-28 03:45:47,806 INFO L290 TraceCheckUtils]: 6: Hoare triple {6845#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} [117] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= v_main_~x~0_164 v_main_~x~0_163)) (.cse0 (mod v_main_~x~0_164 4294967296)) (.cse2 (= |v_main_#t~post5_71| |v_main_#t~post5_70|)) (.cse3 (= |v_main_#t~post6_71| |v_main_#t~post6_70|))) (or (and (< 0 .cse0) (forall ((v_it_16 Int)) (or (< 0 (mod (+ v_main_~x~0_164 (* 4294967295 v_it_16)) 4294967296)) (not (<= 1 v_it_16)) (not (<= (+ v_main_~y~0_150 v_it_16 1) v_main_~y~0_149)))) (= v_main_~x~0_163 (+ v_main_~x~0_164 (* (- 1) v_main_~y~0_149) v_main_~y~0_150)) (< v_main_~y~0_150 v_main_~y~0_149)) (and .cse1 .cse2 .cse3 (= v_main_~y~0_150 v_main_~y~0_149)) (and .cse1 (<= .cse0 0) .cse2 .cse3 (= v_main_~y~0_149 v_main_~y~0_150)))) InVars {main_~y~0=v_main_~y~0_150, main_#t~post5=|v_main_#t~post5_71|, main_~x~0=v_main_~x~0_164, main_#t~post6=|v_main_#t~post6_71|} OutVars{main_~y~0=v_main_~y~0_149, main_#t~post5=|v_main_#t~post5_70|, main_~x~0=v_main_~x~0_163, main_#t~post6=|v_main_#t~post6_70|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {6879#(or (and (= main_~x~0 (+ main_~n~0 (* (- 1) main_~y~0))) (forall ((v_it_16 Int)) (or (not (<= (+ v_it_16 1) main_~y~0)) (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_16)) 4294967296)) (not (<= 1 v_it_16)))) (< 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:45:47,807 INFO L290 TraceCheckUtils]: 7: Hoare triple {6879#(or (and (= main_~x~0 (+ main_~n~0 (* (- 1) main_~y~0))) (forall ((v_it_16 Int)) (or (not (<= (+ v_it_16 1) main_~y~0)) (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_16)) 4294967296)) (not (<= 1 v_it_16)))) (< 0 (mod main_~n~0 4294967296)) (< 0 main_~y~0)) (and (= main_~n~0 main_~x~0) (= main_~y~0 0)))} [116] 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[] {6879#(or (and (= main_~x~0 (+ main_~n~0 (* (- 1) main_~y~0))) (forall ((v_it_16 Int)) (or (not (<= (+ v_it_16 1) main_~y~0)) (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_16)) 4294967296)) (not (<= 1 v_it_16)))) (< 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:45:47,808 INFO L290 TraceCheckUtils]: 8: Hoare triple {6879#(or (and (= main_~x~0 (+ main_~n~0 (* (- 1) main_~y~0))) (forall ((v_it_16 Int)) (or (not (<= (+ v_it_16 1) main_~y~0)) (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_16)) 4294967296)) (not (<= 1 v_it_16)))) (< 0 (mod main_~n~0 4294967296)) (< 0 main_~y~0)) (and (= main_~n~0 main_~x~0) (= main_~y~0 0)))} ~z~0 := ~y~0; {6886#(and (or (and (= main_~x~0 (+ main_~n~0 (* (- 1) main_~y~0))) (forall ((v_it_16 Int)) (or (not (<= (+ v_it_16 1) main_~y~0)) (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_16)) 4294967296)) (not (<= 1 v_it_16)))) (< 0 (mod main_~n~0 4294967296)) (< 0 main_~y~0)) (and (= main_~n~0 main_~x~0) (= main_~y~0 0))) (= main_~z~0 main_~y~0))} is VALID [2022-04-28 03:45:47,810 INFO L290 TraceCheckUtils]: 9: Hoare triple {6886#(and (or (and (= main_~x~0 (+ main_~n~0 (* (- 1) main_~y~0))) (forall ((v_it_16 Int)) (or (not (<= (+ v_it_16 1) main_~y~0)) (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_16)) 4294967296)) (not (<= 1 v_it_16)))) (< 0 (mod main_~n~0 4294967296)) (< 0 main_~y~0)) (and (= main_~n~0 main_~x~0) (= main_~y~0 0))) (= 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; {6890#(and (forall ((v_it_16 Int)) (or (not (<= (+ v_it_16 1) main_~y~0)) (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_16)) 4294967296)) (not (<= 1 v_it_16)))) (< 0 (mod main_~n~0 4294967296)) (< 0 main_~y~0) (= (+ main_~n~0 1) (+ main_~y~0 main_~x~0)) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-28 03:45:47,811 INFO L290 TraceCheckUtils]: 10: Hoare triple {6890#(and (forall ((v_it_16 Int)) (or (not (<= (+ v_it_16 1) main_~y~0)) (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_16)) 4294967296)) (not (<= 1 v_it_16)))) (< 0 (mod main_~n~0 4294967296)) (< 0 main_~y~0) (= (+ main_~n~0 1) (+ main_~y~0 main_~x~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; {6894#(and (< 0 (mod (+ main_~z~0 1) 4294967296)) (= main_~y~0 (+ main_~z~0 2)) (= (+ main_~n~0 2 (* (- 1) main_~y~0)) main_~x~0) (forall ((v_it_16 Int)) (or (not (<= (+ v_it_16 1) main_~y~0)) (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_16)) 4294967296)) (not (<= 1 v_it_16)))) (< 0 (mod main_~n~0 4294967296)) (< 0 main_~y~0))} is VALID [2022-04-28 03:45:47,812 INFO L290 TraceCheckUtils]: 11: Hoare triple {6894#(and (< 0 (mod (+ main_~z~0 1) 4294967296)) (= main_~y~0 (+ main_~z~0 2)) (= (+ main_~n~0 2 (* (- 1) main_~y~0)) main_~x~0) (forall ((v_it_16 Int)) (or (not (<= (+ v_it_16 1) main_~y~0)) (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_16)) 4294967296)) (not (<= 1 v_it_16)))) (< 0 (mod main_~n~0 4294967296)) (< 0 main_~y~0))} assume !(~z~0 % 4294967296 > 0); {6898#(and (= main_~y~0 (+ main_~z~0 2)) (forall ((v_it_16 Int)) (or (not (<= (+ v_it_16 1) main_~y~0)) (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_16)) 4294967296)) (not (<= 1 v_it_16)))) (< 0 (mod main_~n~0 4294967296)) (< 0 main_~y~0) (= (+ main_~n~0 2) (+ main_~y~0 main_~x~0)) (<= (mod main_~z~0 4294967296) 0))} is VALID [2022-04-28 03:45:47,841 INFO L290 TraceCheckUtils]: 12: Hoare triple {6898#(and (= main_~y~0 (+ main_~z~0 2)) (forall ((v_it_16 Int)) (or (not (<= (+ v_it_16 1) main_~y~0)) (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_16)) 4294967296)) (not (<= 1 v_it_16)))) (< 0 (mod main_~n~0 4294967296)) (< 0 main_~y~0) (= (+ main_~n~0 2) (+ main_~y~0 main_~x~0)) (<= (mod main_~z~0 4294967296) 0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {6902#(and (= (+ main_~z~0 1) (+ main_~n~0 2 (* (- 1) main_~x~0))) (forall ((v_it_16 Int)) (or (not (<= (+ main_~x~0 v_it_16) (+ main_~n~0 1))) (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_16)) 4294967296)) (not (<= 1 v_it_16)))) (<= (mod (+ main_~z~0 4294967295) 4294967296) 0) (= (+ main_~y~0 1) (+ main_~n~0 2 (* (- 1) main_~x~0))) (< main_~x~0 (+ main_~n~0 2)) (< 0 (mod main_~n~0 4294967296)))} is VALID [2022-04-28 03:45:47,903 INFO L290 TraceCheckUtils]: 13: Hoare triple {6902#(and (= (+ main_~z~0 1) (+ main_~n~0 2 (* (- 1) main_~x~0))) (forall ((v_it_16 Int)) (or (not (<= (+ main_~x~0 v_it_16) (+ main_~n~0 1))) (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_16)) 4294967296)) (not (<= 1 v_it_16)))) (<= (mod (+ main_~z~0 4294967295) 4294967296) 0) (= (+ main_~y~0 1) (+ main_~n~0 2 (* (- 1) main_~x~0))) (< main_~x~0 (+ main_~n~0 2)) (< 0 (mod main_~n~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; {6906#(and (= main_~z~0 (+ main_~n~0 2 (* (- 1) main_~x~0))) (<= (mod (+ main_~n~0 (* main_~x~0 4294967295)) 4294967296) 0) (forall ((v_it_16 Int)) (or (not (<= (+ main_~x~0 v_it_16) (+ main_~n~0 1))) (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_16)) 4294967296)) (not (<= 1 v_it_16)))) (< main_~x~0 (+ main_~n~0 2)) (< 0 (mod main_~n~0 4294967296)) (= (+ main_~y~0 2) (+ main_~n~0 2 (* (- 1) main_~x~0))))} is VALID [2022-04-28 03:45:47,904 INFO L290 TraceCheckUtils]: 14: Hoare triple {6906#(and (= main_~z~0 (+ main_~n~0 2 (* (- 1) main_~x~0))) (<= (mod (+ main_~n~0 (* main_~x~0 4294967295)) 4294967296) 0) (forall ((v_it_16 Int)) (or (not (<= (+ main_~x~0 v_it_16) (+ main_~n~0 1))) (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_16)) 4294967296)) (not (<= 1 v_it_16)))) (< main_~x~0 (+ main_~n~0 2)) (< 0 (mod main_~n~0 4294967296)) (= (+ main_~y~0 2) (+ main_~n~0 2 (* (- 1) main_~x~0))))} assume !(~y~0 % 4294967296 > 0); {6910#(and (<= (mod (+ main_~n~0 (* main_~x~0 4294967295)) 4294967296) 0) (forall ((v_it_16 Int)) (or (not (<= (+ main_~x~0 v_it_16) (+ main_~n~0 1))) (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_16)) 4294967296)) (not (<= 1 v_it_16)))) (= (+ main_~n~0 2) (+ main_~z~0 main_~x~0)) (< main_~x~0 (+ main_~n~0 2)) (< 0 (mod main_~n~0 4294967296)))} is VALID [2022-04-28 03:45:47,909 INFO L290 TraceCheckUtils]: 15: Hoare triple {6910#(and (<= (mod (+ main_~n~0 (* main_~x~0 4294967295)) 4294967296) 0) (forall ((v_it_16 Int)) (or (not (<= (+ main_~x~0 v_it_16) (+ main_~n~0 1))) (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_16)) 4294967296)) (not (<= 1 v_it_16)))) (= (+ main_~n~0 2) (+ main_~z~0 main_~x~0)) (< main_~x~0 (+ main_~n~0 2)) (< 0 (mod main_~n~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; {6914#(and (forall ((v_it_16 Int)) (or (not (<= (+ main_~x~0 v_it_16) main_~n~0)) (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_16)) 4294967296)) (not (<= 1 v_it_16)))) (< main_~x~0 (+ main_~n~0 1)) (<= (mod (+ main_~n~0 4294967295 (* main_~x~0 4294967295)) 4294967296) 0) (= (+ main_~z~0 main_~x~0) (+ main_~n~0 1)) (< 0 (mod main_~n~0 4294967296)))} is VALID [2022-04-28 03:45:47,916 INFO L290 TraceCheckUtils]: 16: Hoare triple {6914#(and (forall ((v_it_16 Int)) (or (not (<= (+ main_~x~0 v_it_16) main_~n~0)) (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_16)) 4294967296)) (not (<= 1 v_it_16)))) (< main_~x~0 (+ main_~n~0 1)) (<= (mod (+ main_~n~0 4294967295 (* main_~x~0 4294967295)) 4294967296) 0) (= (+ main_~z~0 main_~x~0) (+ main_~n~0 1)) (< 0 (mod main_~n~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; {6918#(and (forall ((v_it_16 Int)) (or (not (<= (+ main_~x~0 v_it_16 1) main_~n~0)) (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_16)) 4294967296)) (not (<= 1 v_it_16)))) (< main_~x~0 main_~n~0) (= (+ main_~z~0 main_~x~0 1) (+ main_~n~0 1)) (<= (mod (+ main_~n~0 4294967294 (* main_~x~0 4294967295)) 4294967296) 0) (< 0 (mod main_~n~0 4294967296)))} is VALID [2022-04-28 03:45:47,917 INFO L290 TraceCheckUtils]: 17: Hoare triple {6918#(and (forall ((v_it_16 Int)) (or (not (<= (+ main_~x~0 v_it_16 1) main_~n~0)) (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_16)) 4294967296)) (not (<= 1 v_it_16)))) (< main_~x~0 main_~n~0) (= (+ main_~z~0 main_~x~0 1) (+ main_~n~0 1)) (<= (mod (+ main_~n~0 4294967294 (* main_~x~0 4294967295)) 4294967296) 0) (< 0 (mod main_~n~0 4294967296)))} assume !(~x~0 % 4294967296 > 0); {6922#(and (forall ((v_it_16 Int)) (or (not (<= (+ main_~x~0 v_it_16 1) main_~n~0)) (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_16)) 4294967296)) (not (<= 1 v_it_16)))) (< main_~x~0 main_~n~0) (<= (mod main_~x~0 4294967296) 0) (<= (mod (+ main_~n~0 4294967294 (* main_~x~0 4294967295)) 4294967296) 0) (= main_~n~0 (+ main_~z~0 main_~x~0)))} is VALID [2022-04-28 03:45:47,933 INFO L290 TraceCheckUtils]: 18: Hoare triple {6922#(and (forall ((v_it_16 Int)) (or (not (<= (+ main_~x~0 v_it_16 1) main_~n~0)) (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_16)) 4294967296)) (not (<= 1 v_it_16)))) (< main_~x~0 main_~n~0) (<= (mod main_~x~0 4294967296) 0) (<= (mod (+ main_~n~0 4294967294 (* main_~x~0 4294967295)) 4294967296) 0) (= main_~n~0 (+ main_~z~0 main_~x~0)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {6926#(and (forall ((v_it_16 Int)) (or (not (<= (+ main_~x~0 v_it_16) main_~n~0)) (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_16)) 4294967296)) (not (<= 1 v_it_16)))) (< main_~x~0 (+ main_~n~0 1)) (<= (mod (+ main_~n~0 4294967295 (* main_~x~0 4294967295)) 4294967296) 0) (<= (mod (+ main_~x~0 4294967295) 4294967296) 0) (= (+ main_~n~0 (* (- 1) main_~x~0) 1) (+ main_~z~0 1)))} is VALID [2022-04-28 03:45:47,978 INFO L290 TraceCheckUtils]: 19: Hoare triple {6926#(and (forall ((v_it_16 Int)) (or (not (<= (+ main_~x~0 v_it_16) main_~n~0)) (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_16)) 4294967296)) (not (<= 1 v_it_16)))) (< main_~x~0 (+ main_~n~0 1)) (<= (mod (+ main_~n~0 4294967295 (* main_~x~0 4294967295)) 4294967296) 0) (<= (mod (+ main_~x~0 4294967295) 4294967296) 0) (= (+ main_~n~0 (* (- 1) main_~x~0) 1) (+ main_~z~0 1)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {6930#(and (<= (mod (+ main_~n~0 (* main_~x~0 4294967295)) 4294967296) 0) (forall ((v_it_16 Int)) (or (not (<= (+ main_~x~0 v_it_16) (+ main_~n~0 1))) (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_16)) 4294967296)) (not (<= 1 v_it_16)))) (<= (mod (+ main_~x~0 4294967294) 4294967296) 0) (< main_~x~0 (+ main_~n~0 2)) (= (+ main_~n~0 (* (- 1) main_~x~0) 1) (+ main_~z~0 1)))} is VALID [2022-04-28 03:45:47,978 INFO L290 TraceCheckUtils]: 20: Hoare triple {6930#(and (<= (mod (+ main_~n~0 (* main_~x~0 4294967295)) 4294967296) 0) (forall ((v_it_16 Int)) (or (not (<= (+ main_~x~0 v_it_16) (+ main_~n~0 1))) (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_16)) 4294967296)) (not (<= 1 v_it_16)))) (<= (mod (+ main_~x~0 4294967294) 4294967296) 0) (< main_~x~0 (+ main_~n~0 2)) (= (+ main_~n~0 (* (- 1) main_~x~0) 1) (+ main_~z~0 1)))} assume !(~z~0 % 4294967296 > 0); {6934#(and (<= (mod (+ main_~n~0 (* main_~x~0 4294967295)) 4294967296) 0) (forall ((v_it_16 Int)) (or (not (<= (+ main_~x~0 v_it_16) (+ main_~n~0 1))) (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_16)) 4294967296)) (not (<= 1 v_it_16)))) (<= (mod (+ main_~x~0 4294967294) 4294967296) 0) (< main_~x~0 (+ main_~n~0 2)))} is VALID [2022-04-28 03:45:47,996 INFO L272 TraceCheckUtils]: 21: Hoare triple {6934#(and (<= (mod (+ main_~n~0 (* main_~x~0 4294967295)) 4294967296) 0) (forall ((v_it_16 Int)) (or (not (<= (+ main_~x~0 v_it_16) (+ main_~n~0 1))) (< 0 (mod (+ main_~n~0 (* 4294967295 v_it_16)) 4294967296)) (not (<= 1 v_it_16)))) (<= (mod (+ main_~x~0 4294967294) 4294967296) 0) (< main_~x~0 (+ main_~n~0 2)))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {6938#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:45:47,996 INFO L290 TraceCheckUtils]: 22: Hoare triple {6938#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6942#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:45:47,996 INFO L290 TraceCheckUtils]: 23: Hoare triple {6942#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6841#false} is VALID [2022-04-28 03:45:47,996 INFO L290 TraceCheckUtils]: 24: Hoare triple {6841#false} assume !false; {6841#false} is VALID [2022-04-28 03:45:47,997 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:45:47,997 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:47:21,278 WARN L232 SmtUtils]: Spent 20.33s on a formula simplification that was a NOOP. DAG size: 84 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-28 03:47:22,832 INFO L290 TraceCheckUtils]: 24: Hoare triple {6841#false} assume !false; {6841#false} is VALID [2022-04-28 03:47:22,832 INFO L290 TraceCheckUtils]: 23: Hoare triple {6942#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6841#false} is VALID [2022-04-28 03:47:22,832 INFO L290 TraceCheckUtils]: 22: Hoare triple {6938#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6942#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:47:22,833 INFO L272 TraceCheckUtils]: 21: Hoare triple {6854#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {6938#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:47:22,834 INFO L290 TraceCheckUtils]: 20: Hoare triple {6961#(or (and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1))) (< 0 (mod main_~z~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {6854#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-28 03:47:22,835 INFO L290 TraceCheckUtils]: 19: Hoare triple {6965#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)))))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {6961#(or (and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1))) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-28 03:47:22,837 INFO L290 TraceCheckUtils]: 18: Hoare triple {6969#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (and (<= (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296)))))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {6965#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)))))} is VALID [2022-04-28 03:47:22,837 INFO L290 TraceCheckUtils]: 17: Hoare triple {6973#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (and (<= (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296)))) (< 0 (mod main_~x~0 4294967296)))} assume !(~x~0 % 4294967296 > 0); {6969#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (and (<= (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296)))))} is VALID [2022-04-28 03:47:22,865 INFO L290 TraceCheckUtils]: 16: Hoare triple {6977#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 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; {6973#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (and (<= (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296)))) (< 0 (mod main_~x~0 4294967296)))} is VALID [2022-04-28 03:47:22,868 INFO L290 TraceCheckUtils]: 15: Hoare triple {6981#(or (and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1))) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (< 0 (mod (+ main_~x~0 4294967294) 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; {6977#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)))))} is VALID [2022-04-28 03:47:22,869 INFO L290 TraceCheckUtils]: 14: Hoare triple {6985#(or (and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1))) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)) (< 0 (mod main_~y~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {6981#(or (and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1))) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} is VALID [2022-04-28 03:47:22,871 INFO L290 TraceCheckUtils]: 13: Hoare triple {6989#(or (and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1))) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (< 0 (mod (+ main_~x~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; {6985#(or (and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1))) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 03:47:22,873 INFO L290 TraceCheckUtils]: 12: Hoare triple {6993#(or (and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1))) (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (< 0 (mod main_~z~0 4294967296)) (< 0 (mod (+ main_~x~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; {6989#(or (and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1))) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} is VALID [2022-04-28 03:47:22,873 INFO L290 TraceCheckUtils]: 11: Hoare triple {6993#(or (and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1))) (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (< 0 (mod main_~z~0 4294967296)) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {6993#(or (and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1))) (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (< 0 (mod main_~z~0 4294967296)) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} is VALID [2022-04-28 03:47:22,877 INFO L290 TraceCheckUtils]: 10: Hoare triple {7000#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 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; {6993#(or (and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1))) (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (< 0 (mod main_~z~0 4294967296)) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} is VALID [2022-04-28 03:47:22,879 INFO L290 TraceCheckUtils]: 9: Hoare triple {7004#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (and (<= (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296)))) (< 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; {7000#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)))))} is VALID [2022-04-28 03:47:22,880 INFO L290 TraceCheckUtils]: 8: Hoare triple {7008#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (and (<= (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296)))) (< 0 (mod main_~x~0 4294967296)))} ~z~0 := ~y~0; {7004#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (and (<= (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296)))) (< 0 (mod main_~x~0 4294967296)))} is VALID [2022-04-28 03:47:22,881 INFO L290 TraceCheckUtils]: 7: Hoare triple {7008#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (and (<= (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296)))) (< 0 (mod main_~x~0 4294967296)))} [116] 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[] {7008#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (and (<= (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296)))) (< 0 (mod main_~x~0 4294967296)))} is VALID [2022-04-28 03:47:24,885 WARN L290 TraceCheckUtils]: 6: Hoare triple {7015#(and (or (< (div (+ (- 4294967295) (* (- 1) main_~y~0)) (- 4294967296)) (+ 2 (div (+ main_~y~0 4294967293) 4294967296))) (and (<= (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296)))) (< (div (+ (- 1) (* (- 1) main_~x~0)) (- 4294967296)) (+ 2 (div (+ (- 1) main_~x~0) 4294967296)))) (or (and (forall ((aux_mod_aux_mod_v_main_~x~0_181_32_91 Int) (aux_div_v_main_~y~0_161_47 Int) (aux_div_aux_mod_v_main_~x~0_181_32_91 Int) (aux_div_v_main_~x~0_181_32 Int)) (or (< (+ main_~y~0 main_~x~0 4294967296) (+ aux_mod_aux_mod_v_main_~x~0_181_32_91 (* 4294967296 aux_div_aux_mod_v_main_~x~0_181_32_91) (* 4294967296 aux_div_v_main_~y~0_161_47))) (exists ((v_it_16 Int)) (and (not (< 0 (mod (+ main_~x~0 (* 4294967295 v_it_16)) 4294967296))) (<= (+ aux_mod_aux_mod_v_main_~x~0_181_32_91 v_it_16 (* 4294967296 aux_div_aux_mod_v_main_~x~0_181_32_91)) (+ main_~x~0 1)) (<= 1 v_it_16))) (< (+ 2 (* 4294967296 aux_div_v_main_~x~0_181_32)) (+ aux_mod_aux_mod_v_main_~x~0_181_32_91 (* 4294967296 aux_div_aux_mod_v_main_~x~0_181_32_91))) (< (+ aux_mod_aux_mod_v_main_~x~0_181_32_91 (* 4294967296 aux_div_aux_mod_v_main_~x~0_181_32_91) (* 4294967296 aux_div_v_main_~y~0_161_47)) (+ main_~y~0 main_~x~0 4294967296)) (< (+ aux_mod_aux_mod_v_main_~x~0_181_32_91 (* 4294967296 aux_div_aux_mod_v_main_~x~0_181_32_91)) (+ 2 (* 4294967296 aux_div_v_main_~x~0_181_32))) (< main_~n~0 (+ aux_mod_aux_mod_v_main_~x~0_181_32_91 (* (div main_~n~0 4294967296) 4294967296) 1)) (not (< (+ aux_mod_aux_mod_v_main_~x~0_181_32_91 (* 4294967296 aux_div_aux_mod_v_main_~x~0_181_32_91)) (+ main_~x~0 2))) (> 0 aux_mod_aux_mod_v_main_~x~0_181_32_91))) (forall ((aux_mod_aux_mod_v_main_~x~0_181_32_91 Int) (aux_div_v_main_~y~0_161_47 Int) (aux_div_aux_mod_v_main_~x~0_181_32_91 Int) (aux_div_v_main_~x~0_181_32 Int)) (or (< (+ main_~y~0 main_~x~0 4294967296) (+ aux_mod_aux_mod_v_main_~x~0_181_32_91 (* 4294967296 aux_div_aux_mod_v_main_~x~0_181_32_91) (* 4294967296 aux_div_v_main_~y~0_161_47))) (exists ((v_it_16 Int)) (and (not (< 0 (mod (+ main_~x~0 (* 4294967295 v_it_16)) 4294967296))) (<= (+ aux_mod_aux_mod_v_main_~x~0_181_32_91 v_it_16 (* 4294967296 aux_div_aux_mod_v_main_~x~0_181_32_91)) (+ main_~x~0 1)) (<= 1 v_it_16))) (< (+ 2 (* 4294967296 aux_div_v_main_~x~0_181_32)) (+ aux_mod_aux_mod_v_main_~x~0_181_32_91 (* 4294967296 aux_div_aux_mod_v_main_~x~0_181_32_91))) (< (+ aux_mod_aux_mod_v_main_~x~0_181_32_91 (* 4294967296 aux_div_aux_mod_v_main_~x~0_181_32_91) (* 4294967296 aux_div_v_main_~y~0_161_47)) (+ main_~y~0 main_~x~0 4294967296)) (< (+ aux_mod_aux_mod_v_main_~x~0_181_32_91 (* 4294967296 aux_div_aux_mod_v_main_~x~0_181_32_91)) (+ 2 (* 4294967296 aux_div_v_main_~x~0_181_32))) (not (< (+ aux_mod_aux_mod_v_main_~x~0_181_32_91 (* 4294967296 aux_div_aux_mod_v_main_~x~0_181_32_91)) (+ main_~x~0 2))) (<= (+ aux_mod_aux_mod_v_main_~x~0_181_32_91 (* (div main_~n~0 4294967296) 4294967296)) main_~n~0) (>= aux_mod_aux_mod_v_main_~x~0_181_32_91 4294967296)))) (not (< 0 (mod main_~x~0 4294967296)))))} [117] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= v_main_~x~0_164 v_main_~x~0_163)) (.cse0 (mod v_main_~x~0_164 4294967296)) (.cse2 (= |v_main_#t~post5_71| |v_main_#t~post5_70|)) (.cse3 (= |v_main_#t~post6_71| |v_main_#t~post6_70|))) (or (and (< 0 .cse0) (forall ((v_it_16 Int)) (or (< 0 (mod (+ v_main_~x~0_164 (* 4294967295 v_it_16)) 4294967296)) (not (<= 1 v_it_16)) (not (<= (+ v_main_~y~0_150 v_it_16 1) v_main_~y~0_149)))) (= v_main_~x~0_163 (+ v_main_~x~0_164 (* (- 1) v_main_~y~0_149) v_main_~y~0_150)) (< v_main_~y~0_150 v_main_~y~0_149)) (and .cse1 .cse2 .cse3 (= v_main_~y~0_150 v_main_~y~0_149)) (and .cse1 (<= .cse0 0) .cse2 .cse3 (= v_main_~y~0_149 v_main_~y~0_150)))) InVars {main_~y~0=v_main_~y~0_150, main_#t~post5=|v_main_#t~post5_71|, main_~x~0=v_main_~x~0_164, main_#t~post6=|v_main_#t~post6_71|} OutVars{main_~y~0=v_main_~y~0_149, main_#t~post5=|v_main_#t~post5_70|, main_~x~0=v_main_~x~0_163, main_#t~post6=|v_main_#t~post6_70|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {7008#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (and (<= (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296)))) (< 0 (mod main_~x~0 4294967296)))} is UNKNOWN [2022-04-28 03:47:24,913 INFO L290 TraceCheckUtils]: 5: Hoare triple {6840#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {7015#(and (or (< (div (+ (- 4294967295) (* (- 1) main_~y~0)) (- 4294967296)) (+ 2 (div (+ main_~y~0 4294967293) 4294967296))) (and (<= (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296)))) (< (div (+ (- 1) (* (- 1) main_~x~0)) (- 4294967296)) (+ 2 (div (+ (- 1) main_~x~0) 4294967296)))) (or (and (forall ((aux_mod_aux_mod_v_main_~x~0_181_32_91 Int) (aux_div_v_main_~y~0_161_47 Int) (aux_div_aux_mod_v_main_~x~0_181_32_91 Int) (aux_div_v_main_~x~0_181_32 Int)) (or (< (+ main_~y~0 main_~x~0 4294967296) (+ aux_mod_aux_mod_v_main_~x~0_181_32_91 (* 4294967296 aux_div_aux_mod_v_main_~x~0_181_32_91) (* 4294967296 aux_div_v_main_~y~0_161_47))) (exists ((v_it_16 Int)) (and (not (< 0 (mod (+ main_~x~0 (* 4294967295 v_it_16)) 4294967296))) (<= (+ aux_mod_aux_mod_v_main_~x~0_181_32_91 v_it_16 (* 4294967296 aux_div_aux_mod_v_main_~x~0_181_32_91)) (+ main_~x~0 1)) (<= 1 v_it_16))) (< (+ 2 (* 4294967296 aux_div_v_main_~x~0_181_32)) (+ aux_mod_aux_mod_v_main_~x~0_181_32_91 (* 4294967296 aux_div_aux_mod_v_main_~x~0_181_32_91))) (< (+ aux_mod_aux_mod_v_main_~x~0_181_32_91 (* 4294967296 aux_div_aux_mod_v_main_~x~0_181_32_91) (* 4294967296 aux_div_v_main_~y~0_161_47)) (+ main_~y~0 main_~x~0 4294967296)) (< (+ aux_mod_aux_mod_v_main_~x~0_181_32_91 (* 4294967296 aux_div_aux_mod_v_main_~x~0_181_32_91)) (+ 2 (* 4294967296 aux_div_v_main_~x~0_181_32))) (< main_~n~0 (+ aux_mod_aux_mod_v_main_~x~0_181_32_91 (* (div main_~n~0 4294967296) 4294967296) 1)) (not (< (+ aux_mod_aux_mod_v_main_~x~0_181_32_91 (* 4294967296 aux_div_aux_mod_v_main_~x~0_181_32_91)) (+ main_~x~0 2))) (> 0 aux_mod_aux_mod_v_main_~x~0_181_32_91))) (forall ((aux_mod_aux_mod_v_main_~x~0_181_32_91 Int) (aux_div_v_main_~y~0_161_47 Int) (aux_div_aux_mod_v_main_~x~0_181_32_91 Int) (aux_div_v_main_~x~0_181_32 Int)) (or (< (+ main_~y~0 main_~x~0 4294967296) (+ aux_mod_aux_mod_v_main_~x~0_181_32_91 (* 4294967296 aux_div_aux_mod_v_main_~x~0_181_32_91) (* 4294967296 aux_div_v_main_~y~0_161_47))) (exists ((v_it_16 Int)) (and (not (< 0 (mod (+ main_~x~0 (* 4294967295 v_it_16)) 4294967296))) (<= (+ aux_mod_aux_mod_v_main_~x~0_181_32_91 v_it_16 (* 4294967296 aux_div_aux_mod_v_main_~x~0_181_32_91)) (+ main_~x~0 1)) (<= 1 v_it_16))) (< (+ 2 (* 4294967296 aux_div_v_main_~x~0_181_32)) (+ aux_mod_aux_mod_v_main_~x~0_181_32_91 (* 4294967296 aux_div_aux_mod_v_main_~x~0_181_32_91))) (< (+ aux_mod_aux_mod_v_main_~x~0_181_32_91 (* 4294967296 aux_div_aux_mod_v_main_~x~0_181_32_91) (* 4294967296 aux_div_v_main_~y~0_161_47)) (+ main_~y~0 main_~x~0 4294967296)) (< (+ aux_mod_aux_mod_v_main_~x~0_181_32_91 (* 4294967296 aux_div_aux_mod_v_main_~x~0_181_32_91)) (+ 2 (* 4294967296 aux_div_v_main_~x~0_181_32))) (not (< (+ aux_mod_aux_mod_v_main_~x~0_181_32_91 (* 4294967296 aux_div_aux_mod_v_main_~x~0_181_32_91)) (+ main_~x~0 2))) (<= (+ aux_mod_aux_mod_v_main_~x~0_181_32_91 (* (div main_~n~0 4294967296) 4294967296)) main_~n~0) (>= aux_mod_aux_mod_v_main_~x~0_181_32_91 4294967296)))) (not (< 0 (mod main_~x~0 4294967296)))))} is VALID [2022-04-28 03:47:24,913 INFO L272 TraceCheckUtils]: 4: Hoare triple {6840#true} call #t~ret15 := main(); {6840#true} is VALID [2022-04-28 03:47:24,914 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6840#true} {6840#true} #83#return; {6840#true} is VALID [2022-04-28 03:47:24,914 INFO L290 TraceCheckUtils]: 2: Hoare triple {6840#true} assume true; {6840#true} is VALID [2022-04-28 03:47:24,914 INFO L290 TraceCheckUtils]: 1: Hoare triple {6840#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {6840#true} is VALID [2022-04-28 03:47:24,914 INFO L272 TraceCheckUtils]: 0: Hoare triple {6840#true} call ULTIMATE.init(); {6840#true} is VALID [2022-04-28 03:47:24,914 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:47:24,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1916940060] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:47:24,914 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:47:24,914 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 19, 18] total 44 [2022-04-28 03:47:37,639 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:47:37,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [795058646] [2022-04-28 03:47:37,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [795058646] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:47:37,639 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:47:37,640 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-28 03:47:37,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692272242] [2022-04-28 03:47:37,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:47:37,640 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 26 [2022-04-28 03:47:37,640 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:47:37,640 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:47:39,898 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 24 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 03:47:39,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-28 03:47:39,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:47:39,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-28 03:47:39,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=375, Invalid=1663, Unknown=32, NotChecked=0, Total=2070 [2022-04-28 03:47:39,900 INFO L87 Difference]: Start difference. First operand 53 states and 68 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:47:46,283 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-28 03:47:53,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:47:53,712 INFO L93 Difference]: Finished difference Result 80 states and 104 transitions. [2022-04-28 03:47:53,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-28 03:47:53,712 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 26 [2022-04-28 03:47:53,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:47:53,712 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:47:53,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 49 transitions. [2022-04-28 03:47:53,713 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:47:53,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 49 transitions. [2022-04-28 03:47:53,713 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 49 transitions. [2022-04-28 03:47:54,518 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:47:54,519 INFO L225 Difference]: With dead ends: 80 [2022-04-28 03:47:54,519 INFO L226 Difference]: Without dead ends: 69 [2022-04-28 03:47:54,520 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 22 SyntacticMatches, 4 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1140 ImplicationChecksByTransitivity, 128.0s TimeCoverageRelationStatistics Valid=511, Invalid=2646, Unknown=35, NotChecked=0, Total=3192 [2022-04-28 03:47:54,520 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 26 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 26 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 30 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-04-28 03:47:54,521 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 67 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 214 Invalid, 1 Unknown, 30 Unchecked, 2.6s Time] [2022-04-28 03:47:54,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-04-28 03:47:54,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 56. [2022-04-28 03:47:54,793 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:47:54,793 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand has 56 states, 51 states have (on average 1.2941176470588236) internal successors, (66), 51 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:47:54,793 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand has 56 states, 51 states have (on average 1.2941176470588236) internal successors, (66), 51 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:47:54,793 INFO L87 Difference]: Start difference. First operand 69 states. Second operand has 56 states, 51 states have (on average 1.2941176470588236) internal successors, (66), 51 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:47:54,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:47:54,794 INFO L93 Difference]: Finished difference Result 69 states and 88 transitions. [2022-04-28 03:47:54,794 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 88 transitions. [2022-04-28 03:47:54,794 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:47:54,794 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:47:54,794 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 51 states have (on average 1.2941176470588236) internal successors, (66), 51 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 69 states. [2022-04-28 03:47:54,794 INFO L87 Difference]: Start difference. First operand has 56 states, 51 states have (on average 1.2941176470588236) internal successors, (66), 51 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 69 states. [2022-04-28 03:47:54,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:47:54,795 INFO L93 Difference]: Finished difference Result 69 states and 88 transitions. [2022-04-28 03:47:54,795 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 88 transitions. [2022-04-28 03:47:54,795 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:47:54,795 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:47:54,795 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:47:54,795 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:47:54,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 51 states have (on average 1.2941176470588236) internal successors, (66), 51 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:47:54,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 70 transitions. [2022-04-28 03:47:54,796 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 70 transitions. Word has length 26 [2022-04-28 03:47:54,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:47:54,796 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 70 transitions. [2022-04-28 03:47:54,796 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:47:54,796 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 56 states and 70 transitions. [2022-04-28 03:48:02,322 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 68 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-28 03:48:02,322 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 70 transitions. [2022-04-28 03:48:02,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-28 03:48:02,323 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:48:02,323 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:48:02,326 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-04-28 03:48:02,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:48:02,523 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:48:02,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:48:02,523 INFO L85 PathProgramCache]: Analyzing trace with hash 62925025, now seen corresponding path program 6 times [2022-04-28 03:48:02,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:48:02,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1492656497] [2022-04-28 03:48:02,684 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:02,685 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:48:02,687 INFO L85 PathProgramCache]: Analyzing trace with hash 2052714325, now seen corresponding path program 1 times [2022-04-28 03:48:02,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:48:02,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838640156] [2022-04-28 03:48:02,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:48:02,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:48:02,698 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:48:02,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:48:02,707 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:48:02,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:48:02,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:48:02,759 INFO L290 TraceCheckUtils]: 0: Hoare triple {7478#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {7470#true} is VALID [2022-04-28 03:48:02,759 INFO L290 TraceCheckUtils]: 1: Hoare triple {7470#true} assume true; {7470#true} is VALID [2022-04-28 03:48:02,759 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7470#true} {7470#true} #83#return; {7470#true} is VALID [2022-04-28 03:48:02,759 INFO L272 TraceCheckUtils]: 0: Hoare triple {7470#true} call ULTIMATE.init(); {7478#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:48:02,759 INFO L290 TraceCheckUtils]: 1: Hoare triple {7478#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {7470#true} is VALID [2022-04-28 03:48:02,759 INFO L290 TraceCheckUtils]: 2: Hoare triple {7470#true} assume true; {7470#true} is VALID [2022-04-28 03:48:02,759 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7470#true} {7470#true} #83#return; {7470#true} is VALID [2022-04-28 03:48:02,759 INFO L272 TraceCheckUtils]: 4: Hoare triple {7470#true} call #t~ret15 := main(); {7470#true} is VALID [2022-04-28 03:48:02,760 INFO L290 TraceCheckUtils]: 5: Hoare triple {7470#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {7470#true} is VALID [2022-04-28 03:48:02,760 INFO L290 TraceCheckUtils]: 6: Hoare triple {7470#true} [119] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_78| |v_main_#t~post5_77|)) (.cse1 (= v_main_~x~0_187 v_main_~x~0_186)) (.cse2 (= v_main_~y~0_167 v_main_~y~0_166)) (.cse3 (= |v_main_#t~post6_78| |v_main_#t~post6_77|)) (.cse4 (mod v_main_~x~0_187 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3) (and (<= .cse4 0) .cse0 .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_167 (* v_main_~x~0_186 (- 1))) v_main_~y~0_166)))) InVars {main_~y~0=v_main_~y~0_167, main_#t~post5=|v_main_#t~post5_78|, main_~x~0=v_main_~x~0_187, main_#t~post6=|v_main_#t~post6_78|} OutVars{main_~y~0=v_main_~y~0_166, main_#t~post5=|v_main_#t~post5_77|, main_~x~0=v_main_~x~0_186, main_#t~post6=|v_main_#t~post6_77|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {7470#true} is VALID [2022-04-28 03:48:02,760 INFO L290 TraceCheckUtils]: 7: Hoare triple {7470#true} [118] 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[] {7470#true} is VALID [2022-04-28 03:48:02,760 INFO L290 TraceCheckUtils]: 8: Hoare triple {7470#true} ~z~0 := ~y~0; {7470#true} is VALID [2022-04-28 03:48:02,760 INFO L290 TraceCheckUtils]: 9: Hoare triple {7470#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7470#true} is VALID [2022-04-28 03:48:02,760 INFO L290 TraceCheckUtils]: 10: Hoare triple {7470#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {7470#true} is VALID [2022-04-28 03:48:02,760 INFO L290 TraceCheckUtils]: 11: Hoare triple {7470#true} assume !(~z~0 % 4294967296 > 0); {7475#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} is VALID [2022-04-28 03:48:02,761 INFO L290 TraceCheckUtils]: 12: Hoare triple {7475#(<= 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; {7476#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1))} is VALID [2022-04-28 03:48:02,762 INFO L290 TraceCheckUtils]: 13: Hoare triple {7476#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~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; {7477#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} is VALID [2022-04-28 03:48:02,763 INFO L290 TraceCheckUtils]: 14: Hoare triple {7477#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} assume !(~y~0 % 4294967296 > 0); {7477#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} is VALID [2022-04-28 03:48:02,763 INFO L290 TraceCheckUtils]: 15: Hoare triple {7477#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 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; {7477#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} is VALID [2022-04-28 03:48:02,763 INFO L290 TraceCheckUtils]: 16: Hoare triple {7477#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 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; {7477#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} is VALID [2022-04-28 03:48:02,764 INFO L290 TraceCheckUtils]: 17: Hoare triple {7477#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} assume !(~x~0 % 4294967296 > 0); {7477#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} is VALID [2022-04-28 03:48:02,765 INFO L290 TraceCheckUtils]: 18: Hoare triple {7477#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {7476#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1))} is VALID [2022-04-28 03:48:02,766 INFO L290 TraceCheckUtils]: 19: Hoare triple {7476#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {7475#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} is VALID [2022-04-28 03:48:02,766 INFO L290 TraceCheckUtils]: 20: Hoare triple {7475#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {7471#false} is VALID [2022-04-28 03:48:02,766 INFO L290 TraceCheckUtils]: 21: Hoare triple {7471#false} assume !(~z~0 % 4294967296 > 0); {7471#false} is VALID [2022-04-28 03:48:02,767 INFO L272 TraceCheckUtils]: 22: Hoare triple {7471#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {7471#false} is VALID [2022-04-28 03:48:02,767 INFO L290 TraceCheckUtils]: 23: Hoare triple {7471#false} ~cond := #in~cond; {7471#false} is VALID [2022-04-28 03:48:02,767 INFO L290 TraceCheckUtils]: 24: Hoare triple {7471#false} assume 0 == ~cond; {7471#false} is VALID [2022-04-28 03:48:02,767 INFO L290 TraceCheckUtils]: 25: Hoare triple {7471#false} assume !false; {7471#false} is VALID [2022-04-28 03:48:02,767 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:48:02,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:48:02,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838640156] [2022-04-28 03:48:02,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838640156] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:48:02,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1709719389] [2022-04-28 03:48:02,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:48:02,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:48:02,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:48:02,771 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:48:02,772 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:48:02,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:48:02,807 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-28 03:48:02,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:48:02,814 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:48:03,051 INFO L272 TraceCheckUtils]: 0: Hoare triple {7470#true} call ULTIMATE.init(); {7470#true} is VALID [2022-04-28 03:48:03,052 INFO L290 TraceCheckUtils]: 1: Hoare triple {7470#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {7470#true} is VALID [2022-04-28 03:48:03,052 INFO L290 TraceCheckUtils]: 2: Hoare triple {7470#true} assume true; {7470#true} is VALID [2022-04-28 03:48:03,052 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7470#true} {7470#true} #83#return; {7470#true} is VALID [2022-04-28 03:48:03,052 INFO L272 TraceCheckUtils]: 4: Hoare triple {7470#true} call #t~ret15 := main(); {7470#true} is VALID [2022-04-28 03:48:03,052 INFO L290 TraceCheckUtils]: 5: Hoare triple {7470#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {7470#true} is VALID [2022-04-28 03:48:03,052 INFO L290 TraceCheckUtils]: 6: Hoare triple {7470#true} [119] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_78| |v_main_#t~post5_77|)) (.cse1 (= v_main_~x~0_187 v_main_~x~0_186)) (.cse2 (= v_main_~y~0_167 v_main_~y~0_166)) (.cse3 (= |v_main_#t~post6_78| |v_main_#t~post6_77|)) (.cse4 (mod v_main_~x~0_187 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3) (and (<= .cse4 0) .cse0 .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_167 (* v_main_~x~0_186 (- 1))) v_main_~y~0_166)))) InVars {main_~y~0=v_main_~y~0_167, main_#t~post5=|v_main_#t~post5_78|, main_~x~0=v_main_~x~0_187, main_#t~post6=|v_main_#t~post6_78|} OutVars{main_~y~0=v_main_~y~0_166, main_#t~post5=|v_main_#t~post5_77|, main_~x~0=v_main_~x~0_186, main_#t~post6=|v_main_#t~post6_77|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {7470#true} is VALID [2022-04-28 03:48:03,052 INFO L290 TraceCheckUtils]: 7: Hoare triple {7470#true} [118] 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[] {7470#true} is VALID [2022-04-28 03:48:03,056 INFO L290 TraceCheckUtils]: 8: Hoare triple {7470#true} ~z~0 := ~y~0; {7506#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 03:48:03,056 INFO L290 TraceCheckUtils]: 9: Hoare triple {7506#(= 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; {7510#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-28 03:48:03,057 INFO L290 TraceCheckUtils]: 10: Hoare triple {7510#(= 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; {7514#(= (+ main_~z~0 1) (+ (- 1) main_~y~0))} is VALID [2022-04-28 03:48:03,057 INFO L290 TraceCheckUtils]: 11: Hoare triple {7514#(= (+ main_~z~0 1) (+ (- 1) main_~y~0))} assume !(~z~0 % 4294967296 > 0); {7514#(= (+ main_~z~0 1) (+ (- 1) main_~y~0))} is VALID [2022-04-28 03:48:03,058 INFO L290 TraceCheckUtils]: 12: Hoare triple {7514#(= (+ main_~z~0 1) (+ (- 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; {7506#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 03:48:03,058 INFO L290 TraceCheckUtils]: 13: Hoare triple {7506#(= main_~z~0 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; {7524#(= (+ (- 1) main_~z~0) (+ main_~y~0 1))} is VALID [2022-04-28 03:48:03,059 INFO L290 TraceCheckUtils]: 14: Hoare triple {7524#(= (+ (- 1) main_~z~0) (+ main_~y~0 1))} assume !(~y~0 % 4294967296 > 0); {7477#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} is VALID [2022-04-28 03:48:03,059 INFO L290 TraceCheckUtils]: 15: Hoare triple {7477#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 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; {7477#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} is VALID [2022-04-28 03:48:03,060 INFO L290 TraceCheckUtils]: 16: Hoare triple {7477#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 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; {7477#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} is VALID [2022-04-28 03:48:03,060 INFO L290 TraceCheckUtils]: 17: Hoare triple {7477#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} assume !(~x~0 % 4294967296 > 0); {7477#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} is VALID [2022-04-28 03:48:03,061 INFO L290 TraceCheckUtils]: 18: Hoare triple {7477#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {7476#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1))} is VALID [2022-04-28 03:48:03,062 INFO L290 TraceCheckUtils]: 19: Hoare triple {7476#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {7475#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} is VALID [2022-04-28 03:48:03,062 INFO L290 TraceCheckUtils]: 20: Hoare triple {7475#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {7471#false} is VALID [2022-04-28 03:48:03,062 INFO L290 TraceCheckUtils]: 21: Hoare triple {7471#false} assume !(~z~0 % 4294967296 > 0); {7471#false} is VALID [2022-04-28 03:48:03,063 INFO L272 TraceCheckUtils]: 22: Hoare triple {7471#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {7471#false} is VALID [2022-04-28 03:48:03,063 INFO L290 TraceCheckUtils]: 23: Hoare triple {7471#false} ~cond := #in~cond; {7471#false} is VALID [2022-04-28 03:48:03,063 INFO L290 TraceCheckUtils]: 24: Hoare triple {7471#false} assume 0 == ~cond; {7471#false} is VALID [2022-04-28 03:48:03,063 INFO L290 TraceCheckUtils]: 25: Hoare triple {7471#false} assume !false; {7471#false} is VALID [2022-04-28 03:48:03,063 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 03:48:03,063 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:48:03,403 INFO L290 TraceCheckUtils]: 25: Hoare triple {7471#false} assume !false; {7471#false} is VALID [2022-04-28 03:48:03,403 INFO L290 TraceCheckUtils]: 24: Hoare triple {7471#false} assume 0 == ~cond; {7471#false} is VALID [2022-04-28 03:48:03,403 INFO L290 TraceCheckUtils]: 23: Hoare triple {7471#false} ~cond := #in~cond; {7471#false} is VALID [2022-04-28 03:48:03,403 INFO L272 TraceCheckUtils]: 22: Hoare triple {7471#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {7471#false} is VALID [2022-04-28 03:48:03,403 INFO L290 TraceCheckUtils]: 21: Hoare triple {7471#false} assume !(~z~0 % 4294967296 > 0); {7471#false} is VALID [2022-04-28 03:48:03,404 INFO L290 TraceCheckUtils]: 20: Hoare triple {7475#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {7471#false} is VALID [2022-04-28 03:48:03,405 INFO L290 TraceCheckUtils]: 19: Hoare triple {7476#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {7475#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} is VALID [2022-04-28 03:48:03,406 INFO L290 TraceCheckUtils]: 18: Hoare triple {7477#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {7476#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1))} is VALID [2022-04-28 03:48:03,406 INFO L290 TraceCheckUtils]: 17: Hoare triple {7477#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} assume !(~x~0 % 4294967296 > 0); {7477#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} is VALID [2022-04-28 03:48:03,406 INFO L290 TraceCheckUtils]: 16: Hoare triple {7477#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 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; {7477#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} is VALID [2022-04-28 03:48:03,410 INFO L290 TraceCheckUtils]: 15: Hoare triple {7477#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 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; {7477#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} is VALID [2022-04-28 03:48:03,411 INFO L290 TraceCheckUtils]: 14: Hoare triple {7594#(or (<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2)) (< 0 (mod main_~y~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {7477#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2))} is VALID [2022-04-28 03:48:03,412 INFO L290 TraceCheckUtils]: 13: Hoare triple {7598#(or (<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1)) (< 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; {7594#(or (<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2)) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 03:48:03,414 INFO L290 TraceCheckUtils]: 12: Hoare triple {7602#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (<= 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; {7598#(or (<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1)) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 03:48:03,414 INFO L290 TraceCheckUtils]: 11: Hoare triple {7602#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {7602#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-28 03:48:03,415 INFO L290 TraceCheckUtils]: 10: Hoare triple {7609#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 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; {7602#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-28 03:48:03,416 INFO L290 TraceCheckUtils]: 9: Hoare triple {7613#(or (<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2)) (< 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; {7609#(or (< 0 (mod (+ main_~y~0 4294967294) 4294967296)) (<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 1)))} is VALID [2022-04-28 03:48:03,417 INFO L290 TraceCheckUtils]: 8: Hoare triple {7470#true} ~z~0 := ~y~0; {7613#(or (<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 2)) (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-28 03:48:03,417 INFO L290 TraceCheckUtils]: 7: Hoare triple {7470#true} [118] 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[] {7470#true} is VALID [2022-04-28 03:48:03,417 INFO L290 TraceCheckUtils]: 6: Hoare triple {7470#true} [119] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_78| |v_main_#t~post5_77|)) (.cse1 (= v_main_~x~0_187 v_main_~x~0_186)) (.cse2 (= v_main_~y~0_167 v_main_~y~0_166)) (.cse3 (= |v_main_#t~post6_78| |v_main_#t~post6_77|)) (.cse4 (mod v_main_~x~0_187 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3) (and (<= .cse4 0) .cse0 .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_167 (* v_main_~x~0_186 (- 1))) v_main_~y~0_166)))) InVars {main_~y~0=v_main_~y~0_167, main_#t~post5=|v_main_#t~post5_78|, main_~x~0=v_main_~x~0_187, main_#t~post6=|v_main_#t~post6_78|} OutVars{main_~y~0=v_main_~y~0_166, main_#t~post5=|v_main_#t~post5_77|, main_~x~0=v_main_~x~0_186, main_#t~post6=|v_main_#t~post6_77|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {7470#true} is VALID [2022-04-28 03:48:03,417 INFO L290 TraceCheckUtils]: 5: Hoare triple {7470#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {7470#true} is VALID [2022-04-28 03:48:03,417 INFO L272 TraceCheckUtils]: 4: Hoare triple {7470#true} call #t~ret15 := main(); {7470#true} is VALID [2022-04-28 03:48:03,417 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7470#true} {7470#true} #83#return; {7470#true} is VALID [2022-04-28 03:48:03,417 INFO L290 TraceCheckUtils]: 2: Hoare triple {7470#true} assume true; {7470#true} is VALID [2022-04-28 03:48:03,418 INFO L290 TraceCheckUtils]: 1: Hoare triple {7470#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {7470#true} is VALID [2022-04-28 03:48:03,418 INFO L272 TraceCheckUtils]: 0: Hoare triple {7470#true} call ULTIMATE.init(); {7470#true} is VALID [2022-04-28 03:48:03,418 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 03:48:03,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1709719389] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:48:03,418 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:48:03,418 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 10] total 15 [2022-04-28 03:48:03,498 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:48:03,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1492656497] [2022-04-28 03:48:03,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1492656497] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:48:03,498 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:48:03,498 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 03:48:03,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269948883] [2022-04-28 03:48:03,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:48:03,499 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 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 27 [2022-04-28 03:48:03,499 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:48:03,499 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 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:48:03,518 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:48:03,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 03:48:03,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:48:03,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 03:48:03,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2022-04-28 03:48:03,519 INFO L87 Difference]: Start difference. First operand 56 states and 70 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 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:48:04,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:48:04,329 INFO L93 Difference]: Finished difference Result 70 states and 87 transitions. [2022-04-28 03:48:04,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 03:48:04,330 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 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 27 [2022-04-28 03:48:04,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:48:04,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 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:48:04,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 51 transitions. [2022-04-28 03:48:04,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 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:48:04,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 51 transitions. [2022-04-28 03:48:04,334 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 51 transitions. [2022-04-28 03:48:04,389 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:48:04,389 INFO L225 Difference]: With dead ends: 70 [2022-04-28 03:48:04,389 INFO L226 Difference]: Without dead ends: 55 [2022-04-28 03:48:04,390 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 52 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=118, Invalid=584, Unknown=0, NotChecked=0, Total=702 [2022-04-28 03:48:04,390 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 33 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:48:04,390 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 38 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 03:48:04,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-04-28 03:48:04,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 51. [2022-04-28 03:48:04,659 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:48:04,659 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand has 51 states, 46 states have (on average 1.2826086956521738) internal successors, (59), 46 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have 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:04,659 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand has 51 states, 46 states have (on average 1.2826086956521738) internal successors, (59), 46 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have 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:04,659 INFO L87 Difference]: Start difference. First operand 55 states. Second operand has 51 states, 46 states have (on average 1.2826086956521738) internal successors, (59), 46 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have 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:04,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:48:04,660 INFO L93 Difference]: Finished difference Result 55 states and 69 transitions. [2022-04-28 03:48:04,660 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 69 transitions. [2022-04-28 03:48:04,660 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:48:04,660 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:48:04,660 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 46 states have (on average 1.2826086956521738) internal successors, (59), 46 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 55 states. [2022-04-28 03:48:04,660 INFO L87 Difference]: Start difference. First operand has 51 states, 46 states have (on average 1.2826086956521738) internal successors, (59), 46 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 55 states. [2022-04-28 03:48:04,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:48:04,661 INFO L93 Difference]: Finished difference Result 55 states and 69 transitions. [2022-04-28 03:48:04,661 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 69 transitions. [2022-04-28 03:48:04,661 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:48:04,661 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:48:04,661 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:48:04,661 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:48:04,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 46 states have (on average 1.2826086956521738) internal successors, (59), 46 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have 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:04,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 63 transitions. [2022-04-28 03:48:04,662 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 63 transitions. Word has length 27 [2022-04-28 03:48:04,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:48:04,662 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 63 transitions. [2022-04-28 03:48:04,662 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 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:48:04,662 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 51 states and 63 transitions. [2022-04-28 03:48:10,384 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 61 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-28 03:48:10,384 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 63 transitions. [2022-04-28 03:48:10,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-28 03:48:10,384 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:48:10,384 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:48:10,400 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:48:10,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-04-28 03:48:10,585 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:48:10,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:48:10,585 INFO L85 PathProgramCache]: Analyzing trace with hash -690945345, now seen corresponding path program 6 times [2022-04-28 03:48:10,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:48:10,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [256125712] [2022-04-28 03:48:10,763 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:10,765 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:48:10,766 INFO L85 PathProgramCache]: Analyzing trace with hash -1207748237, now seen corresponding path program 1 times [2022-04-28 03:48:10,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:48:10,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048099783] [2022-04-28 03:48:10,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:48:10,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:48:10,774 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:48:10,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:48:10,783 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:48:10,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:48:10,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:48:10,855 INFO L290 TraceCheckUtils]: 0: Hoare triple {8030#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {8019#true} is VALID [2022-04-28 03:48:10,855 INFO L290 TraceCheckUtils]: 1: Hoare triple {8019#true} assume true; {8019#true} is VALID [2022-04-28 03:48:10,855 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8019#true} {8019#true} #83#return; {8019#true} is VALID [2022-04-28 03:48:10,855 INFO L272 TraceCheckUtils]: 0: Hoare triple {8019#true} call ULTIMATE.init(); {8030#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:48:10,856 INFO L290 TraceCheckUtils]: 1: Hoare triple {8030#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {8019#true} is VALID [2022-04-28 03:48:10,856 INFO L290 TraceCheckUtils]: 2: Hoare triple {8019#true} assume true; {8019#true} is VALID [2022-04-28 03:48:10,856 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8019#true} {8019#true} #83#return; {8019#true} is VALID [2022-04-28 03:48:10,856 INFO L272 TraceCheckUtils]: 4: Hoare triple {8019#true} call #t~ret15 := main(); {8019#true} is VALID [2022-04-28 03:48:10,856 INFO L290 TraceCheckUtils]: 5: Hoare triple {8019#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {8019#true} is VALID [2022-04-28 03:48:10,856 INFO L290 TraceCheckUtils]: 6: Hoare triple {8019#true} [121] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_203 4294967296)) (.cse1 (= |v_main_#t~post6_83| |v_main_#t~post6_82|)) (.cse2 (= v_main_~x~0_203 v_main_~x~0_202)) (.cse3 (= |v_main_#t~post5_83| |v_main_#t~post5_82|)) (.cse4 (= v_main_~y~0_181 v_main_~y~0_180))) (or (and (<= .cse0 0) .cse1 .cse2 .cse3 .cse4) (and (< v_main_~y~0_181 v_main_~y~0_180) (= v_main_~x~0_202 (+ v_main_~x~0_203 (* (- 1) v_main_~y~0_180) v_main_~y~0_181)) (< 0 .cse0) (forall ((v_it_18 Int)) (or (not (<= (+ v_main_~y~0_181 v_it_18 1) v_main_~y~0_180)) (< 0 (mod (+ v_main_~x~0_203 (* 4294967295 v_it_18)) 4294967296)) (not (<= 1 v_it_18))))) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_181, main_#t~post5=|v_main_#t~post5_83|, main_~x~0=v_main_~x~0_203, main_#t~post6=|v_main_#t~post6_83|} OutVars{main_~y~0=v_main_~y~0_180, main_#t~post5=|v_main_#t~post5_82|, main_~x~0=v_main_~x~0_202, main_#t~post6=|v_main_#t~post6_82|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {8019#true} is VALID [2022-04-28 03:48:10,856 INFO L290 TraceCheckUtils]: 7: Hoare triple {8019#true} [120] 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[] {8019#true} is VALID [2022-04-28 03:48:10,856 INFO L290 TraceCheckUtils]: 8: Hoare triple {8019#true} ~z~0 := ~y~0; {8019#true} is VALID [2022-04-28 03:48:10,857 INFO L290 TraceCheckUtils]: 9: Hoare triple {8019#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8024#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-28 03:48:10,858 INFO L290 TraceCheckUtils]: 10: Hoare triple {8024#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8025#(<= main_~z~0 (+ (* (div main_~z~0 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 03:48:10,859 INFO L290 TraceCheckUtils]: 11: Hoare triple {8025#(<= main_~z~0 (+ (* (div main_~z~0 4294967296) 4294967296) 4294967293))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8026#(<= main_~z~0 (+ 4294967292 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-28 03:48:10,859 INFO L290 TraceCheckUtils]: 12: Hoare triple {8026#(<= main_~z~0 (+ 4294967292 (* (div main_~z~0 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {8026#(<= main_~z~0 (+ 4294967292 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-28 03:48:10,860 INFO L290 TraceCheckUtils]: 13: Hoare triple {8026#(<= main_~z~0 (+ 4294967292 (* (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; {8027#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296)) 4294967293))} is VALID [2022-04-28 03:48:10,861 INFO L290 TraceCheckUtils]: 14: Hoare triple {8027#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0) 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; {8028#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967294))} is VALID [2022-04-28 03:48:10,863 INFO L290 TraceCheckUtils]: 15: Hoare triple {8028#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967294))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {8029#(<= (+ 3 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-28 03:48:10,863 INFO L290 TraceCheckUtils]: 16: Hoare triple {8029#(<= (+ 3 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} assume !(~y~0 % 4294967296 > 0); {8029#(<= (+ 3 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-28 03:48:10,863 INFO L290 TraceCheckUtils]: 17: Hoare triple {8029#(<= (+ 3 (* (div main_~z~0 4294967296) 4294967296)) main_~z~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; {8029#(<= (+ 3 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-28 03:48:10,864 INFO L290 TraceCheckUtils]: 18: Hoare triple {8029#(<= (+ 3 (* (div main_~z~0 4294967296) 4294967296)) main_~z~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; {8029#(<= (+ 3 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-28 03:48:10,864 INFO L290 TraceCheckUtils]: 19: Hoare triple {8029#(<= (+ 3 (* (div main_~z~0 4294967296) 4294967296)) main_~z~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; {8029#(<= (+ 3 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-28 03:48:10,864 INFO L290 TraceCheckUtils]: 20: Hoare triple {8029#(<= (+ 3 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} assume !(~x~0 % 4294967296 > 0); {8029#(<= (+ 3 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-28 03:48:10,865 INFO L290 TraceCheckUtils]: 21: Hoare triple {8029#(<= (+ 3 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} assume !(~z~0 % 4294967296 > 0); {8020#false} is VALID [2022-04-28 03:48:10,865 INFO L272 TraceCheckUtils]: 22: Hoare triple {8020#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {8020#false} is VALID [2022-04-28 03:48:10,865 INFO L290 TraceCheckUtils]: 23: Hoare triple {8020#false} ~cond := #in~cond; {8020#false} is VALID [2022-04-28 03:48:10,865 INFO L290 TraceCheckUtils]: 24: Hoare triple {8020#false} assume 0 == ~cond; {8020#false} is VALID [2022-04-28 03:48:10,865 INFO L290 TraceCheckUtils]: 25: Hoare triple {8020#false} assume !false; {8020#false} is VALID [2022-04-28 03:48:10,865 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-28 03:48:10,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:48:10,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048099783] [2022-04-28 03:48:10,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048099783] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:48:10,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1582155467] [2022-04-28 03:48:10,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:48:10,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:48:10,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:48:10,866 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:48:10,867 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:48:10,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:48:10,898 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-28 03:48:10,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:48:10,905 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:48:11,175 INFO L272 TraceCheckUtils]: 0: Hoare triple {8019#true} call ULTIMATE.init(); {8019#true} is VALID [2022-04-28 03:48:11,175 INFO L290 TraceCheckUtils]: 1: Hoare triple {8019#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {8019#true} is VALID [2022-04-28 03:48:11,175 INFO L290 TraceCheckUtils]: 2: Hoare triple {8019#true} assume true; {8019#true} is VALID [2022-04-28 03:48:11,175 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8019#true} {8019#true} #83#return; {8019#true} is VALID [2022-04-28 03:48:11,175 INFO L272 TraceCheckUtils]: 4: Hoare triple {8019#true} call #t~ret15 := main(); {8019#true} is VALID [2022-04-28 03:48:11,175 INFO L290 TraceCheckUtils]: 5: Hoare triple {8019#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {8019#true} is VALID [2022-04-28 03:48:11,175 INFO L290 TraceCheckUtils]: 6: Hoare triple {8019#true} [121] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_203 4294967296)) (.cse1 (= |v_main_#t~post6_83| |v_main_#t~post6_82|)) (.cse2 (= v_main_~x~0_203 v_main_~x~0_202)) (.cse3 (= |v_main_#t~post5_83| |v_main_#t~post5_82|)) (.cse4 (= v_main_~y~0_181 v_main_~y~0_180))) (or (and (<= .cse0 0) .cse1 .cse2 .cse3 .cse4) (and (< v_main_~y~0_181 v_main_~y~0_180) (= v_main_~x~0_202 (+ v_main_~x~0_203 (* (- 1) v_main_~y~0_180) v_main_~y~0_181)) (< 0 .cse0) (forall ((v_it_18 Int)) (or (not (<= (+ v_main_~y~0_181 v_it_18 1) v_main_~y~0_180)) (< 0 (mod (+ v_main_~x~0_203 (* 4294967295 v_it_18)) 4294967296)) (not (<= 1 v_it_18))))) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_181, main_#t~post5=|v_main_#t~post5_83|, main_~x~0=v_main_~x~0_203, main_#t~post6=|v_main_#t~post6_83|} OutVars{main_~y~0=v_main_~y~0_180, main_#t~post5=|v_main_#t~post5_82|, main_~x~0=v_main_~x~0_202, main_#t~post6=|v_main_#t~post6_82|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {8019#true} is VALID [2022-04-28 03:48:11,176 INFO L290 TraceCheckUtils]: 7: Hoare triple {8019#true} [120] 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[] {8019#true} is VALID [2022-04-28 03:48:11,191 INFO L290 TraceCheckUtils]: 8: Hoare triple {8019#true} ~z~0 := ~y~0; {8058#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 03:48:11,191 INFO L290 TraceCheckUtils]: 9: Hoare triple {8058#(= 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; {8062#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-28 03:48:11,192 INFO L290 TraceCheckUtils]: 10: Hoare triple {8062#(= 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; {8066#(= main_~y~0 (+ main_~z~0 2))} is VALID [2022-04-28 03:48:11,193 INFO L290 TraceCheckUtils]: 11: Hoare triple {8066#(= 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; {8070#(= (+ (- 2) main_~y~0) (+ main_~z~0 1))} is VALID [2022-04-28 03:48:11,193 INFO L290 TraceCheckUtils]: 12: Hoare triple {8070#(= (+ (- 2) main_~y~0) (+ main_~z~0 1))} assume !(~z~0 % 4294967296 > 0); {8070#(= (+ (- 2) main_~y~0) (+ main_~z~0 1))} is VALID [2022-04-28 03:48:11,194 INFO L290 TraceCheckUtils]: 13: Hoare triple {8070#(= (+ (- 2) main_~y~0) (+ main_~z~0 1))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {8077#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-28 03:48:11,195 INFO L290 TraceCheckUtils]: 14: Hoare triple {8077#(< 0 (mod (+ main_~z~0 2) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {8024#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-28 03:48:11,195 INFO L290 TraceCheckUtils]: 15: Hoare triple {8024#(<= main_~z~0 (+ 4294967294 (* (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; {8084#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-28 03:48:11,196 INFO L290 TraceCheckUtils]: 16: Hoare triple {8084#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {8084#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-28 03:48:11,196 INFO L290 TraceCheckUtils]: 17: Hoare triple {8084#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~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; {8084#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-28 03:48:11,196 INFO L290 TraceCheckUtils]: 18: Hoare triple {8084#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~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; {8084#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-28 03:48:11,197 INFO L290 TraceCheckUtils]: 19: Hoare triple {8084#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~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; {8084#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-28 03:48:11,197 INFO L290 TraceCheckUtils]: 20: Hoare triple {8084#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} assume !(~x~0 % 4294967296 > 0); {8084#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-28 03:48:11,198 INFO L290 TraceCheckUtils]: 21: Hoare triple {8084#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {8020#false} is VALID [2022-04-28 03:48:11,198 INFO L272 TraceCheckUtils]: 22: Hoare triple {8020#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {8020#false} is VALID [2022-04-28 03:48:11,198 INFO L290 TraceCheckUtils]: 23: Hoare triple {8020#false} ~cond := #in~cond; {8020#false} is VALID [2022-04-28 03:48:11,198 INFO L290 TraceCheckUtils]: 24: Hoare triple {8020#false} assume 0 == ~cond; {8020#false} is VALID [2022-04-28 03:48:11,198 INFO L290 TraceCheckUtils]: 25: Hoare triple {8020#false} assume !false; {8020#false} is VALID [2022-04-28 03:48:11,198 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-28 03:48:11,198 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:48:11,392 INFO L290 TraceCheckUtils]: 25: Hoare triple {8020#false} assume !false; {8020#false} is VALID [2022-04-28 03:48:11,392 INFO L290 TraceCheckUtils]: 24: Hoare triple {8020#false} assume 0 == ~cond; {8020#false} is VALID [2022-04-28 03:48:11,392 INFO L290 TraceCheckUtils]: 23: Hoare triple {8020#false} ~cond := #in~cond; {8020#false} is VALID [2022-04-28 03:48:11,392 INFO L272 TraceCheckUtils]: 22: Hoare triple {8020#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {8020#false} is VALID [2022-04-28 03:48:11,393 INFO L290 TraceCheckUtils]: 21: Hoare triple {8084#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {8020#false} is VALID [2022-04-28 03:48:11,393 INFO L290 TraceCheckUtils]: 20: Hoare triple {8084#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} assume !(~x~0 % 4294967296 > 0); {8084#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-28 03:48:11,394 INFO L290 TraceCheckUtils]: 19: Hoare triple {8084#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~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; {8084#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-28 03:48:11,394 INFO L290 TraceCheckUtils]: 18: Hoare triple {8084#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~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; {8084#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-28 03:48:11,394 INFO L290 TraceCheckUtils]: 17: Hoare triple {8084#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~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; {8084#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-28 03:48:11,395 INFO L290 TraceCheckUtils]: 16: Hoare triple {8084#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} assume !(~y~0 % 4294967296 > 0); {8084#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-28 03:48:11,396 INFO L290 TraceCheckUtils]: 15: Hoare triple {8024#(<= main_~z~0 (+ 4294967294 (* (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; {8084#(<= main_~z~0 (+ 4294967295 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-28 03:48:11,396 INFO L290 TraceCheckUtils]: 14: Hoare triple {8077#(< 0 (mod (+ main_~z~0 2) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {8024#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-28 03:48:11,397 INFO L290 TraceCheckUtils]: 13: Hoare triple {8151#(or (<= (mod main_~y~0 4294967296) 0) (< 0 (mod (+ main_~z~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; {8077#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-28 03:48:11,397 INFO L290 TraceCheckUtils]: 12: Hoare triple {8151#(or (<= (mod main_~y~0 4294967296) 0) (< 0 (mod (+ main_~z~0 3) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {8151#(or (<= (mod main_~y~0 4294967296) 0) (< 0 (mod (+ main_~z~0 3) 4294967296)))} is VALID [2022-04-28 03:48:11,398 INFO L290 TraceCheckUtils]: 11: Hoare triple {8158#(or (< 0 (mod (+ main_~z~0 2) 4294967296)) (<= (mod main_~y~0 4294967296) 0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8151#(or (<= (mod main_~y~0 4294967296) 0) (< 0 (mod (+ main_~z~0 3) 4294967296)))} is VALID [2022-04-28 03:48:11,399 INFO L290 TraceCheckUtils]: 10: Hoare triple {8162#(or (< 0 (mod (+ main_~z~0 1) 4294967296)) (<= (mod main_~y~0 4294967296) 0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8158#(or (< 0 (mod (+ main_~z~0 2) 4294967296)) (<= (mod main_~y~0 4294967296) 0))} is VALID [2022-04-28 03:48:11,400 INFO L290 TraceCheckUtils]: 9: Hoare triple {8166#(or (< 0 (mod main_~z~0 4294967296)) (<= (mod main_~y~0 4294967296) 0))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {8162#(or (< 0 (mod (+ main_~z~0 1) 4294967296)) (<= (mod main_~y~0 4294967296) 0))} is VALID [2022-04-28 03:48:11,400 INFO L290 TraceCheckUtils]: 8: Hoare triple {8019#true} ~z~0 := ~y~0; {8166#(or (< 0 (mod main_~z~0 4294967296)) (<= (mod main_~y~0 4294967296) 0))} is VALID [2022-04-28 03:48:11,400 INFO L290 TraceCheckUtils]: 7: Hoare triple {8019#true} [120] 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[] {8019#true} is VALID [2022-04-28 03:48:11,400 INFO L290 TraceCheckUtils]: 6: Hoare triple {8019#true} [121] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_203 4294967296)) (.cse1 (= |v_main_#t~post6_83| |v_main_#t~post6_82|)) (.cse2 (= v_main_~x~0_203 v_main_~x~0_202)) (.cse3 (= |v_main_#t~post5_83| |v_main_#t~post5_82|)) (.cse4 (= v_main_~y~0_181 v_main_~y~0_180))) (or (and (<= .cse0 0) .cse1 .cse2 .cse3 .cse4) (and (< v_main_~y~0_181 v_main_~y~0_180) (= v_main_~x~0_202 (+ v_main_~x~0_203 (* (- 1) v_main_~y~0_180) v_main_~y~0_181)) (< 0 .cse0) (forall ((v_it_18 Int)) (or (not (<= (+ v_main_~y~0_181 v_it_18 1) v_main_~y~0_180)) (< 0 (mod (+ v_main_~x~0_203 (* 4294967295 v_it_18)) 4294967296)) (not (<= 1 v_it_18))))) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_181, main_#t~post5=|v_main_#t~post5_83|, main_~x~0=v_main_~x~0_203, main_#t~post6=|v_main_#t~post6_83|} OutVars{main_~y~0=v_main_~y~0_180, main_#t~post5=|v_main_#t~post5_82|, main_~x~0=v_main_~x~0_202, main_#t~post6=|v_main_#t~post6_82|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {8019#true} is VALID [2022-04-28 03:48:11,400 INFO L290 TraceCheckUtils]: 5: Hoare triple {8019#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {8019#true} is VALID [2022-04-28 03:48:11,400 INFO L272 TraceCheckUtils]: 4: Hoare triple {8019#true} call #t~ret15 := main(); {8019#true} is VALID [2022-04-28 03:48:11,401 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8019#true} {8019#true} #83#return; {8019#true} is VALID [2022-04-28 03:48:11,401 INFO L290 TraceCheckUtils]: 2: Hoare triple {8019#true} assume true; {8019#true} is VALID [2022-04-28 03:48:11,401 INFO L290 TraceCheckUtils]: 1: Hoare triple {8019#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {8019#true} is VALID [2022-04-28 03:48:11,401 INFO L272 TraceCheckUtils]: 0: Hoare triple {8019#true} call ULTIMATE.init(); {8019#true} is VALID [2022-04-28 03:48:11,401 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-28 03:48:11,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1582155467] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:48:11,401 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:48:11,401 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2022-04-28 03:48:11,483 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:48:11,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [256125712] [2022-04-28 03:48:11,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [256125712] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:48:11,483 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:48:11,483 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 03:48:11,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600336014] [2022-04-28 03:48:11,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:48:11,483 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 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 27 [2022-04-28 03:48:11,483 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:48:11,484 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 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:48:11,503 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:48:11,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 03:48:11,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:48:11,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 03:48:11,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=350, Unknown=0, NotChecked=0, Total=420 [2022-04-28 03:48:11,504 INFO L87 Difference]: Start difference. First operand 51 states and 63 transitions. Second operand has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 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:48:12,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:48:12,770 INFO L93 Difference]: Finished difference Result 77 states and 100 transitions. [2022-04-28 03:48:12,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-28 03:48:12,770 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 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 27 [2022-04-28 03:48:12,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:48:12,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 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:48:12,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 62 transitions. [2022-04-28 03:48:12,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 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:48:12,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 62 transitions. [2022-04-28 03:48:12,772 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 62 transitions. [2022-04-28 03:48:12,885 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:48:12,886 INFO L225 Difference]: With dead ends: 77 [2022-04-28 03:48:12,886 INFO L226 Difference]: Without dead ends: 72 [2022-04-28 03:48:12,887 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 46 SyntacticMatches, 4 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=229, Invalid=1031, Unknown=0, NotChecked=0, Total=1260 [2022-04-28 03:48:12,887 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 42 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 03:48:12,887 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 50 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 03:48:12,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-04-28 03:48:13,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 62. [2022-04-28 03:48:13,235 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:48:13,236 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand has 62 states, 57 states have (on average 1.280701754385965) internal successors, (73), 57 states have internal predecessors, (73), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:48:13,236 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand has 62 states, 57 states have (on average 1.280701754385965) internal successors, (73), 57 states have internal predecessors, (73), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:48:13,236 INFO L87 Difference]: Start difference. First operand 72 states. Second operand has 62 states, 57 states have (on average 1.280701754385965) internal successors, (73), 57 states have internal predecessors, (73), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:48:13,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:48:13,237 INFO L93 Difference]: Finished difference Result 72 states and 91 transitions. [2022-04-28 03:48:13,237 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 91 transitions. [2022-04-28 03:48:13,237 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:48:13,237 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:48:13,237 INFO L74 IsIncluded]: Start isIncluded. First operand has 62 states, 57 states have (on average 1.280701754385965) internal successors, (73), 57 states have internal predecessors, (73), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 72 states. [2022-04-28 03:48:13,237 INFO L87 Difference]: Start difference. First operand has 62 states, 57 states have (on average 1.280701754385965) internal successors, (73), 57 states have internal predecessors, (73), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 72 states. [2022-04-28 03:48:13,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:48:13,238 INFO L93 Difference]: Finished difference Result 72 states and 91 transitions. [2022-04-28 03:48:13,238 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 91 transitions. [2022-04-28 03:48:13,238 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:48:13,238 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:48:13,238 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:48:13,238 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:48:13,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 57 states have (on average 1.280701754385965) internal successors, (73), 57 states have internal predecessors, (73), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:48:13,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 77 transitions. [2022-04-28 03:48:13,239 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 77 transitions. Word has length 27 [2022-04-28 03:48:13,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:48:13,239 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 77 transitions. [2022-04-28 03:48:13,239 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 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:48:13,239 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 62 states and 77 transitions. [2022-04-28 03:48:19,716 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 75 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-28 03:48:19,716 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 77 transitions. [2022-04-28 03:48:19,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-28 03:48:19,716 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:48:19,716 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:48:19,732 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-04-28 03:48:19,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:48:19,917 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:48:19,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:48:19,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1703289154, now seen corresponding path program 7 times [2022-04-28 03:48:19,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:48:19,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [589038045] [2022-04-28 03:48:20,063 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:20,064 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:48:20,066 INFO L85 PathProgramCache]: Analyzing trace with hash -1827645234, now seen corresponding path program 1 times [2022-04-28 03:48:20,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:48:20,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026080165] [2022-04-28 03:48:20,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:48:20,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:48:20,082 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:48:20,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:48:20,092 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:48:20,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:48:20,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:48:20,203 INFO L290 TraceCheckUtils]: 0: Hoare triple {8662#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {8651#true} is VALID [2022-04-28 03:48:20,203 INFO L290 TraceCheckUtils]: 1: Hoare triple {8651#true} assume true; {8651#true} is VALID [2022-04-28 03:48:20,203 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8651#true} {8651#true} #83#return; {8651#true} is VALID [2022-04-28 03:48:20,204 INFO L272 TraceCheckUtils]: 0: Hoare triple {8651#true} call ULTIMATE.init(); {8662#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:48:20,204 INFO L290 TraceCheckUtils]: 1: Hoare triple {8662#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {8651#true} is VALID [2022-04-28 03:48:20,204 INFO L290 TraceCheckUtils]: 2: Hoare triple {8651#true} assume true; {8651#true} is VALID [2022-04-28 03:48:20,204 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8651#true} {8651#true} #83#return; {8651#true} is VALID [2022-04-28 03:48:20,204 INFO L272 TraceCheckUtils]: 4: Hoare triple {8651#true} call #t~ret15 := main(); {8651#true} is VALID [2022-04-28 03:48:20,204 INFO L290 TraceCheckUtils]: 5: Hoare triple {8651#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {8651#true} is VALID [2022-04-28 03:48:20,204 INFO L290 TraceCheckUtils]: 6: Hoare triple {8651#true} [123] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= v_main_~x~0_217 v_main_~x~0_216)) (.cse2 (= |v_main_#t~post6_88| |v_main_#t~post6_87|)) (.cse0 (mod v_main_~x~0_217 4294967296)) (.cse3 (= |v_main_#t~post5_88| |v_main_#t~post5_87|)) (.cse4 (= v_main_~y~0_196 v_main_~y~0_195))) (or (and (< v_main_~x~0_216 v_main_~x~0_217) (< 0 .cse0) (= v_main_~y~0_195 (+ v_main_~x~0_217 (* v_main_~x~0_216 (- 1)) v_main_~y~0_196)) (forall ((v_it_19 Int)) (or (not (<= (+ v_main_~x~0_216 v_it_19 1) v_main_~x~0_217)) (< 0 (mod (+ v_main_~x~0_217 (* 4294967295 v_it_19)) 4294967296)) (not (<= 1 v_it_19))))) (and .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 (<= .cse0 0) .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_196, main_#t~post5=|v_main_#t~post5_88|, main_~x~0=v_main_~x~0_217, main_#t~post6=|v_main_#t~post6_88|} OutVars{main_~y~0=v_main_~y~0_195, main_#t~post5=|v_main_#t~post5_87|, main_~x~0=v_main_~x~0_216, main_#t~post6=|v_main_#t~post6_87|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {8651#true} is VALID [2022-04-28 03:48:20,204 INFO L290 TraceCheckUtils]: 7: Hoare triple {8651#true} [122] 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[] {8651#true} is VALID [2022-04-28 03:48:20,205 INFO L290 TraceCheckUtils]: 8: Hoare triple {8651#true} ~z~0 := ~y~0; {8656#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-28 03:48:20,206 INFO L290 TraceCheckUtils]: 9: Hoare triple {8656#(and (<= main_~y~0 main_~z~0) (<= 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; {8657#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-28 03:48:20,206 INFO L290 TraceCheckUtils]: 10: Hoare triple {8657#(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; {8658#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-28 03:48:20,207 INFO L290 TraceCheckUtils]: 11: Hoare triple {8658#(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; {8659#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-28 03:48:20,208 INFO L290 TraceCheckUtils]: 12: Hoare triple {8659#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} assume !(~z~0 % 4294967296 > 0); {8659#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-28 03:48:20,208 INFO L290 TraceCheckUtils]: 13: Hoare triple {8659#(<= 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; {8660#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-28 03:48:20,210 INFO L290 TraceCheckUtils]: 14: Hoare triple {8660#(<= 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; {8661#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-28 03:48:20,210 INFO L290 TraceCheckUtils]: 15: Hoare triple {8661#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {8652#false} is VALID [2022-04-28 03:48:20,210 INFO L290 TraceCheckUtils]: 16: Hoare triple {8652#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; {8652#false} is VALID [2022-04-28 03:48:20,210 INFO L290 TraceCheckUtils]: 17: Hoare triple {8652#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; {8652#false} is VALID [2022-04-28 03:48:20,210 INFO L290 TraceCheckUtils]: 18: Hoare triple {8652#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; {8652#false} is VALID [2022-04-28 03:48:20,210 INFO L290 TraceCheckUtils]: 19: Hoare triple {8652#false} assume !(~x~0 % 4294967296 > 0); {8652#false} is VALID [2022-04-28 03:48:20,210 INFO L290 TraceCheckUtils]: 20: Hoare triple {8652#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {8652#false} is VALID [2022-04-28 03:48:20,210 INFO L290 TraceCheckUtils]: 21: Hoare triple {8652#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {8652#false} is VALID [2022-04-28 03:48:20,210 INFO L290 TraceCheckUtils]: 22: Hoare triple {8652#false} assume !(~z~0 % 4294967296 > 0); {8652#false} is VALID [2022-04-28 03:48:20,210 INFO L272 TraceCheckUtils]: 23: Hoare triple {8652#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {8652#false} is VALID [2022-04-28 03:48:20,211 INFO L290 TraceCheckUtils]: 24: Hoare triple {8652#false} ~cond := #in~cond; {8652#false} is VALID [2022-04-28 03:48:20,211 INFO L290 TraceCheckUtils]: 25: Hoare triple {8652#false} assume 0 == ~cond; {8652#false} is VALID [2022-04-28 03:48:20,211 INFO L290 TraceCheckUtils]: 26: Hoare triple {8652#false} assume !false; {8652#false} is VALID [2022-04-28 03:48:20,211 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-28 03:48:20,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:48:20,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026080165] [2022-04-28 03:48:20,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026080165] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:48:20,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1522180286] [2022-04-28 03:48:20,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:48:20,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:48:20,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:48:20,212 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:48:20,213 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:48:20,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:48:20,246 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-28 03:48:20,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:48:20,253 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:48:20,601 INFO L272 TraceCheckUtils]: 0: Hoare triple {8651#true} call ULTIMATE.init(); {8651#true} is VALID [2022-04-28 03:48:20,601 INFO L290 TraceCheckUtils]: 1: Hoare triple {8651#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {8651#true} is VALID [2022-04-28 03:48:20,601 INFO L290 TraceCheckUtils]: 2: Hoare triple {8651#true} assume true; {8651#true} is VALID [2022-04-28 03:48:20,602 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8651#true} {8651#true} #83#return; {8651#true} is VALID [2022-04-28 03:48:20,602 INFO L272 TraceCheckUtils]: 4: Hoare triple {8651#true} call #t~ret15 := main(); {8651#true} is VALID [2022-04-28 03:48:20,602 INFO L290 TraceCheckUtils]: 5: Hoare triple {8651#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {8651#true} is VALID [2022-04-28 03:48:20,602 INFO L290 TraceCheckUtils]: 6: Hoare triple {8651#true} [123] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= v_main_~x~0_217 v_main_~x~0_216)) (.cse2 (= |v_main_#t~post6_88| |v_main_#t~post6_87|)) (.cse0 (mod v_main_~x~0_217 4294967296)) (.cse3 (= |v_main_#t~post5_88| |v_main_#t~post5_87|)) (.cse4 (= v_main_~y~0_196 v_main_~y~0_195))) (or (and (< v_main_~x~0_216 v_main_~x~0_217) (< 0 .cse0) (= v_main_~y~0_195 (+ v_main_~x~0_217 (* v_main_~x~0_216 (- 1)) v_main_~y~0_196)) (forall ((v_it_19 Int)) (or (not (<= (+ v_main_~x~0_216 v_it_19 1) v_main_~x~0_217)) (< 0 (mod (+ v_main_~x~0_217 (* 4294967295 v_it_19)) 4294967296)) (not (<= 1 v_it_19))))) (and .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 (<= .cse0 0) .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_196, main_#t~post5=|v_main_#t~post5_88|, main_~x~0=v_main_~x~0_217, main_#t~post6=|v_main_#t~post6_88|} OutVars{main_~y~0=v_main_~y~0_195, main_#t~post5=|v_main_#t~post5_87|, main_~x~0=v_main_~x~0_216, main_#t~post6=|v_main_#t~post6_87|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {8651#true} is VALID [2022-04-28 03:48:20,602 INFO L290 TraceCheckUtils]: 7: Hoare triple {8651#true} [122] 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[] {8651#true} is VALID [2022-04-28 03:48:20,602 INFO L290 TraceCheckUtils]: 8: Hoare triple {8651#true} ~z~0 := ~y~0; {8656#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-28 03:48:20,603 INFO L290 TraceCheckUtils]: 9: Hoare triple {8656#(and (<= main_~y~0 main_~z~0) (<= 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; {8657#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-28 03:48:20,603 INFO L290 TraceCheckUtils]: 10: Hoare triple {8657#(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; {8658#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-28 03:48:20,604 INFO L290 TraceCheckUtils]: 11: Hoare triple {8658#(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; {8659#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-28 03:48:20,605 INFO L290 TraceCheckUtils]: 12: Hoare triple {8659#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} assume !(~z~0 % 4294967296 > 0); {8659#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-28 03:48:20,605 INFO L290 TraceCheckUtils]: 13: Hoare triple {8659#(<= 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; {8660#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-28 03:48:20,606 INFO L290 TraceCheckUtils]: 14: Hoare triple {8660#(<= 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; {8661#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-28 03:48:20,607 INFO L290 TraceCheckUtils]: 15: Hoare triple {8661#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {8652#false} is VALID [2022-04-28 03:48:20,607 INFO L290 TraceCheckUtils]: 16: Hoare triple {8652#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; {8652#false} is VALID [2022-04-28 03:48:20,607 INFO L290 TraceCheckUtils]: 17: Hoare triple {8652#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; {8652#false} is VALID [2022-04-28 03:48:20,607 INFO L290 TraceCheckUtils]: 18: Hoare triple {8652#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; {8652#false} is VALID [2022-04-28 03:48:20,607 INFO L290 TraceCheckUtils]: 19: Hoare triple {8652#false} assume !(~x~0 % 4294967296 > 0); {8652#false} is VALID [2022-04-28 03:48:20,607 INFO L290 TraceCheckUtils]: 20: Hoare triple {8652#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {8652#false} is VALID [2022-04-28 03:48:20,607 INFO L290 TraceCheckUtils]: 21: Hoare triple {8652#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {8652#false} is VALID [2022-04-28 03:48:20,607 INFO L290 TraceCheckUtils]: 22: Hoare triple {8652#false} assume !(~z~0 % 4294967296 > 0); {8652#false} is VALID [2022-04-28 03:48:20,607 INFO L272 TraceCheckUtils]: 23: Hoare triple {8652#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {8652#false} is VALID [2022-04-28 03:48:20,607 INFO L290 TraceCheckUtils]: 24: Hoare triple {8652#false} ~cond := #in~cond; {8652#false} is VALID [2022-04-28 03:48:20,607 INFO L290 TraceCheckUtils]: 25: Hoare triple {8652#false} assume 0 == ~cond; {8652#false} is VALID [2022-04-28 03:48:20,607 INFO L290 TraceCheckUtils]: 26: Hoare triple {8652#false} assume !false; {8652#false} is VALID [2022-04-28 03:48:20,607 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-28 03:48:20,608 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:48:20,896 INFO L290 TraceCheckUtils]: 26: Hoare triple {8652#false} assume !false; {8652#false} is VALID [2022-04-28 03:48:20,897 INFO L290 TraceCheckUtils]: 25: Hoare triple {8652#false} assume 0 == ~cond; {8652#false} is VALID [2022-04-28 03:48:20,897 INFO L290 TraceCheckUtils]: 24: Hoare triple {8652#false} ~cond := #in~cond; {8652#false} is VALID [2022-04-28 03:48:20,897 INFO L272 TraceCheckUtils]: 23: Hoare triple {8652#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {8652#false} is VALID [2022-04-28 03:48:20,897 INFO L290 TraceCheckUtils]: 22: Hoare triple {8652#false} assume !(~z~0 % 4294967296 > 0); {8652#false} is VALID [2022-04-28 03:48:20,897 INFO L290 TraceCheckUtils]: 21: Hoare triple {8652#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {8652#false} is VALID [2022-04-28 03:48:20,897 INFO L290 TraceCheckUtils]: 20: Hoare triple {8652#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {8652#false} is VALID [2022-04-28 03:48:20,897 INFO L290 TraceCheckUtils]: 19: Hoare triple {8652#false} assume !(~x~0 % 4294967296 > 0); {8652#false} is VALID [2022-04-28 03:48:20,897 INFO L290 TraceCheckUtils]: 18: Hoare triple {8652#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; {8652#false} is VALID [2022-04-28 03:48:20,897 INFO L290 TraceCheckUtils]: 17: Hoare triple {8652#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; {8652#false} is VALID [2022-04-28 03:48:20,897 INFO L290 TraceCheckUtils]: 16: Hoare triple {8652#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; {8652#false} is VALID [2022-04-28 03:48:20,898 INFO L290 TraceCheckUtils]: 15: Hoare triple {8661#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {8652#false} is VALID [2022-04-28 03:48:20,900 INFO L290 TraceCheckUtils]: 14: Hoare triple {8660#(<= 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; {8661#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-28 03:48:20,901 INFO L290 TraceCheckUtils]: 13: Hoare triple {8659#(<= 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; {8660#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-28 03:48:20,901 INFO L290 TraceCheckUtils]: 12: Hoare triple {8659#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} assume !(~z~0 % 4294967296 > 0); {8659#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-28 03:48:20,902 INFO L290 TraceCheckUtils]: 11: Hoare triple {8789#(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; {8659#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-28 03:48:20,903 INFO L290 TraceCheckUtils]: 10: Hoare triple {8793#(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; {8789#(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:48:20,904 INFO L290 TraceCheckUtils]: 9: Hoare triple {8797#(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; {8793#(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:48:20,905 INFO L290 TraceCheckUtils]: 8: Hoare triple {8651#true} ~z~0 := ~y~0; {8797#(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:48:20,905 INFO L290 TraceCheckUtils]: 7: Hoare triple {8651#true} [122] 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[] {8651#true} is VALID [2022-04-28 03:48:20,905 INFO L290 TraceCheckUtils]: 6: Hoare triple {8651#true} [123] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= v_main_~x~0_217 v_main_~x~0_216)) (.cse2 (= |v_main_#t~post6_88| |v_main_#t~post6_87|)) (.cse0 (mod v_main_~x~0_217 4294967296)) (.cse3 (= |v_main_#t~post5_88| |v_main_#t~post5_87|)) (.cse4 (= v_main_~y~0_196 v_main_~y~0_195))) (or (and (< v_main_~x~0_216 v_main_~x~0_217) (< 0 .cse0) (= v_main_~y~0_195 (+ v_main_~x~0_217 (* v_main_~x~0_216 (- 1)) v_main_~y~0_196)) (forall ((v_it_19 Int)) (or (not (<= (+ v_main_~x~0_216 v_it_19 1) v_main_~x~0_217)) (< 0 (mod (+ v_main_~x~0_217 (* 4294967295 v_it_19)) 4294967296)) (not (<= 1 v_it_19))))) (and .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 (<= .cse0 0) .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_196, main_#t~post5=|v_main_#t~post5_88|, main_~x~0=v_main_~x~0_217, main_#t~post6=|v_main_#t~post6_88|} OutVars{main_~y~0=v_main_~y~0_195, main_#t~post5=|v_main_#t~post5_87|, main_~x~0=v_main_~x~0_216, main_#t~post6=|v_main_#t~post6_87|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {8651#true} is VALID [2022-04-28 03:48:20,905 INFO L290 TraceCheckUtils]: 5: Hoare triple {8651#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {8651#true} is VALID [2022-04-28 03:48:20,905 INFO L272 TraceCheckUtils]: 4: Hoare triple {8651#true} call #t~ret15 := main(); {8651#true} is VALID [2022-04-28 03:48:20,905 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8651#true} {8651#true} #83#return; {8651#true} is VALID [2022-04-28 03:48:20,905 INFO L290 TraceCheckUtils]: 2: Hoare triple {8651#true} assume true; {8651#true} is VALID [2022-04-28 03:48:20,905 INFO L290 TraceCheckUtils]: 1: Hoare triple {8651#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {8651#true} is VALID [2022-04-28 03:48:20,905 INFO L272 TraceCheckUtils]: 0: Hoare triple {8651#true} call ULTIMATE.init(); {8651#true} is VALID [2022-04-28 03:48:20,905 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-28 03:48:20,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1522180286] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:48:20,905 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:48:20,905 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 12 [2022-04-28 03:48:20,962 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:48:20,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [589038045] [2022-04-28 03:48:20,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [589038045] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:48:20,962 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:48:20,962 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 03:48:20,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520642103] [2022-04-28 03:48:20,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:48:20,963 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 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 28 [2022-04-28 03:48:20,963 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:48:20,963 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 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:48:20,985 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:48:20,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 03:48:20,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:48:20,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 03:48:20,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2022-04-28 03:48:20,986 INFO L87 Difference]: Start difference. First operand 62 states and 77 transitions. Second operand has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 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:48:21,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:48:21,954 INFO L93 Difference]: Finished difference Result 71 states and 87 transitions. [2022-04-28 03:48:21,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 03:48:21,954 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 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 28 [2022-04-28 03:48:21,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:48:21,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 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:48:21,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 46 transitions. [2022-04-28 03:48:21,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 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:48:21,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 46 transitions. [2022-04-28 03:48:21,955 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 46 transitions. [2022-04-28 03:48:22,006 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:48:22,007 INFO L225 Difference]: With dead ends: 71 [2022-04-28 03:48:22,007 INFO L226 Difference]: Without dead ends: 55 [2022-04-28 03:48:22,007 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 61 SyntacticMatches, 6 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=108, Invalid=444, Unknown=0, NotChecked=0, Total=552 [2022-04-28 03:48:22,008 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 29 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 03:48:22,008 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 52 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 03:48:22,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-04-28 03:48:22,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 51. [2022-04-28 03:48:22,269 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:48:22,269 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand has 51 states, 46 states have (on average 1.2826086956521738) internal successors, (59), 46 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have 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:22,271 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand has 51 states, 46 states have (on average 1.2826086956521738) internal successors, (59), 46 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have 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:22,271 INFO L87 Difference]: Start difference. First operand 55 states. Second operand has 51 states, 46 states have (on average 1.2826086956521738) internal successors, (59), 46 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have 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:22,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:48:22,272 INFO L93 Difference]: Finished difference Result 55 states and 69 transitions. [2022-04-28 03:48:22,272 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 69 transitions. [2022-04-28 03:48:22,272 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:48:22,272 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:48:22,272 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 46 states have (on average 1.2826086956521738) internal successors, (59), 46 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 55 states. [2022-04-28 03:48:22,272 INFO L87 Difference]: Start difference. First operand has 51 states, 46 states have (on average 1.2826086956521738) internal successors, (59), 46 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 55 states. [2022-04-28 03:48:22,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:48:22,273 INFO L93 Difference]: Finished difference Result 55 states and 69 transitions. [2022-04-28 03:48:22,273 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 69 transitions. [2022-04-28 03:48:22,273 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:48:22,273 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:48:22,273 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:48:22,273 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:48:22,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 46 states have (on average 1.2826086956521738) internal successors, (59), 46 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have 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:22,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 63 transitions. [2022-04-28 03:48:22,274 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 63 transitions. Word has length 28 [2022-04-28 03:48:22,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:48:22,274 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 63 transitions. [2022-04-28 03:48:22,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 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:48:22,274 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 51 states and 63 transitions. [2022-04-28 03:48:29,259 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 61 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-28 03:48:29,259 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 63 transitions. [2022-04-28 03:48:29,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-28 03:48:29,259 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:48:29,259 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:48:29,278 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:48:29,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:48:29,477 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:48:29,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:48:29,477 INFO L85 PathProgramCache]: Analyzing trace with hash 453627138, now seen corresponding path program 7 times [2022-04-28 03:48:29,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:48:29,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [917169637] [2022-04-28 03:48:29,618 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:29,620 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:48:29,622 INFO L85 PathProgramCache]: Analyzing trace with hash 822713422, now seen corresponding path program 1 times [2022-04-28 03:48:29,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:48:29,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492386401] [2022-04-28 03:48:29,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:48:29,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:48:29,629 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:48:29,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:48:29,641 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_20.3))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:48:29,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:48:29,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:48:29,730 INFO L290 TraceCheckUtils]: 0: Hoare triple {9217#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {9205#true} is VALID [2022-04-28 03:48:29,730 INFO L290 TraceCheckUtils]: 1: Hoare triple {9205#true} assume true; {9205#true} is VALID [2022-04-28 03:48:29,730 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9205#true} {9205#true} #83#return; {9205#true} is VALID [2022-04-28 03:48:29,731 INFO L272 TraceCheckUtils]: 0: Hoare triple {9205#true} call ULTIMATE.init(); {9217#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:48:29,731 INFO L290 TraceCheckUtils]: 1: Hoare triple {9217#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {9205#true} is VALID [2022-04-28 03:48:29,731 INFO L290 TraceCheckUtils]: 2: Hoare triple {9205#true} assume true; {9205#true} is VALID [2022-04-28 03:48:29,731 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9205#true} {9205#true} #83#return; {9205#true} is VALID [2022-04-28 03:48:29,731 INFO L272 TraceCheckUtils]: 4: Hoare triple {9205#true} call #t~ret15 := main(); {9205#true} is VALID [2022-04-28 03:48:29,731 INFO L290 TraceCheckUtils]: 5: Hoare triple {9205#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {9205#true} is VALID [2022-04-28 03:48:29,731 INFO L290 TraceCheckUtils]: 6: Hoare triple {9205#true} [125] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_233 v_main_~x~0_232)) (.cse1 (= |v_main_#t~post6_93| |v_main_#t~post6_92|)) (.cse2 (= v_main_~y~0_211 v_main_~y~0_210)) (.cse3 (= |v_main_#t~post5_93| |v_main_#t~post5_92|)) (.cse4 (mod v_main_~x~0_233 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 (<= .cse4 0) .cse1 .cse2 .cse3) (and (= v_main_~y~0_210 (+ v_main_~x~0_233 v_main_~y~0_211 (* 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 .cse4) (< v_main_~x~0_232 v_main_~x~0_233)))) InVars {main_~y~0=v_main_~y~0_211, main_#t~post5=|v_main_#t~post5_93|, main_~x~0=v_main_~x~0_233, main_#t~post6=|v_main_#t~post6_93|} OutVars{main_~y~0=v_main_~y~0_210, main_#t~post5=|v_main_#t~post5_92|, main_~x~0=v_main_~x~0_232, main_#t~post6=|v_main_#t~post6_92|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {9205#true} is VALID [2022-04-28 03:48:29,731 INFO L290 TraceCheckUtils]: 7: Hoare triple {9205#true} [124] 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[] {9205#true} is VALID [2022-04-28 03:48:29,731 INFO L290 TraceCheckUtils]: 8: Hoare triple {9205#true} ~z~0 := ~y~0; {9205#true} is VALID [2022-04-28 03:48:29,732 INFO L290 TraceCheckUtils]: 9: Hoare triple {9205#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9210#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-28 03:48:29,733 INFO L290 TraceCheckUtils]: 10: Hoare triple {9210#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9211#(<= main_~z~0 (+ (* (div main_~z~0 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 03:48:29,733 INFO L290 TraceCheckUtils]: 11: Hoare triple {9211#(<= main_~z~0 (+ (* (div main_~z~0 4294967296) 4294967296) 4294967293))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9205#true} is VALID [2022-04-28 03:48:29,734 INFO L290 TraceCheckUtils]: 12: Hoare triple {9205#true} assume !(~z~0 % 4294967296 > 0); {9212#(<= (* (div (+ main_~z~0 4294967295) 4294967296) 4294967296) main_~z~0)} is VALID [2022-04-28 03:48:29,735 INFO L290 TraceCheckUtils]: 13: Hoare triple {9212#(<= (* (div (+ main_~z~0 4294967295) 4294967296) 4294967296) main_~z~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; {9213#(<= (+ (* (div (+ main_~z~0 4294967294) 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-28 03:48:29,736 INFO L290 TraceCheckUtils]: 14: Hoare triple {9213#(<= (+ (* (div (+ main_~z~0 4294967294) 4294967296) 4294967296) 1) main_~z~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; {9214#(<= (+ (* 4294967296 (div (+ main_~z~0 4294967293) 4294967296)) 2) main_~z~0)} is VALID [2022-04-28 03:48:29,736 INFO L290 TraceCheckUtils]: 15: Hoare triple {9214#(<= (+ (* 4294967296 (div (+ main_~z~0 4294967293) 4294967296)) 2) main_~z~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; {9215#(<= (+ 3 (* (div (+ 4294967292 main_~z~0) 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-28 03:48:29,737 INFO L290 TraceCheckUtils]: 16: Hoare triple {9215#(<= (+ 3 (* (div (+ 4294967292 main_~z~0) 4294967296) 4294967296)) main_~z~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; {9216#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 4) main_~z~0)} is VALID [2022-04-28 03:48:29,738 INFO L290 TraceCheckUtils]: 17: Hoare triple {9216#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 4) main_~z~0)} assume !(~y~0 % 4294967296 > 0); {9216#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 4) main_~z~0)} is VALID [2022-04-28 03:48:29,738 INFO L290 TraceCheckUtils]: 18: Hoare triple {9216#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 4) main_~z~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; {9216#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 4) main_~z~0)} is VALID [2022-04-28 03:48:29,738 INFO L290 TraceCheckUtils]: 19: Hoare triple {9216#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 4) main_~z~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; {9216#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 4) main_~z~0)} is VALID [2022-04-28 03:48:29,738 INFO L290 TraceCheckUtils]: 20: Hoare triple {9216#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 4) main_~z~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; {9216#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 4) main_~z~0)} is VALID [2022-04-28 03:48:29,739 INFO L290 TraceCheckUtils]: 21: Hoare triple {9216#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 4) main_~z~0)} assume !(~x~0 % 4294967296 > 0); {9216#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 4) main_~z~0)} is VALID [2022-04-28 03:48:29,739 INFO L290 TraceCheckUtils]: 22: Hoare triple {9216#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 4) main_~z~0)} assume !(~z~0 % 4294967296 > 0); {9206#false} is VALID [2022-04-28 03:48:29,739 INFO L272 TraceCheckUtils]: 23: Hoare triple {9206#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {9206#false} is VALID [2022-04-28 03:48:29,739 INFO L290 TraceCheckUtils]: 24: Hoare triple {9206#false} ~cond := #in~cond; {9206#false} is VALID [2022-04-28 03:48:29,739 INFO L290 TraceCheckUtils]: 25: Hoare triple {9206#false} assume 0 == ~cond; {9206#false} is VALID [2022-04-28 03:48:29,739 INFO L290 TraceCheckUtils]: 26: Hoare triple {9206#false} assume !false; {9206#false} is VALID [2022-04-28 03:48:29,740 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-28 03:48:29,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:48:29,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492386401] [2022-04-28 03:48:29,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492386401] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:48:29,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1533204195] [2022-04-28 03:48:29,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:48:29,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:48:29,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:48:29,741 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:48:29,745 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:48:29,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:48:29,780 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-28 03:48:29,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:48:29,786 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:48:29,931 INFO L272 TraceCheckUtils]: 0: Hoare triple {9205#true} call ULTIMATE.init(); {9205#true} is VALID [2022-04-28 03:48:29,931 INFO L290 TraceCheckUtils]: 1: Hoare triple {9205#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {9205#true} is VALID [2022-04-28 03:48:29,931 INFO L290 TraceCheckUtils]: 2: Hoare triple {9205#true} assume true; {9205#true} is VALID [2022-04-28 03:48:29,931 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9205#true} {9205#true} #83#return; {9205#true} is VALID [2022-04-28 03:48:29,931 INFO L272 TraceCheckUtils]: 4: Hoare triple {9205#true} call #t~ret15 := main(); {9205#true} is VALID [2022-04-28 03:48:29,931 INFO L290 TraceCheckUtils]: 5: Hoare triple {9205#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {9205#true} is VALID [2022-04-28 03:48:29,931 INFO L290 TraceCheckUtils]: 6: Hoare triple {9205#true} [125] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_233 v_main_~x~0_232)) (.cse1 (= |v_main_#t~post6_93| |v_main_#t~post6_92|)) (.cse2 (= v_main_~y~0_211 v_main_~y~0_210)) (.cse3 (= |v_main_#t~post5_93| |v_main_#t~post5_92|)) (.cse4 (mod v_main_~x~0_233 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 (<= .cse4 0) .cse1 .cse2 .cse3) (and (= v_main_~y~0_210 (+ v_main_~x~0_233 v_main_~y~0_211 (* 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 .cse4) (< v_main_~x~0_232 v_main_~x~0_233)))) InVars {main_~y~0=v_main_~y~0_211, main_#t~post5=|v_main_#t~post5_93|, main_~x~0=v_main_~x~0_233, main_#t~post6=|v_main_#t~post6_93|} OutVars{main_~y~0=v_main_~y~0_210, main_#t~post5=|v_main_#t~post5_92|, main_~x~0=v_main_~x~0_232, main_#t~post6=|v_main_#t~post6_92|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {9205#true} is VALID [2022-04-28 03:48:29,932 INFO L290 TraceCheckUtils]: 7: Hoare triple {9205#true} [124] 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[] {9205#true} is VALID [2022-04-28 03:48:29,933 INFO L290 TraceCheckUtils]: 8: Hoare triple {9205#true} ~z~0 := ~y~0; {9245#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 03:48:29,933 INFO L290 TraceCheckUtils]: 9: Hoare triple {9245#(= 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; {9249#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-28 03:48:29,934 INFO L290 TraceCheckUtils]: 10: Hoare triple {9249#(= 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; {9253#(= main_~y~0 (+ main_~z~0 2))} is VALID [2022-04-28 03:48:29,934 INFO L290 TraceCheckUtils]: 11: Hoare triple {9253#(= 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; {9257#(= (+ (- 2) main_~y~0) (+ main_~z~0 1))} is VALID [2022-04-28 03:48:29,935 INFO L290 TraceCheckUtils]: 12: Hoare triple {9257#(= (+ (- 2) main_~y~0) (+ main_~z~0 1))} assume !(~z~0 % 4294967296 > 0); {9261#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-28 03:48:29,936 INFO L290 TraceCheckUtils]: 13: Hoare triple {9261#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {9265#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-28 03:48:29,937 INFO L290 TraceCheckUtils]: 14: Hoare triple {9265#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {9269#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 03:48:29,937 INFO L290 TraceCheckUtils]: 15: Hoare triple {9269#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {9273#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 03:48:29,938 INFO L290 TraceCheckUtils]: 16: Hoare triple {9273#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {9206#false} is VALID [2022-04-28 03:48:29,938 INFO L290 TraceCheckUtils]: 17: Hoare triple {9206#false} assume !(~y~0 % 4294967296 > 0); {9206#false} is VALID [2022-04-28 03:48:29,938 INFO L290 TraceCheckUtils]: 18: Hoare triple {9206#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; {9206#false} is VALID [2022-04-28 03:48:29,938 INFO L290 TraceCheckUtils]: 19: Hoare triple {9206#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; {9206#false} is VALID [2022-04-28 03:48:29,938 INFO L290 TraceCheckUtils]: 20: Hoare triple {9206#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; {9206#false} is VALID [2022-04-28 03:48:29,938 INFO L290 TraceCheckUtils]: 21: Hoare triple {9206#false} assume !(~x~0 % 4294967296 > 0); {9206#false} is VALID [2022-04-28 03:48:29,938 INFO L290 TraceCheckUtils]: 22: Hoare triple {9206#false} assume !(~z~0 % 4294967296 > 0); {9206#false} is VALID [2022-04-28 03:48:29,938 INFO L272 TraceCheckUtils]: 23: Hoare triple {9206#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {9206#false} is VALID [2022-04-28 03:48:29,938 INFO L290 TraceCheckUtils]: 24: Hoare triple {9206#false} ~cond := #in~cond; {9206#false} is VALID [2022-04-28 03:48:29,938 INFO L290 TraceCheckUtils]: 25: Hoare triple {9206#false} assume 0 == ~cond; {9206#false} is VALID [2022-04-28 03:48:29,938 INFO L290 TraceCheckUtils]: 26: Hoare triple {9206#false} assume !false; {9206#false} is VALID [2022-04-28 03:48:29,938 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:48:29,938 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:48:30,129 INFO L290 TraceCheckUtils]: 26: Hoare triple {9206#false} assume !false; {9206#false} is VALID [2022-04-28 03:48:30,129 INFO L290 TraceCheckUtils]: 25: Hoare triple {9206#false} assume 0 == ~cond; {9206#false} is VALID [2022-04-28 03:48:30,129 INFO L290 TraceCheckUtils]: 24: Hoare triple {9206#false} ~cond := #in~cond; {9206#false} is VALID [2022-04-28 03:48:30,129 INFO L272 TraceCheckUtils]: 23: Hoare triple {9206#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {9206#false} is VALID [2022-04-28 03:48:30,129 INFO L290 TraceCheckUtils]: 22: Hoare triple {9206#false} assume !(~z~0 % 4294967296 > 0); {9206#false} is VALID [2022-04-28 03:48:30,129 INFO L290 TraceCheckUtils]: 21: Hoare triple {9206#false} assume !(~x~0 % 4294967296 > 0); {9206#false} is VALID [2022-04-28 03:48:30,129 INFO L290 TraceCheckUtils]: 20: Hoare triple {9206#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; {9206#false} is VALID [2022-04-28 03:48:30,129 INFO L290 TraceCheckUtils]: 19: Hoare triple {9206#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; {9206#false} is VALID [2022-04-28 03:48:30,129 INFO L290 TraceCheckUtils]: 18: Hoare triple {9206#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; {9206#false} is VALID [2022-04-28 03:48:30,129 INFO L290 TraceCheckUtils]: 17: Hoare triple {9206#false} assume !(~y~0 % 4294967296 > 0); {9206#false} is VALID [2022-04-28 03:48:30,130 INFO L290 TraceCheckUtils]: 16: Hoare triple {9273#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {9206#false} is VALID [2022-04-28 03:48:30,131 INFO L290 TraceCheckUtils]: 15: Hoare triple {9269#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {9273#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 03:48:30,131 INFO L290 TraceCheckUtils]: 14: Hoare triple {9265#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {9269#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 03:48:30,132 INFO L290 TraceCheckUtils]: 13: Hoare triple {9261#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {9265#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-28 03:48:30,132 INFO L290 TraceCheckUtils]: 12: Hoare triple {9349#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {9261#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-28 03:48:30,134 INFO L290 TraceCheckUtils]: 11: Hoare triple {9353#(or (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9349#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))))} is VALID [2022-04-28 03:48:30,138 INFO L290 TraceCheckUtils]: 10: Hoare triple {9357#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9353#(or (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-28 03:48:30,139 INFO L290 TraceCheckUtils]: 9: Hoare triple {9361#(or (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {9357#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))))} is VALID [2022-04-28 03:48:30,140 INFO L290 TraceCheckUtils]: 8: Hoare triple {9205#true} ~z~0 := ~y~0; {9361#(or (not (< 0 (mod (+ main_~y~0 4294967293) 4294967296))) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} is VALID [2022-04-28 03:48:30,140 INFO L290 TraceCheckUtils]: 7: Hoare triple {9205#true} [124] 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[] {9205#true} is VALID [2022-04-28 03:48:30,140 INFO L290 TraceCheckUtils]: 6: Hoare triple {9205#true} [125] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_233 v_main_~x~0_232)) (.cse1 (= |v_main_#t~post6_93| |v_main_#t~post6_92|)) (.cse2 (= v_main_~y~0_211 v_main_~y~0_210)) (.cse3 (= |v_main_#t~post5_93| |v_main_#t~post5_92|)) (.cse4 (mod v_main_~x~0_233 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 (<= .cse4 0) .cse1 .cse2 .cse3) (and (= v_main_~y~0_210 (+ v_main_~x~0_233 v_main_~y~0_211 (* 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 .cse4) (< v_main_~x~0_232 v_main_~x~0_233)))) InVars {main_~y~0=v_main_~y~0_211, main_#t~post5=|v_main_#t~post5_93|, main_~x~0=v_main_~x~0_233, main_#t~post6=|v_main_#t~post6_93|} OutVars{main_~y~0=v_main_~y~0_210, main_#t~post5=|v_main_#t~post5_92|, main_~x~0=v_main_~x~0_232, main_#t~post6=|v_main_#t~post6_92|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {9205#true} is VALID [2022-04-28 03:48:30,140 INFO L290 TraceCheckUtils]: 5: Hoare triple {9205#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {9205#true} is VALID [2022-04-28 03:48:30,140 INFO L272 TraceCheckUtils]: 4: Hoare triple {9205#true} call #t~ret15 := main(); {9205#true} is VALID [2022-04-28 03:48:30,140 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9205#true} {9205#true} #83#return; {9205#true} is VALID [2022-04-28 03:48:30,140 INFO L290 TraceCheckUtils]: 2: Hoare triple {9205#true} assume true; {9205#true} is VALID [2022-04-28 03:48:30,140 INFO L290 TraceCheckUtils]: 1: Hoare triple {9205#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {9205#true} is VALID [2022-04-28 03:48:30,140 INFO L272 TraceCheckUtils]: 0: Hoare triple {9205#true} call ULTIMATE.init(); {9205#true} is VALID [2022-04-28 03:48:30,140 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:48:30,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1533204195] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:48:30,141 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:48:30,141 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 22 [2022-04-28 03:48:30,235 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:48:30,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [917169637] [2022-04-28 03:48:30,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [917169637] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:48:30,235 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:48:30,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 03:48:30,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453126758] [2022-04-28 03:48:30,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:48:30,236 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 11 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:48:30,236 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:48:30,236 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 11 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:48:30,259 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:48:30,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 03:48:30,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:48:30,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 03:48:30,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=473, Unknown=0, NotChecked=0, Total=552 [2022-04-28 03:48:30,260 INFO L87 Difference]: Start difference. First operand 51 states and 63 transitions. Second operand has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 11 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:48:32,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:48:32,009 INFO L93 Difference]: Finished difference Result 101 states and 136 transitions. [2022-04-28 03:48:32,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-28 03:48:32,010 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 11 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:48:32,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:48:32,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 11 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:48:32,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 79 transitions. [2022-04-28 03:48:32,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 11 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:48:32,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 79 transitions. [2022-04-28 03:48:32,012 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 79 transitions. [2022-04-28 03:48:32,113 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:48:32,114 INFO L225 Difference]: With dead ends: 101 [2022-04-28 03:48:32,114 INFO L226 Difference]: Without dead ends: 95 [2022-04-28 03:48:32,115 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 347 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=365, Invalid=1797, Unknown=0, NotChecked=0, Total=2162 [2022-04-28 03:48:32,115 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 58 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 03:48:32,116 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 55 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 03:48:32,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-04-28 03:48:32,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 68. [2022-04-28 03:48:32,491 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:48:32,491 INFO L82 GeneralOperation]: Start isEquivalent. First operand 95 states. Second operand has 68 states, 63 states have (on average 1.3333333333333333) internal successors, (84), 63 states have internal predecessors, (84), 3 states have call successors, (3), 3 states have 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:32,492 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand has 68 states, 63 states have (on average 1.3333333333333333) internal successors, (84), 63 states have internal predecessors, (84), 3 states have call successors, (3), 3 states have 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:32,492 INFO L87 Difference]: Start difference. First operand 95 states. Second operand has 68 states, 63 states have (on average 1.3333333333333333) internal successors, (84), 63 states have internal predecessors, (84), 3 states have call successors, (3), 3 states have 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:32,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:48:32,493 INFO L93 Difference]: Finished difference Result 95 states and 123 transitions. [2022-04-28 03:48:32,493 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 123 transitions. [2022-04-28 03:48:32,493 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:48:32,493 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:48:32,493 INFO L74 IsIncluded]: Start isIncluded. First operand has 68 states, 63 states have (on average 1.3333333333333333) internal successors, (84), 63 states have internal predecessors, (84), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 95 states. [2022-04-28 03:48:32,493 INFO L87 Difference]: Start difference. First operand has 68 states, 63 states have (on average 1.3333333333333333) internal successors, (84), 63 states have internal predecessors, (84), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 95 states. [2022-04-28 03:48:32,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:48:32,497 INFO L93 Difference]: Finished difference Result 95 states and 123 transitions. [2022-04-28 03:48:32,497 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 123 transitions. [2022-04-28 03:48:32,497 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:48:32,497 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:48:32,498 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:48:32,498 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:48:32,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 63 states have (on average 1.3333333333333333) internal successors, (84), 63 states have internal predecessors, (84), 3 states have call successors, (3), 3 states have 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:32,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 88 transitions. [2022-04-28 03:48:32,498 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 88 transitions. Word has length 28 [2022-04-28 03:48:32,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:48:32,499 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 88 transitions. [2022-04-28 03:48:32,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 11 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:48:32,499 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 68 states and 88 transitions. [2022-04-28 03:48:38,742 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 86 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-28 03:48:38,742 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 88 transitions. [2022-04-28 03:48:38,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-28 03:48:38,742 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:48:38,742 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:48:38,758 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-04-28 03:48:38,948 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,SelfDestructingSolverStorable23 [2022-04-28 03:48:38,948 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:48:38,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:48:38,948 INFO L85 PathProgramCache]: Analyzing trace with hash 1212034497, now seen corresponding path program 8 times [2022-04-28 03:48:38,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:48:38,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1414475380] [2022-04-28 03:48:39,147 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,148 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:48:39,150 INFO L85 PathProgramCache]: Analyzing trace with hash 410363957, now seen corresponding path program 1 times [2022-04-28 03:48:39,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:48:39,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502990341] [2022-04-28 03:48:39,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:48:39,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:48:39,158 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:48:39,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:48:39,167 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:48:39,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:48:39,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:48:39,284 INFO L290 TraceCheckUtils]: 0: Hoare triple {9982#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {9969#true} is VALID [2022-04-28 03:48:39,284 INFO L290 TraceCheckUtils]: 1: Hoare triple {9969#true} assume true; {9969#true} is VALID [2022-04-28 03:48:39,284 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9969#true} {9969#true} #83#return; {9969#true} is VALID [2022-04-28 03:48:39,284 INFO L272 TraceCheckUtils]: 0: Hoare triple {9969#true} call ULTIMATE.init(); {9982#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:48:39,284 INFO L290 TraceCheckUtils]: 1: Hoare triple {9982#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {9969#true} is VALID [2022-04-28 03:48:39,285 INFO L290 TraceCheckUtils]: 2: Hoare triple {9969#true} assume true; {9969#true} is VALID [2022-04-28 03:48:39,285 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9969#true} {9969#true} #83#return; {9969#true} is VALID [2022-04-28 03:48:39,285 INFO L272 TraceCheckUtils]: 4: Hoare triple {9969#true} call #t~ret15 := main(); {9969#true} is VALID [2022-04-28 03:48:39,285 INFO L290 TraceCheckUtils]: 5: Hoare triple {9969#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {9969#true} is VALID [2022-04-28 03:48:39,285 INFO L290 TraceCheckUtils]: 6: Hoare triple {9969#true} [127] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_247 v_main_~x~0_246)) (.cse1 (= |v_main_#t~post5_98| |v_main_#t~post5_97|)) (.cse2 (= |v_main_#t~post6_98| |v_main_#t~post6_97|)) (.cse3 (mod v_main_~x~0_247 4294967296))) (or (and .cse0 .cse1 .cse2 (= v_main_~y~0_230 v_main_~y~0_229)) (and (<= .cse3 0) .cse0 .cse1 .cse2 (= v_main_~y~0_229 v_main_~y~0_230)) (and (forall ((v_it_21 Int)) (or (not (<= 1 v_it_21)) (< 0 (mod (+ v_main_~x~0_247 (* 4294967295 v_it_21)) 4294967296)) (not (<= (+ v_main_~y~0_230 v_it_21 1) v_main_~y~0_229)))) (= v_main_~x~0_246 (+ v_main_~x~0_247 v_main_~y~0_230 (* (- 1) v_main_~y~0_229))) (< v_main_~y~0_230 v_main_~y~0_229) (< 0 .cse3)))) InVars {main_~y~0=v_main_~y~0_230, main_#t~post5=|v_main_#t~post5_98|, main_~x~0=v_main_~x~0_247, main_#t~post6=|v_main_#t~post6_98|} OutVars{main_~y~0=v_main_~y~0_229, main_#t~post5=|v_main_#t~post5_97|, main_~x~0=v_main_~x~0_246, main_#t~post6=|v_main_#t~post6_97|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {9969#true} is VALID [2022-04-28 03:48:39,285 INFO L290 TraceCheckUtils]: 7: Hoare triple {9969#true} [126] 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[] {9969#true} is VALID [2022-04-28 03:48:39,285 INFO L290 TraceCheckUtils]: 8: Hoare triple {9969#true} ~z~0 := ~y~0; {9974#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-28 03:48:39,286 INFO L290 TraceCheckUtils]: 9: Hoare triple {9974#(= (+ 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; {9975#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-28 03:48:39,287 INFO L290 TraceCheckUtils]: 10: Hoare triple {9975#(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; {9976#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-28 03:48:39,287 INFO L290 TraceCheckUtils]: 11: Hoare triple {9976#(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; {9977#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-28 03:48:39,288 INFO L290 TraceCheckUtils]: 12: Hoare triple {9977#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} assume !(~z~0 % 4294967296 > 0); {9978#(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:48:39,289 INFO L290 TraceCheckUtils]: 13: Hoare triple {9978#(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; {9979#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:48:39,290 INFO L290 TraceCheckUtils]: 14: Hoare triple {9979#(<= 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; {9980#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-28 03:48:39,291 INFO L290 TraceCheckUtils]: 15: Hoare triple {9980#(<= 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; {9981#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:48:39,291 INFO L290 TraceCheckUtils]: 16: Hoare triple {9981#(<= 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; {9970#false} is VALID [2022-04-28 03:48:39,291 INFO L290 TraceCheckUtils]: 17: Hoare triple {9970#false} assume !(~y~0 % 4294967296 > 0); {9970#false} is VALID [2022-04-28 03:48:39,291 INFO L290 TraceCheckUtils]: 18: Hoare triple {9970#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; {9970#false} is VALID [2022-04-28 03:48:39,291 INFO L290 TraceCheckUtils]: 19: Hoare triple {9970#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; {9970#false} is VALID [2022-04-28 03:48:39,291 INFO L290 TraceCheckUtils]: 20: Hoare triple {9970#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; {9970#false} is VALID [2022-04-28 03:48:39,291 INFO L290 TraceCheckUtils]: 21: Hoare triple {9970#false} assume !(~x~0 % 4294967296 > 0); {9970#false} is VALID [2022-04-28 03:48:39,292 INFO L290 TraceCheckUtils]: 22: Hoare triple {9970#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {9970#false} is VALID [2022-04-28 03:48:39,292 INFO L290 TraceCheckUtils]: 23: Hoare triple {9970#false} assume !(~z~0 % 4294967296 > 0); {9970#false} is VALID [2022-04-28 03:48:39,292 INFO L272 TraceCheckUtils]: 24: Hoare triple {9970#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {9970#false} is VALID [2022-04-28 03:48:39,292 INFO L290 TraceCheckUtils]: 25: Hoare triple {9970#false} ~cond := #in~cond; {9970#false} is VALID [2022-04-28 03:48:39,292 INFO L290 TraceCheckUtils]: 26: Hoare triple {9970#false} assume 0 == ~cond; {9970#false} is VALID [2022-04-28 03:48:39,292 INFO L290 TraceCheckUtils]: 27: Hoare triple {9970#false} assume !false; {9970#false} is VALID [2022-04-28 03:48:39,292 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-28 03:48:39,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:48:39,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502990341] [2022-04-28 03:48:39,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502990341] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:48:39,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [180481205] [2022-04-28 03:48:39,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:48:39,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:48:39,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:48:39,293 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:48:39,294 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:48:39,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:48:39,329 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-28 03:48:39,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:48:39,337 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:48:39,656 INFO L272 TraceCheckUtils]: 0: Hoare triple {9969#true} call ULTIMATE.init(); {9969#true} is VALID [2022-04-28 03:48:39,656 INFO L290 TraceCheckUtils]: 1: Hoare triple {9969#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {9969#true} is VALID [2022-04-28 03:48:39,656 INFO L290 TraceCheckUtils]: 2: Hoare triple {9969#true} assume true; {9969#true} is VALID [2022-04-28 03:48:39,656 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9969#true} {9969#true} #83#return; {9969#true} is VALID [2022-04-28 03:48:39,656 INFO L272 TraceCheckUtils]: 4: Hoare triple {9969#true} call #t~ret15 := main(); {9969#true} is VALID [2022-04-28 03:48:39,656 INFO L290 TraceCheckUtils]: 5: Hoare triple {9969#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {9969#true} is VALID [2022-04-28 03:48:39,656 INFO L290 TraceCheckUtils]: 6: Hoare triple {9969#true} [127] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_247 v_main_~x~0_246)) (.cse1 (= |v_main_#t~post5_98| |v_main_#t~post5_97|)) (.cse2 (= |v_main_#t~post6_98| |v_main_#t~post6_97|)) (.cse3 (mod v_main_~x~0_247 4294967296))) (or (and .cse0 .cse1 .cse2 (= v_main_~y~0_230 v_main_~y~0_229)) (and (<= .cse3 0) .cse0 .cse1 .cse2 (= v_main_~y~0_229 v_main_~y~0_230)) (and (forall ((v_it_21 Int)) (or (not (<= 1 v_it_21)) (< 0 (mod (+ v_main_~x~0_247 (* 4294967295 v_it_21)) 4294967296)) (not (<= (+ v_main_~y~0_230 v_it_21 1) v_main_~y~0_229)))) (= v_main_~x~0_246 (+ v_main_~x~0_247 v_main_~y~0_230 (* (- 1) v_main_~y~0_229))) (< v_main_~y~0_230 v_main_~y~0_229) (< 0 .cse3)))) InVars {main_~y~0=v_main_~y~0_230, main_#t~post5=|v_main_#t~post5_98|, main_~x~0=v_main_~x~0_247, main_#t~post6=|v_main_#t~post6_98|} OutVars{main_~y~0=v_main_~y~0_229, main_#t~post5=|v_main_#t~post5_97|, main_~x~0=v_main_~x~0_246, main_#t~post6=|v_main_#t~post6_97|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {9969#true} is VALID [2022-04-28 03:48:39,656 INFO L290 TraceCheckUtils]: 7: Hoare triple {9969#true} [126] 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[] {9969#true} is VALID [2022-04-28 03:48:39,667 INFO L290 TraceCheckUtils]: 8: Hoare triple {9969#true} ~z~0 := ~y~0; {9974#(= (+ main_~y~0 (* (- 1) main_~z~0)) 0)} is VALID [2022-04-28 03:48:39,668 INFO L290 TraceCheckUtils]: 9: Hoare triple {9974#(= (+ 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; {9975#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-28 03:48:39,669 INFO L290 TraceCheckUtils]: 10: Hoare triple {9975#(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; {9976#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-28 03:48:39,669 INFO L290 TraceCheckUtils]: 11: Hoare triple {9976#(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; {9977#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-28 03:48:39,670 INFO L290 TraceCheckUtils]: 12: Hoare triple {9977#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} assume !(~z~0 % 4294967296 > 0); {10022#(<= (div (+ 3 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ main_~y~0 (- 3)) 4294967296))} is VALID [2022-04-28 03:48:39,671 INFO L290 TraceCheckUtils]: 13: Hoare triple {10022#(<= (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; {9979#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:48:39,672 INFO L290 TraceCheckUtils]: 14: Hoare triple {9979#(<= 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; {9980#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-28 03:48:39,673 INFO L290 TraceCheckUtils]: 15: Hoare triple {9980#(<= 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; {9981#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:48:39,674 INFO L290 TraceCheckUtils]: 16: Hoare triple {9981#(<= 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; {9970#false} is VALID [2022-04-28 03:48:39,674 INFO L290 TraceCheckUtils]: 17: Hoare triple {9970#false} assume !(~y~0 % 4294967296 > 0); {9970#false} is VALID [2022-04-28 03:48:39,674 INFO L290 TraceCheckUtils]: 18: Hoare triple {9970#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; {9970#false} is VALID [2022-04-28 03:48:39,674 INFO L290 TraceCheckUtils]: 19: Hoare triple {9970#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; {9970#false} is VALID [2022-04-28 03:48:39,674 INFO L290 TraceCheckUtils]: 20: Hoare triple {9970#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; {9970#false} is VALID [2022-04-28 03:48:39,674 INFO L290 TraceCheckUtils]: 21: Hoare triple {9970#false} assume !(~x~0 % 4294967296 > 0); {9970#false} is VALID [2022-04-28 03:48:39,674 INFO L290 TraceCheckUtils]: 22: Hoare triple {9970#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {9970#false} is VALID [2022-04-28 03:48:39,675 INFO L290 TraceCheckUtils]: 23: Hoare triple {9970#false} assume !(~z~0 % 4294967296 > 0); {9970#false} is VALID [2022-04-28 03:48:39,675 INFO L272 TraceCheckUtils]: 24: Hoare triple {9970#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {9970#false} is VALID [2022-04-28 03:48:39,675 INFO L290 TraceCheckUtils]: 25: Hoare triple {9970#false} ~cond := #in~cond; {9970#false} is VALID [2022-04-28 03:48:39,675 INFO L290 TraceCheckUtils]: 26: Hoare triple {9970#false} assume 0 == ~cond; {9970#false} is VALID [2022-04-28 03:48:39,675 INFO L290 TraceCheckUtils]: 27: Hoare triple {9970#false} assume !false; {9970#false} is VALID [2022-04-28 03:48:39,676 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-28 03:48:39,676 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:48:40,182 INFO L290 TraceCheckUtils]: 27: Hoare triple {9970#false} assume !false; {9970#false} is VALID [2022-04-28 03:48:40,182 INFO L290 TraceCheckUtils]: 26: Hoare triple {9970#false} assume 0 == ~cond; {9970#false} is VALID [2022-04-28 03:48:40,182 INFO L290 TraceCheckUtils]: 25: Hoare triple {9970#false} ~cond := #in~cond; {9970#false} is VALID [2022-04-28 03:48:40,182 INFO L272 TraceCheckUtils]: 24: Hoare triple {9970#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {9970#false} is VALID [2022-04-28 03:48:40,182 INFO L290 TraceCheckUtils]: 23: Hoare triple {9970#false} assume !(~z~0 % 4294967296 > 0); {9970#false} is VALID [2022-04-28 03:48:40,182 INFO L290 TraceCheckUtils]: 22: Hoare triple {9970#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {9970#false} is VALID [2022-04-28 03:48:40,182 INFO L290 TraceCheckUtils]: 21: Hoare triple {9970#false} assume !(~x~0 % 4294967296 > 0); {9970#false} is VALID [2022-04-28 03:48:40,182 INFO L290 TraceCheckUtils]: 20: Hoare triple {9970#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; {9970#false} is VALID [2022-04-28 03:48:40,182 INFO L290 TraceCheckUtils]: 19: Hoare triple {9970#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; {9970#false} is VALID [2022-04-28 03:48:40,182 INFO L290 TraceCheckUtils]: 18: Hoare triple {9970#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; {9970#false} is VALID [2022-04-28 03:48:40,182 INFO L290 TraceCheckUtils]: 17: Hoare triple {9970#false} assume !(~y~0 % 4294967296 > 0); {9970#false} is VALID [2022-04-28 03:48:40,183 INFO L290 TraceCheckUtils]: 16: Hoare triple {9981#(<= 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; {9970#false} is VALID [2022-04-28 03:48:40,184 INFO L290 TraceCheckUtils]: 15: Hoare triple {9980#(<= 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; {9981#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:48:40,185 INFO L290 TraceCheckUtils]: 14: Hoare triple {9979#(<= 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; {9980#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-28 03:48:40,186 INFO L290 TraceCheckUtils]: 13: Hoare triple {10022#(<= (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; {9979#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:48:40,186 INFO L290 TraceCheckUtils]: 12: Hoare triple {10113#(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); {10022#(<= (div (+ 3 (* (- 1) main_~y~0)) (- 4294967296)) (div (+ main_~y~0 (- 3)) 4294967296))} is VALID [2022-04-28 03:48:40,188 INFO L290 TraceCheckUtils]: 11: Hoare triple {10117#(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; {10113#(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:48:40,189 INFO L290 TraceCheckUtils]: 10: Hoare triple {10121#(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; {10117#(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:48:40,190 INFO L290 TraceCheckUtils]: 9: Hoare triple {10125#(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; {10121#(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:48:40,191 INFO L290 TraceCheckUtils]: 8: Hoare triple {9969#true} ~z~0 := ~y~0; {10125#(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:48:40,191 INFO L290 TraceCheckUtils]: 7: Hoare triple {9969#true} [126] 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[] {9969#true} is VALID [2022-04-28 03:48:40,191 INFO L290 TraceCheckUtils]: 6: Hoare triple {9969#true} [127] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_247 v_main_~x~0_246)) (.cse1 (= |v_main_#t~post5_98| |v_main_#t~post5_97|)) (.cse2 (= |v_main_#t~post6_98| |v_main_#t~post6_97|)) (.cse3 (mod v_main_~x~0_247 4294967296))) (or (and .cse0 .cse1 .cse2 (= v_main_~y~0_230 v_main_~y~0_229)) (and (<= .cse3 0) .cse0 .cse1 .cse2 (= v_main_~y~0_229 v_main_~y~0_230)) (and (forall ((v_it_21 Int)) (or (not (<= 1 v_it_21)) (< 0 (mod (+ v_main_~x~0_247 (* 4294967295 v_it_21)) 4294967296)) (not (<= (+ v_main_~y~0_230 v_it_21 1) v_main_~y~0_229)))) (= v_main_~x~0_246 (+ v_main_~x~0_247 v_main_~y~0_230 (* (- 1) v_main_~y~0_229))) (< v_main_~y~0_230 v_main_~y~0_229) (< 0 .cse3)))) InVars {main_~y~0=v_main_~y~0_230, main_#t~post5=|v_main_#t~post5_98|, main_~x~0=v_main_~x~0_247, main_#t~post6=|v_main_#t~post6_98|} OutVars{main_~y~0=v_main_~y~0_229, main_#t~post5=|v_main_#t~post5_97|, main_~x~0=v_main_~x~0_246, main_#t~post6=|v_main_#t~post6_97|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {9969#true} is VALID [2022-04-28 03:48:40,191 INFO L290 TraceCheckUtils]: 5: Hoare triple {9969#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {9969#true} is VALID [2022-04-28 03:48:40,191 INFO L272 TraceCheckUtils]: 4: Hoare triple {9969#true} call #t~ret15 := main(); {9969#true} is VALID [2022-04-28 03:48:40,191 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9969#true} {9969#true} #83#return; {9969#true} is VALID [2022-04-28 03:48:40,191 INFO L290 TraceCheckUtils]: 2: Hoare triple {9969#true} assume true; {9969#true} is VALID [2022-04-28 03:48:40,191 INFO L290 TraceCheckUtils]: 1: Hoare triple {9969#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {9969#true} is VALID [2022-04-28 03:48:40,191 INFO L272 TraceCheckUtils]: 0: Hoare triple {9969#true} call ULTIMATE.init(); {9969#true} is VALID [2022-04-28 03:48:40,191 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-28 03:48:40,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [180481205] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:48:40,191 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:48:40,192 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 16 [2022-04-28 03:48:40,248 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:48:40,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1414475380] [2022-04-28 03:48:40,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1414475380] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:48:40,248 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:48:40,248 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 03:48:40,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035985945] [2022-04-28 03:48:40,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:48:40,248 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 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 29 [2022-04-28 03:48:40,249 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:48:40,249 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 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:48:40,268 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:48:40,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 03:48:40,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:48:40,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 03:48:40,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2022-04-28 03:48:40,269 INFO L87 Difference]: Start difference. First operand 68 states and 88 transitions. Second operand has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 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:48:41,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:48:41,803 INFO L93 Difference]: Finished difference Result 130 states and 170 transitions. [2022-04-28 03:48:41,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-28 03:48:41,803 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 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 29 [2022-04-28 03:48:41,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:48:41,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 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:48:41,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 70 transitions. [2022-04-28 03:48:41,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 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:48:41,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 70 transitions. [2022-04-28 03:48:41,805 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 70 transitions. [2022-04-28 03:48:41,896 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:48:41,897 INFO L225 Difference]: With dead ends: 130 [2022-04-28 03:48:41,897 INFO L226 Difference]: Without dead ends: 71 [2022-04-28 03:48:41,897 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 62 SyntacticMatches, 6 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=179, Invalid=1011, Unknown=0, NotChecked=0, Total=1190 [2022-04-28 03:48:41,898 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 40 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 03:48:41,898 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 60 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 03:48:41,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-04-28 03:48:42,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 57. [2022-04-28 03:48:42,236 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:48:42,236 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand has 57 states, 52 states have (on average 1.3076923076923077) internal successors, (68), 52 states have internal predecessors, (68), 3 states have call successors, (3), 3 states have 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:42,236 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand has 57 states, 52 states have (on average 1.3076923076923077) internal successors, (68), 52 states have internal predecessors, (68), 3 states have call successors, (3), 3 states have 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:42,236 INFO L87 Difference]: Start difference. First operand 71 states. Second operand has 57 states, 52 states have (on average 1.3076923076923077) internal successors, (68), 52 states have internal predecessors, (68), 3 states have call successors, (3), 3 states have 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:42,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:48:42,237 INFO L93 Difference]: Finished difference Result 71 states and 90 transitions. [2022-04-28 03:48:42,237 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 90 transitions. [2022-04-28 03:48:42,237 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:48:42,237 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:48:42,249 INFO L74 IsIncluded]: Start isIncluded. First operand has 57 states, 52 states have (on average 1.3076923076923077) internal successors, (68), 52 states have internal predecessors, (68), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 71 states. [2022-04-28 03:48:42,250 INFO L87 Difference]: Start difference. First operand has 57 states, 52 states have (on average 1.3076923076923077) internal successors, (68), 52 states have internal predecessors, (68), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 71 states. [2022-04-28 03:48:42,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:48:42,250 INFO L93 Difference]: Finished difference Result 71 states and 90 transitions. [2022-04-28 03:48:42,251 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 90 transitions. [2022-04-28 03:48:42,251 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:48:42,251 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:48:42,251 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:48:42,251 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:48:42,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 52 states have (on average 1.3076923076923077) internal successors, (68), 52 states have internal predecessors, (68), 3 states have call successors, (3), 3 states have 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:42,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 72 transitions. [2022-04-28 03:48:42,252 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 72 transitions. Word has length 29 [2022-04-28 03:48:42,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:48:42,252 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 72 transitions. [2022-04-28 03:48:42,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 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:48:42,252 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 57 states and 72 transitions. [2022-04-28 03:48:49,013 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 70 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-28 03:48:49,013 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 72 transitions. [2022-04-28 03:48:49,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-28 03:48:49,013 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:48:49,013 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:48:49,029 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:48:49,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:48:49,229 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:48:49,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:48:49,229 INFO L85 PathProgramCache]: Analyzing trace with hash 539759412, now seen corresponding path program 9 times [2022-04-28 03:48:49,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:48:49,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1966701862] [2022-04-28 03:48:49,391 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:49,393 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:48:49,394 INFO L85 PathProgramCache]: Analyzing trace with hash 868287957, now seen corresponding path program 1 times [2022-04-28 03:48:49,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:48:49,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118830182] [2022-04-28 03:48:49,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:48:49,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:48:49,402 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:48:49,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:48:49,411 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:48:49,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:48:49,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:48:49,485 INFO L290 TraceCheckUtils]: 0: Hoare triple {10721#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {10710#true} is VALID [2022-04-28 03:48:49,485 INFO L290 TraceCheckUtils]: 1: Hoare triple {10710#true} assume true; {10710#true} is VALID [2022-04-28 03:48:49,485 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10710#true} {10710#true} #83#return; {10710#true} is VALID [2022-04-28 03:48:49,486 INFO L272 TraceCheckUtils]: 0: Hoare triple {10710#true} call ULTIMATE.init(); {10721#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:48:49,486 INFO L290 TraceCheckUtils]: 1: Hoare triple {10721#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {10710#true} is VALID [2022-04-28 03:48:49,486 INFO L290 TraceCheckUtils]: 2: Hoare triple {10710#true} assume true; {10710#true} is VALID [2022-04-28 03:48:49,486 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10710#true} {10710#true} #83#return; {10710#true} is VALID [2022-04-28 03:48:49,486 INFO L272 TraceCheckUtils]: 4: Hoare triple {10710#true} call #t~ret15 := main(); {10710#true} is VALID [2022-04-28 03:48:49,486 INFO L290 TraceCheckUtils]: 5: Hoare triple {10710#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {10710#true} is VALID [2022-04-28 03:48:49,486 INFO L290 TraceCheckUtils]: 6: Hoare triple {10710#true} [129] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_103| |v_main_#t~post5_102|)) (.cse1 (= v_main_~x~0_262 v_main_~x~0_261)) (.cse2 (= |v_main_#t~post6_103| |v_main_#t~post6_102|)) (.cse4 (mod v_main_~x~0_262 4294967296)) (.cse3 (= v_main_~y~0_249 v_main_~y~0_248))) (or (and .cse0 .cse1 .cse2 .cse3) (and (< v_main_~x~0_261 v_main_~x~0_262) (< 0 .cse4) (= v_main_~y~0_248 (+ v_main_~x~0_262 (* v_main_~x~0_261 (- 1)) v_main_~y~0_249)) (forall ((v_it_22 Int)) (or (not (<= (+ v_main_~x~0_261 v_it_22 1) v_main_~x~0_262)) (not (<= 1 v_it_22)) (< 0 (mod (+ v_main_~x~0_262 (* 4294967295 v_it_22)) 4294967296))))) (and .cse0 .cse1 .cse2 (<= .cse4 0) .cse3))) InVars {main_~y~0=v_main_~y~0_249, main_#t~post5=|v_main_#t~post5_103|, main_~x~0=v_main_~x~0_262, main_#t~post6=|v_main_#t~post6_103|} OutVars{main_~y~0=v_main_~y~0_248, main_#t~post5=|v_main_#t~post5_102|, main_~x~0=v_main_~x~0_261, main_#t~post6=|v_main_#t~post6_102|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {10710#true} is VALID [2022-04-28 03:48:49,487 INFO L290 TraceCheckUtils]: 7: Hoare triple {10710#true} [128] 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[] {10715#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:48:49,487 INFO L290 TraceCheckUtils]: 8: Hoare triple {10715#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {10715#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:48:49,488 INFO L290 TraceCheckUtils]: 9: Hoare triple {10715#(<= 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; {10716#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:48:49,489 INFO L290 TraceCheckUtils]: 10: Hoare triple {10716#(<= 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; {10717#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:48:49,490 INFO L290 TraceCheckUtils]: 11: Hoare triple {10717#(<= 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; {10718#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:48:49,491 INFO L290 TraceCheckUtils]: 12: Hoare triple {10718#(<= 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; {10719#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:48:49,491 INFO L290 TraceCheckUtils]: 13: Hoare triple {10719#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {10719#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:48:49,492 INFO L290 TraceCheckUtils]: 14: Hoare triple {10719#(<= 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; {10719#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:48:49,492 INFO L290 TraceCheckUtils]: 15: Hoare triple {10719#(<= 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; {10719#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:48:49,492 INFO L290 TraceCheckUtils]: 16: Hoare triple {10719#(<= 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; {10719#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:48:49,493 INFO L290 TraceCheckUtils]: 17: Hoare triple {10719#(<= 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; {10719#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:48:49,493 INFO L290 TraceCheckUtils]: 18: Hoare triple {10719#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {10719#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:48:49,494 INFO L290 TraceCheckUtils]: 19: Hoare triple {10719#(<= 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; {10718#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:48:49,495 INFO L290 TraceCheckUtils]: 20: Hoare triple {10718#(<= 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; {10720#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 03:48:49,496 INFO L290 TraceCheckUtils]: 21: Hoare triple {10720#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {10711#false} is VALID [2022-04-28 03:48:49,496 INFO L290 TraceCheckUtils]: 22: Hoare triple {10711#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {10711#false} is VALID [2022-04-28 03:48:49,496 INFO L290 TraceCheckUtils]: 23: Hoare triple {10711#false} assume !(~z~0 % 4294967296 > 0); {10711#false} is VALID [2022-04-28 03:48:49,496 INFO L272 TraceCheckUtils]: 24: Hoare triple {10711#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {10711#false} is VALID [2022-04-28 03:48:49,496 INFO L290 TraceCheckUtils]: 25: Hoare triple {10711#false} ~cond := #in~cond; {10711#false} is VALID [2022-04-28 03:48:49,496 INFO L290 TraceCheckUtils]: 26: Hoare triple {10711#false} assume 0 == ~cond; {10711#false} is VALID [2022-04-28 03:48:49,496 INFO L290 TraceCheckUtils]: 27: Hoare triple {10711#false} assume !false; {10711#false} is VALID [2022-04-28 03:48:49,496 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-28 03:48:49,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:48:49,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118830182] [2022-04-28 03:48:49,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118830182] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:48:49,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1391251174] [2022-04-28 03:48:49,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:48:49,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:48:49,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:48:49,497 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:48:49,498 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:48:49,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:48:49,538 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-28 03:48:49,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:48:49,545 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:48:49,795 INFO L272 TraceCheckUtils]: 0: Hoare triple {10710#true} call ULTIMATE.init(); {10710#true} is VALID [2022-04-28 03:48:49,796 INFO L290 TraceCheckUtils]: 1: Hoare triple {10710#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {10710#true} is VALID [2022-04-28 03:48:49,796 INFO L290 TraceCheckUtils]: 2: Hoare triple {10710#true} assume true; {10710#true} is VALID [2022-04-28 03:48:49,796 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10710#true} {10710#true} #83#return; {10710#true} is VALID [2022-04-28 03:48:49,796 INFO L272 TraceCheckUtils]: 4: Hoare triple {10710#true} call #t~ret15 := main(); {10710#true} is VALID [2022-04-28 03:48:49,796 INFO L290 TraceCheckUtils]: 5: Hoare triple {10710#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {10710#true} is VALID [2022-04-28 03:48:49,796 INFO L290 TraceCheckUtils]: 6: Hoare triple {10710#true} [129] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_103| |v_main_#t~post5_102|)) (.cse1 (= v_main_~x~0_262 v_main_~x~0_261)) (.cse2 (= |v_main_#t~post6_103| |v_main_#t~post6_102|)) (.cse4 (mod v_main_~x~0_262 4294967296)) (.cse3 (= v_main_~y~0_249 v_main_~y~0_248))) (or (and .cse0 .cse1 .cse2 .cse3) (and (< v_main_~x~0_261 v_main_~x~0_262) (< 0 .cse4) (= v_main_~y~0_248 (+ v_main_~x~0_262 (* v_main_~x~0_261 (- 1)) v_main_~y~0_249)) (forall ((v_it_22 Int)) (or (not (<= (+ v_main_~x~0_261 v_it_22 1) v_main_~x~0_262)) (not (<= 1 v_it_22)) (< 0 (mod (+ v_main_~x~0_262 (* 4294967295 v_it_22)) 4294967296))))) (and .cse0 .cse1 .cse2 (<= .cse4 0) .cse3))) InVars {main_~y~0=v_main_~y~0_249, main_#t~post5=|v_main_#t~post5_103|, main_~x~0=v_main_~x~0_262, main_#t~post6=|v_main_#t~post6_103|} OutVars{main_~y~0=v_main_~y~0_248, main_#t~post5=|v_main_#t~post5_102|, main_~x~0=v_main_~x~0_261, main_#t~post6=|v_main_#t~post6_102|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {10710#true} is VALID [2022-04-28 03:48:49,796 INFO L290 TraceCheckUtils]: 7: Hoare triple {10710#true} [128] 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[] {10710#true} is VALID [2022-04-28 03:48:49,796 INFO L290 TraceCheckUtils]: 8: Hoare triple {10710#true} ~z~0 := ~y~0; {10749#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 03:48:49,797 INFO L290 TraceCheckUtils]: 9: Hoare triple {10749#(= 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; {10753#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-28 03:48:49,797 INFO L290 TraceCheckUtils]: 10: Hoare triple {10753#(= 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; {10757#(and (< 0 (mod (+ main_~z~0 1) 4294967296)) (= main_~y~0 (+ main_~z~0 2)))} is VALID [2022-04-28 03:48:49,798 INFO L290 TraceCheckUtils]: 11: Hoare triple {10757#(and (< 0 (mod (+ main_~z~0 1) 4294967296)) (= 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; {10761#(and (< 0 (mod (+ main_~z~0 2) 4294967296)) (= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-28 03:48:49,799 INFO L290 TraceCheckUtils]: 12: Hoare triple {10761#(and (< 0 (mod (+ main_~z~0 2) 4294967296)) (= 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; {10765#(and (= (+ main_~y~0 (- 3)) (+ main_~z~0 1)) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 03:48:49,800 INFO L290 TraceCheckUtils]: 13: Hoare triple {10765#(and (= (+ main_~y~0 (- 3)) (+ main_~z~0 1)) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {10765#(and (= (+ main_~y~0 (- 3)) (+ main_~z~0 1)) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 03:48:49,801 INFO L290 TraceCheckUtils]: 14: Hoare triple {10765#(and (= (+ main_~y~0 (- 3)) (+ main_~z~0 1)) (< 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; {10772#(and (< 0 (mod (+ main_~z~0 2) 4294967296)) (= (+ main_~z~0 3) (+ main_~y~0 1)))} is VALID [2022-04-28 03:48:49,802 INFO L290 TraceCheckUtils]: 15: Hoare triple {10772#(and (< 0 (mod (+ main_~z~0 2) 4294967296)) (= (+ main_~z~0 3) (+ 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; {10776#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-28 03:48:49,802 INFO L290 TraceCheckUtils]: 16: Hoare triple {10776#(< 0 (mod (+ main_~z~0 1) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10780#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 03:48:49,803 INFO L290 TraceCheckUtils]: 17: Hoare triple {10780#(< 0 (mod main_~z~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; {10784#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 03:48:49,803 INFO L290 TraceCheckUtils]: 18: Hoare triple {10784#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !(~y~0 % 4294967296 > 0); {10784#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 03:48:49,804 INFO L290 TraceCheckUtils]: 19: Hoare triple {10784#(< 0 (mod (+ main_~z~0 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; {10784#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 03:48:49,804 INFO L290 TraceCheckUtils]: 20: Hoare triple {10784#(< 0 (mod (+ main_~z~0 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; {10784#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 03:48:49,804 INFO L290 TraceCheckUtils]: 21: Hoare triple {10784#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {10784#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 03:48:49,805 INFO L290 TraceCheckUtils]: 22: Hoare triple {10784#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {10780#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 03:48:49,805 INFO L290 TraceCheckUtils]: 23: Hoare triple {10780#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {10711#false} is VALID [2022-04-28 03:48:49,805 INFO L272 TraceCheckUtils]: 24: Hoare triple {10711#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {10711#false} is VALID [2022-04-28 03:48:49,806 INFO L290 TraceCheckUtils]: 25: Hoare triple {10711#false} ~cond := #in~cond; {10711#false} is VALID [2022-04-28 03:48:49,806 INFO L290 TraceCheckUtils]: 26: Hoare triple {10711#false} assume 0 == ~cond; {10711#false} is VALID [2022-04-28 03:48:49,806 INFO L290 TraceCheckUtils]: 27: Hoare triple {10711#false} assume !false; {10711#false} is VALID [2022-04-28 03:48:49,806 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 03:48:49,806 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:48:49,931 INFO L290 TraceCheckUtils]: 27: Hoare triple {10711#false} assume !false; {10711#false} is VALID [2022-04-28 03:48:49,931 INFO L290 TraceCheckUtils]: 26: Hoare triple {10711#false} assume 0 == ~cond; {10711#false} is VALID [2022-04-28 03:48:49,931 INFO L290 TraceCheckUtils]: 25: Hoare triple {10711#false} ~cond := #in~cond; {10711#false} is VALID [2022-04-28 03:48:49,931 INFO L272 TraceCheckUtils]: 24: Hoare triple {10711#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {10711#false} is VALID [2022-04-28 03:48:49,931 INFO L290 TraceCheckUtils]: 23: Hoare triple {10780#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {10711#false} is VALID [2022-04-28 03:48:49,932 INFO L290 TraceCheckUtils]: 22: Hoare triple {10784#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {10780#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 03:48:49,933 INFO L290 TraceCheckUtils]: 21: Hoare triple {10784#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {10784#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 03:48:49,933 INFO L290 TraceCheckUtils]: 20: Hoare triple {10784#(< 0 (mod (+ main_~z~0 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; {10784#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 03:48:49,933 INFO L290 TraceCheckUtils]: 19: Hoare triple {10784#(< 0 (mod (+ main_~z~0 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; {10784#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 03:48:49,934 INFO L290 TraceCheckUtils]: 18: Hoare triple {10784#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !(~y~0 % 4294967296 > 0); {10784#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 03:48:49,935 INFO L290 TraceCheckUtils]: 17: Hoare triple {10780#(< 0 (mod main_~z~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; {10784#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 03:48:49,935 INFO L290 TraceCheckUtils]: 16: Hoare triple {10776#(< 0 (mod (+ main_~z~0 1) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10780#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 03:48:49,936 INFO L290 TraceCheckUtils]: 15: Hoare triple {10851#(< 0 (mod (+ main_~z~0 2) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {10776#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-28 03:48:49,937 INFO L290 TraceCheckUtils]: 14: Hoare triple {10855#(< 0 (mod (+ main_~z~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; {10851#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-28 03:48:49,937 INFO L290 TraceCheckUtils]: 13: Hoare triple {10855#(< 0 (mod (+ main_~z~0 3) 4294967296))} assume !(~z~0 % 4294967296 > 0); {10855#(< 0 (mod (+ main_~z~0 3) 4294967296))} is VALID [2022-04-28 03:48:49,938 INFO L290 TraceCheckUtils]: 12: Hoare triple {10851#(< 0 (mod (+ main_~z~0 2) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10855#(< 0 (mod (+ main_~z~0 3) 4294967296))} is VALID [2022-04-28 03:48:49,938 INFO L290 TraceCheckUtils]: 11: Hoare triple {10776#(< 0 (mod (+ main_~z~0 1) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10851#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-28 03:48:49,939 INFO L290 TraceCheckUtils]: 10: Hoare triple {10710#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10776#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-28 03:48:49,939 INFO L290 TraceCheckUtils]: 9: Hoare triple {10710#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {10710#true} is VALID [2022-04-28 03:48:49,939 INFO L290 TraceCheckUtils]: 8: Hoare triple {10710#true} ~z~0 := ~y~0; {10710#true} is VALID [2022-04-28 03:48:49,939 INFO L290 TraceCheckUtils]: 7: Hoare triple {10710#true} [128] 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[] {10710#true} is VALID [2022-04-28 03:48:49,939 INFO L290 TraceCheckUtils]: 6: Hoare triple {10710#true} [129] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_103| |v_main_#t~post5_102|)) (.cse1 (= v_main_~x~0_262 v_main_~x~0_261)) (.cse2 (= |v_main_#t~post6_103| |v_main_#t~post6_102|)) (.cse4 (mod v_main_~x~0_262 4294967296)) (.cse3 (= v_main_~y~0_249 v_main_~y~0_248))) (or (and .cse0 .cse1 .cse2 .cse3) (and (< v_main_~x~0_261 v_main_~x~0_262) (< 0 .cse4) (= v_main_~y~0_248 (+ v_main_~x~0_262 (* v_main_~x~0_261 (- 1)) v_main_~y~0_249)) (forall ((v_it_22 Int)) (or (not (<= (+ v_main_~x~0_261 v_it_22 1) v_main_~x~0_262)) (not (<= 1 v_it_22)) (< 0 (mod (+ v_main_~x~0_262 (* 4294967295 v_it_22)) 4294967296))))) (and .cse0 .cse1 .cse2 (<= .cse4 0) .cse3))) InVars {main_~y~0=v_main_~y~0_249, main_#t~post5=|v_main_#t~post5_103|, main_~x~0=v_main_~x~0_262, main_#t~post6=|v_main_#t~post6_103|} OutVars{main_~y~0=v_main_~y~0_248, main_#t~post5=|v_main_#t~post5_102|, main_~x~0=v_main_~x~0_261, main_#t~post6=|v_main_#t~post6_102|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {10710#true} is VALID [2022-04-28 03:48:49,939 INFO L290 TraceCheckUtils]: 5: Hoare triple {10710#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {10710#true} is VALID [2022-04-28 03:48:49,940 INFO L272 TraceCheckUtils]: 4: Hoare triple {10710#true} call #t~ret15 := main(); {10710#true} is VALID [2022-04-28 03:48:49,940 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10710#true} {10710#true} #83#return; {10710#true} is VALID [2022-04-28 03:48:49,940 INFO L290 TraceCheckUtils]: 2: Hoare triple {10710#true} assume true; {10710#true} is VALID [2022-04-28 03:48:49,940 INFO L290 TraceCheckUtils]: 1: Hoare triple {10710#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {10710#true} is VALID [2022-04-28 03:48:49,940 INFO L272 TraceCheckUtils]: 0: Hoare triple {10710#true} call ULTIMATE.init(); {10710#true} is VALID [2022-04-28 03:48:49,940 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 03:48:49,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1391251174] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:48:49,940 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:48:49,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 7] total 20 [2022-04-28 03:48:50,070 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:48:50,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1966701862] [2022-04-28 03:48:50,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1966701862] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:48:50,071 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:48:50,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 03:48:50,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201290528] [2022-04-28 03:48:50,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:48:50,071 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 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:48:50,071 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:48:50,071 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 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:48:50,093 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:48:50,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 03:48:50,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:48:50,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 03:48:50,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=438, Unknown=0, NotChecked=0, Total=506 [2022-04-28 03:48:50,094 INFO L87 Difference]: Start difference. First operand 57 states and 72 transitions. Second operand has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 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:48:52,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:48:52,444 INFO L93 Difference]: Finished difference Result 174 states and 245 transitions. [2022-04-28 03:48:52,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-28 03:48:52,444 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 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:48:52,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:48:52,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 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:48:52,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 102 transitions. [2022-04-28 03:48:52,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 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:48:52,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 102 transitions. [2022-04-28 03:48:52,446 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 102 transitions. [2022-04-28 03:48:52,600 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:48:52,601 INFO L225 Difference]: With dead ends: 174 [2022-04-28 03:48:52,601 INFO L226 Difference]: Without dead ends: 157 [2022-04-28 03:48:52,602 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=185, Invalid=1005, Unknown=0, NotChecked=0, Total=1190 [2022-04-28 03:48:52,602 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 138 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 03:48:52,602 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 54 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 03:48:52,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2022-04-28 03:48:53,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 77. [2022-04-28 03:48:53,083 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:48:53,083 INFO L82 GeneralOperation]: Start isEquivalent. First operand 157 states. Second operand has 77 states, 72 states have (on average 1.3055555555555556) internal successors, (94), 72 states have internal predecessors, (94), 3 states have call successors, (3), 3 states have 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:53,083 INFO L74 IsIncluded]: Start isIncluded. First operand 157 states. Second operand has 77 states, 72 states have (on average 1.3055555555555556) internal successors, (94), 72 states have internal predecessors, (94), 3 states have call successors, (3), 3 states have 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:53,083 INFO L87 Difference]: Start difference. First operand 157 states. Second operand has 77 states, 72 states have (on average 1.3055555555555556) internal successors, (94), 72 states have internal predecessors, (94), 3 states have call successors, (3), 3 states have 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:53,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:48:53,086 INFO L93 Difference]: Finished difference Result 157 states and 214 transitions. [2022-04-28 03:48:53,086 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 214 transitions. [2022-04-28 03:48:53,086 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:48:53,086 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:48:53,086 INFO L74 IsIncluded]: Start isIncluded. First operand has 77 states, 72 states have (on average 1.3055555555555556) internal successors, (94), 72 states have internal predecessors, (94), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 157 states. [2022-04-28 03:48:53,086 INFO L87 Difference]: Start difference. First operand has 77 states, 72 states have (on average 1.3055555555555556) internal successors, (94), 72 states have internal predecessors, (94), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 157 states. [2022-04-28 03:48:53,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:48:53,089 INFO L93 Difference]: Finished difference Result 157 states and 214 transitions. [2022-04-28 03:48:53,089 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 214 transitions. [2022-04-28 03:48:53,089 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:48:53,089 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:48:53,089 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:48:53,089 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:48:53,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 72 states have (on average 1.3055555555555556) internal successors, (94), 72 states have internal predecessors, (94), 3 states have call successors, (3), 3 states have 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:53,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 98 transitions. [2022-04-28 03:48:53,090 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 98 transitions. Word has length 30 [2022-04-28 03:48:53,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:48:53,091 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 98 transitions. [2022-04-28 03:48:53,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 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:48:53,091 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 77 states and 98 transitions. [2022-04-28 03:49:02,461 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 95 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-28 03:49:02,462 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 98 transitions. [2022-04-28 03:49:02,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-28 03:49:02,462 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:49:02,462 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:49:02,477 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:49:02,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:49:02,662 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:49:02,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:49:02,663 INFO L85 PathProgramCache]: Analyzing trace with hash -543637167, now seen corresponding path program 10 times [2022-04-28 03:49:02,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:49:02,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1262410296] [2022-04-28 03:49:02,834 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:49:02,835 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:49:02,837 INFO L85 PathProgramCache]: Analyzing trace with hash -535770480, now seen corresponding path program 1 times [2022-04-28 03:49:02,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:49:02,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133321241] [2022-04-28 03:49:02,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:49:02,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:49:02,845 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:49:02,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:49:02,879 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_23.5))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:49:03,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:49:03,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:49:03,544 INFO L290 TraceCheckUtils]: 0: Hoare triple {11764#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {11743#true} is VALID [2022-04-28 03:49:03,544 INFO L290 TraceCheckUtils]: 1: Hoare triple {11743#true} assume true; {11743#true} is VALID [2022-04-28 03:49:03,544 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11743#true} {11743#true} #83#return; {11743#true} is VALID [2022-04-28 03:49:03,544 INFO L272 TraceCheckUtils]: 0: Hoare triple {11743#true} call ULTIMATE.init(); {11764#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:49:03,544 INFO L290 TraceCheckUtils]: 1: Hoare triple {11764#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {11743#true} is VALID [2022-04-28 03:49:03,545 INFO L290 TraceCheckUtils]: 2: Hoare triple {11743#true} assume true; {11743#true} is VALID [2022-04-28 03:49:03,545 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11743#true} {11743#true} #83#return; {11743#true} is VALID [2022-04-28 03:49:03,545 INFO L272 TraceCheckUtils]: 4: Hoare triple {11743#true} call #t~ret15 := main(); {11743#true} is VALID [2022-04-28 03:49:03,545 INFO L290 TraceCheckUtils]: 5: Hoare triple {11743#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {11748#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-28 03:49:03,547 INFO L290 TraceCheckUtils]: 6: Hoare triple {11748#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} [131] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_277 4294967296)) (.cse1 (= v_main_~x~0_277 v_main_~x~0_276)) (.cse2 (= |v_main_#t~post5_108| |v_main_#t~post5_107|)) (.cse3 (= |v_main_#t~post6_108| |v_main_#t~post6_107|)) (.cse4 (= v_main_~y~0_266 v_main_~y~0_265))) (or (and (forall ((v_it_23 Int)) (or (not (<= 1 v_it_23)) (< 0 (mod (+ v_main_~x~0_277 (* 4294967295 v_it_23)) 4294967296)) (not (<= (+ v_main_~x~0_276 v_it_23 1) v_main_~x~0_277)))) (< v_main_~x~0_276 v_main_~x~0_277) (= v_main_~y~0_265 (+ v_main_~x~0_277 v_main_~y~0_266 (* v_main_~x~0_276 (- 1)))) (< 0 .cse0)) (and .cse1 .cse2 (<= .cse0 0) .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_266, main_#t~post5=|v_main_#t~post5_108|, main_~x~0=v_main_~x~0_277, main_#t~post6=|v_main_#t~post6_108|} OutVars{main_~y~0=v_main_~y~0_265, main_#t~post5=|v_main_#t~post5_107|, main_~x~0=v_main_~x~0_276, main_#t~post6=|v_main_#t~post6_107|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {11749#(or (and (<= 0 main_~y~0) (<= main_~y~0 0)) (and (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= main_~n~0 (+ main_~y~0 main_~x~0))))} is VALID [2022-04-28 03:49:03,547 INFO L290 TraceCheckUtils]: 7: Hoare triple {11749#(or (and (<= 0 main_~y~0) (<= main_~y~0 0)) (and (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= main_~n~0 (+ main_~y~0 main_~x~0))))} [130] 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[] {11750#(or (and (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ main_~y~0 main_~x~0) main_~n~0)) (and (<= 0 main_~y~0) (<= main_~y~0 0)))} is VALID [2022-04-28 03:49:03,548 INFO L290 TraceCheckUtils]: 8: Hoare triple {11750#(or (and (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ main_~y~0 main_~x~0) main_~n~0)) (and (<= 0 main_~y~0) (<= main_~y~0 0)))} ~z~0 := ~y~0; {11751#(or (and (<= main_~z~0 0) (<= 0 main_~z~0)) (and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0) (<= (+ main_~z~0 main_~x~0) main_~n~0) (<= main_~n~0 (+ main_~z~0 (* 4294967296 (div main_~x~0 4294967296))))))} is VALID [2022-04-28 03:49:03,550 INFO L290 TraceCheckUtils]: 9: Hoare triple {11751#(or (and (<= main_~z~0 0) (<= 0 main_~z~0)) (and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0) (<= (+ main_~z~0 main_~x~0) main_~n~0) (<= main_~n~0 (+ main_~z~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; {11752#(and (<= main_~n~0 (+ main_~z~0 main_~x~0)) (<= (+ (* (div (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) main_~z~0 main_~x~0 4294967295 (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~x~0) (<= (+ main_~z~0 main_~x~0) main_~n~0) (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-28 03:49:03,552 INFO L290 TraceCheckUtils]: 10: Hoare triple {11752#(and (<= main_~n~0 (+ main_~z~0 main_~x~0)) (<= (+ (* (div (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) main_~z~0 main_~x~0 4294967295 (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~x~0) (<= (+ main_~z~0 main_~x~0) main_~n~0) (<= 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; {11753#(and (or (<= (+ (div main_~z~0 4294967296) 1) (div main_~y~0 4294967296)) (and (<= main_~n~0 (+ main_~z~0 main_~x~0)) (<= (+ main_~z~0 main_~x~0) main_~n~0) (<= (+ 2 (* (div (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) main_~z~0 main_~x~0 4294967295 (* (- 1) main_~n~0)) 4294967296) 4294967296)) main_~x~0) (<= (+ main_~z~0 2) main_~y~0))) (or (not (<= (+ (div main_~z~0 4294967296) 1) (div main_~y~0 4294967296))) (<= main_~y~0 (+ main_~z~0 2))))} is VALID [2022-04-28 03:49:03,559 INFO L290 TraceCheckUtils]: 11: Hoare triple {11753#(and (or (<= (+ (div main_~z~0 4294967296) 1) (div main_~y~0 4294967296)) (and (<= main_~n~0 (+ main_~z~0 main_~x~0)) (<= (+ main_~z~0 main_~x~0) main_~n~0) (<= (+ 2 (* (div (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) main_~z~0 main_~x~0 4294967295 (* (- 1) main_~n~0)) 4294967296) 4294967296)) main_~x~0) (<= (+ main_~z~0 2) main_~y~0))) (or (not (<= (+ (div main_~z~0 4294967296) 1) (div main_~y~0 4294967296))) (<= 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; {11754#(or (and (or (<= (+ 3 (* (div (+ main_~z~0 main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (div main_~z~0 4294967296) (- 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296)) main_~x~0) (<= (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296) 4294967293) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)))) (<= (div main_~z~0 4294967296) (div main_~y~0 4294967296)) (<= (+ main_~x~0 (* 4294967296 (div (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0 (* (- 1) main_~z~0) 4294967295 (* (- 1) main_~x~0)) 4294967296))) main_~n~0)) (<= main_~y~0 (+ (* (div main_~y~0 4294967296) 4294967296) 1)))} is VALID [2022-04-28 03:49:03,561 INFO L290 TraceCheckUtils]: 12: Hoare triple {11754#(or (and (or (<= (+ 3 (* (div (+ main_~z~0 main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (div main_~z~0 4294967296) (- 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296)) main_~x~0) (<= (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296) 4294967293) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)))) (<= (div main_~z~0 4294967296) (div main_~y~0 4294967296)) (<= (+ main_~x~0 (* 4294967296 (div (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0 (* (- 1) main_~z~0) 4294967295 (* (- 1) main_~x~0)) 4294967296))) main_~n~0)) (<= main_~y~0 (+ (* (div main_~y~0 4294967296) 4294967296) 1)))} assume !(~z~0 % 4294967296 > 0); {11755#(or (<= main_~y~0 (+ (* (div main_~y~0 4294967296) 4294967296) 1)) (and (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 3) main_~x~0) (<= (div main_~z~0 4294967296) (div main_~y~0 4294967296)) (<= (+ (* (div (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0 4294967295 (* (- 1) main_~x~0) (* (div main_~z~0 4294967296) (- 4294967296))) 4294967296) 4294967296) main_~x~0) main_~n~0)))} is VALID [2022-04-28 03:49:03,563 INFO L290 TraceCheckUtils]: 13: Hoare triple {11755#(or (<= main_~y~0 (+ (* (div main_~y~0 4294967296) 4294967296) 1)) (and (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 3) main_~x~0) (<= (div main_~z~0 4294967296) (div main_~y~0 4294967296)) (<= (+ (* (div (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0 4294967295 (* (- 1) main_~x~0) (* (div main_~z~0 4294967296) (- 4294967296))) 4294967296) 4294967296) main_~x~0) 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; {11756#(or (<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296)) (and (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 3) main_~x~0) (<= (+ main_~x~0 (* (div (+ main_~n~0 4294967295 (* (- 1) main_~x~0)) 4294967296) 4294967296)) main_~n~0)))} is VALID [2022-04-28 03:49:03,564 INFO L290 TraceCheckUtils]: 14: Hoare triple {11756#(or (<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296)) (and (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 3) main_~x~0) (<= (+ main_~x~0 (* (div (+ main_~n~0 4294967295 (* (- 1) main_~x~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; {11757#(and (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 3) main_~x~0) (<= (+ main_~x~0 (* (div (+ main_~n~0 4294967295 (* (- 1) main_~x~0)) 4294967296) 4294967296)) main_~n~0))} is VALID [2022-04-28 03:49:03,565 INFO L290 TraceCheckUtils]: 15: Hoare triple {11757#(and (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 3) main_~x~0) (<= (+ main_~x~0 (* (div (+ main_~n~0 4294967295 (* (- 1) main_~x~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; {11757#(and (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 3) main_~x~0) (<= (+ main_~x~0 (* (div (+ main_~n~0 4294967295 (* (- 1) main_~x~0)) 4294967296) 4294967296)) main_~n~0))} is VALID [2022-04-28 03:49:03,565 INFO L290 TraceCheckUtils]: 16: Hoare triple {11757#(and (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 3) main_~x~0) (<= (+ main_~x~0 (* (div (+ main_~n~0 4294967295 (* (- 1) main_~x~0)) 4294967296) 4294967296)) main_~n~0))} assume !(~y~0 % 4294967296 > 0); {11757#(and (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 3) main_~x~0) (<= (+ main_~x~0 (* (div (+ main_~n~0 4294967295 (* (- 1) main_~x~0)) 4294967296) 4294967296)) main_~n~0))} is VALID [2022-04-28 03:49:03,568 INFO L290 TraceCheckUtils]: 17: Hoare triple {11757#(and (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 3) main_~x~0) (<= (+ main_~x~0 (* (div (+ main_~n~0 4294967295 (* (- 1) main_~x~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; {11758#(and (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967296 (* (- 1) main_~n~0)) 4294967296) 4294967296) 2) main_~x~0) (<= (+ (* (div (+ main_~n~0 4294967294 (* (- 1) main_~x~0)) 4294967296) 4294967296) main_~x~0 1) main_~n~0))} is VALID [2022-04-28 03:49:03,571 INFO L290 TraceCheckUtils]: 18: Hoare triple {11758#(and (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967296 (* (- 1) main_~n~0)) 4294967296) 4294967296) 2) main_~x~0) (<= (+ (* (div (+ main_~n~0 4294967294 (* (- 1) main_~x~0)) 4294967296) 4294967296) main_~x~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; {11759#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~x~0) 4294967293) 4294967296) 4294967296) main_~x~0 2) main_~n~0) (<= (+ (* (div (+ main_~x~0 4294967297 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~x~0))} is VALID [2022-04-28 03:49:03,573 INFO L290 TraceCheckUtils]: 19: Hoare triple {11759#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~x~0) 4294967293) 4294967296) 4294967296) main_~x~0 2) main_~n~0) (<= (+ (* (div (+ main_~x~0 4294967297 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~x~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; {11760#(and (<= (+ main_~x~0 3 (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~x~0)) 4294967296) 4294967296)) main_~n~0) (<= (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 4294967298) 4294967296) 4294967296) main_~x~0))} is VALID [2022-04-28 03:49:03,573 INFO L290 TraceCheckUtils]: 20: Hoare triple {11760#(and (<= (+ main_~x~0 3 (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~x~0)) 4294967296) 4294967296)) main_~n~0) (<= (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 4294967298) 4294967296) 4294967296) main_~x~0))} assume !(~x~0 % 4294967296 > 0); {11760#(and (<= (+ main_~x~0 3 (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~x~0)) 4294967296) 4294967296)) main_~n~0) (<= (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 4294967298) 4294967296) 4294967296) main_~x~0))} is VALID [2022-04-28 03:49:03,576 INFO L290 TraceCheckUtils]: 21: Hoare triple {11760#(and (<= (+ main_~x~0 3 (* (div (+ 4294967292 main_~n~0 (* (- 1) main_~x~0)) 4294967296) 4294967296)) main_~n~0) (<= (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 4294967298) 4294967296) 4294967296) main_~x~0))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {11759#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~x~0) 4294967293) 4294967296) 4294967296) main_~x~0 2) main_~n~0) (<= (+ (* (div (+ main_~x~0 4294967297 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~x~0))} is VALID [2022-04-28 03:49:03,579 INFO L290 TraceCheckUtils]: 22: Hoare triple {11759#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~x~0) 4294967293) 4294967296) 4294967296) main_~x~0 2) main_~n~0) (<= (+ (* (div (+ main_~x~0 4294967297 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) main_~x~0))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {11758#(and (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967296 (* (- 1) main_~n~0)) 4294967296) 4294967296) 2) main_~x~0) (<= (+ (* (div (+ main_~n~0 4294967294 (* (- 1) main_~x~0)) 4294967296) 4294967296) main_~x~0 1) main_~n~0))} is VALID [2022-04-28 03:49:03,580 INFO L290 TraceCheckUtils]: 23: Hoare triple {11758#(and (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967296 (* (- 1) main_~n~0)) 4294967296) 4294967296) 2) main_~x~0) (<= (+ (* (div (+ main_~n~0 4294967294 (* (- 1) main_~x~0)) 4294967296) 4294967296) main_~x~0 1) main_~n~0))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {11761#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-28 03:49:03,581 INFO L290 TraceCheckUtils]: 24: Hoare triple {11761#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !(~z~0 % 4294967296 > 0); {11761#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-28 03:49:03,582 INFO L272 TraceCheckUtils]: 25: Hoare triple {11761#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {11762#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:49:03,582 INFO L290 TraceCheckUtils]: 26: Hoare triple {11762#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {11763#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:49:03,582 INFO L290 TraceCheckUtils]: 27: Hoare triple {11763#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {11744#false} is VALID [2022-04-28 03:49:03,582 INFO L290 TraceCheckUtils]: 28: Hoare triple {11744#false} assume !false; {11744#false} is VALID [2022-04-28 03:49:03,583 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 03:49:03,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:49:03,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133321241] [2022-04-28 03:49:03,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133321241] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:49:03,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [280989105] [2022-04-28 03:49:03,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:49:03,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:49:03,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:49:03,584 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:49:03,585 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:49:04,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:49:04,380 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 46 conjunts are in the unsatisfiable core [2022-04-28 03:49:04,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:49:04,571 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:49:54,099 INFO L272 TraceCheckUtils]: 0: Hoare triple {11743#true} call ULTIMATE.init(); {11743#true} is VALID [2022-04-28 03:49:54,099 INFO L290 TraceCheckUtils]: 1: Hoare triple {11743#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {11743#true} is VALID [2022-04-28 03:49:54,099 INFO L290 TraceCheckUtils]: 2: Hoare triple {11743#true} assume true; {11743#true} is VALID [2022-04-28 03:49:54,099 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11743#true} {11743#true} #83#return; {11743#true} is VALID [2022-04-28 03:49:54,099 INFO L272 TraceCheckUtils]: 4: Hoare triple {11743#true} call #t~ret15 := main(); {11743#true} is VALID [2022-04-28 03:49:54,100 INFO L290 TraceCheckUtils]: 5: Hoare triple {11743#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {11748#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-28 03:49:54,112 INFO L290 TraceCheckUtils]: 6: Hoare triple {11748#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} [131] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_277 4294967296)) (.cse1 (= v_main_~x~0_277 v_main_~x~0_276)) (.cse2 (= |v_main_#t~post5_108| |v_main_#t~post5_107|)) (.cse3 (= |v_main_#t~post6_108| |v_main_#t~post6_107|)) (.cse4 (= v_main_~y~0_266 v_main_~y~0_265))) (or (and (forall ((v_it_23 Int)) (or (not (<= 1 v_it_23)) (< 0 (mod (+ v_main_~x~0_277 (* 4294967295 v_it_23)) 4294967296)) (not (<= (+ v_main_~x~0_276 v_it_23 1) v_main_~x~0_277)))) (< v_main_~x~0_276 v_main_~x~0_277) (= v_main_~y~0_265 (+ v_main_~x~0_277 v_main_~y~0_266 (* v_main_~x~0_276 (- 1)))) (< 0 .cse0)) (and .cse1 .cse2 (<= .cse0 0) .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_266, main_#t~post5=|v_main_#t~post5_108|, main_~x~0=v_main_~x~0_277, main_#t~post6=|v_main_#t~post6_108|} OutVars{main_~y~0=v_main_~y~0_265, main_#t~post5=|v_main_#t~post5_107|, main_~x~0=v_main_~x~0_276, main_#t~post6=|v_main_#t~post6_107|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {11786#(or (and (< main_~x~0 main_~n~0) (forall ((v_it_23 Int)) (or (not (<= 1 v_it_23)) (< 0 (mod (+ (* 4294967295 v_it_23) main_~n~0) 4294967296)) (not (<= (+ main_~x~0 v_it_23 1) main_~n~0)))) (< 0 (mod main_~n~0 4294967296)) (= main_~y~0 (+ main_~n~0 (* (- 1) main_~x~0)))) (and (= main_~n~0 main_~x~0) (= main_~y~0 0)))} is VALID [2022-04-28 03:49:54,114 INFO L290 TraceCheckUtils]: 7: Hoare triple {11786#(or (and (< main_~x~0 main_~n~0) (forall ((v_it_23 Int)) (or (not (<= 1 v_it_23)) (< 0 (mod (+ (* 4294967295 v_it_23) main_~n~0) 4294967296)) (not (<= (+ main_~x~0 v_it_23 1) main_~n~0)))) (< 0 (mod main_~n~0 4294967296)) (= main_~y~0 (+ main_~n~0 (* (- 1) main_~x~0)))) (and (= main_~n~0 main_~x~0) (= main_~y~0 0)))} [130] 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[] {11790#(and (or (and (< main_~x~0 main_~n~0) (forall ((v_it_23 Int)) (or (not (<= 1 v_it_23)) (< 0 (mod (+ (* 4294967295 v_it_23) main_~n~0) 4294967296)) (not (<= (+ main_~x~0 v_it_23 1) main_~n~0)))) (< 0 (mod main_~n~0 4294967296)) (= main_~y~0 (+ main_~n~0 (* (- 1) main_~x~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:49:54,115 INFO L290 TraceCheckUtils]: 8: Hoare triple {11790#(and (or (and (< main_~x~0 main_~n~0) (forall ((v_it_23 Int)) (or (not (<= 1 v_it_23)) (< 0 (mod (+ (* 4294967295 v_it_23) main_~n~0) 4294967296)) (not (<= (+ main_~x~0 v_it_23 1) main_~n~0)))) (< 0 (mod main_~n~0 4294967296)) (= main_~y~0 (+ main_~n~0 (* (- 1) main_~x~0)))) (and (= main_~n~0 main_~x~0) (= main_~y~0 0))) (not (< 0 (mod main_~x~0 4294967296))))} ~z~0 := ~y~0; {11794#(and (= main_~z~0 main_~y~0) (or (and (< main_~x~0 main_~n~0) (forall ((v_it_23 Int)) (or (not (<= 1 v_it_23)) (< 0 (mod (+ (* 4294967295 v_it_23) main_~n~0) 4294967296)) (not (<= (+ main_~x~0 v_it_23 1) main_~n~0)))) (< 0 (mod main_~n~0 4294967296)) (= main_~y~0 (+ main_~n~0 (* (- 1) main_~x~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:49:54,123 INFO L290 TraceCheckUtils]: 9: Hoare triple {11794#(and (= main_~z~0 main_~y~0) (or (and (< main_~x~0 main_~n~0) (forall ((v_it_23 Int)) (or (not (<= 1 v_it_23)) (< 0 (mod (+ (* 4294967295 v_it_23) main_~n~0) 4294967296)) (not (<= (+ main_~x~0 v_it_23 1) main_~n~0)))) (< 0 (mod main_~n~0 4294967296)) (= main_~y~0 (+ main_~n~0 (* (- 1) main_~x~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; {11798#(and (not (< 0 (mod (+ main_~x~0 4294967295) 4294967296))) (= main_~y~0 (+ main_~z~0 1)) (or (and (= main_~y~0 0) (= (+ (- 1) main_~x~0) main_~n~0)) (and (< main_~x~0 (+ main_~n~0 1)) (forall ((v_it_23 Int)) (or (not (<= (+ main_~x~0 v_it_23) main_~n~0)) (not (<= 1 v_it_23)) (< 0 (mod (+ (* 4294967295 v_it_23) main_~n~0) 4294967296)))) (< 0 (mod main_~n~0 4294967296)) (= (+ main_~n~0 (* (- 1) main_~x~0) 1) main_~y~0))))} is VALID [2022-04-28 03:49:54,193 INFO L290 TraceCheckUtils]: 10: Hoare triple {11798#(and (not (< 0 (mod (+ main_~x~0 4294967295) 4294967296))) (= main_~y~0 (+ main_~z~0 1)) (or (and (= main_~y~0 0) (= (+ (- 1) main_~x~0) main_~n~0)) (and (< main_~x~0 (+ main_~n~0 1)) (forall ((v_it_23 Int)) (or (not (<= (+ main_~x~0 v_it_23) main_~n~0)) (not (<= 1 v_it_23)) (< 0 (mod (+ (* 4294967295 v_it_23) main_~n~0) 4294967296)))) (< 0 (mod main_~n~0 4294967296)) (= (+ main_~n~0 (* (- 1) main_~x~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; {11802#(and (or (and (forall ((v_it_23 Int)) (or (not (<= 1 v_it_23)) (< 0 (mod (+ (* 4294967295 v_it_23) main_~n~0) 4294967296)) (not (<= (+ main_~x~0 v_it_23) (+ main_~n~0 1))))) (< main_~x~0 (+ main_~n~0 2)) (= main_~y~0 (+ main_~n~0 2 (* (- 1) main_~x~0))) (< 0 (mod main_~n~0 4294967296))) (and (= main_~n~0 (+ (- 2) main_~x~0)) (= main_~y~0 0))) (not (< 0 (mod (+ main_~x~0 4294967294) 4294967296))) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)))} is VALID [2022-04-28 03:49:54,196 INFO L290 TraceCheckUtils]: 11: Hoare triple {11802#(and (or (and (forall ((v_it_23 Int)) (or (not (<= 1 v_it_23)) (< 0 (mod (+ (* 4294967295 v_it_23) main_~n~0) 4294967296)) (not (<= (+ main_~x~0 v_it_23) (+ main_~n~0 1))))) (< main_~x~0 (+ main_~n~0 2)) (= main_~y~0 (+ main_~n~0 2 (* (- 1) main_~x~0))) (< 0 (mod main_~n~0 4294967296))) (and (= main_~n~0 (+ (- 2) main_~x~0)) (= main_~y~0 0))) (not (< 0 (mod (+ main_~x~0 4294967294) 4294967296))) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (= (+ 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; {11806#(and (= (+ main_~z~0 2) (+ (- 1) main_~y~0)) (not (< 0 (mod (+ main_~x~0 4294967293) 4294967296))) (or (and (= (+ main_~x~0 (- 3)) main_~n~0) (= main_~y~0 0)) (and (= main_~y~0 (+ main_~n~0 3 (* (- 1) main_~x~0))) (< main_~x~0 (+ main_~n~0 3)) (forall ((v_it_23 Int)) (or (not (<= 1 v_it_23)) (< 0 (mod (+ (* 4294967295 v_it_23) main_~n~0) 4294967296)) (not (<= (+ main_~x~0 v_it_23) (+ main_~n~0 2))))) (< 0 (mod main_~n~0 4294967296)))) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 03:49:54,239 INFO L290 TraceCheckUtils]: 12: Hoare triple {11806#(and (= (+ main_~z~0 2) (+ (- 1) main_~y~0)) (not (< 0 (mod (+ main_~x~0 4294967293) 4294967296))) (or (and (= (+ main_~x~0 (- 3)) main_~n~0) (= main_~y~0 0)) (and (= main_~y~0 (+ main_~n~0 3 (* (- 1) main_~x~0))) (< main_~x~0 (+ main_~n~0 3)) (forall ((v_it_23 Int)) (or (not (<= 1 v_it_23)) (< 0 (mod (+ (* 4294967295 v_it_23) main_~n~0) 4294967296)) (not (<= (+ main_~x~0 v_it_23) (+ main_~n~0 2))))) (< 0 (mod main_~n~0 4294967296)))) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {11810#(and (= main_~y~0 (+ main_~n~0 3 (* (- 1) main_~x~0))) (<= (mod (+ main_~y~0 4294967293) 4294967296) 0) (< main_~x~0 (+ main_~n~0 3)) (<= (mod (+ main_~x~0 4294967293) 4294967296) 0) (forall ((v_it_23 Int)) (or (not (<= 1 v_it_23)) (< 0 (mod (+ (* 4294967295 v_it_23) main_~n~0) 4294967296)) (not (<= (+ main_~x~0 v_it_23) (+ main_~n~0 2))))))} is VALID [2022-04-28 03:49:54,241 INFO L290 TraceCheckUtils]: 13: Hoare triple {11810#(and (= main_~y~0 (+ main_~n~0 3 (* (- 1) main_~x~0))) (<= (mod (+ main_~y~0 4294967293) 4294967296) 0) (< main_~x~0 (+ main_~n~0 3)) (<= (mod (+ main_~x~0 4294967293) 4294967296) 0) (forall ((v_it_23 Int)) (or (not (<= 1 v_it_23)) (< 0 (mod (+ (* 4294967295 v_it_23) main_~n~0) 4294967296)) (not (<= (+ main_~x~0 v_it_23) (+ main_~n~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; {11814#(and (= (+ main_~y~0 1) (+ main_~n~0 3 (* (- 1) main_~x~0))) (< main_~x~0 (+ main_~n~0 3)) (<= (mod (+ main_~x~0 4294967293) 4294967296) 0) (forall ((v_it_23 Int)) (or (not (<= 1 v_it_23)) (< 0 (mod (+ (* 4294967295 v_it_23) main_~n~0) 4294967296)) (not (<= (+ main_~x~0 v_it_23) (+ main_~n~0 2))))) (<= (mod (+ main_~y~0 4294967294) 4294967296) 0))} is VALID [2022-04-28 03:49:54,253 INFO L290 TraceCheckUtils]: 14: Hoare triple {11814#(and (= (+ main_~y~0 1) (+ main_~n~0 3 (* (- 1) main_~x~0))) (< main_~x~0 (+ main_~n~0 3)) (<= (mod (+ main_~x~0 4294967293) 4294967296) 0) (forall ((v_it_23 Int)) (or (not (<= 1 v_it_23)) (< 0 (mod (+ (* 4294967295 v_it_23) main_~n~0) 4294967296)) (not (<= (+ main_~x~0 v_it_23) (+ main_~n~0 2))))) (<= (mod (+ main_~y~0 4294967294) 4294967296) 0))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {11818#(and (< main_~x~0 (+ main_~n~0 3)) (<= (mod (+ main_~n~0 (* main_~x~0 4294967295)) 4294967296) 0) (<= (mod (+ main_~x~0 4294967293) 4294967296) 0) (= (+ main_~y~0 1) (+ main_~n~0 2 (* (- 1) main_~x~0))) (forall ((v_it_23 Int)) (or (not (<= 1 v_it_23)) (< 0 (mod (+ (* 4294967295 v_it_23) main_~n~0) 4294967296)) (not (<= (+ main_~x~0 v_it_23) (+ main_~n~0 2))))))} is VALID [2022-04-28 03:49:54,256 INFO L290 TraceCheckUtils]: 15: Hoare triple {11818#(and (< main_~x~0 (+ main_~n~0 3)) (<= (mod (+ main_~n~0 (* main_~x~0 4294967295)) 4294967296) 0) (<= (mod (+ main_~x~0 4294967293) 4294967296) 0) (= (+ main_~y~0 1) (+ main_~n~0 2 (* (- 1) main_~x~0))) (forall ((v_it_23 Int)) (or (not (<= 1 v_it_23)) (< 0 (mod (+ (* 4294967295 v_it_23) main_~n~0) 4294967296)) (not (<= (+ main_~x~0 v_it_23) (+ main_~n~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; {11822#(and (< main_~x~0 (+ main_~n~0 3)) (<= (mod (+ main_~n~0 (* main_~x~0 4294967295)) 4294967296) 0) (<= (mod (+ main_~x~0 4294967293) 4294967296) 0) (= (+ main_~n~0 (* (- 1) main_~x~0) 1) (+ main_~y~0 1)) (forall ((v_it_23 Int)) (or (not (<= 1 v_it_23)) (< 0 (mod (+ (* 4294967295 v_it_23) main_~n~0) 4294967296)) (not (<= (+ main_~x~0 v_it_23) (+ main_~n~0 2))))))} is VALID [2022-04-28 03:49:54,256 INFO L290 TraceCheckUtils]: 16: Hoare triple {11822#(and (< main_~x~0 (+ main_~n~0 3)) (<= (mod (+ main_~n~0 (* main_~x~0 4294967295)) 4294967296) 0) (<= (mod (+ main_~x~0 4294967293) 4294967296) 0) (= (+ main_~n~0 (* (- 1) main_~x~0) 1) (+ main_~y~0 1)) (forall ((v_it_23 Int)) (or (not (<= 1 v_it_23)) (< 0 (mod (+ (* 4294967295 v_it_23) main_~n~0) 4294967296)) (not (<= (+ main_~x~0 v_it_23) (+ main_~n~0 2))))))} assume !(~y~0 % 4294967296 > 0); {11826#(and (< main_~x~0 (+ main_~n~0 3)) (<= (mod (+ main_~n~0 (* main_~x~0 4294967295)) 4294967296) 0) (<= (mod (+ main_~x~0 4294967293) 4294967296) 0) (forall ((v_it_23 Int)) (or (not (<= 1 v_it_23)) (< 0 (mod (+ (* 4294967295 v_it_23) main_~n~0) 4294967296)) (not (<= (+ main_~x~0 v_it_23) (+ main_~n~0 2))))))} is VALID [2022-04-28 03:49:54,307 INFO L290 TraceCheckUtils]: 17: Hoare triple {11826#(and (< main_~x~0 (+ main_~n~0 3)) (<= (mod (+ main_~n~0 (* main_~x~0 4294967295)) 4294967296) 0) (<= (mod (+ main_~x~0 4294967293) 4294967296) 0) (forall ((v_it_23 Int)) (or (not (<= 1 v_it_23)) (< 0 (mod (+ (* 4294967295 v_it_23) main_~n~0) 4294967296)) (not (<= (+ main_~x~0 v_it_23) (+ main_~n~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; {11830#(and (forall ((v_it_23 Int)) (or (not (<= 1 v_it_23)) (< 0 (mod (+ (* 4294967295 v_it_23) main_~n~0) 4294967296)) (not (<= (+ main_~x~0 v_it_23) (+ main_~n~0 1))))) (<= (mod (+ main_~n~0 4294967295 (* main_~x~0 4294967295)) 4294967296) 0) (<= (mod (+ main_~x~0 4294967294) 4294967296) 0) (< main_~x~0 (+ main_~n~0 2)))} is VALID [2022-04-28 03:49:54,312 INFO L290 TraceCheckUtils]: 18: Hoare triple {11830#(and (forall ((v_it_23 Int)) (or (not (<= 1 v_it_23)) (< 0 (mod (+ (* 4294967295 v_it_23) main_~n~0) 4294967296)) (not (<= (+ main_~x~0 v_it_23) (+ main_~n~0 1))))) (<= (mod (+ main_~n~0 4294967295 (* main_~x~0 4294967295)) 4294967296) 0) (<= (mod (+ main_~x~0 4294967294) 4294967296) 0) (< main_~x~0 (+ main_~n~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; {11834#(and (< main_~x~0 (+ main_~n~0 1)) (forall ((v_it_23 Int)) (or (not (<= (+ main_~x~0 v_it_23) main_~n~0)) (not (<= 1 v_it_23)) (< 0 (mod (+ (* 4294967295 v_it_23) main_~n~0) 4294967296)))) (<= (mod (+ main_~x~0 4294967295) 4294967296) 0) (<= (mod (+ main_~n~0 4294967294 (* main_~x~0 4294967295)) 4294967296) 0))} is VALID [2022-04-28 03:49:54,322 INFO L290 TraceCheckUtils]: 19: Hoare triple {11834#(and (< main_~x~0 (+ main_~n~0 1)) (forall ((v_it_23 Int)) (or (not (<= (+ main_~x~0 v_it_23) main_~n~0)) (not (<= 1 v_it_23)) (< 0 (mod (+ (* 4294967295 v_it_23) main_~n~0) 4294967296)))) (<= (mod (+ main_~x~0 4294967295) 4294967296) 0) (<= (mod (+ main_~n~0 4294967294 (* main_~x~0 4294967295)) 4294967296) 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; {11838#(and (< main_~x~0 main_~n~0) (<= (mod main_~x~0 4294967296) 0) (forall ((v_it_23 Int)) (or (not (<= 1 v_it_23)) (< 0 (mod (+ (* 4294967295 v_it_23) main_~n~0) 4294967296)) (not (<= (+ main_~x~0 v_it_23 1) main_~n~0)))) (<= (mod (+ main_~n~0 (* main_~x~0 4294967295) 4294967293) 4294967296) 0))} is VALID [2022-04-28 03:49:54,323 INFO L290 TraceCheckUtils]: 20: Hoare triple {11838#(and (< main_~x~0 main_~n~0) (<= (mod main_~x~0 4294967296) 0) (forall ((v_it_23 Int)) (or (not (<= 1 v_it_23)) (< 0 (mod (+ (* 4294967295 v_it_23) main_~n~0) 4294967296)) (not (<= (+ main_~x~0 v_it_23 1) main_~n~0)))) (<= (mod (+ main_~n~0 (* main_~x~0 4294967295) 4294967293) 4294967296) 0))} assume !(~x~0 % 4294967296 > 0); {11838#(and (< main_~x~0 main_~n~0) (<= (mod main_~x~0 4294967296) 0) (forall ((v_it_23 Int)) (or (not (<= 1 v_it_23)) (< 0 (mod (+ (* 4294967295 v_it_23) main_~n~0) 4294967296)) (not (<= (+ main_~x~0 v_it_23 1) main_~n~0)))) (<= (mod (+ main_~n~0 (* main_~x~0 4294967295) 4294967293) 4294967296) 0))} is VALID [2022-04-28 03:49:54,329 INFO L290 TraceCheckUtils]: 21: Hoare triple {11838#(and (< main_~x~0 main_~n~0) (<= (mod main_~x~0 4294967296) 0) (forall ((v_it_23 Int)) (or (not (<= 1 v_it_23)) (< 0 (mod (+ (* 4294967295 v_it_23) main_~n~0) 4294967296)) (not (<= (+ main_~x~0 v_it_23 1) main_~n~0)))) (<= (mod (+ main_~n~0 (* main_~x~0 4294967295) 4294967293) 4294967296) 0))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {11834#(and (< main_~x~0 (+ main_~n~0 1)) (forall ((v_it_23 Int)) (or (not (<= (+ main_~x~0 v_it_23) main_~n~0)) (not (<= 1 v_it_23)) (< 0 (mod (+ (* 4294967295 v_it_23) main_~n~0) 4294967296)))) (<= (mod (+ main_~x~0 4294967295) 4294967296) 0) (<= (mod (+ main_~n~0 4294967294 (* main_~x~0 4294967295)) 4294967296) 0))} is VALID [2022-04-28 03:49:54,333 INFO L290 TraceCheckUtils]: 22: Hoare triple {11834#(and (< main_~x~0 (+ main_~n~0 1)) (forall ((v_it_23 Int)) (or (not (<= (+ main_~x~0 v_it_23) main_~n~0)) (not (<= 1 v_it_23)) (< 0 (mod (+ (* 4294967295 v_it_23) main_~n~0) 4294967296)))) (<= (mod (+ main_~x~0 4294967295) 4294967296) 0) (<= (mod (+ main_~n~0 4294967294 (* main_~x~0 4294967295)) 4294967296) 0))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {11830#(and (forall ((v_it_23 Int)) (or (not (<= 1 v_it_23)) (< 0 (mod (+ (* 4294967295 v_it_23) main_~n~0) 4294967296)) (not (<= (+ main_~x~0 v_it_23) (+ main_~n~0 1))))) (<= (mod (+ main_~n~0 4294967295 (* main_~x~0 4294967295)) 4294967296) 0) (<= (mod (+ main_~x~0 4294967294) 4294967296) 0) (< main_~x~0 (+ main_~n~0 2)))} is VALID [2022-04-28 03:49:54,364 INFO L290 TraceCheckUtils]: 23: Hoare triple {11830#(and (forall ((v_it_23 Int)) (or (not (<= 1 v_it_23)) (< 0 (mod (+ (* 4294967295 v_it_23) main_~n~0) 4294967296)) (not (<= (+ main_~x~0 v_it_23) (+ main_~n~0 1))))) (<= (mod (+ main_~n~0 4294967295 (* main_~x~0 4294967295)) 4294967296) 0) (<= (mod (+ main_~x~0 4294967294) 4294967296) 0) (< main_~x~0 (+ main_~n~0 2)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {11826#(and (< main_~x~0 (+ main_~n~0 3)) (<= (mod (+ main_~n~0 (* main_~x~0 4294967295)) 4294967296) 0) (<= (mod (+ main_~x~0 4294967293) 4294967296) 0) (forall ((v_it_23 Int)) (or (not (<= 1 v_it_23)) (< 0 (mod (+ (* 4294967295 v_it_23) main_~n~0) 4294967296)) (not (<= (+ main_~x~0 v_it_23) (+ main_~n~0 2))))))} is VALID [2022-04-28 03:49:54,365 INFO L290 TraceCheckUtils]: 24: Hoare triple {11826#(and (< main_~x~0 (+ main_~n~0 3)) (<= (mod (+ main_~n~0 (* main_~x~0 4294967295)) 4294967296) 0) (<= (mod (+ main_~x~0 4294967293) 4294967296) 0) (forall ((v_it_23 Int)) (or (not (<= 1 v_it_23)) (< 0 (mod (+ (* 4294967295 v_it_23) main_~n~0) 4294967296)) (not (<= (+ main_~x~0 v_it_23) (+ main_~n~0 2))))))} assume !(~z~0 % 4294967296 > 0); {11826#(and (< main_~x~0 (+ main_~n~0 3)) (<= (mod (+ main_~n~0 (* main_~x~0 4294967295)) 4294967296) 0) (<= (mod (+ main_~x~0 4294967293) 4294967296) 0) (forall ((v_it_23 Int)) (or (not (<= 1 v_it_23)) (< 0 (mod (+ (* 4294967295 v_it_23) main_~n~0) 4294967296)) (not (<= (+ main_~x~0 v_it_23) (+ main_~n~0 2))))))} is VALID [2022-04-28 03:49:54,371 INFO L272 TraceCheckUtils]: 25: Hoare triple {11826#(and (< main_~x~0 (+ main_~n~0 3)) (<= (mod (+ main_~n~0 (* main_~x~0 4294967295)) 4294967296) 0) (<= (mod (+ main_~x~0 4294967293) 4294967296) 0) (forall ((v_it_23 Int)) (or (not (<= 1 v_it_23)) (< 0 (mod (+ (* 4294967295 v_it_23) main_~n~0) 4294967296)) (not (<= (+ main_~x~0 v_it_23) (+ main_~n~0 2))))))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {11857#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:49:54,371 INFO L290 TraceCheckUtils]: 26: Hoare triple {11857#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {11861#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:49:54,372 INFO L290 TraceCheckUtils]: 27: Hoare triple {11861#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {11744#false} is VALID [2022-04-28 03:49:54,372 INFO L290 TraceCheckUtils]: 28: Hoare triple {11744#false} assume !false; {11744#false} is VALID [2022-04-28 03:49:54,372 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:49:54,372 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:51:40,301 WARN L232 SmtUtils]: Spent 17.04s on a formula simplification that was a NOOP. DAG size: 85 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-28 03:51:41,846 INFO L290 TraceCheckUtils]: 28: Hoare triple {11744#false} assume !false; {11744#false} is VALID [2022-04-28 03:51:41,847 INFO L290 TraceCheckUtils]: 27: Hoare triple {11861#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {11744#false} is VALID [2022-04-28 03:51:41,847 INFO L290 TraceCheckUtils]: 26: Hoare triple {11857#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {11861#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:51:41,848 INFO L272 TraceCheckUtils]: 25: Hoare triple {11761#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {11857#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:51:41,849 INFO L290 TraceCheckUtils]: 24: Hoare triple {11761#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !(~z~0 % 4294967296 > 0); {11761#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-28 03:51:41,850 INFO L290 TraceCheckUtils]: 23: Hoare triple {11883#(and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {11761#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-28 03:51:41,851 INFO L290 TraceCheckUtils]: 22: Hoare triple {11887#(and (<= (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {11883#(and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296))))} is VALID [2022-04-28 03:51:41,852 INFO L290 TraceCheckUtils]: 21: Hoare triple {11891#(and (< (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0)))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {11887#(and (<= (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-28 03:51:41,852 INFO L290 TraceCheckUtils]: 20: Hoare triple {11895#(or (and (< (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0))) (< 0 (mod main_~x~0 4294967296)))} assume !(~x~0 % 4294967296 > 0); {11891#(and (< (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0)))} is VALID [2022-04-28 03:51:41,854 INFO L290 TraceCheckUtils]: 19: Hoare triple {11899#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (<= (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) (+ main_~x~0 3 (* (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; {11895#(or (and (< (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0))) (< 0 (mod main_~x~0 4294967296)))} is VALID [2022-04-28 03:51:41,857 INFO L290 TraceCheckUtils]: 18: Hoare triple {11903#(or (< 0 (mod (+ main_~x~0 4294967294) 4294967296)) (and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 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; {11899#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (<= (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296)))))} is VALID [2022-04-28 03:51:41,861 INFO L290 TraceCheckUtils]: 17: Hoare triple {11907#(or (and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1))) (< 0 (mod (+ main_~x~0 4294967293) 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; {11903#(or (< 0 (mod (+ main_~x~0 4294967294) 4294967296)) (and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)))))} is VALID [2022-04-28 03:51:41,861 INFO L290 TraceCheckUtils]: 16: Hoare triple {11911#(or (and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1))) (< 0 (mod (+ main_~x~0 4294967293) 4294967296)) (< 0 (mod main_~y~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {11907#(or (and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1))) (< 0 (mod (+ main_~x~0 4294967293) 4294967296)))} is VALID [2022-04-28 03:51:41,863 INFO L290 TraceCheckUtils]: 15: Hoare triple {11915#(or (and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1))) (< 0 (mod (+ main_~x~0 4294967293) 4294967296)) (< 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; {11911#(or (and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1))) (< 0 (mod (+ main_~x~0 4294967293) 4294967296)) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 03:51:41,864 INFO L290 TraceCheckUtils]: 14: Hoare triple {11919#(or (and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1))) (< 0 (mod (+ main_~x~0 4294967293) 4294967296)) (< 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; {11915#(or (and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1))) (< 0 (mod (+ main_~x~0 4294967293) 4294967296)) (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 03:51:41,865 INFO L290 TraceCheckUtils]: 13: Hoare triple {11923#(or (and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1))) (< 0 (mod (+ main_~x~0 4294967293) 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; {11919#(or (and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1))) (< 0 (mod (+ main_~x~0 4294967293) 4294967296)) (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-28 03:51:41,866 INFO L290 TraceCheckUtils]: 12: Hoare triple {11927#(or (and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1))) (< 0 (mod (+ main_~x~0 4294967293) 4294967296)) (< 0 (mod main_~z~0 4294967296)) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {11923#(or (and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1))) (< 0 (mod (+ main_~x~0 4294967293) 4294967296)) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-28 03:51:41,869 INFO L290 TraceCheckUtils]: 11: Hoare triple {11931#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)) (and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 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; {11927#(or (and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1))) (< 0 (mod (+ main_~x~0 4294967293) 4294967296)) (< 0 (mod main_~z~0 4294967296)) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-28 03:51:41,872 INFO L290 TraceCheckUtils]: 10: Hoare triple {11935#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (and (<= (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) (+ main_~x~0 3 (* (div main_~n~0 4294967296) 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; {11931#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)) (and (< (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296)))))} is VALID [2022-04-28 03:51:41,875 INFO L290 TraceCheckUtils]: 9: Hoare triple {11939#(or (and (< (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0))) (< 0 (mod main_~x~0 4294967296)) (< 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; {11935#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (and (<= (+ main_~x~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296)) (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296)))) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-28 03:51:41,875 INFO L290 TraceCheckUtils]: 8: Hoare triple {11943#(or (and (< (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0))) (< 0 (mod main_~x~0 4294967296)) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} ~z~0 := ~y~0; {11939#(or (and (< (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0))) (< 0 (mod main_~x~0 4294967296)) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-28 03:51:41,876 INFO L290 TraceCheckUtils]: 7: Hoare triple {11943#(or (and (< (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0))) (< 0 (mod main_~x~0 4294967296)) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} [130] 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[] {11943#(or (and (< (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0))) (< 0 (mod main_~x~0 4294967296)) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-28 03:51:43,909 WARN L290 TraceCheckUtils]: 6: Hoare triple {11950#(and (or (and (< (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0))) (< (div (+ (* (- 1) main_~y~0) (- 4294967294)) (- 4294967296)) (+ (div (+ 4294967292 main_~y~0) 4294967296) 2)) (< (div (+ (- 1) (* (- 1) main_~x~0)) (- 4294967296)) (+ 2 (div (+ (- 1) main_~x~0) 4294967296)))) (or (and (forall ((aux_div_v_main_~y~0_280_47 Int) (aux_mod_aux_mod_v_main_~x~0_300_32_91 Int) (aux_div_aux_mod_v_main_~x~0_300_32_91 Int) (aux_div_v_main_~x~0_300_32 Int)) (or (> 0 aux_mod_aux_mod_v_main_~x~0_300_32_91) (< (+ (* aux_div_aux_mod_v_main_~x~0_300_32_91 4294967296) (* 4294967296 aux_div_v_main_~y~0_280_47) aux_mod_aux_mod_v_main_~x~0_300_32_91) (+ main_~y~0 main_~x~0 4294967296)) (< (+ (* aux_div_aux_mod_v_main_~x~0_300_32_91 4294967296) aux_mod_aux_mod_v_main_~x~0_300_32_91) (+ (* 4294967296 aux_div_v_main_~x~0_300_32) 3)) (exists ((v_it_23 Int)) (and (<= 1 v_it_23) (not (< 0 (mod (+ (* 4294967295 v_it_23) main_~x~0) 4294967296))) (<= (+ (* aux_div_aux_mod_v_main_~x~0_300_32_91 4294967296) v_it_23 aux_mod_aux_mod_v_main_~x~0_300_32_91) (+ main_~x~0 2)))) (< (+ main_~y~0 main_~x~0 4294967296) (+ (* aux_div_aux_mod_v_main_~x~0_300_32_91 4294967296) (* 4294967296 aux_div_v_main_~y~0_280_47) aux_mod_aux_mod_v_main_~x~0_300_32_91)) (not (< (+ (* aux_div_aux_mod_v_main_~x~0_300_32_91 4294967296) aux_mod_aux_mod_v_main_~x~0_300_32_91) (+ main_~x~0 3))) (< main_~n~0 (+ (* (div main_~n~0 4294967296) 4294967296) aux_mod_aux_mod_v_main_~x~0_300_32_91 1)) (< (+ (* 4294967296 aux_div_v_main_~x~0_300_32) 3) (+ (* aux_div_aux_mod_v_main_~x~0_300_32_91 4294967296) aux_mod_aux_mod_v_main_~x~0_300_32_91)))) (forall ((aux_div_v_main_~y~0_280_47 Int) (aux_mod_aux_mod_v_main_~x~0_300_32_91 Int) (aux_div_aux_mod_v_main_~x~0_300_32_91 Int) (aux_div_v_main_~x~0_300_32 Int)) (or (< (+ (* aux_div_aux_mod_v_main_~x~0_300_32_91 4294967296) (* 4294967296 aux_div_v_main_~y~0_280_47) aux_mod_aux_mod_v_main_~x~0_300_32_91) (+ main_~y~0 main_~x~0 4294967296)) (<= (+ (* (div main_~n~0 4294967296) 4294967296) aux_mod_aux_mod_v_main_~x~0_300_32_91) main_~n~0) (< (+ (* aux_div_aux_mod_v_main_~x~0_300_32_91 4294967296) aux_mod_aux_mod_v_main_~x~0_300_32_91) (+ (* 4294967296 aux_div_v_main_~x~0_300_32) 3)) (>= aux_mod_aux_mod_v_main_~x~0_300_32_91 4294967296) (exists ((v_it_23 Int)) (and (<= 1 v_it_23) (not (< 0 (mod (+ (* 4294967295 v_it_23) main_~x~0) 4294967296))) (<= (+ (* aux_div_aux_mod_v_main_~x~0_300_32_91 4294967296) v_it_23 aux_mod_aux_mod_v_main_~x~0_300_32_91) (+ main_~x~0 2)))) (< (+ main_~y~0 main_~x~0 4294967296) (+ (* aux_div_aux_mod_v_main_~x~0_300_32_91 4294967296) (* 4294967296 aux_div_v_main_~y~0_280_47) aux_mod_aux_mod_v_main_~x~0_300_32_91)) (not (< (+ (* aux_div_aux_mod_v_main_~x~0_300_32_91 4294967296) aux_mod_aux_mod_v_main_~x~0_300_32_91) (+ main_~x~0 3))) (< (+ (* 4294967296 aux_div_v_main_~x~0_300_32) 3) (+ (* aux_div_aux_mod_v_main_~x~0_300_32_91 4294967296) aux_mod_aux_mod_v_main_~x~0_300_32_91))))) (not (< 0 (mod main_~x~0 4294967296)))))} [131] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_277 4294967296)) (.cse1 (= v_main_~x~0_277 v_main_~x~0_276)) (.cse2 (= |v_main_#t~post5_108| |v_main_#t~post5_107|)) (.cse3 (= |v_main_#t~post6_108| |v_main_#t~post6_107|)) (.cse4 (= v_main_~y~0_266 v_main_~y~0_265))) (or (and (forall ((v_it_23 Int)) (or (not (<= 1 v_it_23)) (< 0 (mod (+ v_main_~x~0_277 (* 4294967295 v_it_23)) 4294967296)) (not (<= (+ v_main_~x~0_276 v_it_23 1) v_main_~x~0_277)))) (< v_main_~x~0_276 v_main_~x~0_277) (= v_main_~y~0_265 (+ v_main_~x~0_277 v_main_~y~0_266 (* v_main_~x~0_276 (- 1)))) (< 0 .cse0)) (and .cse1 .cse2 (<= .cse0 0) .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_266, main_#t~post5=|v_main_#t~post5_108|, main_~x~0=v_main_~x~0_277, main_#t~post6=|v_main_#t~post6_108|} OutVars{main_~y~0=v_main_~y~0_265, main_#t~post5=|v_main_#t~post5_107|, main_~x~0=v_main_~x~0_276, main_#t~post6=|v_main_#t~post6_107|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {11943#(or (and (< (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0))) (< 0 (mod main_~x~0 4294967296)) (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is UNKNOWN [2022-04-28 03:51:43,918 INFO L290 TraceCheckUtils]: 5: Hoare triple {11743#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {11950#(and (or (and (< (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4)) (<= (+ main_~x~0 3 (* (div main_~n~0 4294967296) 4294967296)) (+ (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~n~0))) (< (div (+ (* (- 1) main_~y~0) (- 4294967294)) (- 4294967296)) (+ (div (+ 4294967292 main_~y~0) 4294967296) 2)) (< (div (+ (- 1) (* (- 1) main_~x~0)) (- 4294967296)) (+ 2 (div (+ (- 1) main_~x~0) 4294967296)))) (or (and (forall ((aux_div_v_main_~y~0_280_47 Int) (aux_mod_aux_mod_v_main_~x~0_300_32_91 Int) (aux_div_aux_mod_v_main_~x~0_300_32_91 Int) (aux_div_v_main_~x~0_300_32 Int)) (or (> 0 aux_mod_aux_mod_v_main_~x~0_300_32_91) (< (+ (* aux_div_aux_mod_v_main_~x~0_300_32_91 4294967296) (* 4294967296 aux_div_v_main_~y~0_280_47) aux_mod_aux_mod_v_main_~x~0_300_32_91) (+ main_~y~0 main_~x~0 4294967296)) (< (+ (* aux_div_aux_mod_v_main_~x~0_300_32_91 4294967296) aux_mod_aux_mod_v_main_~x~0_300_32_91) (+ (* 4294967296 aux_div_v_main_~x~0_300_32) 3)) (exists ((v_it_23 Int)) (and (<= 1 v_it_23) (not (< 0 (mod (+ (* 4294967295 v_it_23) main_~x~0) 4294967296))) (<= (+ (* aux_div_aux_mod_v_main_~x~0_300_32_91 4294967296) v_it_23 aux_mod_aux_mod_v_main_~x~0_300_32_91) (+ main_~x~0 2)))) (< (+ main_~y~0 main_~x~0 4294967296) (+ (* aux_div_aux_mod_v_main_~x~0_300_32_91 4294967296) (* 4294967296 aux_div_v_main_~y~0_280_47) aux_mod_aux_mod_v_main_~x~0_300_32_91)) (not (< (+ (* aux_div_aux_mod_v_main_~x~0_300_32_91 4294967296) aux_mod_aux_mod_v_main_~x~0_300_32_91) (+ main_~x~0 3))) (< main_~n~0 (+ (* (div main_~n~0 4294967296) 4294967296) aux_mod_aux_mod_v_main_~x~0_300_32_91 1)) (< (+ (* 4294967296 aux_div_v_main_~x~0_300_32) 3) (+ (* aux_div_aux_mod_v_main_~x~0_300_32_91 4294967296) aux_mod_aux_mod_v_main_~x~0_300_32_91)))) (forall ((aux_div_v_main_~y~0_280_47 Int) (aux_mod_aux_mod_v_main_~x~0_300_32_91 Int) (aux_div_aux_mod_v_main_~x~0_300_32_91 Int) (aux_div_v_main_~x~0_300_32 Int)) (or (< (+ (* aux_div_aux_mod_v_main_~x~0_300_32_91 4294967296) (* 4294967296 aux_div_v_main_~y~0_280_47) aux_mod_aux_mod_v_main_~x~0_300_32_91) (+ main_~y~0 main_~x~0 4294967296)) (<= (+ (* (div main_~n~0 4294967296) 4294967296) aux_mod_aux_mod_v_main_~x~0_300_32_91) main_~n~0) (< (+ (* aux_div_aux_mod_v_main_~x~0_300_32_91 4294967296) aux_mod_aux_mod_v_main_~x~0_300_32_91) (+ (* 4294967296 aux_div_v_main_~x~0_300_32) 3)) (>= aux_mod_aux_mod_v_main_~x~0_300_32_91 4294967296) (exists ((v_it_23 Int)) (and (<= 1 v_it_23) (not (< 0 (mod (+ (* 4294967295 v_it_23) main_~x~0) 4294967296))) (<= (+ (* aux_div_aux_mod_v_main_~x~0_300_32_91 4294967296) v_it_23 aux_mod_aux_mod_v_main_~x~0_300_32_91) (+ main_~x~0 2)))) (< (+ main_~y~0 main_~x~0 4294967296) (+ (* aux_div_aux_mod_v_main_~x~0_300_32_91 4294967296) (* 4294967296 aux_div_v_main_~y~0_280_47) aux_mod_aux_mod_v_main_~x~0_300_32_91)) (not (< (+ (* aux_div_aux_mod_v_main_~x~0_300_32_91 4294967296) aux_mod_aux_mod_v_main_~x~0_300_32_91) (+ main_~x~0 3))) (< (+ (* 4294967296 aux_div_v_main_~x~0_300_32) 3) (+ (* aux_div_aux_mod_v_main_~x~0_300_32_91 4294967296) aux_mod_aux_mod_v_main_~x~0_300_32_91))))) (not (< 0 (mod main_~x~0 4294967296)))))} is VALID [2022-04-28 03:51:43,918 INFO L272 TraceCheckUtils]: 4: Hoare triple {11743#true} call #t~ret15 := main(); {11743#true} is VALID [2022-04-28 03:51:43,918 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11743#true} {11743#true} #83#return; {11743#true} is VALID [2022-04-28 03:51:43,918 INFO L290 TraceCheckUtils]: 2: Hoare triple {11743#true} assume true; {11743#true} is VALID [2022-04-28 03:51:43,918 INFO L290 TraceCheckUtils]: 1: Hoare triple {11743#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {11743#true} is VALID [2022-04-28 03:51:43,918 INFO L272 TraceCheckUtils]: 0: Hoare triple {11743#true} call ULTIMATE.init(); {11743#true} is VALID [2022-04-28 03:51:43,919 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:51:43,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [280989105] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:51:43,919 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:51:43,919 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 22] total 52 [2022-04-28 03:52:07,464 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:52:07,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1262410296] [2022-04-28 03:52:07,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1262410296] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:52:07,464 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:52:07,464 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-28 03:52:07,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014229763] [2022-04-28 03:52:07,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:52:07,465 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 19 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-28 03:52:07,465 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:52:07,465 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 19 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:52:07,528 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:52:07,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-28 03:52:07,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:52:07,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-28 03:52:07,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=473, Invalid=2455, Unknown=42, NotChecked=0, Total=2970 [2022-04-28 03:52:07,529 INFO L87 Difference]: Start difference. First operand 77 states and 98 transitions. Second operand has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 19 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:52:40,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:52:40,012 INFO L93 Difference]: Finished difference Result 90 states and 110 transitions. [2022-04-28 03:52:40,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-28 03:52:40,013 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 19 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-28 03:52:40,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:52:40,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 19 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:52:40,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 46 transitions. [2022-04-28 03:52:40,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 19 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:52:40,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 46 transitions. [2022-04-28 03:52:40,014 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 46 transitions. [2022-04-28 03:52:42,137 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 45 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 03:52:42,138 INFO L225 Difference]: With dead ends: 90 [2022-04-28 03:52:42,138 INFO L226 Difference]: Without dead ends: 73 [2022-04-28 03:52:42,139 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 27 SyntacticMatches, 4 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1541 ImplicationChecksByTransitivity, 189.5s TimeCoverageRelationStatistics Valid=707, Invalid=4351, Unknown=54, NotChecked=0, Total=5112 [2022-04-28 03:52:42,139 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 26 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 62 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-28 03:52:42,139 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 89 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 321 Invalid, 0 Unknown, 62 Unchecked, 0.6s Time] [2022-04-28 03:52:42,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-04-28 03:52:42,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2022-04-28 03:52:42,612 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:52:42,612 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand has 73 states, 68 states have (on average 1.3088235294117647) internal successors, (89), 68 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:52:42,612 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand has 73 states, 68 states have (on average 1.3088235294117647) internal successors, (89), 68 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:52:42,612 INFO L87 Difference]: Start difference. First operand 73 states. Second operand has 73 states, 68 states have (on average 1.3088235294117647) internal successors, (89), 68 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:52:42,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:52:42,628 INFO L93 Difference]: Finished difference Result 73 states and 93 transitions. [2022-04-28 03:52:42,628 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 93 transitions. [2022-04-28 03:52:42,628 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:52:42,628 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:52:42,628 INFO L74 IsIncluded]: Start isIncluded. First operand has 73 states, 68 states have (on average 1.3088235294117647) internal successors, (89), 68 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 73 states. [2022-04-28 03:52:42,628 INFO L87 Difference]: Start difference. First operand has 73 states, 68 states have (on average 1.3088235294117647) internal successors, (89), 68 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 73 states. [2022-04-28 03:52:42,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:52:42,629 INFO L93 Difference]: Finished difference Result 73 states and 93 transitions. [2022-04-28 03:52:42,629 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 93 transitions. [2022-04-28 03:52:42,629 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:52:42,629 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:52:42,629 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:52:42,629 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:52:42,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 68 states have (on average 1.3088235294117647) internal successors, (89), 68 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:52:42,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 93 transitions. [2022-04-28 03:52:42,630 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 93 transitions. Word has length 31 [2022-04-28 03:52:42,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:52:42,630 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 93 transitions. [2022-04-28 03:52:42,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 19 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:52:42,631 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 73 states and 93 transitions. [2022-04-28 03:52:51,412 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 90 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-28 03:52:51,412 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 93 transitions. [2022-04-28 03:52:51,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-28 03:52:51,412 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:52:51,412 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:52:51,417 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:52:51,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:52:51,613 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:52:51,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:52:51,613 INFO L85 PathProgramCache]: Analyzing trace with hash -58457440, now seen corresponding path program 11 times [2022-04-28 03:52:51,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:52:51,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [928663597] [2022-04-28 03:52:51,760 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:52:51,761 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:52:51,763 INFO L85 PathProgramCache]: Analyzing trace with hash -1637174369, now seen corresponding path program 1 times [2022-04-28 03:52:51,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:52:51,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362055697] [2022-04-28 03:52:51,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:52:51,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:52:51,778 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:52:51,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:52:51,788 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_24.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:52:51,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:52:51,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:52:51,882 INFO L290 TraceCheckUtils]: 0: Hoare triple {12492#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {12480#true} is VALID [2022-04-28 03:52:51,882 INFO L290 TraceCheckUtils]: 1: Hoare triple {12480#true} assume true; {12480#true} is VALID [2022-04-28 03:52:51,882 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12480#true} {12480#true} #83#return; {12480#true} is VALID [2022-04-28 03:52:51,883 INFO L272 TraceCheckUtils]: 0: Hoare triple {12480#true} call ULTIMATE.init(); {12492#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:52:51,883 INFO L290 TraceCheckUtils]: 1: Hoare triple {12492#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {12480#true} is VALID [2022-04-28 03:52:51,883 INFO L290 TraceCheckUtils]: 2: Hoare triple {12480#true} assume true; {12480#true} is VALID [2022-04-28 03:52:51,883 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12480#true} {12480#true} #83#return; {12480#true} is VALID [2022-04-28 03:52:51,883 INFO L272 TraceCheckUtils]: 4: Hoare triple {12480#true} call #t~ret15 := main(); {12480#true} is VALID [2022-04-28 03:52:51,883 INFO L290 TraceCheckUtils]: 5: Hoare triple {12480#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {12480#true} is VALID [2022-04-28 03:52:51,883 INFO L290 TraceCheckUtils]: 6: Hoare triple {12480#true} [133] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_287 v_main_~y~0_286)) (.cse1 (= v_main_~x~0_307 v_main_~x~0_306)) (.cse2 (= |v_main_#t~post6_115| |v_main_#t~post6_114|)) (.cse3 (= |v_main_#t~post5_115| |v_main_#t~post5_114|)) (.cse4 (mod v_main_~x~0_307 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3 (<= .cse4 0)) (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)))) (= v_main_~y~0_286 (+ (* v_main_~x~0_306 (- 1)) v_main_~x~0_307 v_main_~y~0_287)) (< 0 .cse4) (< v_main_~x~0_306 v_main_~x~0_307)))) InVars {main_~y~0=v_main_~y~0_287, main_#t~post5=|v_main_#t~post5_115|, main_~x~0=v_main_~x~0_307, main_#t~post6=|v_main_#t~post6_115|} OutVars{main_~y~0=v_main_~y~0_286, main_#t~post5=|v_main_#t~post5_114|, main_~x~0=v_main_~x~0_306, main_#t~post6=|v_main_#t~post6_114|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {12480#true} is VALID [2022-04-28 03:52:51,884 INFO L290 TraceCheckUtils]: 7: Hoare triple {12480#true} [132] 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[] {12485#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:52:51,884 INFO L290 TraceCheckUtils]: 8: Hoare triple {12485#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {12485#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:52:51,885 INFO L290 TraceCheckUtils]: 9: Hoare triple {12485#(<= 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; {12486#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:52:51,886 INFO L290 TraceCheckUtils]: 10: Hoare triple {12486#(<= 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; {12487#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:52:51,887 INFO L290 TraceCheckUtils]: 11: Hoare triple {12487#(<= 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; {12488#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:52:51,888 INFO L290 TraceCheckUtils]: 12: Hoare triple {12488#(<= 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; {12489#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:52:51,888 INFO L290 TraceCheckUtils]: 13: Hoare triple {12489#(<= 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; {12490#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 03:52:51,889 INFO L290 TraceCheckUtils]: 14: Hoare triple {12490#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !(~z~0 % 4294967296 > 0); {12490#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 03:52:51,889 INFO L290 TraceCheckUtils]: 15: Hoare triple {12490#(<= 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; {12490#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 03:52:51,890 INFO L290 TraceCheckUtils]: 16: Hoare triple {12490#(<= 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; {12490#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 03:52:51,890 INFO L290 TraceCheckUtils]: 17: Hoare triple {12490#(<= 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; {12490#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 03:52:51,890 INFO L290 TraceCheckUtils]: 18: Hoare triple {12490#(<= 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; {12490#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 03:52:51,891 INFO L290 TraceCheckUtils]: 19: Hoare triple {12490#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} assume !(~y~0 % 4294967296 > 0); {12490#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 03:52:51,892 INFO L290 TraceCheckUtils]: 20: Hoare triple {12490#(<= 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; {12489#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:52:51,893 INFO L290 TraceCheckUtils]: 21: Hoare triple {12489#(<= 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; {12491#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 03:52:51,893 INFO L290 TraceCheckUtils]: 22: Hoare triple {12491#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {12481#false} is VALID [2022-04-28 03:52:51,893 INFO L290 TraceCheckUtils]: 23: Hoare triple {12481#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {12481#false} is VALID [2022-04-28 03:52:51,893 INFO L290 TraceCheckUtils]: 24: Hoare triple {12481#false} assume !(~z~0 % 4294967296 > 0); {12481#false} is VALID [2022-04-28 03:52:51,893 INFO L272 TraceCheckUtils]: 25: Hoare triple {12481#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {12481#false} is VALID [2022-04-28 03:52:51,893 INFO L290 TraceCheckUtils]: 26: Hoare triple {12481#false} ~cond := #in~cond; {12481#false} is VALID [2022-04-28 03:52:51,894 INFO L290 TraceCheckUtils]: 27: Hoare triple {12481#false} assume 0 == ~cond; {12481#false} is VALID [2022-04-28 03:52:51,894 INFO L290 TraceCheckUtils]: 28: Hoare triple {12481#false} assume !false; {12481#false} is VALID [2022-04-28 03:52:51,894 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-28 03:52:51,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:52:51,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362055697] [2022-04-28 03:52:51,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362055697] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:52:51,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [988698322] [2022-04-28 03:52:51,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:52:51,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:52:51,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:52:51,895 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:52:51,895 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:52:51,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:52:51,932 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-28 03:52:51,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:52:51,940 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:52:52,170 INFO L272 TraceCheckUtils]: 0: Hoare triple {12480#true} call ULTIMATE.init(); {12480#true} is VALID [2022-04-28 03:52:52,170 INFO L290 TraceCheckUtils]: 1: Hoare triple {12480#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {12480#true} is VALID [2022-04-28 03:52:52,170 INFO L290 TraceCheckUtils]: 2: Hoare triple {12480#true} assume true; {12480#true} is VALID [2022-04-28 03:52:52,170 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12480#true} {12480#true} #83#return; {12480#true} is VALID [2022-04-28 03:52:52,170 INFO L272 TraceCheckUtils]: 4: Hoare triple {12480#true} call #t~ret15 := main(); {12480#true} is VALID [2022-04-28 03:52:52,170 INFO L290 TraceCheckUtils]: 5: Hoare triple {12480#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {12480#true} is VALID [2022-04-28 03:52:52,170 INFO L290 TraceCheckUtils]: 6: Hoare triple {12480#true} [133] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_287 v_main_~y~0_286)) (.cse1 (= v_main_~x~0_307 v_main_~x~0_306)) (.cse2 (= |v_main_#t~post6_115| |v_main_#t~post6_114|)) (.cse3 (= |v_main_#t~post5_115| |v_main_#t~post5_114|)) (.cse4 (mod v_main_~x~0_307 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3 (<= .cse4 0)) (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)))) (= v_main_~y~0_286 (+ (* v_main_~x~0_306 (- 1)) v_main_~x~0_307 v_main_~y~0_287)) (< 0 .cse4) (< v_main_~x~0_306 v_main_~x~0_307)))) InVars {main_~y~0=v_main_~y~0_287, main_#t~post5=|v_main_#t~post5_115|, main_~x~0=v_main_~x~0_307, main_#t~post6=|v_main_#t~post6_115|} OutVars{main_~y~0=v_main_~y~0_286, main_#t~post5=|v_main_#t~post5_114|, main_~x~0=v_main_~x~0_306, main_#t~post6=|v_main_#t~post6_114|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {12480#true} is VALID [2022-04-28 03:52:52,170 INFO L290 TraceCheckUtils]: 7: Hoare triple {12480#true} [132] 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[] {12480#true} is VALID [2022-04-28 03:52:52,170 INFO L290 TraceCheckUtils]: 8: Hoare triple {12480#true} ~z~0 := ~y~0; {12520#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 03:52:52,171 INFO L290 TraceCheckUtils]: 9: Hoare triple {12520#(= 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; {12524#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-28 03:52:52,172 INFO L290 TraceCheckUtils]: 10: Hoare triple {12524#(= 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; {12528#(= (+ main_~z~0 1) (+ (- 1) main_~y~0))} is VALID [2022-04-28 03:52:52,172 INFO L290 TraceCheckUtils]: 11: Hoare triple {12528#(= (+ 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; {12532#(= (+ (- 2) main_~y~0) (+ main_~z~0 1))} is VALID [2022-04-28 03:52:52,173 INFO L290 TraceCheckUtils]: 12: Hoare triple {12532#(= (+ (- 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; {12536#(= (+ (- 2) main_~y~0) (+ main_~z~0 2))} is VALID [2022-04-28 03:52:52,173 INFO L290 TraceCheckUtils]: 13: Hoare triple {12536#(= (+ (- 2) main_~y~0) (+ main_~z~0 2))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {12540#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-28 03:52:52,174 INFO L290 TraceCheckUtils]: 14: Hoare triple {12540#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !(~z~0 % 4294967296 > 0); {12540#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-28 03:52:52,174 INFO L290 TraceCheckUtils]: 15: Hoare triple {12540#(< 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; {12547#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 03:52:52,175 INFO L290 TraceCheckUtils]: 16: Hoare triple {12547#(< 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; {12551#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 03:52:52,176 INFO L290 TraceCheckUtils]: 17: Hoare triple {12551#(< 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; {12555#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 03:52:52,177 INFO L290 TraceCheckUtils]: 18: Hoare triple {12555#(< 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; {12559#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:52:52,177 INFO L290 TraceCheckUtils]: 19: Hoare triple {12559#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {12481#false} is VALID [2022-04-28 03:52:52,177 INFO L290 TraceCheckUtils]: 20: Hoare triple {12481#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; {12481#false} is VALID [2022-04-28 03:52:52,177 INFO L290 TraceCheckUtils]: 21: Hoare triple {12481#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; {12481#false} is VALID [2022-04-28 03:52:52,177 INFO L290 TraceCheckUtils]: 22: Hoare triple {12481#false} assume !(~x~0 % 4294967296 > 0); {12481#false} is VALID [2022-04-28 03:52:52,177 INFO L290 TraceCheckUtils]: 23: Hoare triple {12481#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {12481#false} is VALID [2022-04-28 03:52:52,177 INFO L290 TraceCheckUtils]: 24: Hoare triple {12481#false} assume !(~z~0 % 4294967296 > 0); {12481#false} is VALID [2022-04-28 03:52:52,177 INFO L272 TraceCheckUtils]: 25: Hoare triple {12481#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {12481#false} is VALID [2022-04-28 03:52:52,177 INFO L290 TraceCheckUtils]: 26: Hoare triple {12481#false} ~cond := #in~cond; {12481#false} is VALID [2022-04-28 03:52:52,178 INFO L290 TraceCheckUtils]: 27: Hoare triple {12481#false} assume 0 == ~cond; {12481#false} is VALID [2022-04-28 03:52:52,178 INFO L290 TraceCheckUtils]: 28: Hoare triple {12481#false} assume !false; {12481#false} is VALID [2022-04-28 03:52:52,178 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 03:52:52,178 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:52:52,435 INFO L290 TraceCheckUtils]: 28: Hoare triple {12481#false} assume !false; {12481#false} is VALID [2022-04-28 03:52:52,435 INFO L290 TraceCheckUtils]: 27: Hoare triple {12481#false} assume 0 == ~cond; {12481#false} is VALID [2022-04-28 03:52:52,435 INFO L290 TraceCheckUtils]: 26: Hoare triple {12481#false} ~cond := #in~cond; {12481#false} is VALID [2022-04-28 03:52:52,435 INFO L272 TraceCheckUtils]: 25: Hoare triple {12481#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {12481#false} is VALID [2022-04-28 03:52:52,435 INFO L290 TraceCheckUtils]: 24: Hoare triple {12481#false} assume !(~z~0 % 4294967296 > 0); {12481#false} is VALID [2022-04-28 03:52:52,435 INFO L290 TraceCheckUtils]: 23: Hoare triple {12481#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {12481#false} is VALID [2022-04-28 03:52:52,435 INFO L290 TraceCheckUtils]: 22: Hoare triple {12481#false} assume !(~x~0 % 4294967296 > 0); {12481#false} is VALID [2022-04-28 03:52:52,436 INFO L290 TraceCheckUtils]: 21: Hoare triple {12481#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; {12481#false} is VALID [2022-04-28 03:52:52,436 INFO L290 TraceCheckUtils]: 20: Hoare triple {12481#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; {12481#false} is VALID [2022-04-28 03:52:52,436 INFO L290 TraceCheckUtils]: 19: Hoare triple {12559#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {12481#false} is VALID [2022-04-28 03:52:52,437 INFO L290 TraceCheckUtils]: 18: Hoare triple {12555#(< 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; {12559#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-28 03:52:52,438 INFO L290 TraceCheckUtils]: 17: Hoare triple {12551#(< 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; {12555#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-28 03:52:52,439 INFO L290 TraceCheckUtils]: 16: Hoare triple {12547#(< 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; {12551#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-28 03:52:52,440 INFO L290 TraceCheckUtils]: 15: Hoare triple {12540#(< 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; {12547#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-28 03:52:52,440 INFO L290 TraceCheckUtils]: 14: Hoare triple {12540#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} assume !(~z~0 % 4294967296 > 0); {12540#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-28 03:52:52,440 INFO L290 TraceCheckUtils]: 13: Hoare triple {12635#(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; {12540#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-28 03:52:52,442 INFO L290 TraceCheckUtils]: 12: Hoare triple {12639#(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; {12635#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-28 03:52:52,443 INFO L290 TraceCheckUtils]: 11: Hoare triple {12643#(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; {12639#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-28 03:52:52,444 INFO L290 TraceCheckUtils]: 10: Hoare triple {12647#(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; {12643#(or (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-28 03:52:52,445 INFO L290 TraceCheckUtils]: 9: Hoare triple {12651#(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; {12647#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-28 03:52:52,446 INFO L290 TraceCheckUtils]: 8: Hoare triple {12480#true} ~z~0 := ~y~0; {12651#(or (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))) (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-28 03:52:52,446 INFO L290 TraceCheckUtils]: 7: Hoare triple {12480#true} [132] 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[] {12480#true} is VALID [2022-04-28 03:52:52,446 INFO L290 TraceCheckUtils]: 6: Hoare triple {12480#true} [133] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_287 v_main_~y~0_286)) (.cse1 (= v_main_~x~0_307 v_main_~x~0_306)) (.cse2 (= |v_main_#t~post6_115| |v_main_#t~post6_114|)) (.cse3 (= |v_main_#t~post5_115| |v_main_#t~post5_114|)) (.cse4 (mod v_main_~x~0_307 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3 (<= .cse4 0)) (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)))) (= v_main_~y~0_286 (+ (* v_main_~x~0_306 (- 1)) v_main_~x~0_307 v_main_~y~0_287)) (< 0 .cse4) (< v_main_~x~0_306 v_main_~x~0_307)))) InVars {main_~y~0=v_main_~y~0_287, main_#t~post5=|v_main_#t~post5_115|, main_~x~0=v_main_~x~0_307, main_#t~post6=|v_main_#t~post6_115|} OutVars{main_~y~0=v_main_~y~0_286, main_#t~post5=|v_main_#t~post5_114|, main_~x~0=v_main_~x~0_306, main_#t~post6=|v_main_#t~post6_114|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {12480#true} is VALID [2022-04-28 03:52:52,446 INFO L290 TraceCheckUtils]: 5: Hoare triple {12480#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {12480#true} is VALID [2022-04-28 03:52:52,446 INFO L272 TraceCheckUtils]: 4: Hoare triple {12480#true} call #t~ret15 := main(); {12480#true} is VALID [2022-04-28 03:52:52,446 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12480#true} {12480#true} #83#return; {12480#true} is VALID [2022-04-28 03:52:52,446 INFO L290 TraceCheckUtils]: 2: Hoare triple {12480#true} assume true; {12480#true} is VALID [2022-04-28 03:52:52,446 INFO L290 TraceCheckUtils]: 1: Hoare triple {12480#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {12480#true} is VALID [2022-04-28 03:52:52,446 INFO L272 TraceCheckUtils]: 0: Hoare triple {12480#true} call ULTIMATE.init(); {12480#true} is VALID [2022-04-28 03:52:52,446 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 03:52:52,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [988698322] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:52:52,447 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:52:52,447 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 12] total 25 [2022-04-28 03:52:52,619 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:52:52,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [928663597] [2022-04-28 03:52:52,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [928663597] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:52:52,620 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:52:52,620 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 03:52:52,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065997900] [2022-04-28 03:52:52,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:52:52,620 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 12 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:52:52,620 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:52:52,620 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 12 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:52:52,646 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:52:52,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 03:52:52,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:52:52,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 03:52:52,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=669, Unknown=0, NotChecked=0, Total=756 [2022-04-28 03:52:52,647 INFO L87 Difference]: Start difference. First operand 73 states and 93 transitions. Second operand has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 12 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:52:55,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:52:55,515 INFO L93 Difference]: Finished difference Result 195 states and 275 transitions. [2022-04-28 03:52:55,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-28 03:52:55,515 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 12 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:52:55,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:52:55,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 12 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:52:55,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 108 transitions. [2022-04-28 03:52:55,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 12 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:52:55,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 108 transitions. [2022-04-28 03:52:55,517 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 108 transitions. [2022-04-28 03:52:55,664 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:52:55,667 INFO L225 Difference]: With dead ends: 195 [2022-04-28 03:52:55,667 INFO L226 Difference]: Without dead ends: 178 [2022-04-28 03:52:55,667 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=214, Invalid=1426, Unknown=0, NotChecked=0, Total=1640 [2022-04-28 03:52:55,668 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 108 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 03:52:55,668 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 56 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 03:52:55,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2022-04-28 03:52:56,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 85. [2022-04-28 03:52:56,259 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:52:56,260 INFO L82 GeneralOperation]: Start isEquivalent. First operand 178 states. Second operand has 85 states, 80 states have (on average 1.3375) internal successors, (107), 80 states have internal predecessors, (107), 3 states have call successors, (3), 3 states have 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:52:56,260 INFO L74 IsIncluded]: Start isIncluded. First operand 178 states. Second operand has 85 states, 80 states have (on average 1.3375) internal successors, (107), 80 states have internal predecessors, (107), 3 states have call successors, (3), 3 states have 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:52:56,260 INFO L87 Difference]: Start difference. First operand 178 states. Second operand has 85 states, 80 states have (on average 1.3375) internal successors, (107), 80 states have internal predecessors, (107), 3 states have call successors, (3), 3 states have 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:52:56,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:52:56,262 INFO L93 Difference]: Finished difference Result 178 states and 241 transitions. [2022-04-28 03:52:56,262 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 241 transitions. [2022-04-28 03:52:56,262 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:52:56,262 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:52:56,262 INFO L74 IsIncluded]: Start isIncluded. First operand has 85 states, 80 states have (on average 1.3375) internal successors, (107), 80 states have internal predecessors, (107), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 178 states. [2022-04-28 03:52:56,262 INFO L87 Difference]: Start difference. First operand has 85 states, 80 states have (on average 1.3375) internal successors, (107), 80 states have internal predecessors, (107), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 178 states. [2022-04-28 03:52:56,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:52:56,264 INFO L93 Difference]: Finished difference Result 178 states and 241 transitions. [2022-04-28 03:52:56,264 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 241 transitions. [2022-04-28 03:52:56,264 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:52:56,264 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:52:56,265 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:52:56,265 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:52:56,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 80 states have (on average 1.3375) internal successors, (107), 80 states have internal predecessors, (107), 3 states have call successors, (3), 3 states have 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:52:56,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 111 transitions. [2022-04-28 03:52:56,266 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 111 transitions. Word has length 31 [2022-04-28 03:52:56,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:52:56,266 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 111 transitions. [2022-04-28 03:52:56,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 12 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:52:56,266 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 85 states and 111 transitions. [2022-04-28 03:53:06,839 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 108 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-28 03:53:06,839 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 111 transitions. [2022-04-28 03:53:06,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-28 03:53:06,839 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:53:06,839 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:53:06,855 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-04-28 03:53:07,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-04-28 03:53:07,040 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:53:07,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:53:07,040 INFO L85 PathProgramCache]: Analyzing trace with hash 157963444, now seen corresponding path program 12 times [2022-04-28 03:53:07,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:53:07,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [307520716] [2022-04-28 03:53:07,198 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:53:07,200 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:53:07,201 INFO L85 PathProgramCache]: Analyzing trace with hash 817894357, now seen corresponding path program 1 times [2022-04-28 03:53:07,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:53:07,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964140202] [2022-04-28 03:53:07,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:53:07,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:53:07,217 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_25.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:53:07,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:53:07,245 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_25.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:53:07,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:53:07,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:53:07,431 INFO L290 TraceCheckUtils]: 0: Hoare triple {13641#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {13626#true} is VALID [2022-04-28 03:53:07,432 INFO L290 TraceCheckUtils]: 1: Hoare triple {13626#true} assume true; {13626#true} is VALID [2022-04-28 03:53:07,432 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13626#true} {13626#true} #83#return; {13626#true} is VALID [2022-04-28 03:53:07,432 INFO L272 TraceCheckUtils]: 0: Hoare triple {13626#true} call ULTIMATE.init(); {13641#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:53:07,432 INFO L290 TraceCheckUtils]: 1: Hoare triple {13641#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {13626#true} is VALID [2022-04-28 03:53:07,432 INFO L290 TraceCheckUtils]: 2: Hoare triple {13626#true} assume true; {13626#true} is VALID [2022-04-28 03:53:07,432 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13626#true} {13626#true} #83#return; {13626#true} is VALID [2022-04-28 03:53:07,432 INFO L272 TraceCheckUtils]: 4: Hoare triple {13626#true} call #t~ret15 := main(); {13626#true} is VALID [2022-04-28 03:53:07,432 INFO L290 TraceCheckUtils]: 5: Hoare triple {13626#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {13626#true} is VALID [2022-04-28 03:53:07,433 INFO L290 TraceCheckUtils]: 6: Hoare triple {13626#true} [135] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= v_main_~y~0_306 v_main_~y~0_305)) (.cse0 (mod v_main_~x~0_324 4294967296)) (.cse2 (= v_main_~x~0_324 v_main_~x~0_323))) (or (and (< 0 .cse0) (< v_main_~y~0_306 v_main_~y~0_305) (= v_main_~x~0_323 (+ v_main_~x~0_324 (* (- 1) v_main_~y~0_305) v_main_~y~0_306)) (forall ((v_it_25 Int)) (or (< 0 (mod (+ v_main_~x~0_324 (* 4294967295 v_it_25)) 4294967296)) (not (<= (+ v_main_~y~0_306 v_it_25 1) v_main_~y~0_305)) (not (<= 1 v_it_25))))) (and (= |v_main_#t~post5_120| |v_main_#t~post5_119|) .cse1 (= |v_main_#t~post6_120| |v_main_#t~post6_119|) .cse2) (and .cse1 (= |v_main_#t~post6_119| |v_main_#t~post6_120|) (<= .cse0 0) .cse2 (= |v_main_#t~post5_119| |v_main_#t~post5_120|)))) InVars {main_~y~0=v_main_~y~0_306, main_#t~post5=|v_main_#t~post5_120|, main_~x~0=v_main_~x~0_324, main_#t~post6=|v_main_#t~post6_120|} OutVars{main_~y~0=v_main_~y~0_305, main_#t~post5=|v_main_#t~post5_119|, main_~x~0=v_main_~x~0_323, main_#t~post6=|v_main_#t~post6_119|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {13626#true} is VALID [2022-04-28 03:53:07,433 INFO L290 TraceCheckUtils]: 7: Hoare triple {13626#true} [134] 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[] {13626#true} is VALID [2022-04-28 03:53:07,433 INFO L290 TraceCheckUtils]: 8: Hoare triple {13626#true} ~z~0 := ~y~0; {13631#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-28 03:53:07,434 INFO L290 TraceCheckUtils]: 9: Hoare triple {13631#(and (<= main_~y~0 main_~z~0) (<= 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; {13632#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-28 03:53:07,435 INFO L290 TraceCheckUtils]: 10: Hoare triple {13632#(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; {13633#(and (<= main_~y~0 (+ (* (div main_~z~0 4294967296) 4294967296) 4294967296)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-28 03:53:07,437 INFO L290 TraceCheckUtils]: 11: Hoare triple {13633#(and (<= main_~y~0 (+ (* (div main_~z~0 4294967296) 4294967296) 4294967296)) (<= (+ 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; {13634#(and (or (<= (+ main_~z~0 3) main_~y~0) (<= (+ (div main_~z~0 4294967296) 1) (div main_~y~0 4294967296))) (<= main_~y~0 (+ (* (div main_~z~0 4294967296) 4294967296) 4294967296)))} is VALID [2022-04-28 03:53:07,438 INFO L290 TraceCheckUtils]: 12: Hoare triple {13634#(and (or (<= (+ main_~z~0 3) main_~y~0) (<= (+ (div main_~z~0 4294967296) 1) (div main_~y~0 4294967296))) (<= main_~y~0 (+ (* (div main_~z~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; {13635#(or (<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296)) (<= (* 4294967296 (div (+ (* (div main_~y~0 4294967296) 4294967296) main_~z~0 (* (- 1) main_~y~0) 4294967299) 4294967296)) main_~z~0))} is VALID [2022-04-28 03:53:07,439 INFO L290 TraceCheckUtils]: 13: Hoare triple {13635#(or (<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296)) (<= (* 4294967296 (div (+ (* (div main_~y~0 4294967296) 4294967296) main_~z~0 (* (- 1) main_~y~0) 4294967299) 4294967296)) main_~z~0))} assume !(~z~0 % 4294967296 > 0); {13635#(or (<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296)) (<= (* 4294967296 (div (+ (* (div main_~y~0 4294967296) 4294967296) main_~z~0 (* (- 1) main_~y~0) 4294967299) 4294967296)) main_~z~0))} is VALID [2022-04-28 03:53:07,441 INFO L290 TraceCheckUtils]: 14: Hoare triple {13635#(or (<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296)) (<= (* 4294967296 (div (+ (* (div main_~y~0 4294967296) 4294967296) main_~z~0 (* (- 1) main_~y~0) 4294967299) 4294967296)) main_~z~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; {13636#(<= (+ (* (div (+ main_~z~0 3) 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-28 03:53:07,442 INFO L290 TraceCheckUtils]: 15: Hoare triple {13636#(<= (+ (* (div (+ main_~z~0 3) 4294967296) 4294967296) 1) main_~z~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; {13637#(<= (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) 2) main_~z~0)} is VALID [2022-04-28 03:53:07,443 INFO L290 TraceCheckUtils]: 16: Hoare triple {13637#(<= (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) 2) main_~z~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; {13638#(<= (+ 3 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-28 03:53:07,444 INFO L290 TraceCheckUtils]: 17: Hoare triple {13638#(<= (+ 3 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) main_~z~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; {13639#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 4) main_~z~0)} is VALID [2022-04-28 03:53:07,444 INFO L290 TraceCheckUtils]: 18: Hoare triple {13639#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 4) main_~z~0)} assume !(~y~0 % 4294967296 > 0); {13639#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 4) main_~z~0)} is VALID [2022-04-28 03:53:07,444 INFO L290 TraceCheckUtils]: 19: Hoare triple {13639#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 4) main_~z~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; {13639#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 4) main_~z~0)} is VALID [2022-04-28 03:53:07,444 INFO L290 TraceCheckUtils]: 20: Hoare triple {13639#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 4) main_~z~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; {13639#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 4) main_~z~0)} is VALID [2022-04-28 03:53:07,445 INFO L290 TraceCheckUtils]: 21: Hoare triple {13639#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 4) main_~z~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; {13639#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 4) main_~z~0)} is VALID [2022-04-28 03:53:07,445 INFO L290 TraceCheckUtils]: 22: Hoare triple {13639#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 4) main_~z~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; {13639#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 4) main_~z~0)} is VALID [2022-04-28 03:53:07,445 INFO L290 TraceCheckUtils]: 23: Hoare triple {13639#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 4) main_~z~0)} assume !(~x~0 % 4294967296 > 0); {13639#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 4) main_~z~0)} is VALID [2022-04-28 03:53:07,446 INFO L290 TraceCheckUtils]: 24: Hoare triple {13639#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 4) main_~z~0)} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {13640#(<= (+ 3 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} is VALID [2022-04-28 03:53:07,447 INFO L290 TraceCheckUtils]: 25: Hoare triple {13640#(<= (+ 3 (* (div main_~z~0 4294967296) 4294967296)) main_~z~0)} assume !(~z~0 % 4294967296 > 0); {13627#false} is VALID [2022-04-28 03:53:07,447 INFO L272 TraceCheckUtils]: 26: Hoare triple {13627#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {13627#false} is VALID [2022-04-28 03:53:07,447 INFO L290 TraceCheckUtils]: 27: Hoare triple {13627#false} ~cond := #in~cond; {13627#false} is VALID [2022-04-28 03:53:07,447 INFO L290 TraceCheckUtils]: 28: Hoare triple {13627#false} assume 0 == ~cond; {13627#false} is VALID [2022-04-28 03:53:07,447 INFO L290 TraceCheckUtils]: 29: Hoare triple {13627#false} assume !false; {13627#false} is VALID [2022-04-28 03:53:07,447 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 03:53:07,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:53:07,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964140202] [2022-04-28 03:53:07,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964140202] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:53:07,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1190118973] [2022-04-28 03:53:07,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:53:07,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:53:07,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:53:07,448 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:53:07,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-04-28 03:53:07,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:53:07,487 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-28 03:53:07,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:53:07,495 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:53:08,230 INFO L272 TraceCheckUtils]: 0: Hoare triple {13626#true} call ULTIMATE.init(); {13626#true} is VALID [2022-04-28 03:53:08,230 INFO L290 TraceCheckUtils]: 1: Hoare triple {13626#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {13626#true} is VALID [2022-04-28 03:53:08,230 INFO L290 TraceCheckUtils]: 2: Hoare triple {13626#true} assume true; {13626#true} is VALID [2022-04-28 03:53:08,230 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13626#true} {13626#true} #83#return; {13626#true} is VALID [2022-04-28 03:53:08,231 INFO L272 TraceCheckUtils]: 4: Hoare triple {13626#true} call #t~ret15 := main(); {13626#true} is VALID [2022-04-28 03:53:08,231 INFO L290 TraceCheckUtils]: 5: Hoare triple {13626#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {13626#true} is VALID [2022-04-28 03:53:08,231 INFO L290 TraceCheckUtils]: 6: Hoare triple {13626#true} [135] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= v_main_~y~0_306 v_main_~y~0_305)) (.cse0 (mod v_main_~x~0_324 4294967296)) (.cse2 (= v_main_~x~0_324 v_main_~x~0_323))) (or (and (< 0 .cse0) (< v_main_~y~0_306 v_main_~y~0_305) (= v_main_~x~0_323 (+ v_main_~x~0_324 (* (- 1) v_main_~y~0_305) v_main_~y~0_306)) (forall ((v_it_25 Int)) (or (< 0 (mod (+ v_main_~x~0_324 (* 4294967295 v_it_25)) 4294967296)) (not (<= (+ v_main_~y~0_306 v_it_25 1) v_main_~y~0_305)) (not (<= 1 v_it_25))))) (and (= |v_main_#t~post5_120| |v_main_#t~post5_119|) .cse1 (= |v_main_#t~post6_120| |v_main_#t~post6_119|) .cse2) (and .cse1 (= |v_main_#t~post6_119| |v_main_#t~post6_120|) (<= .cse0 0) .cse2 (= |v_main_#t~post5_119| |v_main_#t~post5_120|)))) InVars {main_~y~0=v_main_~y~0_306, main_#t~post5=|v_main_#t~post5_120|, main_~x~0=v_main_~x~0_324, main_#t~post6=|v_main_#t~post6_120|} OutVars{main_~y~0=v_main_~y~0_305, main_#t~post5=|v_main_#t~post5_119|, main_~x~0=v_main_~x~0_323, main_#t~post6=|v_main_#t~post6_119|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {13626#true} is VALID [2022-04-28 03:53:08,231 INFO L290 TraceCheckUtils]: 7: Hoare triple {13626#true} [134] 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[] {13626#true} is VALID [2022-04-28 03:53:08,231 INFO L290 TraceCheckUtils]: 8: Hoare triple {13626#true} ~z~0 := ~y~0; {13631#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-28 03:53:08,232 INFO L290 TraceCheckUtils]: 9: Hoare triple {13631#(and (<= main_~y~0 main_~z~0) (<= 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; {13632#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-28 03:53:08,232 INFO L290 TraceCheckUtils]: 10: Hoare triple {13632#(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; {13675#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-28 03:53:08,233 INFO L290 TraceCheckUtils]: 11: Hoare triple {13675#(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; {13679#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-28 03:53:08,234 INFO L290 TraceCheckUtils]: 12: Hoare triple {13679#(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; {13683#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-28 03:53:08,234 INFO L290 TraceCheckUtils]: 13: Hoare triple {13683#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} assume !(~z~0 % 4294967296 > 0); {13683#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-28 03:53:08,235 INFO L290 TraceCheckUtils]: 14: Hoare triple {13683#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) 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; {13675#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-28 03:53:08,236 INFO L290 TraceCheckUtils]: 15: Hoare triple {13675#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) 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; {13693#(< (div (+ (* (- 1) main_~z~0) 4294967294) (- 4294967296)) (+ (div main_~z~0 4294967296) 1))} is VALID [2022-04-28 03:53:08,237 INFO L290 TraceCheckUtils]: 16: Hoare triple {13693#(< (div (+ (* (- 1) main_~z~0) 4294967294) (- 4294967296)) (+ (div main_~z~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; {13697#(< (div (+ (* (- 1) main_~z~0) 4294967295) (- 4294967296)) (+ (div (+ (- 1) main_~z~0) 4294967296) 1))} is VALID [2022-04-28 03:53:08,238 INFO L290 TraceCheckUtils]: 17: Hoare triple {13697#(< (div (+ (* (- 1) main_~z~0) 4294967295) (- 4294967296)) (+ (div (+ (- 1) main_~z~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; {13701#(< (div (+ (* (- 1) main_~z~0) 4294967296) (- 4294967296)) (+ (div (+ (- 2) main_~z~0) 4294967296) 1))} is VALID [2022-04-28 03:53:08,238 INFO L290 TraceCheckUtils]: 18: Hoare triple {13701#(< (div (+ (* (- 1) main_~z~0) 4294967296) (- 4294967296)) (+ (div (+ (- 2) main_~z~0) 4294967296) 1))} assume !(~y~0 % 4294967296 > 0); {13701#(< (div (+ (* (- 1) main_~z~0) 4294967296) (- 4294967296)) (+ (div (+ (- 2) main_~z~0) 4294967296) 1))} is VALID [2022-04-28 03:53:08,238 INFO L290 TraceCheckUtils]: 19: Hoare triple {13701#(< (div (+ (* (- 1) main_~z~0) 4294967296) (- 4294967296)) (+ (div (+ (- 2) main_~z~0) 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; {13701#(< (div (+ (* (- 1) main_~z~0) 4294967296) (- 4294967296)) (+ (div (+ (- 2) main_~z~0) 4294967296) 1))} is VALID [2022-04-28 03:53:08,239 INFO L290 TraceCheckUtils]: 20: Hoare triple {13701#(< (div (+ (* (- 1) main_~z~0) 4294967296) (- 4294967296)) (+ (div (+ (- 2) main_~z~0) 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; {13701#(< (div (+ (* (- 1) main_~z~0) 4294967296) (- 4294967296)) (+ (div (+ (- 2) main_~z~0) 4294967296) 1))} is VALID [2022-04-28 03:53:08,239 INFO L290 TraceCheckUtils]: 21: Hoare triple {13701#(< (div (+ (* (- 1) main_~z~0) 4294967296) (- 4294967296)) (+ (div (+ (- 2) main_~z~0) 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; {13701#(< (div (+ (* (- 1) main_~z~0) 4294967296) (- 4294967296)) (+ (div (+ (- 2) main_~z~0) 4294967296) 1))} is VALID [2022-04-28 03:53:08,239 INFO L290 TraceCheckUtils]: 22: Hoare triple {13701#(< (div (+ (* (- 1) main_~z~0) 4294967296) (- 4294967296)) (+ (div (+ (- 2) main_~z~0) 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; {13701#(< (div (+ (* (- 1) main_~z~0) 4294967296) (- 4294967296)) (+ (div (+ (- 2) main_~z~0) 4294967296) 1))} is VALID [2022-04-28 03:53:08,239 INFO L290 TraceCheckUtils]: 23: Hoare triple {13701#(< (div (+ (* (- 1) main_~z~0) 4294967296) (- 4294967296)) (+ (div (+ (- 2) main_~z~0) 4294967296) 1))} assume !(~x~0 % 4294967296 > 0); {13701#(< (div (+ (* (- 1) main_~z~0) 4294967296) (- 4294967296)) (+ (div (+ (- 2) main_~z~0) 4294967296) 1))} is VALID [2022-04-28 03:53:08,241 INFO L290 TraceCheckUtils]: 24: Hoare triple {13701#(< (div (+ (* (- 1) main_~z~0) 4294967296) (- 4294967296)) (+ (div (+ (- 2) main_~z~0) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {13697#(< (div (+ (* (- 1) main_~z~0) 4294967295) (- 4294967296)) (+ (div (+ (- 1) main_~z~0) 4294967296) 1))} is VALID [2022-04-28 03:53:08,241 INFO L290 TraceCheckUtils]: 25: Hoare triple {13697#(< (div (+ (* (- 1) main_~z~0) 4294967295) (- 4294967296)) (+ (div (+ (- 1) main_~z~0) 4294967296) 1))} assume !(~z~0 % 4294967296 > 0); {13627#false} is VALID [2022-04-28 03:53:08,241 INFO L272 TraceCheckUtils]: 26: Hoare triple {13627#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {13627#false} is VALID [2022-04-28 03:53:08,241 INFO L290 TraceCheckUtils]: 27: Hoare triple {13627#false} ~cond := #in~cond; {13627#false} is VALID [2022-04-28 03:53:08,241 INFO L290 TraceCheckUtils]: 28: Hoare triple {13627#false} assume 0 == ~cond; {13627#false} is VALID [2022-04-28 03:53:08,242 INFO L290 TraceCheckUtils]: 29: Hoare triple {13627#false} assume !false; {13627#false} is VALID [2022-04-28 03:53:08,242 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 03:53:08,242 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:53:08,899 INFO L290 TraceCheckUtils]: 29: Hoare triple {13627#false} assume !false; {13627#false} is VALID [2022-04-28 03:53:08,899 INFO L290 TraceCheckUtils]: 28: Hoare triple {13627#false} assume 0 == ~cond; {13627#false} is VALID [2022-04-28 03:53:08,899 INFO L290 TraceCheckUtils]: 27: Hoare triple {13627#false} ~cond := #in~cond; {13627#false} is VALID [2022-04-28 03:53:08,900 INFO L272 TraceCheckUtils]: 26: Hoare triple {13627#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {13627#false} is VALID [2022-04-28 03:53:08,900 INFO L290 TraceCheckUtils]: 25: Hoare triple {13697#(< (div (+ (* (- 1) main_~z~0) 4294967295) (- 4294967296)) (+ (div (+ (- 1) main_~z~0) 4294967296) 1))} assume !(~z~0 % 4294967296 > 0); {13627#false} is VALID [2022-04-28 03:53:08,902 INFO L290 TraceCheckUtils]: 24: Hoare triple {13701#(< (div (+ (* (- 1) main_~z~0) 4294967296) (- 4294967296)) (+ (div (+ (- 2) main_~z~0) 4294967296) 1))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {13697#(< (div (+ (* (- 1) main_~z~0) 4294967295) (- 4294967296)) (+ (div (+ (- 1) main_~z~0) 4294967296) 1))} is VALID [2022-04-28 03:53:08,902 INFO L290 TraceCheckUtils]: 23: Hoare triple {13701#(< (div (+ (* (- 1) main_~z~0) 4294967296) (- 4294967296)) (+ (div (+ (- 2) main_~z~0) 4294967296) 1))} assume !(~x~0 % 4294967296 > 0); {13701#(< (div (+ (* (- 1) main_~z~0) 4294967296) (- 4294967296)) (+ (div (+ (- 2) main_~z~0) 4294967296) 1))} is VALID [2022-04-28 03:53:08,902 INFO L290 TraceCheckUtils]: 22: Hoare triple {13701#(< (div (+ (* (- 1) main_~z~0) 4294967296) (- 4294967296)) (+ (div (+ (- 2) main_~z~0) 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; {13701#(< (div (+ (* (- 1) main_~z~0) 4294967296) (- 4294967296)) (+ (div (+ (- 2) main_~z~0) 4294967296) 1))} is VALID [2022-04-28 03:53:08,902 INFO L290 TraceCheckUtils]: 21: Hoare triple {13701#(< (div (+ (* (- 1) main_~z~0) 4294967296) (- 4294967296)) (+ (div (+ (- 2) main_~z~0) 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; {13701#(< (div (+ (* (- 1) main_~z~0) 4294967296) (- 4294967296)) (+ (div (+ (- 2) main_~z~0) 4294967296) 1))} is VALID [2022-04-28 03:53:08,903 INFO L290 TraceCheckUtils]: 20: Hoare triple {13701#(< (div (+ (* (- 1) main_~z~0) 4294967296) (- 4294967296)) (+ (div (+ (- 2) main_~z~0) 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; {13701#(< (div (+ (* (- 1) main_~z~0) 4294967296) (- 4294967296)) (+ (div (+ (- 2) main_~z~0) 4294967296) 1))} is VALID [2022-04-28 03:53:08,903 INFO L290 TraceCheckUtils]: 19: Hoare triple {13701#(< (div (+ (* (- 1) main_~z~0) 4294967296) (- 4294967296)) (+ (div (+ (- 2) main_~z~0) 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; {13701#(< (div (+ (* (- 1) main_~z~0) 4294967296) (- 4294967296)) (+ (div (+ (- 2) main_~z~0) 4294967296) 1))} is VALID [2022-04-28 03:53:08,903 INFO L290 TraceCheckUtils]: 18: Hoare triple {13701#(< (div (+ (* (- 1) main_~z~0) 4294967296) (- 4294967296)) (+ (div (+ (- 2) main_~z~0) 4294967296) 1))} assume !(~y~0 % 4294967296 > 0); {13701#(< (div (+ (* (- 1) main_~z~0) 4294967296) (- 4294967296)) (+ (div (+ (- 2) main_~z~0) 4294967296) 1))} is VALID [2022-04-28 03:53:08,904 INFO L290 TraceCheckUtils]: 17: Hoare triple {13697#(< (div (+ (* (- 1) main_~z~0) 4294967295) (- 4294967296)) (+ (div (+ (- 1) main_~z~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; {13701#(< (div (+ (* (- 1) main_~z~0) 4294967296) (- 4294967296)) (+ (div (+ (- 2) main_~z~0) 4294967296) 1))} is VALID [2022-04-28 03:53:08,905 INFO L290 TraceCheckUtils]: 16: Hoare triple {13693#(< (div (+ (* (- 1) main_~z~0) 4294967294) (- 4294967296)) (+ (div main_~z~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; {13697#(< (div (+ (* (- 1) main_~z~0) 4294967295) (- 4294967296)) (+ (div (+ (- 1) main_~z~0) 4294967296) 1))} is VALID [2022-04-28 03:53:08,906 INFO L290 TraceCheckUtils]: 15: Hoare triple {13780#(or (not (< 0 (mod main_~y~0 4294967296))) (< (div (+ (* (- 1) main_~z~0) 4294967293) (- 4294967296)) (+ (div (+ main_~z~0 1) 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; {13693#(< (div (+ (* (- 1) main_~z~0) 4294967294) (- 4294967296)) (+ (div main_~z~0 4294967296) 1))} is VALID [2022-04-28 03:53:08,908 INFO L290 TraceCheckUtils]: 14: Hoare triple {13784#(or (< (div (+ 4294967292 (* (- 1) main_~z~0)) (- 4294967296)) (+ (div (+ main_~z~0 2) 4294967296) 1)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {13780#(or (not (< 0 (mod main_~y~0 4294967296))) (< (div (+ (* (- 1) main_~z~0) 4294967293) (- 4294967296)) (+ (div (+ main_~z~0 1) 4294967296) 1)))} is VALID [2022-04-28 03:53:08,909 INFO L290 TraceCheckUtils]: 13: Hoare triple {13784#(or (< (div (+ 4294967292 (* (- 1) main_~z~0)) (- 4294967296)) (+ (div (+ main_~z~0 2) 4294967296) 1)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {13784#(or (< (div (+ 4294967292 (* (- 1) main_~z~0)) (- 4294967296)) (+ (div (+ main_~z~0 2) 4294967296) 1)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-28 03:53:08,910 INFO L290 TraceCheckUtils]: 12: Hoare triple {13791#(or (< (div (+ (* (- 1) main_~z~0) 4294967293) (- 4294967296)) (+ (div (+ main_~z~0 1) 4294967296) 1)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13784#(or (< (div (+ 4294967292 (* (- 1) main_~z~0)) (- 4294967296)) (+ (div (+ main_~z~0 2) 4294967296) 1)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-28 03:53:08,911 INFO L290 TraceCheckUtils]: 11: Hoare triple {13795#(or (< (div (+ (* (- 1) main_~z~0) 4294967294) (- 4294967296)) (+ (div main_~z~0 4294967296) 1)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13791#(or (< (div (+ (* (- 1) main_~z~0) 4294967293) (- 4294967296)) (+ (div (+ main_~z~0 1) 4294967296) 1)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-28 03:53:08,913 INFO L290 TraceCheckUtils]: 10: Hoare triple {13799#(or (< (div (+ (* (- 1) main_~z~0) 4294967295) (- 4294967296)) (+ (div (+ (- 1) main_~z~0) 4294967296) 1)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13795#(or (< (div (+ (* (- 1) main_~z~0) 4294967294) (- 4294967296)) (+ (div main_~z~0 4294967296) 1)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-28 03:53:08,914 INFO L290 TraceCheckUtils]: 9: Hoare triple {13803#(or (< (div (+ (* (- 1) main_~z~0) 4294967296) (- 4294967296)) (+ (div (+ (- 2) main_~z~0) 4294967296) 1)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {13799#(or (< (div (+ (* (- 1) main_~z~0) 4294967295) (- 4294967296)) (+ (div (+ (- 1) main_~z~0) 4294967296) 1)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-28 03:53:08,915 INFO L290 TraceCheckUtils]: 8: Hoare triple {13626#true} ~z~0 := ~y~0; {13803#(or (< (div (+ (* (- 1) main_~z~0) 4294967296) (- 4294967296)) (+ (div (+ (- 2) main_~z~0) 4294967296) 1)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-28 03:53:08,915 INFO L290 TraceCheckUtils]: 7: Hoare triple {13626#true} [134] 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[] {13626#true} is VALID [2022-04-28 03:53:08,915 INFO L290 TraceCheckUtils]: 6: Hoare triple {13626#true} [135] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= v_main_~y~0_306 v_main_~y~0_305)) (.cse0 (mod v_main_~x~0_324 4294967296)) (.cse2 (= v_main_~x~0_324 v_main_~x~0_323))) (or (and (< 0 .cse0) (< v_main_~y~0_306 v_main_~y~0_305) (= v_main_~x~0_323 (+ v_main_~x~0_324 (* (- 1) v_main_~y~0_305) v_main_~y~0_306)) (forall ((v_it_25 Int)) (or (< 0 (mod (+ v_main_~x~0_324 (* 4294967295 v_it_25)) 4294967296)) (not (<= (+ v_main_~y~0_306 v_it_25 1) v_main_~y~0_305)) (not (<= 1 v_it_25))))) (and (= |v_main_#t~post5_120| |v_main_#t~post5_119|) .cse1 (= |v_main_#t~post6_120| |v_main_#t~post6_119|) .cse2) (and .cse1 (= |v_main_#t~post6_119| |v_main_#t~post6_120|) (<= .cse0 0) .cse2 (= |v_main_#t~post5_119| |v_main_#t~post5_120|)))) InVars {main_~y~0=v_main_~y~0_306, main_#t~post5=|v_main_#t~post5_120|, main_~x~0=v_main_~x~0_324, main_#t~post6=|v_main_#t~post6_120|} OutVars{main_~y~0=v_main_~y~0_305, main_#t~post5=|v_main_#t~post5_119|, main_~x~0=v_main_~x~0_323, main_#t~post6=|v_main_#t~post6_119|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {13626#true} is VALID [2022-04-28 03:53:08,915 INFO L290 TraceCheckUtils]: 5: Hoare triple {13626#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {13626#true} is VALID [2022-04-28 03:53:08,915 INFO L272 TraceCheckUtils]: 4: Hoare triple {13626#true} call #t~ret15 := main(); {13626#true} is VALID [2022-04-28 03:53:08,915 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13626#true} {13626#true} #83#return; {13626#true} is VALID [2022-04-28 03:53:08,915 INFO L290 TraceCheckUtils]: 2: Hoare triple {13626#true} assume true; {13626#true} is VALID [2022-04-28 03:53:08,915 INFO L290 TraceCheckUtils]: 1: Hoare triple {13626#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {13626#true} is VALID [2022-04-28 03:53:08,915 INFO L272 TraceCheckUtils]: 0: Hoare triple {13626#true} call ULTIMATE.init(); {13626#true} is VALID [2022-04-28 03:53:08,915 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 03:53:08,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1190118973] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:53:08,916 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:53:08,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 11] total 25 [2022-04-28 03:53:09,049 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:53:09,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [307520716] [2022-04-28 03:53:09,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [307520716] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:53:09,050 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:53:09,050 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-28 03:53:09,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550013790] [2022-04-28 03:53:09,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:53:09,050 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.5625) internal successors, (25), 15 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-28 03:53:09,050 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:53:09,050 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 1.5625) internal successors, (25), 15 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:53:09,084 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:53:09,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-28 03:53:09,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:53:09,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-28 03:53:09,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=655, Unknown=0, NotChecked=0, Total=756 [2022-04-28 03:53:09,085 INFO L87 Difference]: Start difference. First operand 85 states and 111 transitions. Second operand has 16 states, 16 states have (on average 1.5625) internal successors, (25), 15 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:53:12,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:53:12,482 INFO L93 Difference]: Finished difference Result 127 states and 162 transitions. [2022-04-28 03:53:12,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-28 03:53:12,482 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.5625) internal successors, (25), 15 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-28 03:53:12,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:53:12,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.5625) internal successors, (25), 15 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:53:12,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 74 transitions. [2022-04-28 03:53:12,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.5625) internal successors, (25), 15 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:53:12,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 74 transitions. [2022-04-28 03:53:12,484 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 74 transitions. [2022-04-28 03:53:12,743 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:53:12,745 INFO L225 Difference]: With dead ends: 127 [2022-04-28 03:53:12,745 INFO L226 Difference]: Without dead ends: 122 [2022-04-28 03:53:12,747 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 54 SyntacticMatches, 3 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 353 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=399, Invalid=2357, Unknown=0, NotChecked=0, Total=2756 [2022-04-28 03:53:12,747 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 44 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 455 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-28 03:53:12,747 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 75 Invalid, 531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 455 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-28 03:53:12,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-04-28 03:53:13,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 97. [2022-04-28 03:53:13,482 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:53:13,482 INFO L82 GeneralOperation]: Start isEquivalent. First operand 122 states. Second operand has 97 states, 92 states have (on average 1.3043478260869565) internal successors, (120), 92 states have internal predecessors, (120), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:53:13,482 INFO L74 IsIncluded]: Start isIncluded. First operand 122 states. Second operand has 97 states, 92 states have (on average 1.3043478260869565) internal successors, (120), 92 states have internal predecessors, (120), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:53:13,482 INFO L87 Difference]: Start difference. First operand 122 states. Second operand has 97 states, 92 states have (on average 1.3043478260869565) internal successors, (120), 92 states have internal predecessors, (120), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:53:13,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:53:13,483 INFO L93 Difference]: Finished difference Result 122 states and 154 transitions. [2022-04-28 03:53:13,483 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 154 transitions. [2022-04-28 03:53:13,483 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:53:13,483 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:53:13,484 INFO L74 IsIncluded]: Start isIncluded. First operand has 97 states, 92 states have (on average 1.3043478260869565) internal successors, (120), 92 states have internal predecessors, (120), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 122 states. [2022-04-28 03:53:13,484 INFO L87 Difference]: Start difference. First operand has 97 states, 92 states have (on average 1.3043478260869565) internal successors, (120), 92 states have internal predecessors, (120), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 122 states. [2022-04-28 03:53:13,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:53:13,485 INFO L93 Difference]: Finished difference Result 122 states and 154 transitions. [2022-04-28 03:53:13,485 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 154 transitions. [2022-04-28 03:53:13,485 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:53:13,485 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:53:13,485 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:53:13,485 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:53:13,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 92 states have (on average 1.3043478260869565) internal successors, (120), 92 states have internal predecessors, (120), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:53:13,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 124 transitions. [2022-04-28 03:53:13,486 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 124 transitions. Word has length 32 [2022-04-28 03:53:13,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:53:13,486 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 124 transitions. [2022-04-28 03:53:13,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.5625) internal successors, (25), 15 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:53:13,486 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 97 states and 124 transitions. [2022-04-28 03:53:25,903 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 124 edges. 121 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-28 03:53:25,903 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 124 transitions. [2022-04-28 03:53:25,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-28 03:53:25,908 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:53:25,908 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:53:25,924 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2022-04-28 03:53:26,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-04-28 03:53:26,111 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:53:26,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:53:26,112 INFO L85 PathProgramCache]: Analyzing trace with hash -1665087761, now seen corresponding path program 13 times [2022-04-28 03:53:26,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:53:26,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [971910859] [2022-04-28 03:53:28,257 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:53:28,331 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:53:28,333 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:53:28,335 INFO L85 PathProgramCache]: Analyzing trace with hash 1619436462, now seen corresponding path program 1 times [2022-04-28 03:53:28,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:53:28,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620550364] [2022-04-28 03:53:28,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:53:28,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:53:28,343 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_26.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:53:28,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:53:28,357 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_26.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:53:28,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:53:28,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:53:28,478 INFO L290 TraceCheckUtils]: 0: Hoare triple {14593#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {14580#true} is VALID [2022-04-28 03:53:28,478 INFO L290 TraceCheckUtils]: 1: Hoare triple {14580#true} assume true; {14580#true} is VALID [2022-04-28 03:53:28,478 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14580#true} {14580#true} #83#return; {14580#true} is VALID [2022-04-28 03:53:28,478 INFO L272 TraceCheckUtils]: 0: Hoare triple {14580#true} call ULTIMATE.init(); {14593#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:53:28,478 INFO L290 TraceCheckUtils]: 1: Hoare triple {14593#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {14580#true} is VALID [2022-04-28 03:53:28,478 INFO L290 TraceCheckUtils]: 2: Hoare triple {14580#true} assume true; {14580#true} is VALID [2022-04-28 03:53:28,478 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14580#true} {14580#true} #83#return; {14580#true} is VALID [2022-04-28 03:53:28,478 INFO L272 TraceCheckUtils]: 4: Hoare triple {14580#true} call #t~ret15 := main(); {14580#true} is VALID [2022-04-28 03:53:28,478 INFO L290 TraceCheckUtils]: 5: Hoare triple {14580#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {14580#true} is VALID [2022-04-28 03:53:28,479 INFO L290 TraceCheckUtils]: 6: Hoare triple {14580#true} [137] L16-2-->L16-3_primed: Formula: (let ((.cse3 (mod v_main_~x~0_342 4294967296)) (.cse0 (= v_main_~x~0_342 v_main_~x~0_341)) (.cse1 (= |v_main_#t~post5_125| |v_main_#t~post5_124|)) (.cse2 (= |v_main_#t~post6_125| |v_main_#t~post6_124|))) (or (and .cse0 (= v_main_~y~0_324 v_main_~y~0_323) .cse1 .cse2) (and (< 0 .cse3) (= (+ v_main_~x~0_342 v_main_~y~0_324 (* v_main_~x~0_341 (- 1))) v_main_~y~0_323) (< v_main_~x~0_341 v_main_~x~0_342) (forall ((v_it_26 Int)) (or (< 0 (mod (+ v_main_~x~0_342 (* 4294967295 v_it_26)) 4294967296)) (not (<= (+ v_main_~x~0_341 v_it_26 1) v_main_~x~0_342)) (not (<= 1 v_it_26))))) (and (<= .cse3 0) .cse0 (= v_main_~y~0_323 v_main_~y~0_324) .cse1 .cse2))) InVars {main_~y~0=v_main_~y~0_324, main_#t~post5=|v_main_#t~post5_125|, main_~x~0=v_main_~x~0_342, main_#t~post6=|v_main_#t~post6_125|} OutVars{main_~y~0=v_main_~y~0_323, main_#t~post5=|v_main_#t~post5_124|, main_~x~0=v_main_~x~0_341, main_#t~post6=|v_main_#t~post6_124|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {14580#true} is VALID [2022-04-28 03:53:28,479 INFO L290 TraceCheckUtils]: 7: Hoare triple {14580#true} [136] 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[] {14580#true} is VALID [2022-04-28 03:53:28,479 INFO L290 TraceCheckUtils]: 8: Hoare triple {14580#true} ~z~0 := ~y~0; {14585#(= (+ main_~z~0 (* (- 1) main_~y~0)) 0)} is VALID [2022-04-28 03:53:28,480 INFO L290 TraceCheckUtils]: 9: Hoare triple {14585#(= (+ 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; {14586#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-28 03:53:28,481 INFO L290 TraceCheckUtils]: 10: Hoare triple {14586#(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; {14587#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-28 03:53:28,481 INFO L290 TraceCheckUtils]: 11: Hoare triple {14587#(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; {14588#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-28 03:53:28,482 INFO L290 TraceCheckUtils]: 12: Hoare triple {14588#(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; {14589#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-28 03:53:28,483 INFO L290 TraceCheckUtils]: 13: Hoare triple {14589#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} assume !(~z~0 % 4294967296 > 0); {14589#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-28 03:53:28,484 INFO L290 TraceCheckUtils]: 14: Hoare triple {14589#(<= 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; {14590#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-28 03:53:28,485 INFO L290 TraceCheckUtils]: 15: Hoare triple {14590#(<= 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; {14591#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-28 03:53:28,486 INFO L290 TraceCheckUtils]: 16: Hoare triple {14591#(<= 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; {14592#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-28 03:53:28,486 INFO L290 TraceCheckUtils]: 17: Hoare triple {14592#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {14581#false} is VALID [2022-04-28 03:53:28,486 INFO L290 TraceCheckUtils]: 18: Hoare triple {14581#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; {14581#false} is VALID [2022-04-28 03:53:28,486 INFO L290 TraceCheckUtils]: 19: Hoare triple {14581#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; {14581#false} is VALID [2022-04-28 03:53:28,486 INFO L290 TraceCheckUtils]: 20: Hoare triple {14581#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; {14581#false} is VALID [2022-04-28 03:53:28,486 INFO L290 TraceCheckUtils]: 21: Hoare triple {14581#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; {14581#false} is VALID [2022-04-28 03:53:28,487 INFO L290 TraceCheckUtils]: 22: Hoare triple {14581#false} assume !(~x~0 % 4294967296 > 0); {14581#false} is VALID [2022-04-28 03:53:28,487 INFO L290 TraceCheckUtils]: 23: Hoare triple {14581#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {14581#false} is VALID [2022-04-28 03:53:28,487 INFO L290 TraceCheckUtils]: 24: Hoare triple {14581#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {14581#false} is VALID [2022-04-28 03:53:28,487 INFO L290 TraceCheckUtils]: 25: Hoare triple {14581#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {14581#false} is VALID [2022-04-28 03:53:28,487 INFO L290 TraceCheckUtils]: 26: Hoare triple {14581#false} assume !(~z~0 % 4294967296 > 0); {14581#false} is VALID [2022-04-28 03:53:28,487 INFO L272 TraceCheckUtils]: 27: Hoare triple {14581#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {14581#false} is VALID [2022-04-28 03:53:28,487 INFO L290 TraceCheckUtils]: 28: Hoare triple {14581#false} ~cond := #in~cond; {14581#false} is VALID [2022-04-28 03:53:28,487 INFO L290 TraceCheckUtils]: 29: Hoare triple {14581#false} assume 0 == ~cond; {14581#false} is VALID [2022-04-28 03:53:28,487 INFO L290 TraceCheckUtils]: 30: Hoare triple {14581#false} assume !false; {14581#false} is VALID [2022-04-28 03:53:28,487 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-28 03:53:28,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:53:28,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620550364] [2022-04-28 03:53:28,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620550364] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:53:28,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1434143025] [2022-04-28 03:53:28,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:53:28,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:53:28,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:53:28,488 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:53:28,492 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-04-28 03:53:28,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:53:28,530 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-28 03:53:28,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:53:28,537 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:53:28,874 INFO L272 TraceCheckUtils]: 0: Hoare triple {14580#true} call ULTIMATE.init(); {14580#true} is VALID [2022-04-28 03:53:28,874 INFO L290 TraceCheckUtils]: 1: Hoare triple {14580#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {14580#true} is VALID [2022-04-28 03:53:28,874 INFO L290 TraceCheckUtils]: 2: Hoare triple {14580#true} assume true; {14580#true} is VALID [2022-04-28 03:53:28,874 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14580#true} {14580#true} #83#return; {14580#true} is VALID [2022-04-28 03:53:28,874 INFO L272 TraceCheckUtils]: 4: Hoare triple {14580#true} call #t~ret15 := main(); {14580#true} is VALID [2022-04-28 03:53:28,874 INFO L290 TraceCheckUtils]: 5: Hoare triple {14580#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {14580#true} is VALID [2022-04-28 03:53:28,875 INFO L290 TraceCheckUtils]: 6: Hoare triple {14580#true} [137] L16-2-->L16-3_primed: Formula: (let ((.cse3 (mod v_main_~x~0_342 4294967296)) (.cse0 (= v_main_~x~0_342 v_main_~x~0_341)) (.cse1 (= |v_main_#t~post5_125| |v_main_#t~post5_124|)) (.cse2 (= |v_main_#t~post6_125| |v_main_#t~post6_124|))) (or (and .cse0 (= v_main_~y~0_324 v_main_~y~0_323) .cse1 .cse2) (and (< 0 .cse3) (= (+ v_main_~x~0_342 v_main_~y~0_324 (* v_main_~x~0_341 (- 1))) v_main_~y~0_323) (< v_main_~x~0_341 v_main_~x~0_342) (forall ((v_it_26 Int)) (or (< 0 (mod (+ v_main_~x~0_342 (* 4294967295 v_it_26)) 4294967296)) (not (<= (+ v_main_~x~0_341 v_it_26 1) v_main_~x~0_342)) (not (<= 1 v_it_26))))) (and (<= .cse3 0) .cse0 (= v_main_~y~0_323 v_main_~y~0_324) .cse1 .cse2))) InVars {main_~y~0=v_main_~y~0_324, main_#t~post5=|v_main_#t~post5_125|, main_~x~0=v_main_~x~0_342, main_#t~post6=|v_main_#t~post6_125|} OutVars{main_~y~0=v_main_~y~0_323, main_#t~post5=|v_main_#t~post5_124|, main_~x~0=v_main_~x~0_341, main_#t~post6=|v_main_#t~post6_124|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {14580#true} is VALID [2022-04-28 03:53:28,875 INFO L290 TraceCheckUtils]: 7: Hoare triple {14580#true} [136] 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[] {14580#true} is VALID [2022-04-28 03:53:28,875 INFO L290 TraceCheckUtils]: 8: Hoare triple {14580#true} ~z~0 := ~y~0; {14585#(= (+ main_~z~0 (* (- 1) main_~y~0)) 0)} is VALID [2022-04-28 03:53:28,876 INFO L290 TraceCheckUtils]: 9: Hoare triple {14585#(= (+ 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; {14586#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-28 03:53:28,876 INFO L290 TraceCheckUtils]: 10: Hoare triple {14586#(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; {14587#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-28 03:53:28,877 INFO L290 TraceCheckUtils]: 11: Hoare triple {14587#(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; {14588#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-28 03:53:28,878 INFO L290 TraceCheckUtils]: 12: Hoare triple {14588#(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; {14589#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-28 03:53:28,878 INFO L290 TraceCheckUtils]: 13: Hoare triple {14589#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} assume !(~z~0 % 4294967296 > 0); {14589#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-28 03:53:28,879 INFO L290 TraceCheckUtils]: 14: Hoare triple {14589#(<= 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; {14590#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-28 03:53:28,880 INFO L290 TraceCheckUtils]: 15: Hoare triple {14590#(<= 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; {14591#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-28 03:53:28,881 INFO L290 TraceCheckUtils]: 16: Hoare triple {14591#(<= 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; {14592#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-28 03:53:28,881 INFO L290 TraceCheckUtils]: 17: Hoare triple {14592#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {14581#false} is VALID [2022-04-28 03:53:28,881 INFO L290 TraceCheckUtils]: 18: Hoare triple {14581#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; {14581#false} is VALID [2022-04-28 03:53:28,882 INFO L290 TraceCheckUtils]: 19: Hoare triple {14581#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; {14581#false} is VALID [2022-04-28 03:53:28,882 INFO L290 TraceCheckUtils]: 20: Hoare triple {14581#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; {14581#false} is VALID [2022-04-28 03:53:28,882 INFO L290 TraceCheckUtils]: 21: Hoare triple {14581#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; {14581#false} is VALID [2022-04-28 03:53:28,882 INFO L290 TraceCheckUtils]: 22: Hoare triple {14581#false} assume !(~x~0 % 4294967296 > 0); {14581#false} is VALID [2022-04-28 03:53:28,882 INFO L290 TraceCheckUtils]: 23: Hoare triple {14581#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {14581#false} is VALID [2022-04-28 03:53:28,882 INFO L290 TraceCheckUtils]: 24: Hoare triple {14581#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {14581#false} is VALID [2022-04-28 03:53:28,882 INFO L290 TraceCheckUtils]: 25: Hoare triple {14581#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {14581#false} is VALID [2022-04-28 03:53:28,882 INFO L290 TraceCheckUtils]: 26: Hoare triple {14581#false} assume !(~z~0 % 4294967296 > 0); {14581#false} is VALID [2022-04-28 03:53:28,882 INFO L272 TraceCheckUtils]: 27: Hoare triple {14581#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {14581#false} is VALID [2022-04-28 03:53:28,882 INFO L290 TraceCheckUtils]: 28: Hoare triple {14581#false} ~cond := #in~cond; {14581#false} is VALID [2022-04-28 03:53:28,882 INFO L290 TraceCheckUtils]: 29: Hoare triple {14581#false} assume 0 == ~cond; {14581#false} is VALID [2022-04-28 03:53:28,882 INFO L290 TraceCheckUtils]: 30: Hoare triple {14581#false} assume !false; {14581#false} is VALID [2022-04-28 03:53:28,882 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-28 03:53:28,882 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:53:29,225 INFO L290 TraceCheckUtils]: 30: Hoare triple {14581#false} assume !false; {14581#false} is VALID [2022-04-28 03:53:29,225 INFO L290 TraceCheckUtils]: 29: Hoare triple {14581#false} assume 0 == ~cond; {14581#false} is VALID [2022-04-28 03:53:29,225 INFO L290 TraceCheckUtils]: 28: Hoare triple {14581#false} ~cond := #in~cond; {14581#false} is VALID [2022-04-28 03:53:29,225 INFO L272 TraceCheckUtils]: 27: Hoare triple {14581#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {14581#false} is VALID [2022-04-28 03:53:29,225 INFO L290 TraceCheckUtils]: 26: Hoare triple {14581#false} assume !(~z~0 % 4294967296 > 0); {14581#false} is VALID [2022-04-28 03:53:29,225 INFO L290 TraceCheckUtils]: 25: Hoare triple {14581#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {14581#false} is VALID [2022-04-28 03:53:29,225 INFO L290 TraceCheckUtils]: 24: Hoare triple {14581#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {14581#false} is VALID [2022-04-28 03:53:29,225 INFO L290 TraceCheckUtils]: 23: Hoare triple {14581#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {14581#false} is VALID [2022-04-28 03:53:29,226 INFO L290 TraceCheckUtils]: 22: Hoare triple {14581#false} assume !(~x~0 % 4294967296 > 0); {14581#false} is VALID [2022-04-28 03:53:29,226 INFO L290 TraceCheckUtils]: 21: Hoare triple {14581#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; {14581#false} is VALID [2022-04-28 03:53:29,226 INFO L290 TraceCheckUtils]: 20: Hoare triple {14581#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; {14581#false} is VALID [2022-04-28 03:53:29,226 INFO L290 TraceCheckUtils]: 19: Hoare triple {14581#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; {14581#false} is VALID [2022-04-28 03:53:29,226 INFO L290 TraceCheckUtils]: 18: Hoare triple {14581#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; {14581#false} is VALID [2022-04-28 03:53:29,226 INFO L290 TraceCheckUtils]: 17: Hoare triple {14592#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} assume !(~y~0 % 4294967296 > 0); {14581#false} is VALID [2022-04-28 03:53:29,227 INFO L290 TraceCheckUtils]: 16: Hoare triple {14591#(<= 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; {14592#(<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0)} is VALID [2022-04-28 03:53:29,228 INFO L290 TraceCheckUtils]: 15: Hoare triple {14590#(<= 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; {14591#(<= main_~y~0 (+ (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-28 03:53:29,229 INFO L290 TraceCheckUtils]: 14: Hoare triple {14589#(<= 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; {14590#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296) 4294967297))} is VALID [2022-04-28 03:53:29,229 INFO L290 TraceCheckUtils]: 13: Hoare triple {14589#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} assume !(~z~0 % 4294967296 > 0); {14589#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-28 03:53:29,230 INFO L290 TraceCheckUtils]: 12: Hoare triple {14741#(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; {14589#(<= main_~y~0 (+ (* (div (+ main_~y~0 (- 4)) 4294967296) 4294967296) 4294967298))} is VALID [2022-04-28 03:53:29,231 INFO L290 TraceCheckUtils]: 11: Hoare triple {14745#(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; {14741#(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:53:29,232 INFO L290 TraceCheckUtils]: 10: Hoare triple {14749#(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; {14745#(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:53:29,233 INFO L290 TraceCheckUtils]: 9: Hoare triple {14753#(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; {14749#(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:53:29,234 INFO L290 TraceCheckUtils]: 8: Hoare triple {14580#true} ~z~0 := ~y~0; {14753#(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:53:29,234 INFO L290 TraceCheckUtils]: 7: Hoare triple {14580#true} [136] 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[] {14580#true} is VALID [2022-04-28 03:53:29,234 INFO L290 TraceCheckUtils]: 6: Hoare triple {14580#true} [137] L16-2-->L16-3_primed: Formula: (let ((.cse3 (mod v_main_~x~0_342 4294967296)) (.cse0 (= v_main_~x~0_342 v_main_~x~0_341)) (.cse1 (= |v_main_#t~post5_125| |v_main_#t~post5_124|)) (.cse2 (= |v_main_#t~post6_125| |v_main_#t~post6_124|))) (or (and .cse0 (= v_main_~y~0_324 v_main_~y~0_323) .cse1 .cse2) (and (< 0 .cse3) (= (+ v_main_~x~0_342 v_main_~y~0_324 (* v_main_~x~0_341 (- 1))) v_main_~y~0_323) (< v_main_~x~0_341 v_main_~x~0_342) (forall ((v_it_26 Int)) (or (< 0 (mod (+ v_main_~x~0_342 (* 4294967295 v_it_26)) 4294967296)) (not (<= (+ v_main_~x~0_341 v_it_26 1) v_main_~x~0_342)) (not (<= 1 v_it_26))))) (and (<= .cse3 0) .cse0 (= v_main_~y~0_323 v_main_~y~0_324) .cse1 .cse2))) InVars {main_~y~0=v_main_~y~0_324, main_#t~post5=|v_main_#t~post5_125|, main_~x~0=v_main_~x~0_342, main_#t~post6=|v_main_#t~post6_125|} OutVars{main_~y~0=v_main_~y~0_323, main_#t~post5=|v_main_#t~post5_124|, main_~x~0=v_main_~x~0_341, main_#t~post6=|v_main_#t~post6_124|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {14580#true} is VALID [2022-04-28 03:53:29,234 INFO L290 TraceCheckUtils]: 5: Hoare triple {14580#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {14580#true} is VALID [2022-04-28 03:53:29,234 INFO L272 TraceCheckUtils]: 4: Hoare triple {14580#true} call #t~ret15 := main(); {14580#true} is VALID [2022-04-28 03:53:29,234 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14580#true} {14580#true} #83#return; {14580#true} is VALID [2022-04-28 03:53:29,234 INFO L290 TraceCheckUtils]: 2: Hoare triple {14580#true} assume true; {14580#true} is VALID [2022-04-28 03:53:29,234 INFO L290 TraceCheckUtils]: 1: Hoare triple {14580#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {14580#true} is VALID [2022-04-28 03:53:29,235 INFO L272 TraceCheckUtils]: 0: Hoare triple {14580#true} call ULTIMATE.init(); {14580#true} is VALID [2022-04-28 03:53:29,235 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-28 03:53:29,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1434143025] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:53:29,235 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:53:29,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 15 [2022-04-28 03:53:29,325 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:53:29,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [971910859] [2022-04-28 03:53:29,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [971910859] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:53:29,325 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:53:29,325 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 03:53:29,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298586220] [2022-04-28 03:53:29,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:53:29,325 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 13 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 33 [2022-04-28 03:53:29,327 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:53:29,327 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 13 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:53:29,353 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:53:29,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 03:53:29,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:53:29,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 03:53:29,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2022-04-28 03:53:29,354 INFO L87 Difference]: Start difference. First operand 97 states and 124 transitions. Second operand has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 13 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:53:31,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:53:31,984 INFO L93 Difference]: Finished difference Result 128 states and 159 transitions. [2022-04-28 03:53:31,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-28 03:53:31,984 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 13 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 33 [2022-04-28 03:53:31,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:53:31,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 13 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:53:31,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 64 transitions. [2022-04-28 03:53:31,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 13 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:53:31,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 64 transitions. [2022-04-28 03:53:31,986 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 64 transitions. [2022-04-28 03:53:32,093 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:53:32,094 INFO L225 Difference]: With dead ends: 128 [2022-04-28 03:53:32,095 INFO L226 Difference]: Without dead ends: 110 [2022-04-28 03:53:32,095 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 69 SyntacticMatches, 7 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=214, Invalid=976, Unknown=0, NotChecked=0, Total=1190 [2022-04-28 03:53:32,095 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 37 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-28 03:53:32,096 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 73 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-28 03:53:32,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-04-28 03:53:32,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 84. [2022-04-28 03:53:32,710 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:53:32,710 INFO L82 GeneralOperation]: Start isEquivalent. First operand 110 states. Second operand has 84 states, 79 states have (on average 1.3037974683544304) internal successors, (103), 79 states have internal predecessors, (103), 3 states have call successors, (3), 3 states have 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:53:32,710 INFO L74 IsIncluded]: Start isIncluded. First operand 110 states. Second operand has 84 states, 79 states have (on average 1.3037974683544304) internal successors, (103), 79 states have internal predecessors, (103), 3 states have call successors, (3), 3 states have 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:53:32,710 INFO L87 Difference]: Start difference. First operand 110 states. Second operand has 84 states, 79 states have (on average 1.3037974683544304) internal successors, (103), 79 states have internal predecessors, (103), 3 states have call successors, (3), 3 states have 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:53:32,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:53:32,711 INFO L93 Difference]: Finished difference Result 110 states and 138 transitions. [2022-04-28 03:53:32,711 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 138 transitions. [2022-04-28 03:53:32,712 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:53:32,712 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:53:32,712 INFO L74 IsIncluded]: Start isIncluded. First operand has 84 states, 79 states have (on average 1.3037974683544304) internal successors, (103), 79 states have internal predecessors, (103), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 110 states. [2022-04-28 03:53:32,712 INFO L87 Difference]: Start difference. First operand has 84 states, 79 states have (on average 1.3037974683544304) internal successors, (103), 79 states have internal predecessors, (103), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 110 states. [2022-04-28 03:53:32,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:53:32,713 INFO L93 Difference]: Finished difference Result 110 states and 138 transitions. [2022-04-28 03:53:32,713 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 138 transitions. [2022-04-28 03:53:32,713 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:53:32,713 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:53:32,713 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:53:32,713 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:53:32,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 79 states have (on average 1.3037974683544304) internal successors, (103), 79 states have internal predecessors, (103), 3 states have call successors, (3), 3 states have 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:53:32,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 107 transitions. [2022-04-28 03:53:32,714 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 107 transitions. Word has length 33 [2022-04-28 03:53:32,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:53:32,714 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 107 transitions. [2022-04-28 03:53:32,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 13 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:53:32,714 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 84 states and 107 transitions. [2022-04-28 03:53:49,363 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 103 inductive. 0 not inductive. 4 times theorem prover too weak to decide inductivity. [2022-04-28 03:53:49,364 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 107 transitions. [2022-04-28 03:53:49,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-28 03:53:49,364 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:53:49,364 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:53:49,379 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-04-28 03:53:49,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:53:49,569 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:53:49,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:53:49,569 INFO L85 PathProgramCache]: Analyzing trace with hash -1090479377, now seen corresponding path program 14 times [2022-04-28 03:53:49,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:53:49,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [410612529] [2022-04-28 03:53:51,740 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:53:51,742 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:53:51,744 INFO L85 PathProgramCache]: Analyzing trace with hash -2094387346, now seen corresponding path program 1 times [2022-04-28 03:53:51,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:53:51,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460513794] [2022-04-28 03:53:51,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:53:51,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:53:51,753 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_27.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:53:51,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:53:51,780 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_27.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:53:51,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:53:51,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:53:51,912 INFO L290 TraceCheckUtils]: 0: Hoare triple {15480#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {15466#true} is VALID [2022-04-28 03:53:51,912 INFO L290 TraceCheckUtils]: 1: Hoare triple {15466#true} assume true; {15466#true} is VALID [2022-04-28 03:53:51,912 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15466#true} {15466#true} #83#return; {15466#true} is VALID [2022-04-28 03:53:51,913 INFO L272 TraceCheckUtils]: 0: Hoare triple {15466#true} call ULTIMATE.init(); {15480#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:53:51,917 INFO L290 TraceCheckUtils]: 1: Hoare triple {15480#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {15466#true} is VALID [2022-04-28 03:53:51,917 INFO L290 TraceCheckUtils]: 2: Hoare triple {15466#true} assume true; {15466#true} is VALID [2022-04-28 03:53:51,917 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15466#true} {15466#true} #83#return; {15466#true} is VALID [2022-04-28 03:53:51,917 INFO L272 TraceCheckUtils]: 4: Hoare triple {15466#true} call #t~ret15 := main(); {15466#true} is VALID [2022-04-28 03:53:51,917 INFO L290 TraceCheckUtils]: 5: Hoare triple {15466#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {15466#true} is VALID [2022-04-28 03:53:51,918 INFO L290 TraceCheckUtils]: 6: Hoare triple {15466#true} [139] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_362 v_main_~x~0_361)) (.cse1 (= v_main_~y~0_343 v_main_~y~0_342)) (.cse2 (= |v_main_#t~post5_130| |v_main_#t~post5_129|)) (.cse4 (mod v_main_~x~0_362 4294967296)) (.cse3 (= |v_main_#t~post6_130| |v_main_#t~post6_129|))) (or (and .cse0 .cse1 .cse2 .cse3) (and (= (+ v_main_~x~0_362 (* v_main_~x~0_361 (- 1)) v_main_~y~0_343) v_main_~y~0_342) (< 0 .cse4) (< v_main_~x~0_361 v_main_~x~0_362) (forall ((v_it_27 Int)) (or (not (<= (+ v_main_~x~0_361 v_it_27 1) v_main_~x~0_362)) (not (<= 1 v_it_27)) (< 0 (mod (+ v_main_~x~0_362 (* 4294967295 v_it_27)) 4294967296))))) (and .cse0 .cse1 .cse2 (<= .cse4 0) .cse3))) InVars {main_~y~0=v_main_~y~0_343, main_#t~post5=|v_main_#t~post5_130|, main_~x~0=v_main_~x~0_362, main_#t~post6=|v_main_#t~post6_130|} OutVars{main_~y~0=v_main_~y~0_342, main_#t~post5=|v_main_#t~post5_129|, main_~x~0=v_main_~x~0_361, main_#t~post6=|v_main_#t~post6_129|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {15466#true} is VALID [2022-04-28 03:53:51,918 INFO L290 TraceCheckUtils]: 7: Hoare triple {15466#true} [138] 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[] {15466#true} is VALID [2022-04-28 03:53:51,918 INFO L290 TraceCheckUtils]: 8: Hoare triple {15466#true} ~z~0 := ~y~0; {15466#true} is VALID [2022-04-28 03:53:51,920 INFO L290 TraceCheckUtils]: 9: Hoare triple {15466#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {15471#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-28 03:53:51,921 INFO L290 TraceCheckUtils]: 10: Hoare triple {15471#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {15472#(<= main_~z~0 (+ (* (div main_~z~0 4294967296) 4294967296) 4294967293))} is VALID [2022-04-28 03:53:51,922 INFO L290 TraceCheckUtils]: 11: Hoare triple {15472#(<= main_~z~0 (+ (* (div main_~z~0 4294967296) 4294967296) 4294967293))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {15473#(<= main_~z~0 (+ 4294967292 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-28 03:53:51,923 INFO L290 TraceCheckUtils]: 12: Hoare triple {15473#(<= main_~z~0 (+ 4294967292 (* (div main_~z~0 4294967296) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {15474#(<= main_~z~0 (+ 4294967291 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-28 03:53:51,923 INFO L290 TraceCheckUtils]: 13: Hoare triple {15474#(<= main_~z~0 (+ 4294967291 (* (div main_~z~0 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {15474#(<= main_~z~0 (+ 4294967291 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-28 03:53:51,924 INFO L290 TraceCheckUtils]: 14: Hoare triple {15474#(<= main_~z~0 (+ 4294967291 (* (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; {15475#(<= main_~z~0 (+ 4294967292 (* 4294967296 (div (+ (- 1) main_~z~0) 4294967296))))} is VALID [2022-04-28 03:53:51,925 INFO L290 TraceCheckUtils]: 15: Hoare triple {15475#(<= main_~z~0 (+ 4294967292 (* 4294967296 (div (+ (- 1) main_~z~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; {15476#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 4294967296)) 4294967293))} is VALID [2022-04-28 03:53:51,926 INFO L290 TraceCheckUtils]: 16: Hoare triple {15476#(<= main_~z~0 (+ (* 4294967296 (div (+ (- 2) main_~z~0) 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; {15477#(<= main_~z~0 (+ 4294967294 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:53:51,927 INFO L290 TraceCheckUtils]: 17: Hoare triple {15477#(<= main_~z~0 (+ 4294967294 (* (div (+ main_~z~0 (- 3)) 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {15478#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4294967295))} is VALID [2022-04-28 03:53:51,928 INFO L290 TraceCheckUtils]: 18: Hoare triple {15478#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4294967295))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {15479#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 5)) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-28 03:53:51,928 INFO L290 TraceCheckUtils]: 19: Hoare triple {15479#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 5)) 4294967296) 4294967296) 4294967296))} assume !(~y~0 % 4294967296 > 0); {15479#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 5)) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-28 03:53:51,928 INFO L290 TraceCheckUtils]: 20: Hoare triple {15479#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 5)) 4294967296) 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; {15479#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 5)) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-28 03:53:51,929 INFO L290 TraceCheckUtils]: 21: Hoare triple {15479#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 5)) 4294967296) 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; {15479#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 5)) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-28 03:53:51,929 INFO L290 TraceCheckUtils]: 22: Hoare triple {15479#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 5)) 4294967296) 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; {15479#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 5)) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-28 03:53:51,929 INFO L290 TraceCheckUtils]: 23: Hoare triple {15479#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 5)) 4294967296) 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; {15479#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 5)) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-28 03:53:51,930 INFO L290 TraceCheckUtils]: 24: Hoare triple {15479#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 5)) 4294967296) 4294967296) 4294967296))} assume !(~x~0 % 4294967296 > 0); {15479#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 5)) 4294967296) 4294967296) 4294967296))} is VALID [2022-04-28 03:53:51,930 INFO L290 TraceCheckUtils]: 25: Hoare triple {15479#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 5)) 4294967296) 4294967296) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {15478#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4294967295))} is VALID [2022-04-28 03:53:51,931 INFO L290 TraceCheckUtils]: 26: Hoare triple {15478#(<= main_~z~0 (+ (* (div (+ main_~z~0 (- 4)) 4294967296) 4294967296) 4294967295))} assume !(~z~0 % 4294967296 > 0); {15467#false} is VALID [2022-04-28 03:53:51,931 INFO L272 TraceCheckUtils]: 27: Hoare triple {15467#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {15467#false} is VALID [2022-04-28 03:53:51,931 INFO L290 TraceCheckUtils]: 28: Hoare triple {15467#false} ~cond := #in~cond; {15467#false} is VALID [2022-04-28 03:53:51,931 INFO L290 TraceCheckUtils]: 29: Hoare triple {15467#false} assume 0 == ~cond; {15467#false} is VALID [2022-04-28 03:53:51,931 INFO L290 TraceCheckUtils]: 30: Hoare triple {15467#false} assume !false; {15467#false} is VALID [2022-04-28 03:53:51,932 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 10 proven. 16 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 03:53:51,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:53:51,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460513794] [2022-04-28 03:53:51,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460513794] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:53:51,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [903902980] [2022-04-28 03:53:51,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:53:51,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:53:51,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:53:51,933 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:53:51,933 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-04-28 03:53:51,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:53:51,976 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-28 03:53:51,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:53:51,983 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:53:52,194 INFO L272 TraceCheckUtils]: 0: Hoare triple {15466#true} call ULTIMATE.init(); {15466#true} is VALID [2022-04-28 03:53:52,194 INFO L290 TraceCheckUtils]: 1: Hoare triple {15466#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {15466#true} is VALID [2022-04-28 03:53:52,194 INFO L290 TraceCheckUtils]: 2: Hoare triple {15466#true} assume true; {15466#true} is VALID [2022-04-28 03:53:52,194 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15466#true} {15466#true} #83#return; {15466#true} is VALID [2022-04-28 03:53:52,194 INFO L272 TraceCheckUtils]: 4: Hoare triple {15466#true} call #t~ret15 := main(); {15466#true} is VALID [2022-04-28 03:53:52,194 INFO L290 TraceCheckUtils]: 5: Hoare triple {15466#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {15466#true} is VALID [2022-04-28 03:53:52,194 INFO L290 TraceCheckUtils]: 6: Hoare triple {15466#true} [139] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_362 v_main_~x~0_361)) (.cse1 (= v_main_~y~0_343 v_main_~y~0_342)) (.cse2 (= |v_main_#t~post5_130| |v_main_#t~post5_129|)) (.cse4 (mod v_main_~x~0_362 4294967296)) (.cse3 (= |v_main_#t~post6_130| |v_main_#t~post6_129|))) (or (and .cse0 .cse1 .cse2 .cse3) (and (= (+ v_main_~x~0_362 (* v_main_~x~0_361 (- 1)) v_main_~y~0_343) v_main_~y~0_342) (< 0 .cse4) (< v_main_~x~0_361 v_main_~x~0_362) (forall ((v_it_27 Int)) (or (not (<= (+ v_main_~x~0_361 v_it_27 1) v_main_~x~0_362)) (not (<= 1 v_it_27)) (< 0 (mod (+ v_main_~x~0_362 (* 4294967295 v_it_27)) 4294967296))))) (and .cse0 .cse1 .cse2 (<= .cse4 0) .cse3))) InVars {main_~y~0=v_main_~y~0_343, main_#t~post5=|v_main_#t~post5_130|, main_~x~0=v_main_~x~0_362, main_#t~post6=|v_main_#t~post6_130|} OutVars{main_~y~0=v_main_~y~0_342, main_#t~post5=|v_main_#t~post5_129|, main_~x~0=v_main_~x~0_361, main_#t~post6=|v_main_#t~post6_129|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {15466#true} is VALID [2022-04-28 03:53:52,194 INFO L290 TraceCheckUtils]: 7: Hoare triple {15466#true} [138] 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[] {15466#true} is VALID [2022-04-28 03:53:52,195 INFO L290 TraceCheckUtils]: 8: Hoare triple {15466#true} ~z~0 := ~y~0; {15508#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 03:53:52,195 INFO L290 TraceCheckUtils]: 9: Hoare triple {15508#(= 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; {15512#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-28 03:53:52,196 INFO L290 TraceCheckUtils]: 10: Hoare triple {15512#(= 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; {15516#(= main_~y~0 (+ main_~z~0 2))} is VALID [2022-04-28 03:53:52,196 INFO L290 TraceCheckUtils]: 11: Hoare triple {15516#(= 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; {15520#(= (+ (- 2) main_~y~0) (+ main_~z~0 1))} is VALID [2022-04-28 03:53:52,197 INFO L290 TraceCheckUtils]: 12: Hoare triple {15520#(= (+ (- 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; {15524#(= (+ (- 2) main_~y~0) (+ main_~z~0 2))} is VALID [2022-04-28 03:53:52,197 INFO L290 TraceCheckUtils]: 13: Hoare triple {15524#(= (+ (- 2) main_~y~0) (+ main_~z~0 2))} assume !(~z~0 % 4294967296 > 0); {15528#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-28 03:53:52,198 INFO L290 TraceCheckUtils]: 14: Hoare triple {15528#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {15532#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-28 03:53:52,199 INFO L290 TraceCheckUtils]: 15: Hoare triple {15532#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {15536#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-28 03:53:52,200 INFO L290 TraceCheckUtils]: 16: Hoare triple {15536#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {15540#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 03:53:52,201 INFO L290 TraceCheckUtils]: 17: Hoare triple {15540#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {15544#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 03:53:52,201 INFO L290 TraceCheckUtils]: 18: Hoare triple {15544#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {15467#false} is VALID [2022-04-28 03:53:52,201 INFO L290 TraceCheckUtils]: 19: Hoare triple {15467#false} assume !(~y~0 % 4294967296 > 0); {15467#false} is VALID [2022-04-28 03:53:52,201 INFO L290 TraceCheckUtils]: 20: Hoare triple {15467#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; {15467#false} is VALID [2022-04-28 03:53:52,201 INFO L290 TraceCheckUtils]: 21: Hoare triple {15467#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; {15467#false} is VALID [2022-04-28 03:53:52,201 INFO L290 TraceCheckUtils]: 22: Hoare triple {15467#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; {15467#false} is VALID [2022-04-28 03:53:52,201 INFO L290 TraceCheckUtils]: 23: Hoare triple {15467#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; {15467#false} is VALID [2022-04-28 03:53:52,201 INFO L290 TraceCheckUtils]: 24: Hoare triple {15467#false} assume !(~x~0 % 4294967296 > 0); {15467#false} is VALID [2022-04-28 03:53:52,201 INFO L290 TraceCheckUtils]: 25: Hoare triple {15467#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {15467#false} is VALID [2022-04-28 03:53:52,201 INFO L290 TraceCheckUtils]: 26: Hoare triple {15467#false} assume !(~z~0 % 4294967296 > 0); {15467#false} is VALID [2022-04-28 03:53:52,201 INFO L272 TraceCheckUtils]: 27: Hoare triple {15467#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {15467#false} is VALID [2022-04-28 03:53:52,201 INFO L290 TraceCheckUtils]: 28: Hoare triple {15467#false} ~cond := #in~cond; {15467#false} is VALID [2022-04-28 03:53:52,201 INFO L290 TraceCheckUtils]: 29: Hoare triple {15467#false} assume 0 == ~cond; {15467#false} is VALID [2022-04-28 03:53:52,201 INFO L290 TraceCheckUtils]: 30: Hoare triple {15467#false} assume !false; {15467#false} is VALID [2022-04-28 03:53:52,202 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-28 03:53:52,202 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:53:52,451 INFO L290 TraceCheckUtils]: 30: Hoare triple {15467#false} assume !false; {15467#false} is VALID [2022-04-28 03:53:52,451 INFO L290 TraceCheckUtils]: 29: Hoare triple {15467#false} assume 0 == ~cond; {15467#false} is VALID [2022-04-28 03:53:52,451 INFO L290 TraceCheckUtils]: 28: Hoare triple {15467#false} ~cond := #in~cond; {15467#false} is VALID [2022-04-28 03:53:52,451 INFO L272 TraceCheckUtils]: 27: Hoare triple {15467#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {15467#false} is VALID [2022-04-28 03:53:52,451 INFO L290 TraceCheckUtils]: 26: Hoare triple {15467#false} assume !(~z~0 % 4294967296 > 0); {15467#false} is VALID [2022-04-28 03:53:52,451 INFO L290 TraceCheckUtils]: 25: Hoare triple {15467#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {15467#false} is VALID [2022-04-28 03:53:52,451 INFO L290 TraceCheckUtils]: 24: Hoare triple {15467#false} assume !(~x~0 % 4294967296 > 0); {15467#false} is VALID [2022-04-28 03:53:52,451 INFO L290 TraceCheckUtils]: 23: Hoare triple {15467#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; {15467#false} is VALID [2022-04-28 03:53:52,451 INFO L290 TraceCheckUtils]: 22: Hoare triple {15467#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; {15467#false} is VALID [2022-04-28 03:53:52,451 INFO L290 TraceCheckUtils]: 21: Hoare triple {15467#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; {15467#false} is VALID [2022-04-28 03:53:52,451 INFO L290 TraceCheckUtils]: 20: Hoare triple {15467#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; {15467#false} is VALID [2022-04-28 03:53:52,451 INFO L290 TraceCheckUtils]: 19: Hoare triple {15467#false} assume !(~y~0 % 4294967296 > 0); {15467#false} is VALID [2022-04-28 03:53:52,451 INFO L290 TraceCheckUtils]: 18: Hoare triple {15544#(not (< 0 (mod main_~y~0 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {15467#false} is VALID [2022-04-28 03:53:52,453 INFO L290 TraceCheckUtils]: 17: Hoare triple {15540#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {15544#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-28 03:53:52,453 INFO L290 TraceCheckUtils]: 16: Hoare triple {15536#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {15540#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-28 03:53:52,454 INFO L290 TraceCheckUtils]: 15: Hoare triple {15532#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {15536#(not (< 0 (mod (+ main_~y~0 4294967294) 4294967296)))} is VALID [2022-04-28 03:53:52,455 INFO L290 TraceCheckUtils]: 14: Hoare triple {15528#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {15532#(not (< 0 (mod (+ main_~y~0 4294967293) 4294967296)))} is VALID [2022-04-28 03:53:52,455 INFO L290 TraceCheckUtils]: 13: Hoare triple {15635#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {15528#(not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296)))} is VALID [2022-04-28 03:53:52,456 INFO L290 TraceCheckUtils]: 12: Hoare triple {15639#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {15635#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} is VALID [2022-04-28 03:53:52,457 INFO L290 TraceCheckUtils]: 11: Hoare triple {15643#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {15639#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} is VALID [2022-04-28 03:53:52,458 INFO L290 TraceCheckUtils]: 10: Hoare triple {15647#(or (< 0 (mod (+ main_~z~0 4294967293) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {15643#(or (< 0 (mod (+ main_~z~0 4294967294) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} is VALID [2022-04-28 03:53:52,459 INFO L290 TraceCheckUtils]: 9: Hoare triple {15651#(or (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {15647#(or (< 0 (mod (+ main_~z~0 4294967293) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} is VALID [2022-04-28 03:53:52,459 INFO L290 TraceCheckUtils]: 8: Hoare triple {15466#true} ~z~0 := ~y~0; {15651#(or (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~y~0) 4294967296))))} is VALID [2022-04-28 03:53:52,459 INFO L290 TraceCheckUtils]: 7: Hoare triple {15466#true} [138] 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[] {15466#true} is VALID [2022-04-28 03:53:52,460 INFO L290 TraceCheckUtils]: 6: Hoare triple {15466#true} [139] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_362 v_main_~x~0_361)) (.cse1 (= v_main_~y~0_343 v_main_~y~0_342)) (.cse2 (= |v_main_#t~post5_130| |v_main_#t~post5_129|)) (.cse4 (mod v_main_~x~0_362 4294967296)) (.cse3 (= |v_main_#t~post6_130| |v_main_#t~post6_129|))) (or (and .cse0 .cse1 .cse2 .cse3) (and (= (+ v_main_~x~0_362 (* v_main_~x~0_361 (- 1)) v_main_~y~0_343) v_main_~y~0_342) (< 0 .cse4) (< v_main_~x~0_361 v_main_~x~0_362) (forall ((v_it_27 Int)) (or (not (<= (+ v_main_~x~0_361 v_it_27 1) v_main_~x~0_362)) (not (<= 1 v_it_27)) (< 0 (mod (+ v_main_~x~0_362 (* 4294967295 v_it_27)) 4294967296))))) (and .cse0 .cse1 .cse2 (<= .cse4 0) .cse3))) InVars {main_~y~0=v_main_~y~0_343, main_#t~post5=|v_main_#t~post5_130|, main_~x~0=v_main_~x~0_362, main_#t~post6=|v_main_#t~post6_130|} OutVars{main_~y~0=v_main_~y~0_342, main_#t~post5=|v_main_#t~post5_129|, main_~x~0=v_main_~x~0_361, main_#t~post6=|v_main_#t~post6_129|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {15466#true} is VALID [2022-04-28 03:53:52,460 INFO L290 TraceCheckUtils]: 5: Hoare triple {15466#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {15466#true} is VALID [2022-04-28 03:53:52,460 INFO L272 TraceCheckUtils]: 4: Hoare triple {15466#true} call #t~ret15 := main(); {15466#true} is VALID [2022-04-28 03:53:52,460 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15466#true} {15466#true} #83#return; {15466#true} is VALID [2022-04-28 03:53:52,460 INFO L290 TraceCheckUtils]: 2: Hoare triple {15466#true} assume true; {15466#true} is VALID [2022-04-28 03:53:52,460 INFO L290 TraceCheckUtils]: 1: Hoare triple {15466#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {15466#true} is VALID [2022-04-28 03:53:52,460 INFO L272 TraceCheckUtils]: 0: Hoare triple {15466#true} call ULTIMATE.init(); {15466#true} is VALID [2022-04-28 03:53:52,460 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-04-28 03:53:52,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [903902980] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:53:52,460 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:53:52,460 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 27 [2022-04-28 03:53:52,591 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:53:52,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [410612529] [2022-04-28 03:53:52,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [410612529] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:53:52,591 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:53:52,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-28 03:53:52,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921506530] [2022-04-28 03:53:52,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:53:52,591 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 14 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-04-28 03:53:52,591 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:53:52,591 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 14 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:53:52,623 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:53:52,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-28 03:53:52,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:53:52,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-28 03:53:52,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=774, Unknown=0, NotChecked=0, Total=870 [2022-04-28 03:53:52,623 INFO L87 Difference]: Start difference. First operand 84 states and 107 transitions. Second operand has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 14 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:53:55,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:53:55,691 INFO L93 Difference]: Finished difference Result 129 states and 163 transitions. [2022-04-28 03:53:55,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-28 03:53:55,691 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 14 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-04-28 03:53:55,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:53:55,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 14 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:53:55,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 80 transitions. [2022-04-28 03:53:55,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 14 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:53:55,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 80 transitions. [2022-04-28 03:53:55,693 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 80 transitions. [2022-04-28 03:53:55,841 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:53:55,842 INFO L225 Difference]: With dead ends: 129 [2022-04-28 03:53:55,842 INFO L226 Difference]: Without dead ends: 124 [2022-04-28 03:53:55,843 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 54 SyntacticMatches, 2 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 572 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=444, Invalid=2862, Unknown=0, NotChecked=0, Total=3306 [2022-04-28 03:53:55,843 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 51 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-28 03:53:55,843 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 50 Invalid, 382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-28 03:53:55,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-04-28 03:53:56,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 94. [2022-04-28 03:53:56,603 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:53:56,603 INFO L82 GeneralOperation]: Start isEquivalent. First operand 124 states. Second operand has 94 states, 89 states have (on average 1.2808988764044944) internal successors, (114), 89 states have internal predecessors, (114), 3 states have call successors, (3), 3 states have 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:53:56,603 INFO L74 IsIncluded]: Start isIncluded. First operand 124 states. Second operand has 94 states, 89 states have (on average 1.2808988764044944) internal successors, (114), 89 states have internal predecessors, (114), 3 states have call successors, (3), 3 states have 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:53:56,604 INFO L87 Difference]: Start difference. First operand 124 states. Second operand has 94 states, 89 states have (on average 1.2808988764044944) internal successors, (114), 89 states have internal predecessors, (114), 3 states have call successors, (3), 3 states have 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:53:56,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:53:56,605 INFO L93 Difference]: Finished difference Result 124 states and 154 transitions. [2022-04-28 03:53:56,605 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 154 transitions. [2022-04-28 03:53:56,605 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:53:56,605 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:53:56,605 INFO L74 IsIncluded]: Start isIncluded. First operand has 94 states, 89 states have (on average 1.2808988764044944) internal successors, (114), 89 states have internal predecessors, (114), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 124 states. [2022-04-28 03:53:56,605 INFO L87 Difference]: Start difference. First operand has 94 states, 89 states have (on average 1.2808988764044944) internal successors, (114), 89 states have internal predecessors, (114), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 124 states. [2022-04-28 03:53:56,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:53:56,606 INFO L93 Difference]: Finished difference Result 124 states and 154 transitions. [2022-04-28 03:53:56,606 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 154 transitions. [2022-04-28 03:53:56,607 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:53:56,607 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:53:56,607 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:53:56,607 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:53:56,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 89 states have (on average 1.2808988764044944) internal successors, (114), 89 states have internal predecessors, (114), 3 states have call successors, (3), 3 states have 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:53:56,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 118 transitions. [2022-04-28 03:53:56,608 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 118 transitions. Word has length 33 [2022-04-28 03:53:56,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:53:56,608 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 118 transitions. [2022-04-28 03:53:56,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 14 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:53:56,608 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 94 states and 118 transitions. [2022-04-28 03:54:13,257 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 114 inductive. 0 not inductive. 4 times theorem prover too weak to decide inductivity. [2022-04-28 03:54:13,257 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 118 transitions. [2022-04-28 03:54:13,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-28 03:54:13,257 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:54:13,257 INFO L195 NwaCegarLoop]: trace histogram [6, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:54:13,275 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-04-28 03:54:13,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:54:13,459 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:54:13,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:54:13,459 INFO L85 PathProgramCache]: Analyzing trace with hash -1137501164, now seen corresponding path program 15 times [2022-04-28 03:54:13,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:54:13,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [489359128] [2022-04-28 03:54:13,625 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:54:13,627 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:54:13,628 INFO L85 PathProgramCache]: Analyzing trace with hash -1991288907, now seen corresponding path program 1 times [2022-04-28 03:54:13,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:54:13,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28420260] [2022-04-28 03:54:13,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:54:13,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:54:13,639 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_28.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:54:13,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:54:13,653 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_28.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:54:13,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:54:13,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:54:13,802 INFO L290 TraceCheckUtils]: 0: Hoare triple {16450#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {16435#true} is VALID [2022-04-28 03:54:13,802 INFO L290 TraceCheckUtils]: 1: Hoare triple {16435#true} assume true; {16435#true} is VALID [2022-04-28 03:54:13,802 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16435#true} {16435#true} #83#return; {16435#true} is VALID [2022-04-28 03:54:13,803 INFO L272 TraceCheckUtils]: 0: Hoare triple {16435#true} call ULTIMATE.init(); {16450#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:54:13,803 INFO L290 TraceCheckUtils]: 1: Hoare triple {16450#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {16435#true} is VALID [2022-04-28 03:54:13,803 INFO L290 TraceCheckUtils]: 2: Hoare triple {16435#true} assume true; {16435#true} is VALID [2022-04-28 03:54:13,803 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16435#true} {16435#true} #83#return; {16435#true} is VALID [2022-04-28 03:54:13,803 INFO L272 TraceCheckUtils]: 4: Hoare triple {16435#true} call #t~ret15 := main(); {16435#true} is VALID [2022-04-28 03:54:13,803 INFO L290 TraceCheckUtils]: 5: Hoare triple {16435#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {16435#true} is VALID [2022-04-28 03:54:13,803 INFO L290 TraceCheckUtils]: 6: Hoare triple {16435#true} [141] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_380 4294967296)) (.cse1 (= |v_main_#t~post5_135| |v_main_#t~post5_134|)) (.cse2 (= v_main_~y~0_365 v_main_~y~0_364)) (.cse3 (= v_main_~x~0_380 v_main_~x~0_379)) (.cse4 (= |v_main_#t~post6_135| |v_main_#t~post6_134|))) (or (and (= v_main_~x~0_379 (+ v_main_~x~0_380 v_main_~y~0_365 (* (- 1) v_main_~y~0_364))) (< 0 .cse0) (forall ((v_it_28 Int)) (or (< 0 (mod (+ v_main_~x~0_380 (* 4294967295 v_it_28)) 4294967296)) (not (<= 1 v_it_28)) (not (<= (+ v_main_~y~0_365 v_it_28 1) v_main_~y~0_364)))) (< v_main_~y~0_365 v_main_~y~0_364)) (and .cse1 .cse2 (<= .cse0 0) .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_365, main_#t~post5=|v_main_#t~post5_135|, main_~x~0=v_main_~x~0_380, main_#t~post6=|v_main_#t~post6_135|} OutVars{main_~y~0=v_main_~y~0_364, main_#t~post5=|v_main_#t~post5_134|, main_~x~0=v_main_~x~0_379, main_#t~post6=|v_main_#t~post6_134|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {16435#true} is VALID [2022-04-28 03:54:13,803 INFO L290 TraceCheckUtils]: 7: Hoare triple {16435#true} [140] 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[] {16435#true} is VALID [2022-04-28 03:54:13,803 INFO L290 TraceCheckUtils]: 8: Hoare triple {16435#true} ~z~0 := ~y~0; {16440#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-28 03:54:13,804 INFO L290 TraceCheckUtils]: 9: Hoare triple {16440#(and (<= main_~y~0 main_~z~0) (<= 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; {16441#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-28 03:54:13,805 INFO L290 TraceCheckUtils]: 10: Hoare triple {16441#(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; {16442#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-28 03:54:13,805 INFO L290 TraceCheckUtils]: 11: Hoare triple {16442#(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; {16443#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-28 03:54:13,806 INFO L290 TraceCheckUtils]: 12: Hoare triple {16443#(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; {16444#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-28 03:54:13,806 INFO L290 TraceCheckUtils]: 13: Hoare triple {16444#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} assume !(~z~0 % 4294967296 > 0); {16445#(and (<= main_~y~0 (+ (* (div main_~z~0 4294967296) 4294967296) 4)) (<= (+ (* (div main_~z~0 4294967296) 4294967296) 4) main_~y~0))} is VALID [2022-04-28 03:54:13,807 INFO L290 TraceCheckUtils]: 14: Hoare triple {16445#(and (<= main_~y~0 (+ (* (div main_~z~0 4294967296) 4294967296) 4)) (<= (+ (* (div main_~z~0 4294967296) 4294967296) 4) 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; {16446#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:54:13,808 INFO L290 TraceCheckUtils]: 15: Hoare triple {16446#(<= main_~y~0 (+ 3 (* (div (+ main_~y~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; {16447#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:54:13,809 INFO L290 TraceCheckUtils]: 16: Hoare triple {16447#(<= 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; {16448#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-28 03:54:13,810 INFO L290 TraceCheckUtils]: 17: Hoare triple {16448#(<= 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; {16449#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:54:13,811 INFO L290 TraceCheckUtils]: 18: Hoare triple {16449#(<= 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; {16436#false} is VALID [2022-04-28 03:54:13,811 INFO L290 TraceCheckUtils]: 19: Hoare triple {16436#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {16436#false} is VALID [2022-04-28 03:54:13,811 INFO L290 TraceCheckUtils]: 20: Hoare triple {16436#false} assume !(~y~0 % 4294967296 > 0); {16436#false} is VALID [2022-04-28 03:54:13,811 INFO L290 TraceCheckUtils]: 21: Hoare triple {16436#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; {16436#false} is VALID [2022-04-28 03:54:13,811 INFO L290 TraceCheckUtils]: 22: Hoare triple {16436#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; {16436#false} is VALID [2022-04-28 03:54:13,811 INFO L290 TraceCheckUtils]: 23: Hoare triple {16436#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; {16436#false} is VALID [2022-04-28 03:54:13,811 INFO L290 TraceCheckUtils]: 24: Hoare triple {16436#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; {16436#false} is VALID [2022-04-28 03:54:13,811 INFO L290 TraceCheckUtils]: 25: Hoare triple {16436#false} assume !(~x~0 % 4294967296 > 0); {16436#false} is VALID [2022-04-28 03:54:13,811 INFO L290 TraceCheckUtils]: 26: Hoare triple {16436#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {16436#false} is VALID [2022-04-28 03:54:13,811 INFO L290 TraceCheckUtils]: 27: Hoare triple {16436#false} assume !(~z~0 % 4294967296 > 0); {16436#false} is VALID [2022-04-28 03:54:13,811 INFO L272 TraceCheckUtils]: 28: Hoare triple {16436#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {16436#false} is VALID [2022-04-28 03:54:13,811 INFO L290 TraceCheckUtils]: 29: Hoare triple {16436#false} ~cond := #in~cond; {16436#false} is VALID [2022-04-28 03:54:13,811 INFO L290 TraceCheckUtils]: 30: Hoare triple {16436#false} assume 0 == ~cond; {16436#false} is VALID [2022-04-28 03:54:13,811 INFO L290 TraceCheckUtils]: 31: Hoare triple {16436#false} assume !false; {16436#false} is VALID [2022-04-28 03:54:13,811 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 10 proven. 20 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-28 03:54:13,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:54:13,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28420260] [2022-04-28 03:54:13,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28420260] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:54:13,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2130704879] [2022-04-28 03:54:13,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:54:13,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:54:13,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:54:13,813 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:54:13,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-04-28 03:54:13,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:54:13,854 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-28 03:54:13,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:54:13,867 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:54:14,210 INFO L272 TraceCheckUtils]: 0: Hoare triple {16435#true} call ULTIMATE.init(); {16435#true} is VALID [2022-04-28 03:54:14,210 INFO L290 TraceCheckUtils]: 1: Hoare triple {16435#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {16435#true} is VALID [2022-04-28 03:54:14,210 INFO L290 TraceCheckUtils]: 2: Hoare triple {16435#true} assume true; {16435#true} is VALID [2022-04-28 03:54:14,211 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16435#true} {16435#true} #83#return; {16435#true} is VALID [2022-04-28 03:54:14,211 INFO L272 TraceCheckUtils]: 4: Hoare triple {16435#true} call #t~ret15 := main(); {16435#true} is VALID [2022-04-28 03:54:14,211 INFO L290 TraceCheckUtils]: 5: Hoare triple {16435#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {16435#true} is VALID [2022-04-28 03:54:14,211 INFO L290 TraceCheckUtils]: 6: Hoare triple {16435#true} [141] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_380 4294967296)) (.cse1 (= |v_main_#t~post5_135| |v_main_#t~post5_134|)) (.cse2 (= v_main_~y~0_365 v_main_~y~0_364)) (.cse3 (= v_main_~x~0_380 v_main_~x~0_379)) (.cse4 (= |v_main_#t~post6_135| |v_main_#t~post6_134|))) (or (and (= v_main_~x~0_379 (+ v_main_~x~0_380 v_main_~y~0_365 (* (- 1) v_main_~y~0_364))) (< 0 .cse0) (forall ((v_it_28 Int)) (or (< 0 (mod (+ v_main_~x~0_380 (* 4294967295 v_it_28)) 4294967296)) (not (<= 1 v_it_28)) (not (<= (+ v_main_~y~0_365 v_it_28 1) v_main_~y~0_364)))) (< v_main_~y~0_365 v_main_~y~0_364)) (and .cse1 .cse2 (<= .cse0 0) .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_365, main_#t~post5=|v_main_#t~post5_135|, main_~x~0=v_main_~x~0_380, main_#t~post6=|v_main_#t~post6_135|} OutVars{main_~y~0=v_main_~y~0_364, main_#t~post5=|v_main_#t~post5_134|, main_~x~0=v_main_~x~0_379, main_#t~post6=|v_main_#t~post6_134|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {16435#true} is VALID [2022-04-28 03:54:14,211 INFO L290 TraceCheckUtils]: 7: Hoare triple {16435#true} [140] 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[] {16435#true} is VALID [2022-04-28 03:54:14,211 INFO L290 TraceCheckUtils]: 8: Hoare triple {16435#true} ~z~0 := ~y~0; {16440#(and (<= main_~y~0 main_~z~0) (<= main_~z~0 main_~y~0))} is VALID [2022-04-28 03:54:14,212 INFO L290 TraceCheckUtils]: 9: Hoare triple {16440#(and (<= main_~y~0 main_~z~0) (<= 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; {16441#(and (<= main_~y~0 (+ main_~z~0 1)) (<= (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-28 03:54:14,213 INFO L290 TraceCheckUtils]: 10: Hoare triple {16441#(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; {16442#(and (<= main_~y~0 (+ main_~z~0 2)) (<= (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-28 03:54:14,213 INFO L290 TraceCheckUtils]: 11: Hoare triple {16442#(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; {16443#(and (<= (+ main_~z~0 3) main_~y~0) (<= main_~y~0 (+ main_~z~0 3)))} is VALID [2022-04-28 03:54:14,214 INFO L290 TraceCheckUtils]: 12: Hoare triple {16443#(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; {16444#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-28 03:54:14,215 INFO L290 TraceCheckUtils]: 13: Hoare triple {16444#(and (<= main_~y~0 (+ main_~z~0 4)) (<= (+ main_~z~0 4) main_~y~0))} assume !(~z~0 % 4294967296 > 0); {16493#(<= (div (+ (* (- 1) main_~y~0) 4) (- 4294967296)) (div (+ main_~y~0 (- 4)) 4294967296))} is VALID [2022-04-28 03:54:14,216 INFO L290 TraceCheckUtils]: 14: Hoare triple {16493#(<= (div (+ (* (- 1) main_~y~0) 4) (- 4294967296)) (div (+ main_~y~0 (- 4)) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {16446#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:54:14,217 INFO L290 TraceCheckUtils]: 15: Hoare triple {16446#(<= main_~y~0 (+ 3 (* (div (+ main_~y~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; {16447#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:54:14,217 INFO L290 TraceCheckUtils]: 16: Hoare triple {16447#(<= 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; {16448#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-28 03:54:14,219 INFO L290 TraceCheckUtils]: 17: Hoare triple {16448#(<= 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; {16449#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:54:14,219 INFO L290 TraceCheckUtils]: 18: Hoare triple {16449#(<= 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; {16436#false} is VALID [2022-04-28 03:54:14,219 INFO L290 TraceCheckUtils]: 19: Hoare triple {16436#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {16436#false} is VALID [2022-04-28 03:54:14,219 INFO L290 TraceCheckUtils]: 20: Hoare triple {16436#false} assume !(~y~0 % 4294967296 > 0); {16436#false} is VALID [2022-04-28 03:54:14,219 INFO L290 TraceCheckUtils]: 21: Hoare triple {16436#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; {16436#false} is VALID [2022-04-28 03:54:14,219 INFO L290 TraceCheckUtils]: 22: Hoare triple {16436#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; {16436#false} is VALID [2022-04-28 03:54:14,220 INFO L290 TraceCheckUtils]: 23: Hoare triple {16436#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; {16436#false} is VALID [2022-04-28 03:54:14,220 INFO L290 TraceCheckUtils]: 24: Hoare triple {16436#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; {16436#false} is VALID [2022-04-28 03:54:14,220 INFO L290 TraceCheckUtils]: 25: Hoare triple {16436#false} assume !(~x~0 % 4294967296 > 0); {16436#false} is VALID [2022-04-28 03:54:14,220 INFO L290 TraceCheckUtils]: 26: Hoare triple {16436#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {16436#false} is VALID [2022-04-28 03:54:14,220 INFO L290 TraceCheckUtils]: 27: Hoare triple {16436#false} assume !(~z~0 % 4294967296 > 0); {16436#false} is VALID [2022-04-28 03:54:14,220 INFO L272 TraceCheckUtils]: 28: Hoare triple {16436#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {16436#false} is VALID [2022-04-28 03:54:14,220 INFO L290 TraceCheckUtils]: 29: Hoare triple {16436#false} ~cond := #in~cond; {16436#false} is VALID [2022-04-28 03:54:14,220 INFO L290 TraceCheckUtils]: 30: Hoare triple {16436#false} assume 0 == ~cond; {16436#false} is VALID [2022-04-28 03:54:14,220 INFO L290 TraceCheckUtils]: 31: Hoare triple {16436#false} assume !false; {16436#false} is VALID [2022-04-28 03:54:14,220 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 10 proven. 20 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-28 03:54:14,220 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:54:14,846 INFO L290 TraceCheckUtils]: 31: Hoare triple {16436#false} assume !false; {16436#false} is VALID [2022-04-28 03:54:14,846 INFO L290 TraceCheckUtils]: 30: Hoare triple {16436#false} assume 0 == ~cond; {16436#false} is VALID [2022-04-28 03:54:14,846 INFO L290 TraceCheckUtils]: 29: Hoare triple {16436#false} ~cond := #in~cond; {16436#false} is VALID [2022-04-28 03:54:14,846 INFO L272 TraceCheckUtils]: 28: Hoare triple {16436#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {16436#false} is VALID [2022-04-28 03:54:14,846 INFO L290 TraceCheckUtils]: 27: Hoare triple {16436#false} assume !(~z~0 % 4294967296 > 0); {16436#false} is VALID [2022-04-28 03:54:14,846 INFO L290 TraceCheckUtils]: 26: Hoare triple {16436#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {16436#false} is VALID [2022-04-28 03:54:14,846 INFO L290 TraceCheckUtils]: 25: Hoare triple {16436#false} assume !(~x~0 % 4294967296 > 0); {16436#false} is VALID [2022-04-28 03:54:14,846 INFO L290 TraceCheckUtils]: 24: Hoare triple {16436#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; {16436#false} is VALID [2022-04-28 03:54:14,846 INFO L290 TraceCheckUtils]: 23: Hoare triple {16436#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; {16436#false} is VALID [2022-04-28 03:54:14,846 INFO L290 TraceCheckUtils]: 22: Hoare triple {16436#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; {16436#false} is VALID [2022-04-28 03:54:14,846 INFO L290 TraceCheckUtils]: 21: Hoare triple {16436#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; {16436#false} is VALID [2022-04-28 03:54:14,846 INFO L290 TraceCheckUtils]: 20: Hoare triple {16436#false} assume !(~y~0 % 4294967296 > 0); {16436#false} is VALID [2022-04-28 03:54:14,846 INFO L290 TraceCheckUtils]: 19: Hoare triple {16436#false} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {16436#false} is VALID [2022-04-28 03:54:14,847 INFO L290 TraceCheckUtils]: 18: Hoare triple {16449#(<= 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; {16436#false} is VALID [2022-04-28 03:54:14,848 INFO L290 TraceCheckUtils]: 17: Hoare triple {16448#(<= 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; {16449#(<= main_~y~0 (* (div main_~y~0 4294967296) 4294967296))} is VALID [2022-04-28 03:54:14,849 INFO L290 TraceCheckUtils]: 16: Hoare triple {16447#(<= 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; {16448#(<= main_~y~0 (+ (* 4294967296 (div (+ (- 1) main_~y~0) 4294967296)) 1))} is VALID [2022-04-28 03:54:14,850 INFO L290 TraceCheckUtils]: 15: Hoare triple {16446#(<= main_~y~0 (+ 3 (* (div (+ main_~y~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; {16447#(<= main_~y~0 (+ 2 (* (div (+ (- 2) main_~y~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:54:14,851 INFO L290 TraceCheckUtils]: 14: Hoare triple {16493#(<= (div (+ (* (- 1) main_~y~0) 4) (- 4294967296)) (div (+ main_~y~0 (- 4)) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {16446#(<= main_~y~0 (+ 3 (* (div (+ main_~y~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:54:14,851 INFO L290 TraceCheckUtils]: 13: Hoare triple {16602#(or (<= (div (+ (* (- 1) main_~y~0) 4) (- 4294967296)) (div (+ main_~y~0 (- 4)) 4294967296)) (< 0 (mod main_~z~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {16493#(<= (div (+ (* (- 1) main_~y~0) 4) (- 4294967296)) (div (+ main_~y~0 (- 4)) 4294967296))} is VALID [2022-04-28 03:54:14,852 INFO L290 TraceCheckUtils]: 12: Hoare triple {16606#(or (<= (div (+ (* (- 1) main_~y~0) 4) (- 4294967296)) (div (+ main_~y~0 (- 4)) 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; {16602#(or (<= (div (+ (* (- 1) main_~y~0) 4) (- 4294967296)) (div (+ main_~y~0 (- 4)) 4294967296)) (< 0 (mod main_~z~0 4294967296)))} is VALID [2022-04-28 03:54:14,853 INFO L290 TraceCheckUtils]: 11: Hoare triple {16610#(or (<= (div (+ (* (- 1) main_~y~0) 4) (- 4294967296)) (div (+ main_~y~0 (- 4)) 4294967296)) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {16606#(or (<= (div (+ (* (- 1) main_~y~0) 4) (- 4294967296)) (div (+ main_~y~0 (- 4)) 4294967296)) (< 0 (mod (+ main_~z~0 4294967295) 4294967296)))} is VALID [2022-04-28 03:54:14,854 INFO L290 TraceCheckUtils]: 10: Hoare triple {16614#(or (<= (div (+ (* (- 1) main_~y~0) 4) (- 4294967296)) (div (+ main_~y~0 (- 4)) 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; {16610#(or (<= (div (+ (* (- 1) main_~y~0) 4) (- 4294967296)) (div (+ main_~y~0 (- 4)) 4294967296)) (< 0 (mod (+ main_~z~0 4294967294) 4294967296)))} is VALID [2022-04-28 03:54:14,864 INFO L290 TraceCheckUtils]: 9: Hoare triple {16618#(or (<= (div (+ (* (- 1) main_~y~0) 4) (- 4294967296)) (div (+ main_~y~0 (- 4)) 4294967296)) (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {16614#(or (<= (div (+ (* (- 1) main_~y~0) 4) (- 4294967296)) (div (+ main_~y~0 (- 4)) 4294967296)) (< 0 (mod (+ main_~z~0 4294967293) 4294967296)))} is VALID [2022-04-28 03:54:14,865 INFO L290 TraceCheckUtils]: 8: Hoare triple {16435#true} ~z~0 := ~y~0; {16618#(or (<= (div (+ (* (- 1) main_~y~0) 4) (- 4294967296)) (div (+ main_~y~0 (- 4)) 4294967296)) (< 0 (mod (+ 4294967292 main_~z~0) 4294967296)))} is VALID [2022-04-28 03:54:14,865 INFO L290 TraceCheckUtils]: 7: Hoare triple {16435#true} [140] 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[] {16435#true} is VALID [2022-04-28 03:54:14,865 INFO L290 TraceCheckUtils]: 6: Hoare triple {16435#true} [141] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_380 4294967296)) (.cse1 (= |v_main_#t~post5_135| |v_main_#t~post5_134|)) (.cse2 (= v_main_~y~0_365 v_main_~y~0_364)) (.cse3 (= v_main_~x~0_380 v_main_~x~0_379)) (.cse4 (= |v_main_#t~post6_135| |v_main_#t~post6_134|))) (or (and (= v_main_~x~0_379 (+ v_main_~x~0_380 v_main_~y~0_365 (* (- 1) v_main_~y~0_364))) (< 0 .cse0) (forall ((v_it_28 Int)) (or (< 0 (mod (+ v_main_~x~0_380 (* 4294967295 v_it_28)) 4294967296)) (not (<= 1 v_it_28)) (not (<= (+ v_main_~y~0_365 v_it_28 1) v_main_~y~0_364)))) (< v_main_~y~0_365 v_main_~y~0_364)) (and .cse1 .cse2 (<= .cse0 0) .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_365, main_#t~post5=|v_main_#t~post5_135|, main_~x~0=v_main_~x~0_380, main_#t~post6=|v_main_#t~post6_135|} OutVars{main_~y~0=v_main_~y~0_364, main_#t~post5=|v_main_#t~post5_134|, main_~x~0=v_main_~x~0_379, main_#t~post6=|v_main_#t~post6_134|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {16435#true} is VALID [2022-04-28 03:54:14,865 INFO L290 TraceCheckUtils]: 5: Hoare triple {16435#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {16435#true} is VALID [2022-04-28 03:54:14,866 INFO L272 TraceCheckUtils]: 4: Hoare triple {16435#true} call #t~ret15 := main(); {16435#true} is VALID [2022-04-28 03:54:14,866 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16435#true} {16435#true} #83#return; {16435#true} is VALID [2022-04-28 03:54:14,866 INFO L290 TraceCheckUtils]: 2: Hoare triple {16435#true} assume true; {16435#true} is VALID [2022-04-28 03:54:14,866 INFO L290 TraceCheckUtils]: 1: Hoare triple {16435#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {16435#true} is VALID [2022-04-28 03:54:14,866 INFO L272 TraceCheckUtils]: 0: Hoare triple {16435#true} call ULTIMATE.init(); {16435#true} is VALID [2022-04-28 03:54:14,866 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 10 proven. 20 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-28 03:54:14,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2130704879] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:54:14,866 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:54:14,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 19 [2022-04-28 03:54:15,003 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:54:15,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [489359128] [2022-04-28 03:54:15,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [489359128] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:54:15,003 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:54:15,003 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-28 03:54:15,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999090452] [2022-04-28 03:54:15,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:54:15,004 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.6875) internal successors, (27), 15 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2022-04-28 03:54:15,004 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:54:15,004 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 1.6875) internal successors, (27), 15 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:54:15,030 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:54:15,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-28 03:54:15,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:54:15,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-28 03:54:15,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2022-04-28 03:54:15,030 INFO L87 Difference]: Start difference. First operand 94 states and 118 transitions. Second operand has 16 states, 16 states have (on average 1.6875) internal successors, (27), 15 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:54:18,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:54:18,664 INFO L93 Difference]: Finished difference Result 226 states and 285 transitions. [2022-04-28 03:54:18,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-28 03:54:18,664 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.6875) internal successors, (27), 15 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2022-04-28 03:54:18,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:54:18,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.6875) internal successors, (27), 15 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:54:18,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 92 transitions. [2022-04-28 03:54:18,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.6875) internal successors, (27), 15 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:54:18,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 92 transitions. [2022-04-28 03:54:18,666 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 92 transitions. [2022-04-28 03:54:18,790 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:54:18,792 INFO L225 Difference]: With dead ends: 226 [2022-04-28 03:54:18,792 INFO L226 Difference]: Without dead ends: 142 [2022-04-28 03:54:18,793 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 72 SyntacticMatches, 5 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 384 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=293, Invalid=1963, Unknown=0, NotChecked=0, Total=2256 [2022-04-28 03:54:18,793 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 59 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-28 03:54:18,793 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 74 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-28 03:54:18,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2022-04-28 03:54:19,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 92. [2022-04-28 03:54:19,567 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:54:19,568 INFO L82 GeneralOperation]: Start isEquivalent. First operand 142 states. Second operand has 92 states, 87 states have (on average 1.2413793103448276) internal successors, (108), 87 states have internal predecessors, (108), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:54:19,568 INFO L74 IsIncluded]: Start isIncluded. First operand 142 states. Second operand has 92 states, 87 states have (on average 1.2413793103448276) internal successors, (108), 87 states have internal predecessors, (108), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:54:19,568 INFO L87 Difference]: Start difference. First operand 142 states. Second operand has 92 states, 87 states have (on average 1.2413793103448276) internal successors, (108), 87 states have internal predecessors, (108), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:54:19,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:54:19,569 INFO L93 Difference]: Finished difference Result 142 states and 176 transitions. [2022-04-28 03:54:19,569 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 176 transitions. [2022-04-28 03:54:19,569 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:54:19,569 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:54:19,570 INFO L74 IsIncluded]: Start isIncluded. First operand has 92 states, 87 states have (on average 1.2413793103448276) internal successors, (108), 87 states have internal predecessors, (108), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 142 states. [2022-04-28 03:54:19,570 INFO L87 Difference]: Start difference. First operand has 92 states, 87 states have (on average 1.2413793103448276) internal successors, (108), 87 states have internal predecessors, (108), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 142 states. [2022-04-28 03:54:19,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:54:19,571 INFO L93 Difference]: Finished difference Result 142 states and 176 transitions. [2022-04-28 03:54:19,571 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 176 transitions. [2022-04-28 03:54:19,571 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:54:19,571 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:54:19,571 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:54:19,571 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:54:19,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 87 states have (on average 1.2413793103448276) internal successors, (108), 87 states have internal predecessors, (108), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:54:19,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 112 transitions. [2022-04-28 03:54:19,572 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 112 transitions. Word has length 34 [2022-04-28 03:54:19,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:54:19,572 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 112 transitions. [2022-04-28 03:54:19,572 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.6875) internal successors, (27), 15 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:54:19,572 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 92 states and 112 transitions. [2022-04-28 03:54:38,208 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 106 inductive. 0 not inductive. 6 times theorem prover too weak to decide inductivity. [2022-04-28 03:54:38,209 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 112 transitions. [2022-04-28 03:54:38,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-28 03:54:38,209 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:54:38,209 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:54:38,225 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-04-28 03:54:38,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:54:38,423 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:54:38,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:54:38,424 INFO L85 PathProgramCache]: Analyzing trace with hash 599059425, now seen corresponding path program 16 times [2022-04-28 03:54:38,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:54:38,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [488995833] [2022-04-28 03:54:38,582 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:54:38,584 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:54:38,586 INFO L85 PathProgramCache]: Analyzing trace with hash -408470539, now seen corresponding path program 1 times [2022-04-28 03:54:38,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:54:38,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485247041] [2022-04-28 03:54:38,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:54:38,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:54:38,595 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_29.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:54:38,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:54:38,604 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_29.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:54:38,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:54:38,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:54:38,720 INFO L290 TraceCheckUtils]: 0: Hoare triple {17639#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {17626#true} is VALID [2022-04-28 03:54:38,720 INFO L290 TraceCheckUtils]: 1: Hoare triple {17626#true} assume true; {17626#true} is VALID [2022-04-28 03:54:38,720 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {17626#true} {17626#true} #83#return; {17626#true} is VALID [2022-04-28 03:54:38,720 INFO L272 TraceCheckUtils]: 0: Hoare triple {17626#true} call ULTIMATE.init(); {17639#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:54:38,720 INFO L290 TraceCheckUtils]: 1: Hoare triple {17639#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {17626#true} is VALID [2022-04-28 03:54:38,721 INFO L290 TraceCheckUtils]: 2: Hoare triple {17626#true} assume true; {17626#true} is VALID [2022-04-28 03:54:38,721 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17626#true} {17626#true} #83#return; {17626#true} is VALID [2022-04-28 03:54:38,721 INFO L272 TraceCheckUtils]: 4: Hoare triple {17626#true} call #t~ret15 := main(); {17626#true} is VALID [2022-04-28 03:54:38,721 INFO L290 TraceCheckUtils]: 5: Hoare triple {17626#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {17626#true} is VALID [2022-04-28 03:54:38,721 INFO L290 TraceCheckUtils]: 6: Hoare triple {17626#true} [143] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_398 4294967296)) (.cse1 (= v_main_~x~0_398 v_main_~x~0_397)) (.cse2 (= v_main_~y~0_389 v_main_~y~0_388))) (or (and (= |v_main_#t~post5_139| |v_main_#t~post5_140|) (<= .cse0 0) .cse1 .cse2 (= |v_main_#t~post6_139| |v_main_#t~post6_140|)) (and (< 0 .cse0) (forall ((v_it_29 Int)) (or (not (<= (+ v_main_~y~0_389 v_it_29 1) v_main_~y~0_388)) (< 0 (mod (+ v_main_~x~0_398 (* 4294967295 v_it_29)) 4294967296)) (not (<= 1 v_it_29)))) (< v_main_~y~0_389 v_main_~y~0_388) (= (+ v_main_~x~0_398 v_main_~y~0_389 (* (- 1) v_main_~y~0_388)) v_main_~x~0_397)) (and (= |v_main_#t~post5_140| |v_main_#t~post5_139|) .cse1 (= |v_main_#t~post6_140| |v_main_#t~post6_139|) .cse2))) InVars {main_~y~0=v_main_~y~0_389, main_#t~post5=|v_main_#t~post5_140|, main_~x~0=v_main_~x~0_398, main_#t~post6=|v_main_#t~post6_140|} OutVars{main_~y~0=v_main_~y~0_388, main_#t~post5=|v_main_#t~post5_139|, main_~x~0=v_main_~x~0_397, main_#t~post6=|v_main_#t~post6_139|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {17626#true} is VALID [2022-04-28 03:54:38,721 INFO L290 TraceCheckUtils]: 7: Hoare triple {17626#true} [142] 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[] {17631#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:54:38,722 INFO L290 TraceCheckUtils]: 8: Hoare triple {17631#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {17631#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-28 03:54:38,722 INFO L290 TraceCheckUtils]: 9: Hoare triple {17631#(<= 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; {17632#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-28 03:54:38,723 INFO L290 TraceCheckUtils]: 10: Hoare triple {17632#(<= 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; {17633#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-28 03:54:38,724 INFO L290 TraceCheckUtils]: 11: Hoare triple {17633#(<= 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; {17634#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:54:38,725 INFO L290 TraceCheckUtils]: 12: Hoare triple {17634#(<= 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; {17635#(<= main_~x~0 (+ 4 (* (div (+ main_~x~0 (- 4)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:54:38,726 INFO L290 TraceCheckUtils]: 13: Hoare triple {17635#(<= 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; {17636#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 03:54:38,726 INFO L290 TraceCheckUtils]: 14: Hoare triple {17636#(<= 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; {17637#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:54:38,727 INFO L290 TraceCheckUtils]: 15: Hoare triple {17637#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {17637#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:54:38,727 INFO L290 TraceCheckUtils]: 16: Hoare triple {17637#(<= 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; {17637#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:54:38,728 INFO L290 TraceCheckUtils]: 17: Hoare triple {17637#(<= 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; {17637#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:54:38,728 INFO L290 TraceCheckUtils]: 18: Hoare triple {17637#(<= 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; {17637#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:54:38,728 INFO L290 TraceCheckUtils]: 19: Hoare triple {17637#(<= 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; {17637#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:54:38,729 INFO L290 TraceCheckUtils]: 20: Hoare triple {17637#(<= 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; {17637#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:54:38,729 INFO L290 TraceCheckUtils]: 21: Hoare triple {17637#(<= 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; {17637#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:54:38,729 INFO L290 TraceCheckUtils]: 22: Hoare triple {17637#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} assume !(~y~0 % 4294967296 > 0); {17637#(<= main_~x~0 (+ 6 (* (div (+ main_~x~0 (- 6)) 4294967296) 4294967296)))} is VALID [2022-04-28 03:54:38,730 INFO L290 TraceCheckUtils]: 23: Hoare triple {17637#(<= 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; {17636#(<= main_~x~0 (+ (* 4294967296 (div (+ main_~x~0 (- 5)) 4294967296)) 5))} is VALID [2022-04-28 03:54:38,731 INFO L290 TraceCheckUtils]: 24: Hoare triple {17636#(<= 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; {17638#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-28 03:54:38,732 INFO L290 TraceCheckUtils]: 25: Hoare triple {17638#(<= (+ 4 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {17627#false} is VALID [2022-04-28 03:54:38,732 INFO L290 TraceCheckUtils]: 26: Hoare triple {17627#false} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {17627#false} is VALID [2022-04-28 03:54:38,732 INFO L290 TraceCheckUtils]: 27: Hoare triple {17627#false} assume !(~z~0 % 4294967296 > 0); {17627#false} is VALID [2022-04-28 03:54:38,732 INFO L272 TraceCheckUtils]: 28: Hoare triple {17627#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {17627#false} is VALID [2022-04-28 03:54:38,732 INFO L290 TraceCheckUtils]: 29: Hoare triple {17627#false} ~cond := #in~cond; {17627#false} is VALID [2022-04-28 03:54:38,732 INFO L290 TraceCheckUtils]: 30: Hoare triple {17627#false} assume 0 == ~cond; {17627#false} is VALID [2022-04-28 03:54:38,732 INFO L290 TraceCheckUtils]: 31: Hoare triple {17627#false} assume !false; {17627#false} is VALID [2022-04-28 03:54:38,732 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-04-28 03:54:38,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:54:38,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485247041] [2022-04-28 03:54:38,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485247041] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:54:38,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [699318637] [2022-04-28 03:54:38,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:54:38,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:54:38,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:54:38,733 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:54:38,734 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-04-28 03:54:38,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:54:38,775 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-28 03:54:38,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:54:38,784 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:54:39,088 INFO L272 TraceCheckUtils]: 0: Hoare triple {17626#true} call ULTIMATE.init(); {17626#true} is VALID [2022-04-28 03:54:39,088 INFO L290 TraceCheckUtils]: 1: Hoare triple {17626#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {17626#true} is VALID [2022-04-28 03:54:39,088 INFO L290 TraceCheckUtils]: 2: Hoare triple {17626#true} assume true; {17626#true} is VALID [2022-04-28 03:54:39,088 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17626#true} {17626#true} #83#return; {17626#true} is VALID [2022-04-28 03:54:39,088 INFO L272 TraceCheckUtils]: 4: Hoare triple {17626#true} call #t~ret15 := main(); {17626#true} is VALID [2022-04-28 03:54:39,088 INFO L290 TraceCheckUtils]: 5: Hoare triple {17626#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {17626#true} is VALID [2022-04-28 03:54:39,088 INFO L290 TraceCheckUtils]: 6: Hoare triple {17626#true} [143] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_398 4294967296)) (.cse1 (= v_main_~x~0_398 v_main_~x~0_397)) (.cse2 (= v_main_~y~0_389 v_main_~y~0_388))) (or (and (= |v_main_#t~post5_139| |v_main_#t~post5_140|) (<= .cse0 0) .cse1 .cse2 (= |v_main_#t~post6_139| |v_main_#t~post6_140|)) (and (< 0 .cse0) (forall ((v_it_29 Int)) (or (not (<= (+ v_main_~y~0_389 v_it_29 1) v_main_~y~0_388)) (< 0 (mod (+ v_main_~x~0_398 (* 4294967295 v_it_29)) 4294967296)) (not (<= 1 v_it_29)))) (< v_main_~y~0_389 v_main_~y~0_388) (= (+ v_main_~x~0_398 v_main_~y~0_389 (* (- 1) v_main_~y~0_388)) v_main_~x~0_397)) (and (= |v_main_#t~post5_140| |v_main_#t~post5_139|) .cse1 (= |v_main_#t~post6_140| |v_main_#t~post6_139|) .cse2))) InVars {main_~y~0=v_main_~y~0_389, main_#t~post5=|v_main_#t~post5_140|, main_~x~0=v_main_~x~0_398, main_#t~post6=|v_main_#t~post6_140|} OutVars{main_~y~0=v_main_~y~0_388, main_#t~post5=|v_main_#t~post5_139|, main_~x~0=v_main_~x~0_397, main_#t~post6=|v_main_#t~post6_139|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {17626#true} is VALID [2022-04-28 03:54:39,088 INFO L290 TraceCheckUtils]: 7: Hoare triple {17626#true} [142] 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[] {17626#true} is VALID [2022-04-28 03:54:39,088 INFO L290 TraceCheckUtils]: 8: Hoare triple {17626#true} ~z~0 := ~y~0; {17667#(= main_~z~0 main_~y~0)} is VALID [2022-04-28 03:54:39,089 INFO L290 TraceCheckUtils]: 9: Hoare triple {17667#(= 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; {17671#(= main_~y~0 (+ main_~z~0 1))} is VALID [2022-04-28 03:54:39,089 INFO L290 TraceCheckUtils]: 10: Hoare triple {17671#(= 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; {17675#(= main_~y~0 (+ main_~z~0 2))} is VALID [2022-04-28 03:54:39,090 INFO L290 TraceCheckUtils]: 11: Hoare triple {17675#(= 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; {17679#(= (+ (- 2) main_~y~0) (+ main_~z~0 1))} is VALID [2022-04-28 03:54:39,091 INFO L290 TraceCheckUtils]: 12: Hoare triple {17679#(= (+ (- 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; {17683#(= (+ (- 2) main_~y~0) (+ main_~z~0 2))} is VALID [2022-04-28 03:54:39,091 INFO L290 TraceCheckUtils]: 13: Hoare triple {17683#(= (+ (- 2) main_~y~0) (+ main_~z~0 2))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {17687#(= (+ (- 2) main_~y~0) (+ main_~z~0 3))} is VALID [2022-04-28 03:54:39,092 INFO L290 TraceCheckUtils]: 14: Hoare triple {17687#(= (+ (- 2) 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; {17691#(= (+ (- 2) main_~y~0) (+ main_~z~0 4))} is VALID [2022-04-28 03:54:39,092 INFO L290 TraceCheckUtils]: 15: Hoare triple {17691#(= (+ (- 2) main_~y~0) (+ main_~z~0 4))} assume !(~z~0 % 4294967296 > 0); {17691#(= (+ (- 2) main_~y~0) (+ main_~z~0 4))} is VALID [2022-04-28 03:54:39,093 INFO L290 TraceCheckUtils]: 16: Hoare triple {17691#(= (+ (- 2) main_~y~0) (+ main_~z~0 4))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17683#(= (+ (- 2) main_~y~0) (+ main_~z~0 2))} is VALID [2022-04-28 03:54:39,093 INFO L290 TraceCheckUtils]: 17: Hoare triple {17683#(= (+ (- 2) main_~y~0) (+ main_~z~0 2))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17701#(< 0 (mod (+ main_~z~0 3) 4294967296))} is VALID [2022-04-28 03:54:39,094 INFO L290 TraceCheckUtils]: 18: Hoare triple {17701#(< 0 (mod (+ main_~z~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; {17705#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-28 03:54:39,095 INFO L290 TraceCheckUtils]: 19: Hoare triple {17705#(< 0 (mod (+ main_~z~0 2) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17709#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-28 03:54:39,096 INFO L290 TraceCheckUtils]: 20: Hoare triple {17709#(< 0 (mod (+ main_~z~0 1) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17713#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 03:54:39,096 INFO L290 TraceCheckUtils]: 21: Hoare triple {17713#(< 0 (mod main_~z~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; {17717#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 03:54:39,097 INFO L290 TraceCheckUtils]: 22: Hoare triple {17717#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !(~y~0 % 4294967296 > 0); {17717#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 03:54:39,097 INFO L290 TraceCheckUtils]: 23: Hoare triple {17717#(< 0 (mod (+ main_~z~0 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; {17717#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 03:54:39,097 INFO L290 TraceCheckUtils]: 24: Hoare triple {17717#(< 0 (mod (+ main_~z~0 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; {17717#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 03:54:39,098 INFO L290 TraceCheckUtils]: 25: Hoare triple {17717#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {17717#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 03:54:39,098 INFO L290 TraceCheckUtils]: 26: Hoare triple {17717#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {17713#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 03:54:39,099 INFO L290 TraceCheckUtils]: 27: Hoare triple {17713#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {17627#false} is VALID [2022-04-28 03:54:39,099 INFO L272 TraceCheckUtils]: 28: Hoare triple {17627#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {17627#false} is VALID [2022-04-28 03:54:39,099 INFO L290 TraceCheckUtils]: 29: Hoare triple {17627#false} ~cond := #in~cond; {17627#false} is VALID [2022-04-28 03:54:39,099 INFO L290 TraceCheckUtils]: 30: Hoare triple {17627#false} assume 0 == ~cond; {17627#false} is VALID [2022-04-28 03:54:39,099 INFO L290 TraceCheckUtils]: 31: Hoare triple {17627#false} assume !false; {17627#false} is VALID [2022-04-28 03:54:39,099 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 03:54:39,099 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:54:39,509 INFO L290 TraceCheckUtils]: 31: Hoare triple {17627#false} assume !false; {17627#false} is VALID [2022-04-28 03:54:39,510 INFO L290 TraceCheckUtils]: 30: Hoare triple {17627#false} assume 0 == ~cond; {17627#false} is VALID [2022-04-28 03:54:39,510 INFO L290 TraceCheckUtils]: 29: Hoare triple {17627#false} ~cond := #in~cond; {17627#false} is VALID [2022-04-28 03:54:39,510 INFO L272 TraceCheckUtils]: 28: Hoare triple {17627#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {17627#false} is VALID [2022-04-28 03:54:39,510 INFO L290 TraceCheckUtils]: 27: Hoare triple {17713#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {17627#false} is VALID [2022-04-28 03:54:39,511 INFO L290 TraceCheckUtils]: 26: Hoare triple {17717#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {17713#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 03:54:39,511 INFO L290 TraceCheckUtils]: 25: Hoare triple {17717#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !(~x~0 % 4294967296 > 0); {17717#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 03:54:39,511 INFO L290 TraceCheckUtils]: 24: Hoare triple {17717#(< 0 (mod (+ main_~z~0 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; {17717#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 03:54:39,512 INFO L290 TraceCheckUtils]: 23: Hoare triple {17717#(< 0 (mod (+ main_~z~0 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; {17717#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 03:54:39,512 INFO L290 TraceCheckUtils]: 22: Hoare triple {17717#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} assume !(~y~0 % 4294967296 > 0); {17717#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 03:54:39,513 INFO L290 TraceCheckUtils]: 21: Hoare triple {17713#(< 0 (mod main_~z~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; {17717#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-28 03:54:39,514 INFO L290 TraceCheckUtils]: 20: Hoare triple {17709#(< 0 (mod (+ main_~z~0 1) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17713#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-28 03:54:39,514 INFO L290 TraceCheckUtils]: 19: Hoare triple {17705#(< 0 (mod (+ main_~z~0 2) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17709#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-28 03:54:39,515 INFO L290 TraceCheckUtils]: 18: Hoare triple {17701#(< 0 (mod (+ main_~z~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; {17705#(< 0 (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-28 03:54:39,516 INFO L290 TraceCheckUtils]: 17: Hoare triple {17790#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ main_~z~0 4) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17701#(< 0 (mod (+ main_~z~0 3) 4294967296))} is VALID [2022-04-28 03:54:39,517 INFO L290 TraceCheckUtils]: 16: Hoare triple {17794#(or (< 0 (mod (+ 5 main_~z~0) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {17790#(or (not (< 0 (mod main_~y~0 4294967296))) (< 0 (mod (+ main_~z~0 4) 4294967296)))} is VALID [2022-04-28 03:54:39,517 INFO L290 TraceCheckUtils]: 15: Hoare triple {17794#(or (< 0 (mod (+ 5 main_~z~0) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {17794#(or (< 0 (mod (+ 5 main_~z~0) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-28 03:54:39,518 INFO L290 TraceCheckUtils]: 14: Hoare triple {17801#(or (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))) (< 0 (mod (+ main_~z~0 4) 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {17794#(or (< 0 (mod (+ 5 main_~z~0) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-28 03:54:39,519 INFO L290 TraceCheckUtils]: 13: Hoare triple {17805#(or (< 0 (mod (+ main_~z~0 3) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {17801#(or (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))) (< 0 (mod (+ main_~z~0 4) 4294967296)))} is VALID [2022-04-28 03:54:39,520 INFO L290 TraceCheckUtils]: 12: Hoare triple {17809#(or (< 0 (mod (+ main_~z~0 2) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {17805#(or (< 0 (mod (+ main_~z~0 3) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-28 03:54:39,521 INFO L290 TraceCheckUtils]: 11: Hoare triple {17813#(or (< 0 (mod (+ main_~z~0 1) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {17809#(or (< 0 (mod (+ main_~z~0 2) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-28 03:54:39,522 INFO L290 TraceCheckUtils]: 10: Hoare triple {17817#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {17813#(or (< 0 (mod (+ main_~z~0 1) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-28 03:54:39,523 INFO L290 TraceCheckUtils]: 9: Hoare triple {17821#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {17817#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-28 03:54:39,523 INFO L290 TraceCheckUtils]: 8: Hoare triple {17626#true} ~z~0 := ~y~0; {17821#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-28 03:54:39,523 INFO L290 TraceCheckUtils]: 7: Hoare triple {17626#true} [142] 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[] {17626#true} is VALID [2022-04-28 03:54:39,523 INFO L290 TraceCheckUtils]: 6: Hoare triple {17626#true} [143] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_398 4294967296)) (.cse1 (= v_main_~x~0_398 v_main_~x~0_397)) (.cse2 (= v_main_~y~0_389 v_main_~y~0_388))) (or (and (= |v_main_#t~post5_139| |v_main_#t~post5_140|) (<= .cse0 0) .cse1 .cse2 (= |v_main_#t~post6_139| |v_main_#t~post6_140|)) (and (< 0 .cse0) (forall ((v_it_29 Int)) (or (not (<= (+ v_main_~y~0_389 v_it_29 1) v_main_~y~0_388)) (< 0 (mod (+ v_main_~x~0_398 (* 4294967295 v_it_29)) 4294967296)) (not (<= 1 v_it_29)))) (< v_main_~y~0_389 v_main_~y~0_388) (= (+ v_main_~x~0_398 v_main_~y~0_389 (* (- 1) v_main_~y~0_388)) v_main_~x~0_397)) (and (= |v_main_#t~post5_140| |v_main_#t~post5_139|) .cse1 (= |v_main_#t~post6_140| |v_main_#t~post6_139|) .cse2))) InVars {main_~y~0=v_main_~y~0_389, main_#t~post5=|v_main_#t~post5_140|, main_~x~0=v_main_~x~0_398, main_#t~post6=|v_main_#t~post6_140|} OutVars{main_~y~0=v_main_~y~0_388, main_#t~post5=|v_main_#t~post5_139|, main_~x~0=v_main_~x~0_397, main_#t~post6=|v_main_#t~post6_139|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {17626#true} is VALID [2022-04-28 03:54:39,523 INFO L290 TraceCheckUtils]: 5: Hoare triple {17626#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {17626#true} is VALID [2022-04-28 03:54:39,523 INFO L272 TraceCheckUtils]: 4: Hoare triple {17626#true} call #t~ret15 := main(); {17626#true} is VALID [2022-04-28 03:54:39,524 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17626#true} {17626#true} #83#return; {17626#true} is VALID [2022-04-28 03:54:39,524 INFO L290 TraceCheckUtils]: 2: Hoare triple {17626#true} assume true; {17626#true} is VALID [2022-04-28 03:54:39,524 INFO L290 TraceCheckUtils]: 1: Hoare triple {17626#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {17626#true} is VALID [2022-04-28 03:54:39,524 INFO L272 TraceCheckUtils]: 0: Hoare triple {17626#true} call ULTIMATE.init(); {17626#true} is VALID [2022-04-28 03:54:39,524 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 03:54:39,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [699318637] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:54:39,524 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:54:39,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14, 15] total 31 [2022-04-28 03:54:39,821 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:54:39,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [488995833] [2022-04-28 03:54:39,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [488995833] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:54:39,821 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:54:39,821 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-28 03:54:39,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619349330] [2022-04-28 03:54:39,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:54:39,822 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 14 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-04-28 03:54:39,822 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:54:39,822 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 14 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:54:39,848 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:54:39,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-28 03:54:39,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:54:39,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-28 03:54:39,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1073, Unknown=0, NotChecked=0, Total=1190 [2022-04-28 03:54:39,849 INFO L87 Difference]: Start difference. First operand 92 states and 112 transitions. Second operand has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 14 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:54:44,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:54:44,564 INFO L93 Difference]: Finished difference Result 264 states and 362 transitions. [2022-04-28 03:54:44,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-28 03:54:44,565 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 14 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-04-28 03:54:44,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:54:44,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 14 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:54:44,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 128 transitions. [2022-04-28 03:54:44,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 14 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:54:44,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 128 transitions. [2022-04-28 03:54:44,567 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 128 transitions. [2022-04-28 03:54:44,741 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 128 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:54:44,744 INFO L225 Difference]: With dead ends: 264 [2022-04-28 03:54:44,744 INFO L226 Difference]: Without dead ends: 246 [2022-04-28 03:54:44,745 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=297, Invalid=2253, Unknown=0, NotChecked=0, Total=2550 [2022-04-28 03:54:44,745 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 181 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 163 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 163 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-28 03:54:44,745 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 66 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [163 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-28 03:54:44,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2022-04-28 03:54:45,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 105. [2022-04-28 03:54:45,678 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:54:45,678 INFO L82 GeneralOperation]: Start isEquivalent. First operand 246 states. Second operand has 105 states, 100 states have (on average 1.26) internal successors, (126), 100 states have internal predecessors, (126), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:54:45,678 INFO L74 IsIncluded]: Start isIncluded. First operand 246 states. Second operand has 105 states, 100 states have (on average 1.26) internal successors, (126), 100 states have internal predecessors, (126), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:54:45,679 INFO L87 Difference]: Start difference. First operand 246 states. Second operand has 105 states, 100 states have (on average 1.26) internal successors, (126), 100 states have internal predecessors, (126), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:54:45,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:54:45,681 INFO L93 Difference]: Finished difference Result 246 states and 318 transitions. [2022-04-28 03:54:45,681 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 318 transitions. [2022-04-28 03:54:45,682 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:54:45,682 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:54:45,682 INFO L74 IsIncluded]: Start isIncluded. First operand has 105 states, 100 states have (on average 1.26) internal successors, (126), 100 states have internal predecessors, (126), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 246 states. [2022-04-28 03:54:45,682 INFO L87 Difference]: Start difference. First operand has 105 states, 100 states have (on average 1.26) internal successors, (126), 100 states have internal predecessors, (126), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 246 states. [2022-04-28 03:54:45,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:54:45,685 INFO L93 Difference]: Finished difference Result 246 states and 318 transitions. [2022-04-28 03:54:45,685 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 318 transitions. [2022-04-28 03:54:45,685 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:54:45,685 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:54:45,685 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:54:45,685 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:54:45,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 100 states have (on average 1.26) internal successors, (126), 100 states have internal predecessors, (126), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:54:45,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 130 transitions. [2022-04-28 03:54:45,686 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 130 transitions. Word has length 35 [2022-04-28 03:54:45,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:54:45,686 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 130 transitions. [2022-04-28 03:54:45,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 14 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:54:45,686 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 105 states and 130 transitions. [2022-04-28 03:55:10,417 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 130 edges. 120 inductive. 0 not inductive. 10 times theorem prover too weak to decide inductivity. [2022-04-28 03:55:10,417 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 130 transitions. [2022-04-28 03:55:10,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-28 03:55:10,417 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:55:10,417 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:55:10,435 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-04-28 03:55:10,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2022-04-28 03:55:10,618 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:55:10,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:55:10,618 INFO L85 PathProgramCache]: Analyzing trace with hash 955015874, now seen corresponding path program 17 times [2022-04-28 03:55:10,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:55:10,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1408041997] [2022-04-28 03:55:11,613 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:55:11,614 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:55:11,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1771625710, now seen corresponding path program 1 times [2022-04-28 03:55:11,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:55:11,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459468741] [2022-04-28 03:55:11,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:55:11,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:55:11,627 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_30.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:55:11,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:55:11,659 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_30.4))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:55:12,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:55:12,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:55:12,239 INFO L290 TraceCheckUtils]: 0: Hoare triple {19139#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {19117#true} is VALID [2022-04-28 03:55:12,240 INFO L290 TraceCheckUtils]: 1: Hoare triple {19117#true} assume true; {19117#true} is VALID [2022-04-28 03:55:12,240 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {19117#true} {19117#true} #83#return; {19117#true} is VALID [2022-04-28 03:55:12,240 INFO L272 TraceCheckUtils]: 0: Hoare triple {19117#true} call ULTIMATE.init(); {19139#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:55:12,240 INFO L290 TraceCheckUtils]: 1: Hoare triple {19139#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {19117#true} is VALID [2022-04-28 03:55:12,240 INFO L290 TraceCheckUtils]: 2: Hoare triple {19117#true} assume true; {19117#true} is VALID [2022-04-28 03:55:12,240 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19117#true} {19117#true} #83#return; {19117#true} is VALID [2022-04-28 03:55:12,240 INFO L272 TraceCheckUtils]: 4: Hoare triple {19117#true} call #t~ret15 := main(); {19117#true} is VALID [2022-04-28 03:55:12,241 INFO L290 TraceCheckUtils]: 5: Hoare triple {19117#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {19122#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-28 03:55:12,242 INFO L290 TraceCheckUtils]: 6: Hoare triple {19122#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} [145] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= |v_main_#t~post6_145| |v_main_#t~post6_144|)) (.cse2 (= |v_main_#t~post5_145| |v_main_#t~post5_144|)) (.cse3 (= v_main_~y~0_408 v_main_~y~0_407)) (.cse4 (= v_main_~x~0_417 v_main_~x~0_416)) (.cse0 (mod v_main_~x~0_417 4294967296))) (or (and (<= .cse0 0) .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4) (and (< v_main_~y~0_408 v_main_~y~0_407) (< 0 .cse0) (forall ((v_it_30 Int)) (or (not (<= 1 v_it_30)) (< 0 (mod (+ v_main_~x~0_417 (* 4294967295 v_it_30)) 4294967296)) (not (<= (+ v_main_~y~0_408 v_it_30 1) v_main_~y~0_407)))) (= v_main_~x~0_416 (+ v_main_~x~0_417 v_main_~y~0_408 (* (- 1) v_main_~y~0_407)))))) InVars {main_~y~0=v_main_~y~0_408, main_#t~post5=|v_main_#t~post5_145|, main_~x~0=v_main_~x~0_417, main_#t~post6=|v_main_#t~post6_145|} OutVars{main_~y~0=v_main_~y~0_407, main_#t~post5=|v_main_#t~post5_144|, main_~x~0=v_main_~x~0_416, main_#t~post6=|v_main_#t~post6_144|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {19123#(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:55:12,243 INFO L290 TraceCheckUtils]: 7: Hoare triple {19123#(or (and (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= main_~n~0 (+ main_~y~0 main_~x~0))) (= main_~y~0 0))} [144] 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[] {19124#(or (and (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ main_~y~0 main_~x~0) main_~n~0)) (= main_~y~0 0))} is VALID [2022-04-28 03:55:12,243 INFO L290 TraceCheckUtils]: 8: Hoare triple {19124#(or (and (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ main_~y~0 main_~x~0) main_~n~0)) (= main_~y~0 0))} ~z~0 := ~y~0; {19125#(and (= (+ main_~y~0 (* (- 1) main_~z~0)) 0) (or (and (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ main_~y~0 main_~x~0) main_~n~0)) (= main_~y~0 0)))} is VALID [2022-04-28 03:55:12,245 INFO L290 TraceCheckUtils]: 9: Hoare triple {19125#(and (= (+ main_~y~0 (* (- 1) main_~z~0)) 0) (or (and (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ main_~y~0 main_~x~0) main_~n~0)) (= 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; {19126#(and (<= main_~n~0 (+ main_~z~0 main_~x~0)) (<= (+ main_~z~0 main_~x~0) main_~n~0) (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (* (- 1) main_~z~0) (* (- 1) main_~x~0) (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)) 4294967296) 4294967296) 1)))} is VALID [2022-04-28 03:55:12,247 INFO L290 TraceCheckUtils]: 10: Hoare triple {19126#(and (<= main_~n~0 (+ main_~z~0 main_~x~0)) (<= (+ main_~z~0 main_~x~0) main_~n~0) (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (* (- 1) main_~z~0) (* (- 1) main_~x~0) (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)) 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; {19127#(and (<= main_~n~0 (+ main_~z~0 main_~x~0)) (<= (+ main_~z~0 main_~x~0) main_~n~0) (<= main_~n~0 (+ main_~z~0 2 (* (div (+ main_~n~0 (* (- 1) main_~z~0) (* (- 1) main_~x~0) (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)) 4294967296) 4294967296))))} is VALID [2022-04-28 03:55:12,248 INFO L290 TraceCheckUtils]: 11: Hoare triple {19127#(and (<= main_~n~0 (+ main_~z~0 main_~x~0)) (<= (+ main_~z~0 main_~x~0) main_~n~0) (<= main_~n~0 (+ main_~z~0 2 (* (div (+ main_~n~0 (* (- 1) main_~z~0) (* (- 1) main_~x~0) (* (div (+ (- 2) main_~x~0) 4294967296) 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; {19128#(and (<= main_~n~0 (+ main_~z~0 main_~x~0)) (<= main_~n~0 (+ main_~z~0 3 (* (div (+ main_~n~0 (* (- 1) main_~z~0) (* (- 1) main_~x~0) (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)) 4294967296) 4294967296))) (<= (+ main_~z~0 main_~x~0) main_~n~0))} is VALID [2022-04-28 03:55:12,252 INFO L290 TraceCheckUtils]: 12: Hoare triple {19128#(and (<= main_~n~0 (+ main_~z~0 main_~x~0)) (<= main_~n~0 (+ main_~z~0 3 (* (div (+ main_~n~0 (* (- 1) main_~z~0) (* (- 1) main_~x~0) (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)) 4294967296) 4294967296))) (<= (+ main_~z~0 main_~x~0) 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; {19129#(and (<= main_~n~0 (+ main_~z~0 main_~x~0)) (or (<= (+ 4 (* (div (+ main_~z~0 main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (div main_~z~0 4294967296) (- 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296)) main_~x~0) (<= (+ 4294967292 main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)))) (<= (+ main_~z~0 main_~x~0) main_~n~0))} is VALID [2022-04-28 03:55:12,255 INFO L290 TraceCheckUtils]: 13: Hoare triple {19129#(and (<= main_~n~0 (+ main_~z~0 main_~x~0)) (or (<= (+ 4 (* (div (+ main_~z~0 main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (div main_~z~0 4294967296) (- 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296)) main_~x~0) (<= (+ 4294967292 main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)))) (<= (+ main_~z~0 main_~x~0) main_~n~0))} assume !(~z~0 % 4294967296 > 0); {19130#(and (<= main_~n~0 (+ main_~x~0 (* (div main_~z~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~z~0 4294967296) 4294967296)) main_~n~0) (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4) main_~x~0))} is VALID [2022-04-28 03:55:12,257 INFO L290 TraceCheckUtils]: 14: Hoare triple {19130#(and (<= main_~n~0 (+ main_~x~0 (* (div main_~z~0 4294967296) 4294967296))) (<= (+ main_~x~0 (* (div main_~z~0 4294967296) 4294967296)) main_~n~0) (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4) 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; {19131#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (* (- 1) main_~x~0)) 4294967296) 4294967296) main_~x~0)) (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4) main_~x~0))} is VALID [2022-04-28 03:55:12,257 INFO L290 TraceCheckUtils]: 15: Hoare triple {19131#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (* (- 1) main_~x~0)) 4294967296) 4294967296) main_~x~0)) (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4) 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; {19131#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (* (- 1) main_~x~0)) 4294967296) 4294967296) main_~x~0)) (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4) main_~x~0))} is VALID [2022-04-28 03:55:12,258 INFO L290 TraceCheckUtils]: 16: Hoare triple {19131#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (* (- 1) main_~x~0)) 4294967296) 4294967296) main_~x~0)) (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4) 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; {19131#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (* (- 1) main_~x~0)) 4294967296) 4294967296) main_~x~0)) (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4) main_~x~0))} is VALID [2022-04-28 03:55:12,259 INFO L290 TraceCheckUtils]: 17: Hoare triple {19131#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (* (- 1) main_~x~0)) 4294967296) 4294967296) main_~x~0)) (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4) 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; {19131#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (* (- 1) main_~x~0)) 4294967296) 4294967296) main_~x~0)) (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4) main_~x~0))} is VALID [2022-04-28 03:55:12,259 INFO L290 TraceCheckUtils]: 18: Hoare triple {19131#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (* (- 1) main_~x~0)) 4294967296) 4294967296) main_~x~0)) (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4) main_~x~0))} assume !(~y~0 % 4294967296 > 0); {19131#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (* (- 1) main_~x~0)) 4294967296) 4294967296) main_~x~0)) (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4) main_~x~0))} is VALID [2022-04-28 03:55:12,262 INFO L290 TraceCheckUtils]: 19: Hoare triple {19131#(and (<= main_~n~0 (+ (* (div (+ main_~n~0 (* (- 1) main_~x~0)) 4294967296) 4294967296) main_~x~0)) (<= (+ (* (div (+ main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4) main_~x~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; {19132#(and (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967296 (* (- 1) main_~n~0)) 4294967296) 4294967296) 3) main_~x~0) (<= main_~n~0 (+ main_~x~0 1 (* (div (+ (- 1) main_~n~0 (* (- 1) main_~x~0)) 4294967296) 4294967296))))} is VALID [2022-04-28 03:55:12,266 INFO L290 TraceCheckUtils]: 20: Hoare triple {19132#(and (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967296 (* (- 1) main_~n~0)) 4294967296) 4294967296) 3) main_~x~0) (<= main_~n~0 (+ main_~x~0 1 (* (div (+ (- 1) main_~n~0 (* (- 1) main_~x~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; {19133#(and (<= main_~n~0 (+ main_~x~0 2 (* 4294967296 (div (+ (- 2) main_~n~0 (* (- 1) main_~x~0)) 4294967296)))) (<= (+ (* (div (+ main_~x~0 4294967297 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 2) main_~x~0))} is VALID [2022-04-28 03:55:12,268 INFO L290 TraceCheckUtils]: 21: Hoare triple {19133#(and (<= main_~n~0 (+ main_~x~0 2 (* 4294967296 (div (+ (- 2) main_~n~0 (* (- 1) main_~x~0)) 4294967296)))) (<= (+ (* (div (+ main_~x~0 4294967297 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 2) main_~x~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; {19134#(and (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 4294967298) 4294967296) 4294967296) 1) main_~x~0) (<= main_~n~0 (+ main_~x~0 3 (* (div (+ main_~n~0 (- 3) (* (- 1) main_~x~0)) 4294967296) 4294967296))))} is VALID [2022-04-28 03:55:12,272 INFO L290 TraceCheckUtils]: 22: Hoare triple {19134#(and (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 4294967298) 4294967296) 4294967296) 1) main_~x~0) (<= main_~n~0 (+ main_~x~0 3 (* (div (+ main_~n~0 (- 3) (* (- 1) main_~x~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; {19135#(and (<= main_~n~0 (+ main_~x~0 (* (div (+ main_~n~0 (- 4) (* (- 1) main_~x~0)) 4294967296) 4294967296) 4)) (<= (* 4294967296 (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967299 (* (- 1) main_~n~0)) 4294967296)) main_~x~0))} is VALID [2022-04-28 03:55:12,277 INFO L290 TraceCheckUtils]: 23: Hoare triple {19135#(and (<= main_~n~0 (+ main_~x~0 (* (div (+ main_~n~0 (- 4) (* (- 1) main_~x~0)) 4294967296) 4294967296) 4)) (<= (* 4294967296 (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967299 (* (- 1) main_~n~0)) 4294967296)) main_~x~0))} assume !(~x~0 % 4294967296 > 0); {19135#(and (<= main_~n~0 (+ main_~x~0 (* (div (+ main_~n~0 (- 4) (* (- 1) main_~x~0)) 4294967296) 4294967296) 4)) (<= (* 4294967296 (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967299 (* (- 1) main_~n~0)) 4294967296)) main_~x~0))} is VALID [2022-04-28 03:55:12,280 INFO L290 TraceCheckUtils]: 24: Hoare triple {19135#(and (<= main_~n~0 (+ main_~x~0 (* (div (+ main_~n~0 (- 4) (* (- 1) main_~x~0)) 4294967296) 4294967296) 4)) (<= (* 4294967296 (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967299 (* (- 1) main_~n~0)) 4294967296)) main_~x~0))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {19134#(and (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 4294967298) 4294967296) 4294967296) 1) main_~x~0) (<= main_~n~0 (+ main_~x~0 3 (* (div (+ main_~n~0 (- 3) (* (- 1) main_~x~0)) 4294967296) 4294967296))))} is VALID [2022-04-28 03:55:12,282 INFO L290 TraceCheckUtils]: 25: Hoare triple {19134#(and (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 4294967298) 4294967296) 4294967296) 1) main_~x~0) (<= main_~n~0 (+ main_~x~0 3 (* (div (+ main_~n~0 (- 3) (* (- 1) main_~x~0)) 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {19133#(and (<= main_~n~0 (+ main_~x~0 2 (* 4294967296 (div (+ (- 2) main_~n~0 (* (- 1) main_~x~0)) 4294967296)))) (<= (+ (* (div (+ main_~x~0 4294967297 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 2) main_~x~0))} is VALID [2022-04-28 03:55:12,285 INFO L290 TraceCheckUtils]: 26: Hoare triple {19133#(and (<= main_~n~0 (+ main_~x~0 2 (* 4294967296 (div (+ (- 2) main_~n~0 (* (- 1) main_~x~0)) 4294967296)))) (<= (+ (* (div (+ main_~x~0 4294967297 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 2) main_~x~0))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {19132#(and (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967296 (* (- 1) main_~n~0)) 4294967296) 4294967296) 3) main_~x~0) (<= main_~n~0 (+ main_~x~0 1 (* (div (+ (- 1) main_~n~0 (* (- 1) main_~x~0)) 4294967296) 4294967296))))} is VALID [2022-04-28 03:55:12,287 INFO L290 TraceCheckUtils]: 27: Hoare triple {19132#(and (<= (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 4294967296 (* (- 1) main_~n~0)) 4294967296) 4294967296) 3) main_~x~0) (<= main_~n~0 (+ main_~x~0 1 (* (div (+ (- 1) main_~n~0 (* (- 1) main_~x~0)) 4294967296) 4294967296))))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {19136#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-28 03:55:12,287 INFO L290 TraceCheckUtils]: 28: Hoare triple {19136#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !(~z~0 % 4294967296 > 0); {19136#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-28 03:55:12,288 INFO L272 TraceCheckUtils]: 29: Hoare triple {19136#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {19137#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:55:12,288 INFO L290 TraceCheckUtils]: 30: Hoare triple {19137#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {19138#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:55:12,289 INFO L290 TraceCheckUtils]: 31: Hoare triple {19138#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {19118#false} is VALID [2022-04-28 03:55:12,289 INFO L290 TraceCheckUtils]: 32: Hoare triple {19118#false} assume !false; {19118#false} is VALID [2022-04-28 03:55:12,289 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-28 03:55:12,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:55:12,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459468741] [2022-04-28 03:55:12,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459468741] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:55:12,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [694027964] [2022-04-28 03:55:12,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:55:12,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:55:12,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:55:12,290 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:55:12,291 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-04-28 03:55:12,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:55:12,797 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 58 conjunts are in the unsatisfiable core [2022-04-28 03:55:12,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:55:12,888 INFO L286 TraceCheckSpWp]: Computing forward predicates...