/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-de20.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 03:34:40,883 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 03:34:40,886 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 03:34:40,948 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 03:34:40,948 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 03:34:40,949 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 03:34:40,951 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 03:34:40,961 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 03:34:40,962 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 03:34:40,979 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 03:34:40,980 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 03:34:40,981 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 03:34:40,982 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 03:34:41,001 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 03:34:41,002 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 03:34:41,005 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 03:34:41,005 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 03:34:41,006 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 03:34:41,012 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 03:34:41,017 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 03:34:41,018 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 03:34:41,020 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 03:34:41,020 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 03:34:41,021 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 03:34:41,033 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 03:34:41,041 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 03:34:41,042 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 03:34:41,042 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 03:34:41,043 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 03:34:41,044 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 03:34:41,045 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 03:34:41,045 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 03:34:41,047 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 03:34:41,047 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 03:34:41,048 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 03:34:41,049 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 03:34:41,049 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 03:34:41,049 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 03:34:41,050 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 03:34:41,050 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 03:34:41,050 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 03:34:41,063 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 03:34:41,064 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:34:41,075 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 03:34:41,076 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 03:34:41,077 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 03:34:41,077 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 03:34:41,078 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 03:34:41,078 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 03:34:41,078 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 03:34:41,078 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 03:34:41,078 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 03:34:41,079 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 03:34:41,079 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 03:34:41,079 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 03:34:41,079 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 03:34:41,080 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 03:34:41,080 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 03:34:41,080 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 03:34:41,080 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 03:34:41,080 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 03:34:41,080 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 03:34:41,081 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 03:34:41,081 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 03:34:41,081 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 03:34:41,081 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 03:34:41,081 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 03:34:41,081 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 03:34:41,081 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:34:41,505 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 03:34:41,535 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 03:34:41,537 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 03:34:41,539 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 03:34:41,539 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 03:34:41,541 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/in-de20.c [2022-04-28 03:34:41,652 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03eef3896/031df706cd4d464b976d10c66f1bf47c/FLAG229ed3975 [2022-04-28 03:34:42,379 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 03:34:42,380 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/in-de20.c [2022-04-28 03:34:42,400 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03eef3896/031df706cd4d464b976d10c66f1bf47c/FLAG229ed3975 [2022-04-28 03:34:42,672 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03eef3896/031df706cd4d464b976d10c66f1bf47c [2022-04-28 03:34:42,674 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 03:34:42,675 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 03:34:42,692 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 03:34:42,692 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 03:34:42,696 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 03:34:42,698 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 03:34:42" (1/1) ... [2022-04-28 03:34:42,699 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7336b599 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:34:42, skipping insertion in model container [2022-04-28 03:34:42,699 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 03:34:42" (1/1) ... [2022-04-28 03:34:42,711 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 03:34:42,745 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 03:34:42,965 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-de20.c[368,381] [2022-04-28 03:34:42,989 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 03:34:42,997 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 03:34:43,011 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-de20.c[368,381] [2022-04-28 03:34:43,021 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 03:34:43,034 INFO L208 MainTranslator]: Completed translation [2022-04-28 03:34:43,035 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:34:43 WrapperNode [2022-04-28 03:34:43,035 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 03:34:43,036 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 03:34:43,037 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 03:34:43,037 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 03:34:43,047 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:34:43" (1/1) ... [2022-04-28 03:34:43,047 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:34:43" (1/1) ... [2022-04-28 03:34:43,055 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:34:43" (1/1) ... [2022-04-28 03:34:43,055 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:34:43" (1/1) ... [2022-04-28 03:34:43,061 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:34:43" (1/1) ... [2022-04-28 03:34:43,066 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:34:43" (1/1) ... [2022-04-28 03:34:43,067 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:34:43" (1/1) ... [2022-04-28 03:34:43,069 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 03:34:43,070 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 03:34:43,070 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 03:34:43,070 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 03:34:43,071 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:34:43" (1/1) ... [2022-04-28 03:34:43,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 03:34:43,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:34:43,105 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:34:43,131 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:34:43,168 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 03:34:43,168 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 03:34:43,168 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 03:34:43,168 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 03:34:43,169 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 03:34:43,169 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 03:34:43,169 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 03:34:43,170 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 03:34:43,170 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 03:34:43,170 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-28 03:34:43,170 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 03:34:43,171 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 03:34:43,172 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 03:34:43,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 03:34:43,172 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 03:34:43,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 03:34:43,172 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 03:34:43,172 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 03:34:43,269 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 03:34:43,271 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 03:34:43,512 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 03:34:43,553 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 03:34:43,553 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-28 03:34:43,555 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 03:34:43 BoogieIcfgContainer [2022-04-28 03:34:43,555 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 03:34:43,563 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 03:34:43,563 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 03:34:43,578 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 03:34:43,579 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 03:34:42" (1/3) ... [2022-04-28 03:34:43,579 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1658688b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 03:34:43, skipping insertion in model container [2022-04-28 03:34:43,580 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:34:43" (2/3) ... [2022-04-28 03:34:43,580 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1658688b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 03:34:43, skipping insertion in model container [2022-04-28 03:34:43,580 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 03:34:43" (3/3) ... [2022-04-28 03:34:43,581 INFO L111 eAbstractionObserver]: Analyzing ICFG in-de20.c [2022-04-28 03:34:43,608 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 03:34:43,608 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 03:34:43,692 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 03:34:43,705 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@67d1336f, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1e3a4e8 [2022-04-28 03:34:43,705 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 03:34:43,736 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 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:34:43,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-28 03:34:43,743 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:34:43,744 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:34:43,744 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:34:43,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:34:43,749 INFO L85 PathProgramCache]: Analyzing trace with hash 449096471, now seen corresponding path program 1 times [2022-04-28 03:34:43,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:34:43,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [385920928] [2022-04-28 03:34:43,813 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:34:43,813 INFO L85 PathProgramCache]: Analyzing trace with hash 449096471, now seen corresponding path program 2 times [2022-04-28 03:34:43,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:34:43,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144175733] [2022-04-28 03:34:43,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:34:43,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:34:44,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:34:44,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:34:44,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:34:44,523 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); {24#true} is VALID [2022-04-28 03:34:44,523 INFO L290 TraceCheckUtils]: 1: Hoare triple {24#true} assume true; {24#true} is VALID [2022-04-28 03:34:44,523 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24#true} {24#true} #50#return; {24#true} is VALID [2022-04-28 03:34:44,525 INFO L272 TraceCheckUtils]: 0: Hoare triple {24#true} call ULTIMATE.init(); {32#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:34:44,526 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); {24#true} is VALID [2022-04-28 03:34:44,526 INFO L290 TraceCheckUtils]: 2: Hoare triple {24#true} assume true; {24#true} is VALID [2022-04-28 03:34:44,526 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24#true} {24#true} #50#return; {24#true} is VALID [2022-04-28 03:34:44,526 INFO L272 TraceCheckUtils]: 4: Hoare triple {24#true} call #t~ret9 := main(); {24#true} is VALID [2022-04-28 03:34:44,527 INFO L290 TraceCheckUtils]: 5: Hoare triple {24#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {29#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-28 03:34:44,528 INFO L290 TraceCheckUtils]: 6: Hoare triple {29#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !(~x~0 % 4294967296 > 0); {29#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-28 03:34:44,530 INFO L290 TraceCheckUtils]: 7: Hoare triple {29#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} ~z~0 := ~y~0; {29#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-28 03:34:44,531 INFO L290 TraceCheckUtils]: 8: Hoare triple {29#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !(~z~0 % 4294967296 > 0); {29#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-28 03:34:44,534 INFO L272 TraceCheckUtils]: 9: Hoare triple {29#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {30#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:34:44,536 INFO L290 TraceCheckUtils]: 10: Hoare triple {30#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {31#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:34:44,537 INFO L290 TraceCheckUtils]: 11: Hoare triple {31#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {25#false} is VALID [2022-04-28 03:34:44,537 INFO L290 TraceCheckUtils]: 12: Hoare triple {25#false} assume !false; {25#false} is VALID [2022-04-28 03:34:44,550 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:34:44,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:34:44,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144175733] [2022-04-28 03:34:44,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144175733] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:34:44,553 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:34:44,553 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 03:34:44,555 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:34:44,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [385920928] [2022-04-28 03:34:44,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [385920928] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:34:44,557 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:34:44,557 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 03:34:44,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743785978] [2022-04-28 03:34:44,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:34:44,566 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-28 03:34:44,568 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:34:44,571 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.5) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:34:44,620 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:34:44,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 03:34:44,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:34:44,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 03:34:44,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 03:34:44,679 INFO L87 Difference]: Start difference. First operand has 21 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 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 6 states, 6 states have (on average 1.5) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:34:45,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:34:45,141 INFO L93 Difference]: Finished difference Result 46 states and 59 transitions. [2022-04-28 03:34:45,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 03:34:45,142 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-28 03:34:45,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:34:45,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:34:45,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 59 transitions. [2022-04-28 03:34:45,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:34:45,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 59 transitions. [2022-04-28 03:34:45,199 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 59 transitions. [2022-04-28 03:34:45,283 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:34:45,291 INFO L225 Difference]: With dead ends: 46 [2022-04-28 03:34:45,291 INFO L226 Difference]: Without dead ends: 17 [2022-04-28 03:34:45,296 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-28 03:34:45,300 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 29 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:34:45,302 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 37 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 03:34:45,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-28 03:34:45,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-28 03:34:45,332 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:34:45,334 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:34:45,334 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:34:45,335 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:34:45,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:34:45,354 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-28 03:34:45,354 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-28 03:34:45,356 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:34:45,356 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:34:45,357 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-28 03:34:45,357 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-28 03:34:45,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:34:45,361 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-28 03:34:45,361 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-28 03:34:45,362 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:34:45,362 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:34:45,362 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:34:45,362 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:34:45,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:34:45,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-04-28 03:34:45,366 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 13 [2022-04-28 03:34:45,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:34:45,366 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-04-28 03:34:45,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:34:45,367 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 19 transitions. [2022-04-28 03:34:45,388 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:34:45,389 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-28 03:34:45,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-28 03:34:45,390 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:34:45,390 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:34:45,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 03:34:45,391 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:34:45,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:34:45,391 INFO L85 PathProgramCache]: Analyzing trace with hash 1071583787, now seen corresponding path program 1 times [2022-04-28 03:34:45,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:34:45,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [432633421] [2022-04-28 03:34:45,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:34:46,004 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:34:46,009 INFO L85 PathProgramCache]: Analyzing trace with hash 1959087468, now seen corresponding path program 1 times [2022-04-28 03:34:46,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:34:46,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595445619] [2022-04-28 03:34:46,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:34:46,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:34:46,060 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:34:46,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:34:46,202 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:34:46,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:34:46,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:34:46,478 INFO L290 TraceCheckUtils]: 0: Hoare triple {213#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {203#true} is VALID [2022-04-28 03:34:46,479 INFO L290 TraceCheckUtils]: 1: Hoare triple {203#true} assume true; {203#true} is VALID [2022-04-28 03:34:46,479 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {203#true} {203#true} #50#return; {203#true} is VALID [2022-04-28 03:34:46,497 INFO L272 TraceCheckUtils]: 0: Hoare triple {203#true} call ULTIMATE.init(); {213#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:34:46,498 INFO L290 TraceCheckUtils]: 1: Hoare triple {213#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {203#true} is VALID [2022-04-28 03:34:46,498 INFO L290 TraceCheckUtils]: 2: Hoare triple {203#true} assume true; {203#true} is VALID [2022-04-28 03:34:46,499 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {203#true} {203#true} #50#return; {203#true} is VALID [2022-04-28 03:34:46,499 INFO L272 TraceCheckUtils]: 4: Hoare triple {203#true} call #t~ret9 := main(); {203#true} is VALID [2022-04-28 03:34:46,500 INFO L290 TraceCheckUtils]: 5: Hoare triple {203#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {208#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-28 03:34:46,500 INFO L290 TraceCheckUtils]: 6: Hoare triple {208#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} assume !(~x~0 % 4294967296 > 0); {208#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-28 03:34:46,501 INFO L290 TraceCheckUtils]: 7: Hoare triple {208#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} ~z~0 := ~y~0; {209#(and (= main_~z~0 0) (= 0 (+ main_~x~0 (* (- 1) main_~n~0))))} is VALID [2022-04-28 03:34:46,503 INFO L290 TraceCheckUtils]: 8: Hoare triple {209#(and (= main_~z~0 0) (= 0 (+ main_~x~0 (* (- 1) main_~n~0))))} [54] L23-2-->L23-3_primed: Formula: (let ((.cse1 (= v_main_~z~0_7 v_main_~z~0_6)) (.cse2 (= |v_main_#t~post7_4| |v_main_#t~post7_3|)) (.cse3 (= |v_main_#t~post8_4| |v_main_#t~post8_3|)) (.cse4 (= v_main_~x~0_10 v_main_~x~0_9)) (.cse0 (mod v_main_~z~0_7 4294967296))) (or (and (forall ((v_it_1 Int)) (or (< 0 (mod (+ v_main_~z~0_7 (* v_it_1 4294967295)) 4294967296)) (not (<= (+ v_main_~x~0_10 v_it_1 1) v_main_~x~0_9)) (not (<= 1 v_it_1)))) (= v_main_~z~0_6 (+ v_main_~x~0_10 v_main_~z~0_7 (* (- 1) v_main_~x~0_9))) (< 0 .cse0) (< v_main_~x~0_10 v_main_~x~0_9)) (and .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4 (<= .cse0 0)))) InVars {main_~x~0=v_main_~x~0_10, main_#t~post8=|v_main_#t~post8_4|, main_~z~0=v_main_~z~0_7, main_#t~post7=|v_main_#t~post7_4|} OutVars{main_~x~0=v_main_~x~0_9, main_#t~post8=|v_main_#t~post8_3|, main_~z~0=v_main_~z~0_6, main_#t~post7=|v_main_#t~post7_3|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {210#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= main_~x~0 main_~n~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:34:46,504 INFO L290 TraceCheckUtils]: 9: Hoare triple {210#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= main_~x~0 main_~n~0) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} [53] L23-3_primed-->L23-3: Formula: (not (< 0 (mod v_main_~z~0_2 4294967296))) InVars {main_~z~0=v_main_~z~0_2} OutVars{main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[] {210#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= main_~x~0 main_~n~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:34:46,505 INFO L272 TraceCheckUtils]: 10: Hoare triple {210#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= main_~x~0 main_~n~0) (< (+ 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)); {211#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:34:46,506 INFO L290 TraceCheckUtils]: 11: Hoare triple {211#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {212#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:34:46,507 INFO L290 TraceCheckUtils]: 12: Hoare triple {212#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {204#false} is VALID [2022-04-28 03:34:46,507 INFO L290 TraceCheckUtils]: 13: Hoare triple {204#false} assume !false; {204#false} is VALID [2022-04-28 03:34:46,508 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:34:46,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:34:46,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595445619] [2022-04-28 03:34:46,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595445619] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:34:46,509 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:34:46,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 03:34:46,595 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:34:46,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [432633421] [2022-04-28 03:34:46,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [432633421] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:34:46,596 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:34:46,596 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 03:34:46,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69300404] [2022-04-28 03:34:46,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:34:46,597 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-28 03:34:46,598 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:34:46,598 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:34:46,617 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:34:46,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 03:34:46,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:34:46,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 03:34:46,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-04-28 03:34:46,619 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:34:46,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:34:46,846 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2022-04-28 03:34:46,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 03:34:46,847 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-28 03:34:46,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:34:46,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:34:46,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. [2022-04-28 03:34:46,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:34:46,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. [2022-04-28 03:34:46,853 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 25 transitions. [2022-04-28 03:34:46,877 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:34:46,878 INFO L225 Difference]: With dead ends: 23 [2022-04-28 03:34:46,878 INFO L226 Difference]: Without dead ends: 15 [2022-04-28 03:34:46,879 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-04-28 03:34:46,882 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 13 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:34:46,883 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 34 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 03:34:46,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-28 03:34:46,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-28 03:34:46,889 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:34:46,890 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:34:46,890 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:34:46,891 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:34:46,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:34:46,892 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-04-28 03:34:46,892 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-28 03:34:46,892 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:34:46,892 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:34:46,893 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-28 03:34:46,893 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-28 03:34:46,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:34:46,896 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-04-28 03:34:46,896 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-28 03:34:46,896 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:34:46,896 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:34:46,896 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:34:46,896 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:34:46,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:34:46,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2022-04-28 03:34:46,898 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 14 [2022-04-28 03:34:46,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:34:46,898 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2022-04-28 03:34:46,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:34:46,899 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 16 transitions. [2022-04-28 03:34:46,920 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:34:46,920 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-28 03:34:46,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-28 03:34:46,921 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:34:46,921 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:34:46,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 03:34:46,923 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:34:46,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:34:46,924 INFO L85 PathProgramCache]: Analyzing trace with hash -1025479988, now seen corresponding path program 1 times [2022-04-28 03:34:46,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:34:46,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [146603062] [2022-04-28 03:34:49,141 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:34:49,451 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:34:49,454 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:34:49,457 INFO L85 PathProgramCache]: Analyzing trace with hash -2032929875, now seen corresponding path program 1 times [2022-04-28 03:34:49,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:34:49,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879238857] [2022-04-28 03:34:49,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:34:49,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:34:49,481 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:34:49,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:34:49,584 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_2.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:34:49,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:34:49,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:34:49,946 INFO L290 TraceCheckUtils]: 0: Hoare triple {338#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {326#true} is VALID [2022-04-28 03:34:49,949 INFO L290 TraceCheckUtils]: 1: Hoare triple {326#true} assume true; {326#true} is VALID [2022-04-28 03:34:49,950 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {326#true} {326#true} #50#return; {326#true} is VALID [2022-04-28 03:34:49,951 INFO L272 TraceCheckUtils]: 0: Hoare triple {326#true} call ULTIMATE.init(); {338#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:34:49,951 INFO L290 TraceCheckUtils]: 1: Hoare triple {338#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {326#true} is VALID [2022-04-28 03:34:49,951 INFO L290 TraceCheckUtils]: 2: Hoare triple {326#true} assume true; {326#true} is VALID [2022-04-28 03:34:49,951 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {326#true} {326#true} #50#return; {326#true} is VALID [2022-04-28 03:34:49,951 INFO L272 TraceCheckUtils]: 4: Hoare triple {326#true} call #t~ret9 := main(); {326#true} is VALID [2022-04-28 03:34:49,952 INFO L290 TraceCheckUtils]: 5: Hoare triple {326#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {331#(and (= main_~n~0 main_~x~0) (= main_~y~0 0))} is VALID [2022-04-28 03:34:49,975 INFO L290 TraceCheckUtils]: 6: Hoare triple {331#(and (= main_~n~0 main_~x~0) (= main_~y~0 0))} [56] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post6_4| |v_main_#t~post6_3|)) (.cse1 (= |v_main_#t~post5_4| |v_main_#t~post5_3|)) (.cse2 (= v_main_~x~0_17 v_main_~x~0_16)) (.cse3 (= v_main_~y~0_6 v_main_~y~0_5)) (.cse4 (mod v_main_~x~0_17 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 (<= .cse4 0) .cse3) (and (< 0 .cse4) (< v_main_~y~0_6 v_main_~y~0_5) (forall ((v_it_2 Int)) (or (not (<= 1 v_it_2)) (< 0 (mod (+ v_main_~x~0_17 (* v_it_2 4294967295)) 4294967296)) (not (<= (+ v_main_~y~0_6 v_it_2 1) v_main_~y~0_5)))) (= v_main_~x~0_16 (+ v_main_~x~0_17 v_main_~y~0_6 (* (- 1) v_main_~y~0_5)))))) InVars {main_~y~0=v_main_~y~0_6, main_#t~post5=|v_main_#t~post5_4|, main_~x~0=v_main_~x~0_17, main_#t~post6=|v_main_#t~post6_4|} OutVars{main_~y~0=v_main_~y~0_5, main_#t~post5=|v_main_#t~post5_3|, main_~x~0=v_main_~x~0_16, main_#t~post6=|v_main_#t~post6_3|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {332#(or (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 main_~x~0) (+ (* 4294967296 (div (+ (- 1) main_~y~0 main_~x~0) 4294967296)) 4294967295)))} is VALID [2022-04-28 03:34:49,995 INFO L290 TraceCheckUtils]: 7: Hoare triple {332#(or (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 main_~x~0) (+ (* 4294967296 (div (+ (- 1) main_~y~0 main_~x~0) 4294967296)) 4294967295)))} [55] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[] {333#(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))) (<= (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) (+ 4294967295 (* (div (+ (- 1) main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296))))} is VALID [2022-04-28 03:34:50,005 INFO L290 TraceCheckUtils]: 8: Hoare triple {333#(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))) (<= (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) (+ 4294967295 (* (div (+ (- 1) main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296))))} ~z~0 := ~y~0; {334#(or (<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0) (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:34:50,007 INFO L290 TraceCheckUtils]: 9: Hoare triple {334#(or (<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0) (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); {335#(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:34:50,008 INFO L272 TraceCheckUtils]: 10: Hoare triple {335#(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)); {336#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:34:50,009 INFO L290 TraceCheckUtils]: 11: Hoare triple {336#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {337#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:34:50,012 INFO L290 TraceCheckUtils]: 12: Hoare triple {337#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {327#false} is VALID [2022-04-28 03:34:50,013 INFO L290 TraceCheckUtils]: 13: Hoare triple {327#false} assume !false; {327#false} is VALID [2022-04-28 03:34:50,017 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:34:50,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:34:50,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879238857] [2022-04-28 03:34:50,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879238857] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:34:50,019 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:34:50,019 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 03:34:50,844 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:34:50,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [146603062] [2022-04-28 03:34:50,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [146603062] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:34:50,845 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:34:50,845 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 03:34:50,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211548975] [2022-04-28 03:34:50,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:34:50,846 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 8 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-28 03:34:50,847 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:34:50,847 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 8 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:34:51,001 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:34:51,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 03:34:51,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:34:51,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 03:34:51,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-04-28 03:34:51,002 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 8 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:34:51,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:34:51,653 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2022-04-28 03:34:51,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 03:34:51,654 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 8 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-28 03:34:51,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:34:51,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 8 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:34:51,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 24 transitions. [2022-04-28 03:34:51,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 8 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:34:51,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 24 transitions. [2022-04-28 03:34:51,657 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 24 transitions. [2022-04-28 03:34:51,855 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:34:51,856 INFO L225 Difference]: With dead ends: 22 [2022-04-28 03:34:51,856 INFO L226 Difference]: Without dead ends: 17 [2022-04-28 03:34:51,856 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2022-04-28 03:34:51,857 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 12 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 13 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:34:51,857 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 36 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 38 Invalid, 0 Unknown, 13 Unchecked, 0.1s Time] [2022-04-28 03:34:51,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-28 03:34:51,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2022-04-28 03:34:51,898 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:34:51,899 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:34:51,899 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:34:51,899 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:34:51,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:34:51,900 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-28 03:34:51,900 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-28 03:34:51,901 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:34:51,901 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:34:51,901 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states 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:34:51,901 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states 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:34:51,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:34:51,902 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-28 03:34:51,902 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-28 03:34:51,902 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:34:51,903 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:34:51,903 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:34:51,903 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:34:51,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:34:51,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2022-04-28 03:34:51,904 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 14 [2022-04-28 03:34:51,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:34:51,904 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2022-04-28 03:34:51,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 8 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:34:51,904 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 17 transitions. [2022-04-28 03:34:54,031 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 16 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 03:34:54,032 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2022-04-28 03:34:54,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-28 03:34:54,032 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:34:54,032 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:34:54,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-28 03:34:54,033 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:34:54,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:34:54,033 INFO L85 PathProgramCache]: Analyzing trace with hash -1690613482, now seen corresponding path program 1 times [2022-04-28 03:34:54,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:34:54,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1197990829] [2022-04-28 03:34:54,385 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:34:54,388 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:34:54,390 INFO L85 PathProgramCache]: Analyzing trace with hash 1308890133, now seen corresponding path program 1 times [2022-04-28 03:34:54,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:34:54,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422271766] [2022-04-28 03:34:54,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:34:54,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:34:54,409 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:34:54,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:34:54,491 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.5))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:34:54,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:34:54,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:34:54,918 INFO L290 TraceCheckUtils]: 0: Hoare triple {478#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {465#true} is VALID [2022-04-28 03:34:54,918 INFO L290 TraceCheckUtils]: 1: Hoare triple {465#true} assume true; {465#true} is VALID [2022-04-28 03:34:54,918 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {465#true} {465#true} #50#return; {465#true} is VALID [2022-04-28 03:34:54,922 INFO L272 TraceCheckUtils]: 0: Hoare triple {465#true} call ULTIMATE.init(); {478#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:34:54,922 INFO L290 TraceCheckUtils]: 1: Hoare triple {478#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {465#true} is VALID [2022-04-28 03:34:54,922 INFO L290 TraceCheckUtils]: 2: Hoare triple {465#true} assume true; {465#true} is VALID [2022-04-28 03:34:54,922 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {465#true} {465#true} #50#return; {465#true} is VALID [2022-04-28 03:34:54,923 INFO L272 TraceCheckUtils]: 4: Hoare triple {465#true} call #t~ret9 := main(); {465#true} is VALID [2022-04-28 03:34:54,926 INFO L290 TraceCheckUtils]: 5: Hoare triple {465#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {470#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-28 03:34:54,992 INFO L290 TraceCheckUtils]: 6: Hoare triple {470#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} [58] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post6_9| |v_main_#t~post6_8|)) (.cse1 (= |v_main_#t~post5_9| |v_main_#t~post5_8|)) (.cse2 (= v_main_~x~0_24 v_main_~x~0_23)) (.cse3 (= v_main_~y~0_13 v_main_~y~0_12)) (.cse4 (mod v_main_~x~0_24 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 (<= .cse4 0) .cse2 .cse3) (and (< v_main_~x~0_23 v_main_~x~0_24) (forall ((v_it_3 Int)) (or (< 0 (mod (+ v_main_~x~0_24 (* v_it_3 4294967295)) 4294967296)) (not (<= 1 v_it_3)) (not (<= (+ v_main_~x~0_23 v_it_3 1) v_main_~x~0_24)))) (= (+ v_main_~x~0_24 v_main_~y~0_13 (* (- 1) v_main_~x~0_23)) v_main_~y~0_12) (< 0 .cse4)))) InVars {main_~y~0=v_main_~y~0_13, main_#t~post5=|v_main_#t~post5_9|, main_~x~0=v_main_~x~0_24, main_#t~post6=|v_main_#t~post6_9|} OutVars{main_~y~0=v_main_~y~0_12, main_#t~post5=|v_main_#t~post5_8|, main_~x~0=v_main_~x~0_23, main_#t~post6=|v_main_#t~post6_8|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {471#(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:34:55,005 INFO L290 TraceCheckUtils]: 7: Hoare triple {471#(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))} [57] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[] {472#(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:34:55,010 INFO L290 TraceCheckUtils]: 8: Hoare triple {472#(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; {473#(or (= main_~z~0 0) (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_~n~0 (* (div main_~z~0 4294967296) 4294967296) (* 4294967296 (div main_~x~0 4294967296))) (+ main_~z~0 main_~x~0 (* (div main_~n~0 4294967296) 4294967296)))))} is VALID [2022-04-28 03:34:55,017 INFO L290 TraceCheckUtils]: 9: Hoare triple {473#(or (= main_~z~0 0) (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_~n~0 (* (div main_~z~0 4294967296) 4294967296) (* 4294967296 (div main_~x~0 4294967296))) (+ main_~z~0 main_~x~0 (* (div main_~n~0 4294967296) 4294967296)))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {474#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296) (* 4294967296 (div main_~x~0 4294967296))) (+ main_~z~0 main_~x~0 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-28 03:34:55,018 INFO L290 TraceCheckUtils]: 10: Hoare triple {474#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296) (* 4294967296 (div main_~x~0 4294967296))) (+ main_~z~0 main_~x~0 (* (div main_~n~0 4294967296) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {475#(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:34:55,020 INFO L272 TraceCheckUtils]: 11: Hoare triple {475#(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)); {476#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:34:55,020 INFO L290 TraceCheckUtils]: 12: Hoare triple {476#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {477#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:34:55,021 INFO L290 TraceCheckUtils]: 13: Hoare triple {477#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {466#false} is VALID [2022-04-28 03:34:55,021 INFO L290 TraceCheckUtils]: 14: Hoare triple {466#false} assume !false; {466#false} is VALID [2022-04-28 03:34:55,021 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:34:55,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:34:55,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422271766] [2022-04-28 03:34:55,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422271766] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:34:55,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1069298894] [2022-04-28 03:34:55,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:34:55,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:34:55,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:34:55,037 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:34:55,063 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:34:55,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:34:55,297 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-28 03:34:55,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:34:55,368 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:35:05,936 WARN L232 SmtUtils]: Spent 6.15s on a formula simplification that was a NOOP. DAG size: 39 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-28 03:35:33,513 INFO L272 TraceCheckUtils]: 0: Hoare triple {465#true} call ULTIMATE.init(); {465#true} is VALID [2022-04-28 03:35:33,514 INFO L290 TraceCheckUtils]: 1: Hoare triple {465#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {465#true} is VALID [2022-04-28 03:35:33,514 INFO L290 TraceCheckUtils]: 2: Hoare triple {465#true} assume true; {465#true} is VALID [2022-04-28 03:35:33,514 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {465#true} {465#true} #50#return; {465#true} is VALID [2022-04-28 03:35:33,515 INFO L272 TraceCheckUtils]: 4: Hoare triple {465#true} call #t~ret9 := main(); {465#true} is VALID [2022-04-28 03:35:33,515 INFO L290 TraceCheckUtils]: 5: Hoare triple {465#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {470#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-28 03:35:33,538 INFO L290 TraceCheckUtils]: 6: Hoare triple {470#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} [58] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post6_9| |v_main_#t~post6_8|)) (.cse1 (= |v_main_#t~post5_9| |v_main_#t~post5_8|)) (.cse2 (= v_main_~x~0_24 v_main_~x~0_23)) (.cse3 (= v_main_~y~0_13 v_main_~y~0_12)) (.cse4 (mod v_main_~x~0_24 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 (<= .cse4 0) .cse2 .cse3) (and (< v_main_~x~0_23 v_main_~x~0_24) (forall ((v_it_3 Int)) (or (< 0 (mod (+ v_main_~x~0_24 (* v_it_3 4294967295)) 4294967296)) (not (<= 1 v_it_3)) (not (<= (+ v_main_~x~0_23 v_it_3 1) v_main_~x~0_24)))) (= (+ v_main_~x~0_24 v_main_~y~0_13 (* (- 1) v_main_~x~0_23)) v_main_~y~0_12) (< 0 .cse4)))) InVars {main_~y~0=v_main_~y~0_13, main_#t~post5=|v_main_#t~post5_9|, main_~x~0=v_main_~x~0_24, main_#t~post6=|v_main_#t~post6_9|} OutVars{main_~y~0=v_main_~y~0_12, main_#t~post5=|v_main_#t~post5_8|, main_~x~0=v_main_~x~0_23, main_#t~post6=|v_main_#t~post6_8|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {500#(or (and (< main_~x~0 main_~n~0) (forall ((v_it_3 Int)) (or (not (<= 1 v_it_3)) (not (<= (+ v_it_3 main_~x~0 1) main_~n~0)) (< 0 (mod (+ main_~n~0 (* v_it_3 4294967295)) 4294967296)))) (< 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:35:33,540 INFO L290 TraceCheckUtils]: 7: Hoare triple {500#(or (and (< main_~x~0 main_~n~0) (forall ((v_it_3 Int)) (or (not (<= 1 v_it_3)) (not (<= (+ v_it_3 main_~x~0 1) main_~n~0)) (< 0 (mod (+ main_~n~0 (* v_it_3 4294967295)) 4294967296)))) (< 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)))} [57] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[] {504#(and (not (< 0 (mod main_~x~0 4294967296))) (or (and (< main_~x~0 main_~n~0) (forall ((v_it_3 Int)) (or (not (<= 1 v_it_3)) (not (<= (+ v_it_3 main_~x~0 1) main_~n~0)) (< 0 (mod (+ main_~n~0 (* v_it_3 4294967295)) 4294967296)))) (< 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:35:33,541 INFO L290 TraceCheckUtils]: 8: Hoare triple {504#(and (not (< 0 (mod main_~x~0 4294967296))) (or (and (< main_~x~0 main_~n~0) (forall ((v_it_3 Int)) (or (not (<= 1 v_it_3)) (not (<= (+ v_it_3 main_~x~0 1) main_~n~0)) (< 0 (mod (+ main_~n~0 (* v_it_3 4294967295)) 4294967296)))) (< 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))))} ~z~0 := ~y~0; {508#(and (not (< 0 (mod main_~x~0 4294967296))) (or (and (< main_~x~0 main_~n~0) (forall ((v_it_3 Int)) (or (not (<= 1 v_it_3)) (not (<= (+ v_it_3 main_~x~0 1) main_~n~0)) (< 0 (mod (+ main_~n~0 (* v_it_3 4294967295)) 4294967296)))) (< 0 (mod main_~n~0 4294967296)) (= main_~z~0 (+ main_~n~0 (* (- 1) main_~x~0)))) (and (= main_~z~0 0) (= main_~n~0 main_~x~0))))} is VALID [2022-04-28 03:35:33,548 INFO L290 TraceCheckUtils]: 9: Hoare triple {508#(and (not (< 0 (mod main_~x~0 4294967296))) (or (and (< main_~x~0 main_~n~0) (forall ((v_it_3 Int)) (or (not (<= 1 v_it_3)) (not (<= (+ v_it_3 main_~x~0 1) main_~n~0)) (< 0 (mod (+ main_~n~0 (* v_it_3 4294967295)) 4294967296)))) (< 0 (mod main_~n~0 4294967296)) (= main_~z~0 (+ main_~n~0 (* (- 1) main_~x~0)))) (and (= main_~z~0 0) (= main_~n~0 main_~x~0))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {512#(and (or (and (= (+ main_~z~0 1) 0) (= (+ (- 1) main_~x~0) main_~n~0)) (and (< main_~x~0 (+ main_~n~0 1)) (forall ((v_it_3 Int)) (or (not (<= 1 v_it_3)) (not (<= (+ v_it_3 main_~x~0) main_~n~0)) (< 0 (mod (+ main_~n~0 (* v_it_3 4294967295)) 4294967296)))) (< 0 (mod main_~n~0 4294967296)) (= (+ main_~n~0 (* (- 1) main_~x~0) 1) (+ main_~z~0 1)))) (not (< 0 (mod (+ main_~x~0 4294967295) 4294967296))))} is VALID [2022-04-28 03:35:33,550 INFO L290 TraceCheckUtils]: 10: Hoare triple {512#(and (or (and (= (+ main_~z~0 1) 0) (= (+ (- 1) main_~x~0) main_~n~0)) (and (< main_~x~0 (+ main_~n~0 1)) (forall ((v_it_3 Int)) (or (not (<= 1 v_it_3)) (not (<= (+ v_it_3 main_~x~0) main_~n~0)) (< 0 (mod (+ main_~n~0 (* v_it_3 4294967295)) 4294967296)))) (< 0 (mod main_~n~0 4294967296)) (= (+ main_~n~0 (* (- 1) main_~x~0) 1) (+ main_~z~0 1)))) (not (< 0 (mod (+ main_~x~0 4294967295) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {516#(and (< main_~x~0 (+ main_~n~0 1)) (not (< 0 (mod (+ main_~x~0 4294967295) 4294967296))) (<= (div (+ main_~x~0 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (* (- 1) main_~x~0)) 4294967296)) (forall ((v_it_3 Int)) (or (not (<= 1 v_it_3)) (not (<= (+ v_it_3 main_~x~0) main_~n~0)) (< 0 (mod (+ main_~n~0 (* v_it_3 4294967295)) 4294967296)))))} is VALID [2022-04-28 03:35:33,578 INFO L272 TraceCheckUtils]: 11: Hoare triple {516#(and (< main_~x~0 (+ main_~n~0 1)) (not (< 0 (mod (+ main_~x~0 4294967295) 4294967296))) (<= (div (+ main_~x~0 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (* (- 1) main_~x~0)) 4294967296)) (forall ((v_it_3 Int)) (or (not (<= 1 v_it_3)) (not (<= (+ v_it_3 main_~x~0) main_~n~0)) (< 0 (mod (+ main_~n~0 (* v_it_3 4294967295)) 4294967296)))))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {520#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:35:33,578 INFO L290 TraceCheckUtils]: 12: Hoare triple {520#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {524#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:35:33,579 INFO L290 TraceCheckUtils]: 13: Hoare triple {524#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {466#false} is VALID [2022-04-28 03:35:33,579 INFO L290 TraceCheckUtils]: 14: Hoare triple {466#false} assume !false; {466#false} is VALID [2022-04-28 03:35:33,579 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:35:33,579 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:36:01,087 INFO L290 TraceCheckUtils]: 14: Hoare triple {466#false} assume !false; {466#false} is VALID [2022-04-28 03:36:01,088 INFO L290 TraceCheckUtils]: 13: Hoare triple {524#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {466#false} is VALID [2022-04-28 03:36:01,088 INFO L290 TraceCheckUtils]: 12: Hoare triple {520#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {524#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:36:01,089 INFO L272 TraceCheckUtils]: 11: Hoare triple {475#(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)); {520#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:36:01,090 INFO L290 TraceCheckUtils]: 10: Hoare triple {543#(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); {475#(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:36:01,092 INFO L290 TraceCheckUtils]: 9: Hoare triple {547#(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~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {543#(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:36:01,093 INFO L290 TraceCheckUtils]: 8: Hoare triple {551#(or (< 0 (mod (+ main_~y~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)))))} ~z~0 := ~y~0; {547#(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:36:01,094 INFO L290 TraceCheckUtils]: 7: Hoare triple {555#(or (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (< 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)))))} [57] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[] {551#(or (< 0 (mod (+ main_~y~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:36:03,153 WARN L290 TraceCheckUtils]: 6: Hoare triple {559#(and (forall ((aux_div_aux_mod_v_main_~x~0_31_31_89 Int) (aux_mod_aux_mod_v_main_~x~0_31_31_89 Int) (aux_div_v_main_~x~0_31_31 Int)) (or (< (+ aux_mod_aux_mod_v_main_~x~0_31_31_89 (* aux_div_aux_mod_v_main_~x~0_31_31_89 4294967296)) (+ (* aux_div_v_main_~x~0_31_31 4294967296) 1)) (< aux_mod_aux_mod_v_main_~x~0_31_31_89 0) (and (or (< (div (+ (- 4294967296) (* (- 1) main_~y~0)) (- 4294967296)) (+ 2 (div (+ main_~y~0 4294967294) 4294967296))) (not (= (+ (- 1) aux_mod_aux_mod_v_main_~x~0_31_31_89 (* aux_div_aux_mod_v_main_~x~0_31_31_89 4294967296)) main_~x~0))) (or (not (< (+ aux_mod_aux_mod_v_main_~x~0_31_31_89 (* aux_div_aux_mod_v_main_~x~0_31_31_89 4294967296)) (+ main_~x~0 1))) (not (< 0 (mod main_~x~0 4294967296))) (forall ((aux_div_v_main_~y~0_18_46 Int)) (or (< (+ main_~y~0 main_~x~0 4294967296) (+ (* aux_div_v_main_~y~0_18_46 4294967296) aux_mod_aux_mod_v_main_~x~0_31_31_89 (* aux_div_aux_mod_v_main_~x~0_31_31_89 4294967296))) (< (+ (* aux_div_v_main_~y~0_18_46 4294967296) aux_mod_aux_mod_v_main_~x~0_31_31_89 (* aux_div_aux_mod_v_main_~x~0_31_31_89 4294967296)) (+ main_~y~0 main_~x~0 4294967296)))) (exists ((v_it_3 Int)) (and (<= (+ v_it_3 aux_mod_aux_mod_v_main_~x~0_31_31_89 (* aux_div_aux_mod_v_main_~x~0_31_31_89 4294967296)) main_~x~0) (not (< 0 (mod (+ main_~x~0 (* v_it_3 4294967295)) 4294967296))) (<= 1 v_it_3))))) (< (+ (* aux_div_v_main_~x~0_31_31 4294967296) 1) (+ aux_mod_aux_mod_v_main_~x~0_31_31_89 (* aux_div_aux_mod_v_main_~x~0_31_31_89 4294967296))) (< main_~n~0 (+ aux_mod_aux_mod_v_main_~x~0_31_31_89 (* (div main_~n~0 4294967296) 4294967296) 1)))) (forall ((aux_div_aux_mod_v_main_~x~0_31_31_89 Int) (aux_mod_aux_mod_v_main_~x~0_31_31_89 Int) (aux_div_v_main_~x~0_31_31 Int)) (or (<= 4294967296 aux_mod_aux_mod_v_main_~x~0_31_31_89) (< (+ aux_mod_aux_mod_v_main_~x~0_31_31_89 (* aux_div_aux_mod_v_main_~x~0_31_31_89 4294967296)) (+ (* aux_div_v_main_~x~0_31_31 4294967296) 1)) (and (or (< (div (+ (- 4294967296) (* (- 1) main_~y~0)) (- 4294967296)) (+ 2 (div (+ main_~y~0 4294967294) 4294967296))) (not (= (+ (- 1) aux_mod_aux_mod_v_main_~x~0_31_31_89 (* aux_div_aux_mod_v_main_~x~0_31_31_89 4294967296)) main_~x~0))) (or (not (< (+ aux_mod_aux_mod_v_main_~x~0_31_31_89 (* aux_div_aux_mod_v_main_~x~0_31_31_89 4294967296)) (+ main_~x~0 1))) (not (< 0 (mod main_~x~0 4294967296))) (forall ((aux_div_v_main_~y~0_18_46 Int)) (or (< (+ main_~y~0 main_~x~0 4294967296) (+ (* aux_div_v_main_~y~0_18_46 4294967296) aux_mod_aux_mod_v_main_~x~0_31_31_89 (* aux_div_aux_mod_v_main_~x~0_31_31_89 4294967296))) (< (+ (* aux_div_v_main_~y~0_18_46 4294967296) aux_mod_aux_mod_v_main_~x~0_31_31_89 (* aux_div_aux_mod_v_main_~x~0_31_31_89 4294967296)) (+ main_~y~0 main_~x~0 4294967296)))) (exists ((v_it_3 Int)) (and (<= (+ v_it_3 aux_mod_aux_mod_v_main_~x~0_31_31_89 (* aux_div_aux_mod_v_main_~x~0_31_31_89 4294967296)) main_~x~0) (not (< 0 (mod (+ main_~x~0 (* v_it_3 4294967295)) 4294967296))) (<= 1 v_it_3))))) (< (+ (* aux_div_v_main_~x~0_31_31 4294967296) 1) (+ aux_mod_aux_mod_v_main_~x~0_31_31_89 (* aux_div_aux_mod_v_main_~x~0_31_31_89 4294967296))) (<= (+ aux_mod_aux_mod_v_main_~x~0_31_31_89 (* (div main_~n~0 4294967296) 4294967296)) main_~n~0))))} [58] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post6_9| |v_main_#t~post6_8|)) (.cse1 (= |v_main_#t~post5_9| |v_main_#t~post5_8|)) (.cse2 (= v_main_~x~0_24 v_main_~x~0_23)) (.cse3 (= v_main_~y~0_13 v_main_~y~0_12)) (.cse4 (mod v_main_~x~0_24 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 (<= .cse4 0) .cse2 .cse3) (and (< v_main_~x~0_23 v_main_~x~0_24) (forall ((v_it_3 Int)) (or (< 0 (mod (+ v_main_~x~0_24 (* v_it_3 4294967295)) 4294967296)) (not (<= 1 v_it_3)) (not (<= (+ v_main_~x~0_23 v_it_3 1) v_main_~x~0_24)))) (= (+ v_main_~x~0_24 v_main_~y~0_13 (* (- 1) v_main_~x~0_23)) v_main_~y~0_12) (< 0 .cse4)))) InVars {main_~y~0=v_main_~y~0_13, main_#t~post5=|v_main_#t~post5_9|, main_~x~0=v_main_~x~0_24, main_#t~post6=|v_main_#t~post6_9|} OutVars{main_~y~0=v_main_~y~0_12, main_#t~post5=|v_main_#t~post5_8|, main_~x~0=v_main_~x~0_23, main_#t~post6=|v_main_#t~post6_8|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {555#(or (< 0 (mod (+ main_~y~0 4294967295) 4294967296)) (< 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 UNKNOWN [2022-04-28 03:36:03,164 INFO L290 TraceCheckUtils]: 5: Hoare triple {465#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {559#(and (forall ((aux_div_aux_mod_v_main_~x~0_31_31_89 Int) (aux_mod_aux_mod_v_main_~x~0_31_31_89 Int) (aux_div_v_main_~x~0_31_31 Int)) (or (< (+ aux_mod_aux_mod_v_main_~x~0_31_31_89 (* aux_div_aux_mod_v_main_~x~0_31_31_89 4294967296)) (+ (* aux_div_v_main_~x~0_31_31 4294967296) 1)) (< aux_mod_aux_mod_v_main_~x~0_31_31_89 0) (and (or (< (div (+ (- 4294967296) (* (- 1) main_~y~0)) (- 4294967296)) (+ 2 (div (+ main_~y~0 4294967294) 4294967296))) (not (= (+ (- 1) aux_mod_aux_mod_v_main_~x~0_31_31_89 (* aux_div_aux_mod_v_main_~x~0_31_31_89 4294967296)) main_~x~0))) (or (not (< (+ aux_mod_aux_mod_v_main_~x~0_31_31_89 (* aux_div_aux_mod_v_main_~x~0_31_31_89 4294967296)) (+ main_~x~0 1))) (not (< 0 (mod main_~x~0 4294967296))) (forall ((aux_div_v_main_~y~0_18_46 Int)) (or (< (+ main_~y~0 main_~x~0 4294967296) (+ (* aux_div_v_main_~y~0_18_46 4294967296) aux_mod_aux_mod_v_main_~x~0_31_31_89 (* aux_div_aux_mod_v_main_~x~0_31_31_89 4294967296))) (< (+ (* aux_div_v_main_~y~0_18_46 4294967296) aux_mod_aux_mod_v_main_~x~0_31_31_89 (* aux_div_aux_mod_v_main_~x~0_31_31_89 4294967296)) (+ main_~y~0 main_~x~0 4294967296)))) (exists ((v_it_3 Int)) (and (<= (+ v_it_3 aux_mod_aux_mod_v_main_~x~0_31_31_89 (* aux_div_aux_mod_v_main_~x~0_31_31_89 4294967296)) main_~x~0) (not (< 0 (mod (+ main_~x~0 (* v_it_3 4294967295)) 4294967296))) (<= 1 v_it_3))))) (< (+ (* aux_div_v_main_~x~0_31_31 4294967296) 1) (+ aux_mod_aux_mod_v_main_~x~0_31_31_89 (* aux_div_aux_mod_v_main_~x~0_31_31_89 4294967296))) (< main_~n~0 (+ aux_mod_aux_mod_v_main_~x~0_31_31_89 (* (div main_~n~0 4294967296) 4294967296) 1)))) (forall ((aux_div_aux_mod_v_main_~x~0_31_31_89 Int) (aux_mod_aux_mod_v_main_~x~0_31_31_89 Int) (aux_div_v_main_~x~0_31_31 Int)) (or (<= 4294967296 aux_mod_aux_mod_v_main_~x~0_31_31_89) (< (+ aux_mod_aux_mod_v_main_~x~0_31_31_89 (* aux_div_aux_mod_v_main_~x~0_31_31_89 4294967296)) (+ (* aux_div_v_main_~x~0_31_31 4294967296) 1)) (and (or (< (div (+ (- 4294967296) (* (- 1) main_~y~0)) (- 4294967296)) (+ 2 (div (+ main_~y~0 4294967294) 4294967296))) (not (= (+ (- 1) aux_mod_aux_mod_v_main_~x~0_31_31_89 (* aux_div_aux_mod_v_main_~x~0_31_31_89 4294967296)) main_~x~0))) (or (not (< (+ aux_mod_aux_mod_v_main_~x~0_31_31_89 (* aux_div_aux_mod_v_main_~x~0_31_31_89 4294967296)) (+ main_~x~0 1))) (not (< 0 (mod main_~x~0 4294967296))) (forall ((aux_div_v_main_~y~0_18_46 Int)) (or (< (+ main_~y~0 main_~x~0 4294967296) (+ (* aux_div_v_main_~y~0_18_46 4294967296) aux_mod_aux_mod_v_main_~x~0_31_31_89 (* aux_div_aux_mod_v_main_~x~0_31_31_89 4294967296))) (< (+ (* aux_div_v_main_~y~0_18_46 4294967296) aux_mod_aux_mod_v_main_~x~0_31_31_89 (* aux_div_aux_mod_v_main_~x~0_31_31_89 4294967296)) (+ main_~y~0 main_~x~0 4294967296)))) (exists ((v_it_3 Int)) (and (<= (+ v_it_3 aux_mod_aux_mod_v_main_~x~0_31_31_89 (* aux_div_aux_mod_v_main_~x~0_31_31_89 4294967296)) main_~x~0) (not (< 0 (mod (+ main_~x~0 (* v_it_3 4294967295)) 4294967296))) (<= 1 v_it_3))))) (< (+ (* aux_div_v_main_~x~0_31_31 4294967296) 1) (+ aux_mod_aux_mod_v_main_~x~0_31_31_89 (* aux_div_aux_mod_v_main_~x~0_31_31_89 4294967296))) (<= (+ aux_mod_aux_mod_v_main_~x~0_31_31_89 (* (div main_~n~0 4294967296) 4294967296)) main_~n~0))))} is VALID [2022-04-28 03:36:03,164 INFO L272 TraceCheckUtils]: 4: Hoare triple {465#true} call #t~ret9 := main(); {465#true} is VALID [2022-04-28 03:36:03,165 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {465#true} {465#true} #50#return; {465#true} is VALID [2022-04-28 03:36:03,165 INFO L290 TraceCheckUtils]: 2: Hoare triple {465#true} assume true; {465#true} is VALID [2022-04-28 03:36:03,165 INFO L290 TraceCheckUtils]: 1: Hoare triple {465#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {465#true} is VALID [2022-04-28 03:36:03,165 INFO L272 TraceCheckUtils]: 0: Hoare triple {465#true} call ULTIMATE.init(); {465#true} is VALID [2022-04-28 03:36:03,165 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:36:03,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1069298894] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:36:03,166 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:36:03,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 23 [2022-04-28 03:36:06,635 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:36:06,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1197990829] [2022-04-28 03:36:06,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1197990829] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:36:06,636 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:36:06,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 03:36:06,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906468432] [2022-04-28 03:36:06,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:36:06,636 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.1) internal successors, (11), 9 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-28 03:36:06,637 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:36:06,637 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 1.1) internal successors, (11), 9 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:36:06,673 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:36:06,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 03:36:06,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:36:06,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 03:36:06,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=454, Unknown=8, NotChecked=0, Total=552 [2022-04-28 03:36:06,675 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 9 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:36:11,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:36:11,693 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2022-04-28 03:36:11,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 03:36:11,693 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.1) internal successors, (11), 9 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-28 03:36:11,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:36:11,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 9 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:36:11,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 25 transitions. [2022-04-28 03:36:11,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 9 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:36:11,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 25 transitions. [2022-04-28 03:36:11,696 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 25 transitions. [2022-04-28 03:36:13,945 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:36:13,946 INFO L225 Difference]: With dead ends: 23 [2022-04-28 03:36:13,946 INFO L226 Difference]: Without dead ends: 18 [2022-04-28 03:36:13,946 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 18 SyntacticMatches, 4 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 39.5s TimeCoverageRelationStatistics Valid=144, Invalid=776, Unknown=10, NotChecked=0, Total=930 [2022-04-28 03:36:13,949 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 11 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 14 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:36:13,949 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 41 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 53 Invalid, 0 Unknown, 14 Unchecked, 0.1s Time] [2022-04-28 03:36:13,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-04-28 03:36:13,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2022-04-28 03:36:13,966 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:36:13,966 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 17 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:36:13,966 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 17 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:36:13,966 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 17 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:36:13,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:36:13,967 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2022-04-28 03:36:13,968 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-28 03:36:13,968 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:36:13,968 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:36:13,968 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 18 states. [2022-04-28 03:36:13,968 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 18 states. [2022-04-28 03:36:13,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:36:13,969 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2022-04-28 03:36:13,969 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-28 03:36:13,970 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:36:13,970 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:36:13,970 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:36:13,970 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:36:13,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:36:13,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2022-04-28 03:36:13,972 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 15 [2022-04-28 03:36:13,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:36:13,972 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2022-04-28 03:36:13,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.1) internal successors, (11), 9 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:36:13,972 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 18 transitions. [2022-04-28 03:36:16,357 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 17 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 03:36:16,358 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2022-04-28 03:36:16,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-28 03:36:16,358 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:36:16,358 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:36:16,363 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:36:16,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:36:16,559 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:36:16,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:36:16,560 INFO L85 PathProgramCache]: Analyzing trace with hash -834915316, now seen corresponding path program 2 times [2022-04-28 03:36:16,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:36:16,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [219017486] [2022-04-28 03:36:16,801 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:36:16,811 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:36:16,814 INFO L85 PathProgramCache]: Analyzing trace with hash -2052552403, now seen corresponding path program 1 times [2022-04-28 03:36:16,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:36:16,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530217268] [2022-04-28 03:36:16,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:36:16,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:36:16,824 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:36:16,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:36:16,846 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.4))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-04-28 03:36:17,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:36:17,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:36:17,966 INFO L290 TraceCheckUtils]: 0: Hoare triple {725#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {711#true} is VALID [2022-04-28 03:36:17,966 INFO L290 TraceCheckUtils]: 1: Hoare triple {711#true} assume true; {711#true} is VALID [2022-04-28 03:36:17,966 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {711#true} {711#true} #50#return; {711#true} is VALID [2022-04-28 03:36:17,967 INFO L272 TraceCheckUtils]: 0: Hoare triple {711#true} call ULTIMATE.init(); {725#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:36:17,967 INFO L290 TraceCheckUtils]: 1: Hoare triple {725#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {711#true} is VALID [2022-04-28 03:36:17,968 INFO L290 TraceCheckUtils]: 2: Hoare triple {711#true} assume true; {711#true} is VALID [2022-04-28 03:36:17,968 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {711#true} {711#true} #50#return; {711#true} is VALID [2022-04-28 03:36:17,968 INFO L272 TraceCheckUtils]: 4: Hoare triple {711#true} call #t~ret9 := main(); {711#true} is VALID [2022-04-28 03:36:17,968 INFO L290 TraceCheckUtils]: 5: Hoare triple {711#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {716#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-28 03:36:17,979 INFO L290 TraceCheckUtils]: 6: Hoare triple {716#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} [60] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_36 4294967296)) (.cse1 (= |v_main_#t~post6_16| |v_main_#t~post6_15|)) (.cse2 (= |v_main_#t~post5_16| |v_main_#t~post5_15|)) (.cse3 (= v_main_~y~0_23 v_main_~y~0_22)) (.cse4 (= v_main_~x~0_36 v_main_~x~0_35))) (or (and (< v_main_~y~0_23 v_main_~y~0_22) (= v_main_~x~0_35 (+ v_main_~x~0_36 (* (- 1) v_main_~y~0_22) v_main_~y~0_23)) (< 0 .cse0) (forall ((v_it_4 Int)) (or (not (<= (+ v_main_~y~0_23 v_it_4 1) v_main_~y~0_22)) (< 0 (mod (+ (* v_it_4 4294967295) v_main_~x~0_36) 4294967296)) (not (<= 1 v_it_4))))) (and .cse1 (<= .cse0 0) .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_23, main_#t~post5=|v_main_#t~post5_16|, main_~x~0=v_main_~x~0_36, main_#t~post6=|v_main_#t~post6_16|} OutVars{main_~y~0=v_main_~y~0_22, main_#t~post5=|v_main_#t~post5_15|, main_~x~0=v_main_~x~0_35, main_#t~post6=|v_main_#t~post6_15|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {717#(or (and (<= 0 main_~y~0) (<= main_~y~0 0)) (and (<= (+ main_~y~0 main_~x~0) (+ 4294967295 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 main_~x~0) (+ (* 4294967296 (div (+ (* 4294967296 (div (+ (- 1) main_~y~0 main_~x~0) 4294967296)) main_~y~0 main_~x~0 (* (- 1) main_~n~0)) 4294967296)) 4294967295)) (<= (+ (* (div (+ main_~y~0 main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) (+ main_~y~0 main_~x~0))))} is VALID [2022-04-28 03:36:18,262 INFO L290 TraceCheckUtils]: 7: Hoare triple {717#(or (and (<= 0 main_~y~0) (<= main_~y~0 0)) (and (<= (+ main_~y~0 main_~x~0) (+ 4294967295 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 main_~x~0) (+ (* 4294967296 (div (+ (* 4294967296 (div (+ (- 1) main_~y~0 main_~x~0) 4294967296)) main_~y~0 main_~x~0 (* (- 1) main_~n~0)) 4294967296)) 4294967295)) (<= (+ (* (div (+ main_~y~0 main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) (+ main_~y~0 main_~x~0))))} [59] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[] {718#(or (and (<= 0 main_~y~0) (<= main_~y~0 0)) (and (<= (+ (* (div (+ main_~y~0 main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) (+ (* (div (+ (* (- 1) main_~x~0) (* (div main_~n~0 4294967296) 4294967296) (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296) 4294967295)) (<= (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) (+ 4294967295 (* (div (+ main_~y~0 main_~x~0 (* (div (+ (- 1) main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296)))))} is VALID [2022-04-28 03:36:18,264 INFO L290 TraceCheckUtils]: 8: Hoare triple {718#(or (and (<= 0 main_~y~0) (<= main_~y~0 0)) (and (<= (+ (* (div (+ main_~y~0 main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) (+ (* (div (+ (* (- 1) main_~x~0) (* (div main_~n~0 4294967296) 4294967296) (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296) 4294967295)) (<= (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) (+ 4294967295 (* (div (+ main_~y~0 main_~x~0 (* (div (+ (- 1) main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296)))))} ~z~0 := ~y~0; {719#(or (and (<= (+ main_~z~0 (* 4294967296 (div main_~x~0 4294967296))) (+ (* (div (+ main_~z~0 main_~x~0 (* (div (+ (- 1) main_~z~0 (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967295)) (<= (+ (* (div (+ main_~z~0 main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) (+ main_~z~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ main_~z~0 (* 4294967296 (div main_~x~0 4294967296))) (+ (* (div (+ (* (- 1) main_~x~0) (* (div main_~n~0 4294967296) 4294967296) (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296) 4294967295))) (and (<= main_~z~0 0) (<= 0 main_~z~0)))} is VALID [2022-04-28 03:36:18,596 INFO L290 TraceCheckUtils]: 9: Hoare triple {719#(or (and (<= (+ main_~z~0 (* 4294967296 (div main_~x~0 4294967296))) (+ (* (div (+ main_~z~0 main_~x~0 (* (div (+ (- 1) main_~z~0 (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967295)) (<= (+ (* (div (+ main_~z~0 main_~x~0 4294967295 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 1) (+ main_~z~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ main_~z~0 (* 4294967296 (div main_~x~0 4294967296))) (+ (* (div (+ (* (- 1) main_~x~0) (* (div main_~n~0 4294967296) 4294967296) (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296) 4294967295))) (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; {720#(and (<= (+ (* (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) 1) main_~x~0) (<= 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 (+ (* (div (+ (* (- 1) main_~x~0) (* (div main_~n~0 4294967296) 4294967296) 1) 4294967296) 4294967296) 4294967294)))} is VALID [2022-04-28 03:36:18,633 INFO L290 TraceCheckUtils]: 10: Hoare triple {720#(and (<= (+ (* (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) 1) main_~x~0) (<= 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 (+ (* (div (+ (* (- 1) main_~x~0) (* (div main_~n~0 4294967296) 4294967296) 1) 4294967296) 4294967296) 4294967294)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {721#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (or (<= (+ main_~x~0 4294967294 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296) (* 4294967296 (div main_~x~0 4294967296))) (+ main_~z~0 main_~x~0 (* (div main_~n~0 4294967296) 4294967296)))))} is VALID [2022-04-28 03:36:18,634 INFO L290 TraceCheckUtils]: 11: Hoare triple {721#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (or (<= (+ main_~x~0 4294967294 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296) (* 4294967296 (div main_~x~0 4294967296))) (+ main_~z~0 main_~x~0 (* (div main_~n~0 4294967296) 4294967296)))))} assume !(~z~0 % 4294967296 > 0); {722#(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:36:18,635 INFO L272 TraceCheckUtils]: 12: Hoare triple {722#(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)); {723#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:36:18,636 INFO L290 TraceCheckUtils]: 13: Hoare triple {723#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {724#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:36:18,636 INFO L290 TraceCheckUtils]: 14: Hoare triple {724#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {712#false} is VALID [2022-04-28 03:36:18,637 INFO L290 TraceCheckUtils]: 15: Hoare triple {712#false} assume !false; {712#false} is VALID [2022-04-28 03:36:18,637 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:36:18,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:36:18,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530217268] [2022-04-28 03:36:18,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530217268] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:36:18,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1828157490] [2022-04-28 03:36:18,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:36:18,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:36:18,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:36:18,641 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:36:18,642 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-28 03:36:18,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:36:18,895 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-28 03:36:19,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:36:19,008 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:36:52,166 INFO L272 TraceCheckUtils]: 0: Hoare triple {711#true} call ULTIMATE.init(); {711#true} is VALID [2022-04-28 03:36:52,166 INFO L290 TraceCheckUtils]: 1: Hoare triple {711#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {711#true} is VALID [2022-04-28 03:36:52,166 INFO L290 TraceCheckUtils]: 2: Hoare triple {711#true} assume true; {711#true} is VALID [2022-04-28 03:36:52,166 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {711#true} {711#true} #50#return; {711#true} is VALID [2022-04-28 03:36:52,166 INFO L272 TraceCheckUtils]: 4: Hoare triple {711#true} call #t~ret9 := main(); {711#true} is VALID [2022-04-28 03:36:52,171 INFO L290 TraceCheckUtils]: 5: Hoare triple {711#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {716#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-28 03:36:52,186 INFO L290 TraceCheckUtils]: 6: Hoare triple {716#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} [60] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_36 4294967296)) (.cse1 (= |v_main_#t~post6_16| |v_main_#t~post6_15|)) (.cse2 (= |v_main_#t~post5_16| |v_main_#t~post5_15|)) (.cse3 (= v_main_~y~0_23 v_main_~y~0_22)) (.cse4 (= v_main_~x~0_36 v_main_~x~0_35))) (or (and (< v_main_~y~0_23 v_main_~y~0_22) (= v_main_~x~0_35 (+ v_main_~x~0_36 (* (- 1) v_main_~y~0_22) v_main_~y~0_23)) (< 0 .cse0) (forall ((v_it_4 Int)) (or (not (<= (+ v_main_~y~0_23 v_it_4 1) v_main_~y~0_22)) (< 0 (mod (+ (* v_it_4 4294967295) v_main_~x~0_36) 4294967296)) (not (<= 1 v_it_4))))) (and .cse1 (<= .cse0 0) .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_23, main_#t~post5=|v_main_#t~post5_16|, main_~x~0=v_main_~x~0_36, main_#t~post6=|v_main_#t~post6_16|} OutVars{main_~y~0=v_main_~y~0_22, main_#t~post5=|v_main_#t~post5_15|, main_~x~0=v_main_~x~0_35, main_#t~post6=|v_main_#t~post6_15|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {747#(or (and (= main_~x~0 (+ main_~n~0 (* (- 1) main_~y~0))) (forall ((v_it_4 Int)) (or (< 0 (mod (+ (* v_it_4 4294967295) main_~n~0) 4294967296)) (not (<= 1 v_it_4)) (not (<= (+ v_it_4 1) main_~y~0)))) (< 0 (mod main_~n~0 4294967296)) (< 0 main_~y~0)) (and (= main_~n~0 main_~x~0) (= main_~y~0 0)))} is VALID [2022-04-28 03:36:52,188 INFO L290 TraceCheckUtils]: 7: Hoare triple {747#(or (and (= main_~x~0 (+ main_~n~0 (* (- 1) main_~y~0))) (forall ((v_it_4 Int)) (or (< 0 (mod (+ (* v_it_4 4294967295) main_~n~0) 4294967296)) (not (<= 1 v_it_4)) (not (<= (+ v_it_4 1) main_~y~0)))) (< 0 (mod main_~n~0 4294967296)) (< 0 main_~y~0)) (and (= main_~n~0 main_~x~0) (= main_~y~0 0)))} [59] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[] {751#(and (not (< 0 (mod main_~x~0 4294967296))) (or (and (= main_~x~0 (+ main_~n~0 (* (- 1) main_~y~0))) (forall ((v_it_4 Int)) (or (< 0 (mod (+ (* v_it_4 4294967295) main_~n~0) 4294967296)) (not (<= 1 v_it_4)) (not (<= (+ v_it_4 1) main_~y~0)))) (< 0 (mod main_~n~0 4294967296)) (< 0 main_~y~0)) (and (= main_~n~0 main_~x~0) (= main_~y~0 0))))} is VALID [2022-04-28 03:36:52,190 INFO L290 TraceCheckUtils]: 8: Hoare triple {751#(and (not (< 0 (mod main_~x~0 4294967296))) (or (and (= main_~x~0 (+ main_~n~0 (* (- 1) main_~y~0))) (forall ((v_it_4 Int)) (or (< 0 (mod (+ (* v_it_4 4294967295) main_~n~0) 4294967296)) (not (<= 1 v_it_4)) (not (<= (+ v_it_4 1) main_~y~0)))) (< 0 (mod main_~n~0 4294967296)) (< 0 main_~y~0)) (and (= main_~n~0 main_~x~0) (= main_~y~0 0))))} ~z~0 := ~y~0; {755#(and (not (< 0 (mod main_~x~0 4294967296))) (or (and (= main_~z~0 0) (= main_~n~0 main_~x~0)) (and (< 0 main_~z~0) (forall ((v_it_4 Int)) (or (not (<= (+ v_it_4 1) main_~z~0)) (< 0 (mod (+ (* v_it_4 4294967295) main_~n~0) 4294967296)) (not (<= 1 v_it_4)))) (< 0 (mod main_~n~0 4294967296)) (= (+ main_~n~0 (* (- 1) main_~z~0)) main_~x~0))))} is VALID [2022-04-28 03:36:52,209 INFO L290 TraceCheckUtils]: 9: Hoare triple {755#(and (not (< 0 (mod main_~x~0 4294967296))) (or (and (= main_~z~0 0) (= main_~n~0 main_~x~0)) (and (< 0 main_~z~0) (forall ((v_it_4 Int)) (or (not (<= (+ v_it_4 1) main_~z~0)) (< 0 (mod (+ (* v_it_4 4294967295) main_~n~0) 4294967296)) (not (<= 1 v_it_4)))) (< 0 (mod main_~n~0 4294967296)) (= (+ main_~n~0 (* (- 1) main_~z~0)) main_~x~0))))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {759#(and (not (< 0 (mod (+ main_~x~0 4294967295) 4294967296))) (or (and (forall ((v_it_4 Int)) (or (< 0 (mod (+ (* v_it_4 4294967295) main_~n~0) 4294967296)) (not (<= 1 v_it_4)) (not (<= v_it_4 main_~z~0)))) (= (+ (- 1) main_~x~0) (+ (- 1) main_~n~0 (* (- 1) main_~z~0))) (< 0 (+ main_~z~0 1)) (< 0 (mod main_~n~0 4294967296))) (and (= (+ main_~z~0 1) 0) (= (+ (- 1) main_~x~0) main_~n~0))))} is VALID [2022-04-28 03:36:52,212 INFO L290 TraceCheckUtils]: 10: Hoare triple {759#(and (not (< 0 (mod (+ main_~x~0 4294967295) 4294967296))) (or (and (forall ((v_it_4 Int)) (or (< 0 (mod (+ (* v_it_4 4294967295) main_~n~0) 4294967296)) (not (<= 1 v_it_4)) (not (<= v_it_4 main_~z~0)))) (= (+ (- 1) main_~x~0) (+ (- 1) main_~n~0 (* (- 1) main_~z~0))) (< 0 (+ main_~z~0 1)) (< 0 (mod main_~n~0 4294967296))) (and (= (+ main_~z~0 1) 0) (= (+ (- 1) 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; {763#(and (or (and (= main_~n~0 (+ (- 2) main_~x~0)) (= (+ main_~z~0 2) 0)) (and (< 0 (+ main_~z~0 2)) (forall ((v_it_4 Int)) (or (< 0 (mod (+ (* v_it_4 4294967295) main_~n~0) 4294967296)) (not (<= 1 v_it_4)) (not (<= v_it_4 (+ main_~z~0 1))))) (< 0 (mod main_~n~0 4294967296)) (= (+ (- 2) main_~n~0 (* (- 1) main_~z~0)) (+ (- 2) main_~x~0)))) (< 0 (mod (+ main_~z~0 1) 4294967296)) (not (< 0 (mod (+ main_~x~0 4294967294) 4294967296))))} is VALID [2022-04-28 03:36:52,218 INFO L290 TraceCheckUtils]: 11: Hoare triple {763#(and (or (and (= main_~n~0 (+ (- 2) main_~x~0)) (= (+ main_~z~0 2) 0)) (and (< 0 (+ main_~z~0 2)) (forall ((v_it_4 Int)) (or (< 0 (mod (+ (* v_it_4 4294967295) main_~n~0) 4294967296)) (not (<= 1 v_it_4)) (not (<= v_it_4 (+ main_~z~0 1))))) (< 0 (mod main_~n~0 4294967296)) (= (+ (- 2) main_~n~0 (* (- 1) main_~z~0)) (+ (- 2) main_~x~0)))) (< 0 (mod (+ main_~z~0 1) 4294967296)) (not (< 0 (mod (+ main_~x~0 4294967294) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {767#(and (forall ((v_it_4 Int)) (or (< 0 (mod (+ (* v_it_4 4294967295) main_~n~0) 4294967296)) (not (<= 1 v_it_4)) (not (<= (+ v_it_4 main_~x~0) (+ main_~n~0 1))))) (not (< 0 (mod (+ main_~x~0 4294967294) 4294967296))) (<= (div (+ main_~x~0 (- 4294967296) (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (* (- 1) main_~x~0) 4294967296) 4294967296)) (< main_~x~0 (+ main_~n~0 2)))} is VALID [2022-04-28 03:36:52,266 INFO L272 TraceCheckUtils]: 12: Hoare triple {767#(and (forall ((v_it_4 Int)) (or (< 0 (mod (+ (* v_it_4 4294967295) main_~n~0) 4294967296)) (not (<= 1 v_it_4)) (not (<= (+ v_it_4 main_~x~0) (+ main_~n~0 1))))) (not (< 0 (mod (+ main_~x~0 4294967294) 4294967296))) (<= (div (+ main_~x~0 (- 4294967296) (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (* (- 1) main_~x~0) 4294967296) 4294967296)) (< main_~x~0 (+ main_~n~0 2)))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {771#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:36:52,266 INFO L290 TraceCheckUtils]: 13: Hoare triple {771#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {775#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:36:52,267 INFO L290 TraceCheckUtils]: 14: Hoare triple {775#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {712#false} is VALID [2022-04-28 03:36:52,267 INFO L290 TraceCheckUtils]: 15: Hoare triple {712#false} assume !false; {712#false} is VALID [2022-04-28 03:36:52,267 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:36:52,267 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:37:42,103 WARN L232 SmtUtils]: Spent 16.97s 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:37:43,975 INFO L290 TraceCheckUtils]: 15: Hoare triple {712#false} assume !false; {712#false} is VALID [2022-04-28 03:37:43,977 INFO L290 TraceCheckUtils]: 14: Hoare triple {775#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {712#false} is VALID [2022-04-28 03:37:43,978 INFO L290 TraceCheckUtils]: 13: Hoare triple {771#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {775#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:37:43,979 INFO L272 TraceCheckUtils]: 12: Hoare triple {722#(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)); {771#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:37:43,980 INFO L290 TraceCheckUtils]: 11: Hoare triple {794#(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); {722#(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:37:43,981 INFO L290 TraceCheckUtils]: 10: Hoare triple {798#(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~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {794#(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:37:43,984 INFO L290 TraceCheckUtils]: 9: Hoare triple {802#(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~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {798#(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:37:43,985 INFO L290 TraceCheckUtils]: 8: Hoare triple {806#(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)))))} ~z~0 := ~y~0; {802#(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:37:43,986 INFO L290 TraceCheckUtils]: 7: Hoare triple {810#(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)))} [59] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[] {806#(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)))))} is VALID [2022-04-28 03:37:46,021 WARN L290 TraceCheckUtils]: 6: Hoare triple {814#(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_div_v_main_~x~0_45_31 Int) (aux_div_aux_mod_v_main_~x~0_45_31_89 Int) (aux_div_v_main_~y~0_28_46 Int) (aux_mod_aux_mod_v_main_~x~0_45_31_89 Int)) (or (< (+ 2 (* aux_div_v_main_~x~0_45_31 4294967296)) (+ (* aux_div_aux_mod_v_main_~x~0_45_31_89 4294967296) aux_mod_aux_mod_v_main_~x~0_45_31_89)) (> 0 aux_mod_aux_mod_v_main_~x~0_45_31_89) (< main_~n~0 (+ (* (div main_~n~0 4294967296) 4294967296) aux_mod_aux_mod_v_main_~x~0_45_31_89 1)) (< (+ (* aux_div_aux_mod_v_main_~x~0_45_31_89 4294967296) aux_mod_aux_mod_v_main_~x~0_45_31_89) (+ 2 (* aux_div_v_main_~x~0_45_31 4294967296))) (< (+ (* aux_div_aux_mod_v_main_~x~0_45_31_89 4294967296) (* aux_div_v_main_~y~0_28_46 4294967296) aux_mod_aux_mod_v_main_~x~0_45_31_89) (+ main_~y~0 main_~x~0 4294967296)) (< (+ main_~y~0 main_~x~0 4294967296) (+ (* aux_div_aux_mod_v_main_~x~0_45_31_89 4294967296) (* aux_div_v_main_~y~0_28_46 4294967296) aux_mod_aux_mod_v_main_~x~0_45_31_89)) (exists ((v_it_4 Int)) (and (<= (+ (* aux_div_aux_mod_v_main_~x~0_45_31_89 4294967296) v_it_4 aux_mod_aux_mod_v_main_~x~0_45_31_89) (+ main_~x~0 1)) (not (< 0 (mod (+ (* v_it_4 4294967295) main_~x~0) 4294967296))) (<= 1 v_it_4))) (not (< (+ (* aux_div_aux_mod_v_main_~x~0_45_31_89 4294967296) aux_mod_aux_mod_v_main_~x~0_45_31_89) (+ main_~x~0 2))))) (forall ((aux_div_v_main_~x~0_45_31 Int) (aux_div_aux_mod_v_main_~x~0_45_31_89 Int) (aux_div_v_main_~y~0_28_46 Int) (aux_mod_aux_mod_v_main_~x~0_45_31_89 Int)) (or (< (+ 2 (* aux_div_v_main_~x~0_45_31 4294967296)) (+ (* aux_div_aux_mod_v_main_~x~0_45_31_89 4294967296) aux_mod_aux_mod_v_main_~x~0_45_31_89)) (< (+ (* aux_div_aux_mod_v_main_~x~0_45_31_89 4294967296) aux_mod_aux_mod_v_main_~x~0_45_31_89) (+ 2 (* aux_div_v_main_~x~0_45_31 4294967296))) (<= (+ (* (div main_~n~0 4294967296) 4294967296) aux_mod_aux_mod_v_main_~x~0_45_31_89) main_~n~0) (>= aux_mod_aux_mod_v_main_~x~0_45_31_89 4294967296) (< (+ (* aux_div_aux_mod_v_main_~x~0_45_31_89 4294967296) (* aux_div_v_main_~y~0_28_46 4294967296) aux_mod_aux_mod_v_main_~x~0_45_31_89) (+ main_~y~0 main_~x~0 4294967296)) (< (+ main_~y~0 main_~x~0 4294967296) (+ (* aux_div_aux_mod_v_main_~x~0_45_31_89 4294967296) (* aux_div_v_main_~y~0_28_46 4294967296) aux_mod_aux_mod_v_main_~x~0_45_31_89)) (exists ((v_it_4 Int)) (and (<= (+ (* aux_div_aux_mod_v_main_~x~0_45_31_89 4294967296) v_it_4 aux_mod_aux_mod_v_main_~x~0_45_31_89) (+ main_~x~0 1)) (not (< 0 (mod (+ (* v_it_4 4294967295) main_~x~0) 4294967296))) (<= 1 v_it_4))) (not (< (+ (* aux_div_aux_mod_v_main_~x~0_45_31_89 4294967296) aux_mod_aux_mod_v_main_~x~0_45_31_89) (+ main_~x~0 2)))))) (not (< 0 (mod main_~x~0 4294967296)))))} [60] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_36 4294967296)) (.cse1 (= |v_main_#t~post6_16| |v_main_#t~post6_15|)) (.cse2 (= |v_main_#t~post5_16| |v_main_#t~post5_15|)) (.cse3 (= v_main_~y~0_23 v_main_~y~0_22)) (.cse4 (= v_main_~x~0_36 v_main_~x~0_35))) (or (and (< v_main_~y~0_23 v_main_~y~0_22) (= v_main_~x~0_35 (+ v_main_~x~0_36 (* (- 1) v_main_~y~0_22) v_main_~y~0_23)) (< 0 .cse0) (forall ((v_it_4 Int)) (or (not (<= (+ v_main_~y~0_23 v_it_4 1) v_main_~y~0_22)) (< 0 (mod (+ (* v_it_4 4294967295) v_main_~x~0_36) 4294967296)) (not (<= 1 v_it_4))))) (and .cse1 (<= .cse0 0) .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_23, main_#t~post5=|v_main_#t~post5_16|, main_~x~0=v_main_~x~0_36, main_#t~post6=|v_main_#t~post6_16|} OutVars{main_~y~0=v_main_~y~0_22, main_#t~post5=|v_main_#t~post5_15|, main_~x~0=v_main_~x~0_35, main_#t~post6=|v_main_#t~post6_15|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {810#(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:37:46,054 INFO L290 TraceCheckUtils]: 5: Hoare triple {711#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {814#(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_div_v_main_~x~0_45_31 Int) (aux_div_aux_mod_v_main_~x~0_45_31_89 Int) (aux_div_v_main_~y~0_28_46 Int) (aux_mod_aux_mod_v_main_~x~0_45_31_89 Int)) (or (< (+ 2 (* aux_div_v_main_~x~0_45_31 4294967296)) (+ (* aux_div_aux_mod_v_main_~x~0_45_31_89 4294967296) aux_mod_aux_mod_v_main_~x~0_45_31_89)) (> 0 aux_mod_aux_mod_v_main_~x~0_45_31_89) (< main_~n~0 (+ (* (div main_~n~0 4294967296) 4294967296) aux_mod_aux_mod_v_main_~x~0_45_31_89 1)) (< (+ (* aux_div_aux_mod_v_main_~x~0_45_31_89 4294967296) aux_mod_aux_mod_v_main_~x~0_45_31_89) (+ 2 (* aux_div_v_main_~x~0_45_31 4294967296))) (< (+ (* aux_div_aux_mod_v_main_~x~0_45_31_89 4294967296) (* aux_div_v_main_~y~0_28_46 4294967296) aux_mod_aux_mod_v_main_~x~0_45_31_89) (+ main_~y~0 main_~x~0 4294967296)) (< (+ main_~y~0 main_~x~0 4294967296) (+ (* aux_div_aux_mod_v_main_~x~0_45_31_89 4294967296) (* aux_div_v_main_~y~0_28_46 4294967296) aux_mod_aux_mod_v_main_~x~0_45_31_89)) (exists ((v_it_4 Int)) (and (<= (+ (* aux_div_aux_mod_v_main_~x~0_45_31_89 4294967296) v_it_4 aux_mod_aux_mod_v_main_~x~0_45_31_89) (+ main_~x~0 1)) (not (< 0 (mod (+ (* v_it_4 4294967295) main_~x~0) 4294967296))) (<= 1 v_it_4))) (not (< (+ (* aux_div_aux_mod_v_main_~x~0_45_31_89 4294967296) aux_mod_aux_mod_v_main_~x~0_45_31_89) (+ main_~x~0 2))))) (forall ((aux_div_v_main_~x~0_45_31 Int) (aux_div_aux_mod_v_main_~x~0_45_31_89 Int) (aux_div_v_main_~y~0_28_46 Int) (aux_mod_aux_mod_v_main_~x~0_45_31_89 Int)) (or (< (+ 2 (* aux_div_v_main_~x~0_45_31 4294967296)) (+ (* aux_div_aux_mod_v_main_~x~0_45_31_89 4294967296) aux_mod_aux_mod_v_main_~x~0_45_31_89)) (< (+ (* aux_div_aux_mod_v_main_~x~0_45_31_89 4294967296) aux_mod_aux_mod_v_main_~x~0_45_31_89) (+ 2 (* aux_div_v_main_~x~0_45_31 4294967296))) (<= (+ (* (div main_~n~0 4294967296) 4294967296) aux_mod_aux_mod_v_main_~x~0_45_31_89) main_~n~0) (>= aux_mod_aux_mod_v_main_~x~0_45_31_89 4294967296) (< (+ (* aux_div_aux_mod_v_main_~x~0_45_31_89 4294967296) (* aux_div_v_main_~y~0_28_46 4294967296) aux_mod_aux_mod_v_main_~x~0_45_31_89) (+ main_~y~0 main_~x~0 4294967296)) (< (+ main_~y~0 main_~x~0 4294967296) (+ (* aux_div_aux_mod_v_main_~x~0_45_31_89 4294967296) (* aux_div_v_main_~y~0_28_46 4294967296) aux_mod_aux_mod_v_main_~x~0_45_31_89)) (exists ((v_it_4 Int)) (and (<= (+ (* aux_div_aux_mod_v_main_~x~0_45_31_89 4294967296) v_it_4 aux_mod_aux_mod_v_main_~x~0_45_31_89) (+ main_~x~0 1)) (not (< 0 (mod (+ (* v_it_4 4294967295) main_~x~0) 4294967296))) (<= 1 v_it_4))) (not (< (+ (* aux_div_aux_mod_v_main_~x~0_45_31_89 4294967296) aux_mod_aux_mod_v_main_~x~0_45_31_89) (+ main_~x~0 2)))))) (not (< 0 (mod main_~x~0 4294967296)))))} is VALID [2022-04-28 03:37:46,054 INFO L272 TraceCheckUtils]: 4: Hoare triple {711#true} call #t~ret9 := main(); {711#true} is VALID [2022-04-28 03:37:46,054 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {711#true} {711#true} #50#return; {711#true} is VALID [2022-04-28 03:37:46,054 INFO L290 TraceCheckUtils]: 2: Hoare triple {711#true} assume true; {711#true} is VALID [2022-04-28 03:37:46,054 INFO L290 TraceCheckUtils]: 1: Hoare triple {711#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {711#true} is VALID [2022-04-28 03:37:46,055 INFO L272 TraceCheckUtils]: 0: Hoare triple {711#true} call ULTIMATE.init(); {711#true} is VALID [2022-04-28 03:37:46,055 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:37:46,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1828157490] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:37:46,055 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:37:46,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 26 [2022-04-28 03:37:53,168 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:37:53,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [219017486] [2022-04-28 03:37:53,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [219017486] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:37:53,168 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:37:53,168 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 03:37:53,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048831511] [2022-04-28 03:37:53,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:37:53,169 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 10 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:37:53,169 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:37:53,169 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 10 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:37:53,469 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:37:53,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 03:37:53,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:37:53,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 03:37:53,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=577, Unknown=16, NotChecked=0, Total=702 [2022-04-28 03:37:53,470 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand has 12 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 10 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:38:00,963 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:38:04,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:38:04,599 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2022-04-28 03:38:04,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 03:38:04,599 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 10 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:38:04,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:38:04,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 10 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:38:04,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 26 transitions. [2022-04-28 03:38:04,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 10 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:38:04,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 26 transitions. [2022-04-28 03:38:04,603 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 26 transitions. [2022-04-28 03:38:05,683 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:38:05,684 INFO L225 Difference]: With dead ends: 24 [2022-04-28 03:38:05,684 INFO L226 Difference]: Without dead ends: 19 [2022-04-28 03:38:05,685 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 18 SyntacticMatches, 4 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 313 ImplicationChecksByTransitivity, 69.0s TimeCoverageRelationStatistics Valid=174, Invalid=998, Unknown=18, NotChecked=0, Total=1190 [2022-04-28 03:38:05,685 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 11 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 11 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 17 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-28 03:38:05,685 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 41 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 56 Invalid, 1 Unknown, 17 Unchecked, 2.3s Time] [2022-04-28 03:38:05,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-28 03:38:05,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2022-04-28 03:38:05,718 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:38:05,718 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 18 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:38:05,719 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 18 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:38:05,719 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 18 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:38:05,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:38:05,720 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2022-04-28 03:38:05,720 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-28 03:38:05,720 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:38:05,720 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:38:05,720 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 19 states. [2022-04-28 03:38:05,721 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 19 states. [2022-04-28 03:38:05,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:38:05,722 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2022-04-28 03:38:05,722 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-28 03:38:05,722 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:38:05,722 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:38:05,722 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:38:05,722 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:38:05,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:38:05,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2022-04-28 03:38:05,723 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 16 [2022-04-28 03:38:05,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:38:05,723 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2022-04-28 03:38:05,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 10 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:38:05,724 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 19 transitions. [2022-04-28 03:38:08,587 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:38:08,587 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2022-04-28 03:38:08,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 03:38:08,588 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:38:08,588 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:38:08,595 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-28 03:38:08,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:38:08,792 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:38:08,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:38:08,792 INFO L85 PathProgramCache]: Analyzing trace with hash -78075946, now seen corresponding path program 3 times [2022-04-28 03:38:08,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:38:08,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1917986336] [2022-04-28 03:38:09,012 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:38:09,013 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:38:09,015 INFO L85 PathProgramCache]: Analyzing trace with hash 1137917589, now seen corresponding path program 1 times [2022-04-28 03:38:09,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:38:09,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187239653] [2022-04-28 03:38:09,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:38:09,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:38:09,030 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:38:09,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:38:09,053 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.3))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-28 03:38:09,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:38:09,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:38:09,636 INFO L290 TraceCheckUtils]: 0: Hoare triple {989#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {974#true} is VALID [2022-04-28 03:38:09,637 INFO L290 TraceCheckUtils]: 1: Hoare triple {974#true} assume true; {974#true} is VALID [2022-04-28 03:38:09,637 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {974#true} {974#true} #50#return; {974#true} is VALID [2022-04-28 03:38:09,637 INFO L272 TraceCheckUtils]: 0: Hoare triple {974#true} call ULTIMATE.init(); {989#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:38:09,638 INFO L290 TraceCheckUtils]: 1: Hoare triple {989#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {974#true} is VALID [2022-04-28 03:38:09,638 INFO L290 TraceCheckUtils]: 2: Hoare triple {974#true} assume true; {974#true} is VALID [2022-04-28 03:38:09,638 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {974#true} {974#true} #50#return; {974#true} is VALID [2022-04-28 03:38:09,638 INFO L272 TraceCheckUtils]: 4: Hoare triple {974#true} call #t~ret9 := main(); {974#true} is VALID [2022-04-28 03:38:09,639 INFO L290 TraceCheckUtils]: 5: Hoare triple {974#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {979#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-28 03:38:09,671 INFO L290 TraceCheckUtils]: 6: Hoare triple {979#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} [62] L16-2-->L16-3_primed: Formula: (let ((.cse1 (= |v_main_#t~post5_23| |v_main_#t~post5_22|)) (.cse0 (mod v_main_~x~0_50 4294967296)) (.cse2 (= |v_main_#t~post6_23| |v_main_#t~post6_22|)) (.cse3 (= v_main_~y~0_33 v_main_~y~0_32))) (or (and (< 0 .cse0) (< v_main_~y~0_33 v_main_~y~0_32) (forall ((v_it_5 Int)) (or (< 0 (mod (+ v_main_~x~0_50 (* v_it_5 4294967295)) 4294967296)) (not (<= (+ v_main_~y~0_33 v_it_5 1) v_main_~y~0_32)) (not (<= 1 v_it_5)))) (= (+ v_main_~x~0_50 v_main_~y~0_33 (* (- 1) v_main_~y~0_32)) v_main_~x~0_49)) (and .cse1 (= v_main_~x~0_50 v_main_~x~0_49) .cse2 .cse3) (and (= v_main_~x~0_49 v_main_~x~0_50) .cse1 (<= .cse0 0) .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_33, main_#t~post5=|v_main_#t~post5_23|, main_~x~0=v_main_~x~0_50, main_#t~post6=|v_main_#t~post6_23|} OutVars{main_~y~0=v_main_~y~0_32, main_#t~post5=|v_main_#t~post5_22|, main_~x~0=v_main_~x~0_49, main_#t~post6=|v_main_#t~post6_22|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {980#(or (and (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= (+ main_~y~0 main_~x~0) (+ (* 4294967296 (div (+ (* 4294967296 (div (+ (- 1) main_~y~0 main_~x~0) 4294967296)) main_~y~0 main_~x~0 (* (- 1) main_~n~0)) 4294967296)) 4294967295))) (and (<= 0 main_~y~0) (<= main_~y~0 0)))} is VALID [2022-04-28 03:38:09,747 INFO L290 TraceCheckUtils]: 7: Hoare triple {980#(or (and (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= (+ main_~y~0 main_~x~0) (+ (* 4294967296 (div (+ (* 4294967296 (div (+ (- 1) main_~y~0 main_~x~0) 4294967296)) main_~y~0 main_~x~0 (* (- 1) main_~n~0)) 4294967296)) 4294967295))) (and (<= 0 main_~y~0) (<= main_~y~0 0)))} [61] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[] {981#(or (and (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) (+ 4294967295 (* (div (+ main_~y~0 main_~x~0 (* (div (+ (- 1) main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ (* (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))))) (and (<= 0 main_~y~0) (<= main_~y~0 0)))} is VALID [2022-04-28 03:38:09,936 INFO L290 TraceCheckUtils]: 8: Hoare triple {981#(or (and (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) (+ 4294967295 (* (div (+ main_~y~0 main_~x~0 (* (div (+ (- 1) main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ (* (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))))) (and (<= 0 main_~y~0) (<= main_~y~0 0)))} ~z~0 := ~y~0; {982#(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:38:09,971 INFO L290 TraceCheckUtils]: 9: Hoare triple {982#(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; {983#(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:38:09,976 INFO L290 TraceCheckUtils]: 10: Hoare triple {983#(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; {984#(and (<= (+ 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~x~0 (* (div main_~z~0 4294967296) 4294967296))) (<= main_~z~0 (+ (* 4294967296 (div (+ main_~z~0 main_~x~0 (* (div main_~z~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296)) 4294967293)) (<= (+ main_~z~0 main_~x~0) main_~n~0))} is VALID [2022-04-28 03:38:09,983 INFO L290 TraceCheckUtils]: 11: Hoare triple {984#(and (<= (+ 2 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~x~0 (* (div main_~z~0 4294967296) 4294967296))) (<= main_~z~0 (+ (* 4294967296 (div (+ main_~z~0 main_~x~0 (* (div main_~z~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296)) 4294967293)) (<= (+ 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; {985#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296) (* 4294967296 (div main_~x~0 4294967296))) (+ main_~z~0 main_~x~0 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-28 03:38:09,984 INFO L290 TraceCheckUtils]: 12: Hoare triple {985#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296) (* 4294967296 (div main_~x~0 4294967296))) (+ main_~z~0 main_~x~0 (* (div main_~n~0 4294967296) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {986#(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:38:09,985 INFO L272 TraceCheckUtils]: 13: Hoare triple {986#(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)); {987#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:38:09,986 INFO L290 TraceCheckUtils]: 14: Hoare triple {987#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {988#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:38:09,986 INFO L290 TraceCheckUtils]: 15: Hoare triple {988#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {975#false} is VALID [2022-04-28 03:38:09,986 INFO L290 TraceCheckUtils]: 16: Hoare triple {975#false} assume !false; {975#false} is VALID [2022-04-28 03:38:09,986 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:38:09,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:38:09,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187239653] [2022-04-28 03:38:09,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187239653] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:38:09,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [620234644] [2022-04-28 03:38:09,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:38:09,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:38:09,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:38:09,988 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:38:09,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process